Multiagent plan repair by combined prefix and suffix reuse

Deterministic domain-independent multiagent planning is an approach to coordination of cooperative agents with joint goals. Provided that the agents act in an uncertain and dynamic environment, such plans can fail. The straightforward approach to recover from such situations is to compute a new plan from scratch, that is to replan. Even though, in a worst case, plan repair or plan re-use does not yield an advantage over replanning from scratch, there is a sound evidence from practical use that approaches trying to repair the failed original plan can outperform replanning in selected problems. One of the possible plan repairing techniques is based on preservation of fragments of the older plans. This work theoretically analyses complexity of plan repairing approaches based on preservation of fragments of the original plan and experimentally studies three practical aspects affecting its efficiency in various multiagent settings. We focus both on the computational, as well as the communication efficiency of plan repair in comparison to replanning from scratch and we report on the influence of the following properties on the efficiency of plan repair: 1 the number of involved agents in the plan repairing process, 2 inter-dependencies among the repaired actions, and finally 3 particular modes of re-use of the older plans.

[1]  Enrico Scala,et al.  Plan Repair for Resource Constrained Tasks via Numeric Macro Actions , 2014, ICAPS.

[2]  Sheila A. McIlraith,et al.  Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, ICAPS 2014, Portsmouth, New Hampshire, USA, June 21-26, 2014 , 2014, AAAI 2014.

[3]  Robert Givan,et al.  FF-Replan: A Baseline for Probabilistic Planning , 2007, ICAPS.

[4]  Lukás Chrpa,et al.  Learnability of Specific Structural Patterns of Planning Problems , 2013, 2013 IEEE 25th International Conference on Tools with Artificial Intelligence.

[5]  Manuela M. Veloso,et al.  Fault Tolerant Planning: Toward Probabilistic Uncertainty Models in Symbolic Non-Deterministic Planning , 2004, ICAPS.

[6]  Hector Geffner,et al.  Compiling Uncertainty Away in Conformant Planning Problems with Bounded Width , 2009, J. Artif. Intell. Res..

[7]  Michal Pechoucek,et al.  Domain-independent multi-agent plan repair , 2014, J. Netw. Comput. Appl..

[8]  Michal Pechoucek,et al.  Decentralized multi-agent plan repair in dynamic environments , 2012, AAMAS.

[9]  Christian J. Muise,et al.  Computing Contingent Plans via Fully Observable Non-Deterministic Planning , 2014, AAAI.

[10]  Ronen I. Brafman,et al.  A general, fully distributed multi-agent planning algorithm , 2010, AAMAS.

[11]  Ronen I. Brafman,et al.  From One to Many: Planning for Loosely Coupled Multi-Agent Systems , 2008, ICAPS.

[12]  Bernhard Nebel,et al.  Plan Reuse Versus Plan Generation: A Theoretical and Empirical Analysis , 1995, Artif. Intell..

[13]  Rina Dechter,et al.  Constraint Processing , 1995, Lecture Notes in Computer Science.

[14]  Kevin Leyton-Brown,et al.  Improved Features for Runtime Prediction of Domain-Independent Planners , 2014, ICAPS.

[15]  Neil Immerman,et al.  The Complexity of Decentralized Control of Markov Decision Processes , 2000, UAI.