Automated Agent Decomposition for Classical Planning

Matthew Crosby, Michael Rovatsos, Ronald Petrick

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

Many real-world planning domains, including those used in common benchmark problems, are based on multiagent scenarios. It has long been recognised that breaking down such problems into sub-problems for individual agents may help reduce overall planning complexity. This kind of approach is especially effective in domains where interaction between agents is limited. In this paper we present a fully centralised, offline, sequential, total-order planning algorithm for solving classical planning problems based on this idea. This algorithm consists of an automated decomposition process and a heuristic search method designed specifically for decomposed domains. The decomposition method is part of a preprocessing step and can be used to determine the 'multiagent nature' of a planning problem prior to actual plan search. The heuristic search strategy is shown to effectively exploit any decompositions that are found and performs significantly better than current approaches on loosely coupled domains.
Original languageEnglish
Title of host publicationProceedings of the Twenty-Third International Conference on Automated Planning and Scheduling
PublisherAAAI Press
Publication statusPublished - 2013
EventTwenty-Third International Conference on Automated Planning and Scheduling - Italy, Rome, Italy
Duration: 10 Jun 201314 Jun 2014


ConferenceTwenty-Third International Conference on Automated Planning and Scheduling

Keywords / Materials (for Non-textual outputs)

  • planning
  • decomposition
  • multiagent


Dive into the research topics of 'Automated Agent Decomposition for Classical Planning'. Together they form a unique fingerprint.

Cite this