A Theory of Intra-Agent Replanning

Abstract : When autonomous agents execute in the real world, the world state as well as the objectives may change from the agent's original conception of those things. In such cases, the agent's planning process must modify the existing plan to make it amenable to the new conditions, and to resume execution. The need for inter-agent replanning, in terms of commitments to other agents, is understood in the multi-agent systems community. Such inter-agent replanning also motivates an intra-agent replanning problem for each individual agent. However the single-agent planning community has mostly limited its view of replanning to reducing the computational effort involved by minimally perturbing the current plan structure to replan. This is not very appropriate as a general model for intra-agent replanning, which may consist of various techniques that are employed according to the scenario at hand. In this paper, we present a general replanning problem that is built on various types of replanning constraints. We show that these constraints can model different types of replanning, including the similarity-based approaches used in the past and sensitivity to commitments made to other agents. Finally, we show that partial satisfaction planning provides a good substrate for modeling this general replanning problem.

[1]  Felipe Meneguzzi,et al.  A First-Order Formalization of Commitments and Goals for Planning , 2013, AAAI.

[2]  Matthias Scheutz,et al.  Planning for human-robot teaming in open worlds , 2010, TIST.

[3]  Ivan Serina,et al.  Planning Through Stochastic Local Search and Temporal Action Graphs in LPG , 2003, J. Artif. Intell. Res..

[4]  Subbarao Kambhampati,et al.  Replanning: a New Perspective , 2005 .

[5]  Subbarao Kambhampati,et al.  Domain Independent Approaches for Finding Diverse Plans , 2007, IJCAI.

[6]  Michael Wooldridge,et al.  Reasoning about rational agents , 2000, Intelligent robots and autonomous agents.

[7]  Subbarao Kambhampati,et al.  Effective Approaches for Partial Satisfaction (Over-Subscription) Planning , 2004, AAAI.

[8]  Subbarao Kambhampati,et al.  Mapping and Retrieval During Plan Reuse: A Validation Structure Based Approach , 1990, AAAI.

[9]  Thomas Wagner,et al.  Multi-Level Conflict in Multi-Agent Systems , 1999 .

[10]  H. Simon,et al.  On the concept of organizational goal. , 1964 .

[11]  Richard Fikes,et al.  Learning and Executing Generalized Robot Plans , 1993, Artif. Intell..

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

[13]  Edmund H. Durfee,et al.  Limiting disruption in multiagent replanning , 2003, AAMAS '03.

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

[15]  Martha E. Pollack,et al.  Least-Cost Flaw Repair: A Plan Refinement Strategy for Partial-Order Planning , 1994, AAAI.

[16]  Michael Wooldridge,et al.  Reasoning about rational agents MIT Press , 2000 .

[17]  Rob Sherwood,et al.  Casper: Space Exploration through Continuous Planning , 2001, IEEE Intell. Syst..

[18]  Daniel S. Weld,et al.  UCPOP: A Sound, Complete, Partial Order Planner for ADL , 1992, KR.

[19]  Sheila A. McIlraith,et al.  Monitoring Plan Optimality During Execution , 2007, ICAPS.

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

[21]  Michal Pechoucek,et al.  Planning and re-planning in multi-actors scenarios by means of social commitments , 2008, 2008 International Multiconference on Computer Science and Information Technology.

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