{"department":[{"_id":"KrCh"}],"conference":{"location":"London, United Kingdom","name":"ICAPS: International Conference on Automated Planning and Scheduling","start_date":"2016-06-12","end_date":"2016-06-17"},"type":"conference","publication":"Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling","ec_funded":1,"date_updated":"2021-01-12T06:49:53Z","day":"01","status":"public","_id":"1324","language":[{"iso":"eng"}],"year":"2016","publication_status":"published","main_file_link":[{"url":"http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/12999"}],"quality_controlled":"1","volume":"2016-January","publist_id":"5946","publisher":"AAAI Press","abstract":[{"lang":"eng","text":"DEC-POMDPs extend POMDPs to a multi-agent setting, where several agents operate in an uncertain environment independently to achieve a joint objective. DEC-POMDPs have been studied with finite-horizon and infinite-horizon discounted-sum objectives, and there exist solvers both for exact and approximate solutions. In this work we consider Goal-DEC-POMDPs, where given a set of target states, the objective is to ensure that the target set is reached with minimal cost. We consider the indefinite-horizon (infinite-horizon with either discounted-sum, or undiscounted-sum, where absorbing goal states have zero-cost) problem. We present a new and novel method to solve the problem that extends methods for finite-horizon DEC-POMDPs and the RTDP-Bel approach for POMDPs. We present experimental results on several examples, and show that our approach presents promising results. Copyright "}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"01","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Chmelik, Martin","first_name":"Martin","last_name":"Chmelik","id":"3624234E-F248-11E8-B48F-1D18A9856A87"}],"citation":{"short":"K. Chatterjee, M. Chmelik, in:, Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling, AAAI Press, 2016, pp. 88–96.","ama":"Chatterjee K, Chmelik M. Indefinite-horizon reachability in Goal-DEC-POMDPs. In: <i>Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling</i>. Vol 2016-January. AAAI Press; 2016:88-96.","chicago":"Chatterjee, Krishnendu, and Martin Chmelik. “Indefinite-Horizon Reachability in Goal-DEC-POMDPs.” In <i>Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling</i>, 2016–January:88–96. AAAI Press, 2016.","apa":"Chatterjee, K., &#38; Chmelik, M. (2016). Indefinite-horizon reachability in Goal-DEC-POMDPs. In <i>Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling</i> (Vol. 2016–January, pp. 88–96). London, United Kingdom: AAAI Press.","mla":"Chatterjee, Krishnendu, and Martin Chmelik. “Indefinite-Horizon Reachability in Goal-DEC-POMDPs.” <i>Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling</i>, vol. 2016–January, AAAI Press, 2016, pp. 88–96.","ieee":"K. Chatterjee and M. Chmelik, “Indefinite-horizon reachability in Goal-DEC-POMDPs,” in <i>Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling</i>, London, United Kingdom, 2016, vol. 2016–January, pp. 88–96.","ista":"Chatterjee K, Chmelik M. 2016. Indefinite-horizon reachability in Goal-DEC-POMDPs. Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling. ICAPS: International Conference on Automated Planning and Scheduling vol. 2016–January, 88–96."},"title":"Indefinite-horizon reachability in Goal-DEC-POMDPs","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"oa_version":"None","date_published":"2016-01-01T00:00:00Z","page":"88 - 96","date_created":"2018-12-11T11:51:22Z","scopus_import":1}