Analyzing Plans with Conditional Effects

Several tasks, such as plan reuse and agent modeling, rely on interpreting a given or observed plan to generate the underlying plan rationale. Although there are several previous methods that successfully extract plan rationales, they do not apply to complex plans, in particular to plans with actions that have conditional effects. In this paper, we introduce SPRAWL, an algorithm to find a minimal annotated partially ordered structure that maximizes a given evaluation function for an observed totally ordered plan with conditional effects. The algorithm proceeds in a two-phased approach, first preprocessing the given plan using a novel needs analysis technique that builds a needs tree to identify the dependencies between operators in the totally ordered plan. The needs tree is then processed to construct a partial ordering that captures the complete rationale of the given plan. We also provide a polynomial-time algorithm to find non-optimal minimal annotated partial orderings of observed totally ordered plans with conditional effects. We provide illustrative examples and discuss the challenges we faced.

[1]  Daniel L. Slotnick,et al.  The SOLOMON computer , 1962, AFIPS '62 (Fall).

[2]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

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

[4]  Henry A. Kautz,et al.  Generalized Plan Recognition , 1986, AAAI.

[5]  Edwin P. D. Pednault,et al.  FORMULATING MULTIAGENT, DYNAMIC-WORLD PROBLEMS IN THE CLASSICAL PLANNING FRAMEWORK , 1987 .

[6]  James A. Hendler,et al.  Flexible reuse and modification in hierarchical planning: a validation structure-based approach , 1989 .

[7]  M. Veloso,et al.  Nonlinear Planning with Parallel Resource Allocation , 1990 .

[8]  Pierre Régnier,et al.  Complete Determination of Parallel Actions and Temporal Optimization in Linear Plans of Action , 1991, EWSP.

[9]  Subbarao Kambhampati,et al.  Explanation-Based Generalization of Partially Ordered Plans , 1991, AAAI.

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

[11]  James A. Hendler,et al.  A Validation-Structure-Based Theory of Plan Modification and Reuse , 1992, Artif. Intell..

[12]  Mark A. Peot,et al.  Postponing Threats in Partial-Order Planning , 1993, AAAI.

[13]  Manuela M. Veloso,et al.  Prodigy/Analogy: Analogical Reasoning in General Problem Solving , 1993, EWCBR.

[14]  Daniel S. Weld.  An Introduction to Least Commitment Planning , 1994, AI Mag..

[15]  Christer Bäckström.  Finding Least Constrained Plans and Optimal Parallel Executions is Harder than We Thought , 1994 .

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

[17]  Mark A. Peot,et al.  Suspending Recursion in Causal-Link Planning , 1996, AIPS.

[18]  S. Kambhampati.  Using Disjunctive orderings instead of Conflict Resolution in Partial order planning , 1996 .

[19]  David E. Smith,et al.  Conditional Effects in Graphplan , 1998, AIPS.

[20]  Jörg Hoffmann,et al.  On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm , 2000, J. Artif. Intell. Res..