A Heuristic Approach for Solving Decentralized-POMDP: Assessment on the Pursuit Problem

Iadine Chadès 1 Bruno Scherrer 1 François Charpillet 1
1 MAIA - Autonomous intelligent machine
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Defining the behaviour of a set of situated agents, such that a collaborative problem can be solved is a key issue in multi-agent systems. In this paper, we formulate this problem from the decision theoretic perspective using the framework of Decentralized Partially Observable Markov Decision Processes (DEC-POMDP). Formulating the coordination problem in this way provides a formal foundation for study of cooperation activities. But, as it has been recently shown solving DEC-POMDP is NEXP-complete and thus it is not a realistic approach for the design of agent cooperation policies. However, we demonstrate in this paper that it is not completely desperate. Indeed, we propose an heuristic approach for solving DEC-POMDP when agents are memoryless and when the global reward function can be broken up into a sum of local reward functions. We demonstrate experimentally on an example (the so-called pursuit problem) that this heuristic is efficient within a few iteration steps.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00100691
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 2:49:29 PM
Last modification on : Thursday, January 11, 2018 - 6:19:50 AM

Identifiers

  • HAL Id : inria-00100691, version 1

Collections

Citation

Iadine Chadès, Bruno Scherrer, François Charpillet. A Heuristic Approach for Solving Decentralized-POMDP: Assessment on the Pursuit Problem. [Intern report] A01-R-017 || chades01a, 2001, 6 p. ⟨inria-00100691⟩

Share

Metrics

Record views

180