Robust plan execution via reconfiguration and replanning

Acting in real world may be a difficult task for an agent, either software or robotic, because unexpected contingencies may arise at any step of the execution. Previous approaches to robust plan execution consider propositional goals to be achieved and time constraints to be satisfied. However, realistic plans must obey to constraints on continuous/consumable resources, too. To face the complexity in handling these resources, the paper proposes the notion of Multi Modality Action (MMA). The model allows to explicitly express the multiple execution modalities in which a given action can be executed; each execution modality models requirements/consequences on the involved consumable resources when that modality is selected. Relying on the MMA notion, the paper presents how the repair problem can be seen as a problem of reconfiguring actions modalities, and how it can be solved by exploiting a CSP encoding. The MMAs are employed by a new continual planner, FLEX-RR, which, exploiting the synergy from the reconfiguration and a numeric planning mechanism can efficiently repair on the fly the plan keeping it rather stable. An empirical analysis performed on three numeric planning domains, confirms the large benefits of FLEX-RR in terms of competence, efficiency and stability of the repaired plan.

[1]  Antonio Garrido,et al.  Anytime Plan-Adaptation for Continuous Planning , 2010 .

[2]  Subbarao Kambhampati,et al.  Generating diverse plans to handle unknown and partially known user preferences , 2012, Artif. Intell..

[3]  Maria Fox,et al.  PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains , 2003, J. Artif. Intell. Res..

[4]  Fahiem Bacchus,et al.  Generalizing GraphPlan by Formulating Planning as a CSP , 2003, IJCAI.

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

[6]  Amanda Jane Coles Opportunistic Branched Plans to Maximise Utility in the Presence of Resource Uncertainty , 2012, ECAI.

[7]  Subbarao Kambhampati,et al.  Solving Planning-Graph by Compiling It into CSP , 2000, AIPS.

[8]  Tom Bylander,et al.  The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..

[9]  Jörg Hoffmann,et al.  Resource-Constrained Planning: A Monte Carlo Random Walk Approach , 2012, ICAPS.

[10]  Jörg Hoffmann,et al.  The Metric-FF Planning System: Translating ''Ignoring Delete Lists'' to Numeric State Variables , 2003, J. Artif. Intell. Res..

[11]  Malte Helmert,et al.  Decidability and Undecidability Results for Planning with Numerical State Variables , 2002, PuK.

[12]  Ivan Serina,et al.  Plan Stability: Replanning versus Plan Repair , 2006, ICAPS.

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

[14]  R. Brafman,et al.  Contingent Planning via Heuristic Forward Search witn Implicit Belief States , 2005, ICAPS.

[15]  Pietro Torasso,et al.  Towards Robust Execution of Mission Plans for Planetary Rovers , 2012 .

[16]  Nicola Muscettola,et al.  HSTS: Integrating Planning and Scheduling , 1993 .

[17]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[18]  Enrico Scala,et al.  Numeric Kernel for Reasoning about Plans Involving Numeric Fluents , 2013, AI*IA.

[19]  Roberto Micalizio,et al.  ACTION FAILURE RECOVERY VIA MODEL‐BASED DIAGNOSIS AND CONFORMANT PLANNING , 2013, Comput. Intell..

[20]  Roberto Micalizio,et al.  Communication Scheduling and Plan Revision For Planetary Rovers , 2010 .

[21]  Amedeo Cesta,et al.  The Timeline Representation Framework as a Planning and Scheduling Software Development Environment , 2008 .

[22]  Stephen F. Smith,et al.  Solve-and-robustify , 2009, J. Sched..

[23]  Ivan Serina,et al.  Case-based Planning for Problems with Real-valued Fluents: Kernel Functions for Effective Plan Retrieval , 2012, ECAI.

[24]  Pietro Torasso,et al.  Intelligent Supervision for Robust Plan Execution , 2011, AI*IA.

[25]  Ivan Serina,et al.  Efficient Plan Adaptation through Replanning Windows and Heuristic Goals , 2010, RCRA.

[26]  Bernhard Nebel,et al.  Continual planning and acting in dynamic multiagent environments , 2006, PCAR '06.

[27]  Xavier Lorca,et al.  Choco: an Open Source Java Constraint Programming Library , 2008 .

[28]  Toby Walsh,et al.  Handbook of Constraint Programming (Foundations of Artificial Intelligence) , 2006 .

[29]  Pietro Torasso,et al.  Monitoring the Execution of a Multi-Agent Plan: Dealing with Partial Observability , 2008, ECAI.

[30]  Ivan Serina,et al.  An approach to efficient planning with numerical fluents and multi-criteria plan quality , 2008, Artif. Intell..

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

[32]  Malte Helmert,et al.  Automating the evaluation of planning systems , 2013, AI Commun..

[33]  Patrick Doherty,et al.  A Temporal Logic-Based Planning and Execution Monitoring System , 2008, ICAPS.

[34]  Brian Charles Williams,et al.  Drake: An Efficient Executive for Temporal Plans with Choice , 2011, J. Artif. Intell. Res..

[35]  Vladimir I. Levenshtein,et al.  Binary codes capable of correcting deletions, insertions, and reversals , 1965 .

[36]  Nico Roos,et al.  Diagnosis of Plan Execution and the Executing Agent , 2005, KI.

[37]  Stephen F. Smith,et al.  From precedence constraint posting to partial order schedules: A CSP approach to Robust Scheduling , 2007, AI Commun..

[38]  Paolo Traverso,et al.  The actor's view of automated planning and acting: A position paper , 2014, Artif. Intell..

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