{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,7]],"date-time":"2022-05-07T02:15:43Z","timestamp":1651889743417},"reference-count":48,"publisher":"IGI Global","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,4,1]]},"abstract":"<p>The standard Value Iteration (VI) algorithm, referred to as Value Iteration Pre-Jacobi (PJ-VI) algorithm, is the simplest Value Iteration scheme, and the well-known algorithm for solving Markov Decision Processes (MDPs). In the literature, several versions of VI algorithm were developed in order to reduce the number of iterations: the VI Jacobi (VI-J) algorithm, the Value Iteration Pre-Gauss-Seidel (VI-PGS) algorithm and the VI Gauss-Seidel (VI-GS) algorithm. In this article, the authors combine the advantages of VI Pre Gauss-Seidel algorithm, the decomposition technique and the parallelism in order to propose a new Parallel Hierarchical VI Pre-Gauss-Seidel algorithm. Experimental results show that their approach performs better than the traditional VI schemes in the case where the global problem can be decomposed into smaller problems.<\/p>","DOI":"10.4018\/ijdsst.2018040101","type":"journal-article","created":{"date-parts":[[2018,2,5]],"date-time":"2018-02-05T14:05:27Z","timestamp":1517839527000},"page":"1-22","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Hierarchical Pre-Gauss-Seidel Value Iteration Algorithm"],"prefix":"10.4018","volume":"10","author":[{"given":"Sanaa","family":"Chafik","sequence":"first","affiliation":[{"name":"Sultan Moulay Slimane University, Beni Mellal, Morocco"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdelhadi","family":"Larach","sequence":"additional","affiliation":[{"name":"Sultan Moulay Slimane University, Beni Mellal, Morocco"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cherki","family":"Daoui","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Sultan Moulay Slimane University, Beni Mellal, Morocco"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2432","reference":[{"key":"IJDSST.2018040101-0","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(03)00055-5"},{"key":"IJDSST.2018040101-1","doi-asserted-by":"publisher","DOI":"10.1007\/s001860300290"},{"key":"IJDSST.2018040101-2","unstructured":"Barto, A. G., Bradtke, S. J., & Singh, S. P. (1993). Learning to act using real-time dynamic programming (Technical Report UM-CS-1993-002). University of Alberta."},{"key":"IJDSST.2018040101-3","author":"R. E.Bellman","year":"1957","journal-title":"Dynamic Programming"},{"key":"IJDSST.2018040101-4","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1060.0588"},{"key":"IJDSST.2018040101-5","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177700285"},{"key":"IJDSST.2018040101-6","first-page":"1293","author":"J.Boger","year":"2005","journal-title":"A decision-theoretic approach to task assistance for persons with dementia"},{"key":"IJDSST.2018040101-7","unstructured":"Buongiorno, J., & Zhou, M. (2005). The use of Markov optimization models in the economic and ecological management of forested landscapes under risk."},{"key":"IJDSST.2018040101-8","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pbio.0040379"},{"key":"IJDSST.2018040101-9","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.09.016"},{"key":"IJDSST.2018040101-10","doi-asserted-by":"publisher","DOI":"10.2991\/isca-13.2013.51"},{"key":"IJDSST.2018040101-11","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2006.03.006"},{"key":"IJDSST.2018040101-12","article-title":"Exact decomposition approaches for Markov decision processes: A survey.","author":"C.Daoui","year":"2010","journal-title":"Advances in Operations Research"},{"key":"IJDSST.2018040101-13","unstructured":"Dean, T., & Lin, S. H. (1995, August). Decomposition techniques for planning in stochastic domains. In Proceedings of the 14th international joint conference on Artificial intelligence (Vol. 2)."},{"key":"IJDSST.2018040101-14","doi-asserted-by":"publisher","DOI":"10.1016\/j.jart.2016.06.006"},{"key":"IJDSST.2018040101-15","volume":"Vol. 40","author":"E. A.Feinberg","year":"2012","journal-title":"Handbook of Markov decision processes: methods and applications"},{"key":"IJDSST.2018040101-16","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00592-1"},{"key":"IJDSST.2018040101-17","doi-asserted-by":"publisher","DOI":"10.1016\/j.agee.2011.01.011"},{"key":"IJDSST.2018040101-18","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(96)00024-5"},{"key":"IJDSST.2018040101-19","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(96)00024-5"},{"key":"IJDSST.2018040101-20","volume":"Vol. 1","author":"W.Gropp","year":"1999","journal-title":"Using MPI: portable parallel programming with the message-passing interface"},{"key":"IJDSST.2018040101-21","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-5273(01)00117-7"},{"key":"IJDSST.2018040101-22","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/57.1.97"},{"key":"IJDSST.2018040101-23","doi-asserted-by":"publisher","DOI":"10.1287\/opre.42.5.940"},{"key":"IJDSST.2018040101-24","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)00208-8"},{"key":"IJDSST.2018040101-25","doi-asserted-by":"publisher","DOI":"10.1287\/opre.35.6.875"},{"key":"IJDSST.2018040101-26","doi-asserted-by":"publisher","DOI":"10.1080\/00401706.1991.10484833"},{"key":"IJDSST.2018040101-27","unstructured":"Kleinman, A. J., & Kushner, H. J. (1971). Accelerated procedures for the solution of discrete Markov control problems."},{"key":"IJDSST.2018040101-28","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s40092-017-0197-7","volume":"13","author":"A.Larach","year":"2017","journal-title":"J Ind Eng Int"},{"key":"IJDSST.2018040101-29","doi-asserted-by":"publisher","DOI":"10.1017\/S0021900200021483"},{"key":"IJDSST.2018040101-30","doi-asserted-by":"publisher","DOI":"10.1287\/opre.15.3.559"},{"key":"IJDSST.2018040101-31","doi-asserted-by":"publisher","DOI":"10.1016\/j.jhydrol.2011.03.049"},{"key":"IJDSST.2018040101-32","doi-asserted-by":"crossref","unstructured":"Nakai, M., Akira, N., Shimodaira, H., & Sagayama, S. (2001). Substroke approach to HMM-based on-line Kanji handwriting recognition. In Proceedings of the Sixth International Conference on Document Analysis and Recognition (pp. 491-495). IEEE.","DOI":"10.1109\/ICDAR.2001.953838"},{"key":"IJDSST.2018040101-33","first-page":"422","article-title":"Flexible decomposition algorithms for weakly coupled Markov decision problems.","author":"R.Parr","year":"1998","journal-title":"Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence"},{"key":"IJDSST.2018040101-34","author":"T.Pellegrini","year":"2003","journal-title":"Suivi de Voix Parl\u00e9e grace aux Mod\u00e8les de Markov Cach\u00e9s. IRCAM"},{"key":"IJDSST.2018040101-35","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2006.03.015"},{"key":"IJDSST.2018040101-36","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.18.1.7"},{"key":"IJDSST.2018040101-37","doi-asserted-by":"publisher","DOI":"10.1287\/opre.23.4.761"},{"key":"IJDSST.2018040101-38","doi-asserted-by":"publisher","DOI":"10.1287\/opre.26.2.350"},{"key":"IJDSST.2018040101-39","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316887"},{"key":"IJDSST.2018040101-40","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.24.11.1127"},{"key":"IJDSST.2018040101-41","doi-asserted-by":"publisher","DOI":"10.1109\/5.18626"},{"key":"IJDSST.2018040101-42","doi-asserted-by":"publisher","DOI":"10.1287\/moor.16.1.195"},{"key":"IJDSST.2018040101-43","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(81)90008-0"},{"key":"IJDSST.2018040101-44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27645-3_12"},{"key":"IJDSST.2018040101-45","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"IJDSST.2018040101-46","doi-asserted-by":"publisher","DOI":"10.1016\/j.csl.2006.06.008"},{"key":"IJDSST.2018040101-47","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1954-0059635-7"}],"container-title":["International Journal of Decision Support System Technology"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=199030","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,7]],"date-time":"2022-05-07T01:51:27Z","timestamp":1651888287000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJDSST.2018040101"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2018,4,1]]},"references-count":48,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,4]]}},"URL":"https:\/\/doi.org\/10.4018\/ijdsst.2018040101","relation":{},"ISSN":["1941-6296","1941-630X"],"issn-type":[{"value":"1941-6296","type":"print"},{"value":"1941-630X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,1]]}}}