You can manage bookmarks using lists, please log in to your user account for this.
Media type:
E-Article
Title:
Indefinite-Horizon Reachability in Goal-DEC-POMDPs
Contributor:
Chatterjee, Krishnendu;
Chmelík, Martin
imprint:
Association for the Advancement of Artificial Intelligence (AAAI), 2016
Published in:Proceedings of the International Conference on Automated Planning and Scheduling
Language:
Not determined
DOI:
10.1609/icaps.v26i1.13737
ISSN:
2334-0843;
2334-0835
Origination:
Footnote:
Description:
<jats:p>
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.
</jats:p>