Coordination Through Plan Repair

In most practical situations, agents need to continuously improve or repair their plans. In a multiagent system agents also need to coordinate their plans. Consequently, we need methods such that agents in a multiagent system can construct, coordinate, and repair their plans. In this paper we focus on the problem of coordinating plans without exchanging explicit information on dependencies, or having to construct a global set of constraints. Our approach is to combine a propositional plan repair algorithm for each agent with a blackboard that auctions subgoals on behalf of the agents. Both the details of a first construction and some initial experimental results are discussed.

[1]  Michael P. Wellman,et al.  A market protocol for decentralized task allocation , 1998, Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160).

[2]  Maria L. Gini,et al.  MAGNET: A Multi-Agent Contracting System for Plan Execution , 1998 .

[3]  Reid G. Smith,et al.  The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver , 1980, IEEE Transactions on Computers.

[4]  Michael Brenner,et al.  Multiagent Planning with Partially Ordered Temporal Plans , 2003, IJCAI.

[5]  Richard Lazarus,et al.  An infrastructure for adaptive control of multi-agent systems , 2003, IEMC '03 Proceedings. Managing Technologically Driven Organizations: The Human Side of Innovation and Change (IEEE Cat. No.03CH37502).

[6]  Ivan Serina,et al.  Fast Plan Adaptation through Planning Graphs: Local and Systematic Search Techniques , 2000, AIPS.

[7]  Martha E. Pollack,et al.  There's More to Life than Making Plans: Plan Management in Dynamic, Multiagent Environments , 1999, AI Mag..

[8]  David E. Wilkins,et al.  A Multiagent Planning Architecture , 1998, AIPS.

[9]  Luke Hunsberger,et al.  A combinatorial auction for collaborative planning , 2000, Proceedings Fourth International Conference on MultiAgent Systems.

[10]  Edmund H. Durfee,et al.  A Survey of Research in Distributed, Continual Planning , 1999, AI Mag..

[11]  Keith S. Decker,et al.  Coordinating Mutually Exclusive Resources using GPGP , 2000, Autonomous Agents and Multi-Agent Systems.

[12]  W. K. Vickery,et al.  Counter-Speculation Auctions and Competitive Sealed Tenders , 1961 .

[13]  M. M. deWeerdt,et al.  Coordination through plan repair , 2005 .

[14]  Victor R. Lesser,et al.  Leveled-Commitment Contracting: A Backtracking Instrument for Multiagent Systems , 2002, AI Mag..

[15]  Luke Hunsberger,et al.  Distributing the control of a temporal network among multiple agents , 2003, AAMAS '03.

[16]  Milind Tambe,et al.  Role allocation and reallocation in multiagent teams: towards a practical analysis , 2003, AAMAS '03.

[17]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[18]  Christian Kray,et al.  The eager bidder problem: a fundamental problem of DAI and selected solutions , 2002, AAMAS '02.

[19]  Mathijs de Weerdt,et al.  Plan Repair as an Extension of Planning , 2005, ICAPS.

[20]  Frank von Martial.  Coordinating Plans of Autonomous Agents , 1992, Lecture Notes in Computer Science.

[21]  Han La Poutré,et al.  A Decommitment Strategy in a Competitive Multi-agent Transportation Setting , 2003, AMEC.

[22]  Kevin Crowston,et al.  The interdisciplinary study of coordination , 1994, CSUR.

[23]  Subbarao Kambhampati,et al.  Refinement Planning as a Unifying Framework for Plan Synthesis , 1997, AI Mag..

[24]  Sarit Kraus,et al.  Methods for Task Allocation via Agent Coalition Formation , 1998, Artif. Intell..