A general, fully distributed multi-agent planning algorithm

Raz Nissim, Ronen I. Brafman, Carmel Domshlak

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

57 Scopus citations

Abstract

We present a fully distributed multi-agent planning algorithm. Our methodology uses distributed constraint satisfaction to coordinate between agents, and local planning to ensure the consistency of these coordination points. To solve the distributed CSP efficiently, we must modify existing methods to take advantage of the structure of the underlying planning problem. In multi-agent planning domains with limited agent interaction, our algorithm empirically shows scalability beyond state of the art centralized solvers. Our work also provides a novel, real-world setting for testing and evaluating distributed constraint satisfaction algorithms in structured domains and illustrates how existing techniques can be altered to address such structure.

Original languageEnglish
Title of host publication9th International Joint Conference on Autonomous Agents and Multiagent Systems 2010, AAMAS 2010
PublisherInternational Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
Pages1323-1330
Number of pages8
ISBN (Print)9781617387715
StatePublished - 1 Jan 2010
Event9th International Joint Conference on Autonomous Agents and Multiagent Systems 2010, AAMAS 2010 - Toronto, ON, Canada
Duration: 10 May 2010 → …

Publication series

NameProceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
Volume2
ISSN (Print)1548-8403
ISSN (Electronic)1558-2914

Conference

Conference9th International Joint Conference on Autonomous Agents and Multiagent Systems 2010, AAMAS 2010
Country/TerritoryCanada
CityToronto, ON
Period10/05/10 → …

Keywords

  • Distributed Constraint Satisfaction
  • Distributed Problem Solving
  • Multi-Agent Planning
  • Single-Agent Planning

Fingerprint

Dive into the research topics of 'A general, fully distributed multi-agent planning algorithm'. Together they form a unique fingerprint.

Cite this