A Heuristic Approach for Solving Decentralized-POMDP : Assessment on the Pursuit Problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2002

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

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.
Not file

Dates and versions

inria-00100729 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00100729 , version 1

Cite

Iadine Chadès, Bruno Scherrer, François Charpillet. A Heuristic Approach for Solving Decentralized-POMDP : Assessment on the Pursuit Problem. ACM Symposium on Applied Computing - SAC'2002, Mar 2002, Madrid, Spain, 6 p. ⟨inria-00100729⟩
69 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More