Indefinite-horizon reachability in Goal-DEC-POMDPs Chatterjee, Krishnendu ; https://orcid.org/0000-0002-4561-241X Chmelik, Martin 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 AAAI Press 2016 info:eu-repo/semantics/conferenceObject doc-type:conferenceObject text http://purl.org/coar/resource_type/c_5794 https://research-explorer.ista.ac.at/record/1324 Chatterjee K, Chmelik M. Indefinite-horizon reachability in Goal-DEC-POMDPs. In: <i>Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling</i>. Vol 2016. AAAI Press; 2016:88-96. doi:<a href="https://doi.org/10.1609/icaps.v26i1.13737">10.1609/icaps.v26i1.13737</a> eng info:eu-repo/semantics/altIdentifier/doi/10.1609/icaps.v26i1.13737 info:eu-repo/semantics/openAccess