Indefinite-horizon reachability in Goal-DEC-POMDPs - Chatterjee, Krishnendu; Chmelik, Martin; ICAPS: International Conference on Automated Planning and Scheduling; Modern Graph Algorithmic Techniques in Formal Verification; Quantitative Graph Games: Theory and Applications; Rigorous Systems Engineering (Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling, 2016)
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
published
yes
Keywords: conference paper