Abstract

The notion of planning using multiple agents has been around since the very beginning of planning itself. It has been approached from various viewpoints especially in the multiagent systems community. Recently, domain-independent multiagent planning has gained more attention also in the automated planning community. In this paper, we shortly present the current state of the art, question some aspects of the research field and discuss the rising challenges.

Highlights

  • We could trace the first mention of multiagent planning back nearly as far as STRIPS itself – in 1980 Nillson published together with Konolige a paper titled “Multiple-Agent Planning Systems” [1], in which they presented a high-level extension of STRIPS [2] towards multiple agents

  • Multiagent planning often relates to planning models described by Decentralized POMDPs (Dec-POMDPs) [6], as POMDPs are used in single agent planning under uncertainty

  • The paper formally introduced a minimalistic extension of STRIPS and have shown that the complexity of multiagent planning is not directly exponentially dependent on the number of agents, but rather on the tree-width of their interaction graph and a minimal number of interactions needed to solve the problem

Read more

Summary

Introduction

We could trace the first mention of multiagent planning back nearly as far as STRIPS itself – in 1980 Nillson published together with Konolige a paper titled “Multiple-Agent Planning Systems” [1], in which they presented a high-level extension of STRIPS [2] towards multiple agents. The paper formally introduced a minimalistic extension of STRIPS ( forming MA-STRIPS) and have shown that the complexity of multiagent planning is not directly exponentially dependent on the number of agents, but rather on the tree-width of their interaction graph and a minimal number of interactions needed to solve the problem. Such results suggested that at least for loosely coupled problems (where the tree-width is low), the approach may be beneficial. A dedicated workshop Distributed and Multiagent Planning (DMAP) took place at the ICAPS’13 and ICAPS’14 conferences

MA-STRIPS
Is It Any Good?
Improve Scalability by Decomposition
Privacy
Asynchronous Computation
Comparison of Planners
Which Planning Paradigm Is the Best?
Heuristics
Final Remarks
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call