Divide and conquer in multi-agent planning

Eithan Ephrati*, Jeffrey S. Rosenschein

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

43 Scopus citations

Abstract

In this paper, we suggest an approach to multi-agent planning that contains heuristic elements. Our method makes use of subgoals, and derived sub-plans, to construct a global plan. Agents solve their individual sub-plans, which are then merged into a global plan. The suggested approach may reduce overall planning time and derives a plan that approximates the optimal global plan that would have been derived, by a central planner, given those original subgoals. We consider two different scenarios. The first involves a group of agents with a common goal. The second considers how agents can interleave planning and execution when planning towards a common, though dynamic, goal.

Original languageAmerican English
Pages375-380
Number of pages6
StatePublished - 1994
Externally publishedYes
EventProceedings of the 12th National Conference on Artificial Intelligence. Part 1 (of 2) - Seattle, WA, USA
Duration: 31 Jul 19944 Aug 1994

Conference

ConferenceProceedings of the 12th National Conference on Artificial Intelligence. Part 1 (of 2)
CitySeattle, WA, USA
Period31/07/944/08/94

Fingerprint

Dive into the research topics of 'Divide and conquer in multi-agent planning'. Together they form a unique fingerprint.

Cite this