A Validation-Structure-Based Theory of Plan Modification and Reuse

@article{Kambhampati1992AVT,
  title={A Validation-Structure-Based Theory of Plan Modification and Reuse},
  author={S. Kambhampati and J. Hendler},
  journal={Artif. Intell.},
  year={1992},
  volume={55},
  pages={193-258}
}
A framework for the flexible and conservative modification of plans enables a planner to modify its plans in response to incremental changes in their specifications, to reuse its existing plans in new problem situations, and to efficiently replan in response to execution time failures. We present a theory of plan modification applicable to hierarchical nonlinear planning. Our theory utilizes the validation structure of stored plans to yield a flexible and conservative plan modification… Expand
Flexible Plan Reuse in a Formal Framework
TLDR
A domain-independent approach to exible plan reuse based on a deductive framework and a formalization of the whole reuse process is proposed including the modiication, representation and retrieval of plans. Expand
Plan Modification versus Plan Generation: A Complexity-Theoretic Perspective
TLDR
Considering propositional STRIPS planning, it turns out that conservative plan modification is as hard as planning and can sometimes be harder than plan generation. Expand
EXPLOITING CAUSAL STRUCTURE TO CONTROL RETRIEVAL AND REFITTING DURING PLAN REUSE
TLDR
This paper provides a domain independent similarity metric that utilizes the plan causal dependency structure to estimate the utility of reusing a given plan in a new problem situation and presents a minimum‐conflict heuristic, based on the causal dependencyructure of the plan, to conservatively control the modification. Expand
A Domain-Independent Algorithm for Plan Adaptation
TLDR
The algorithm's completeness ensures that the adaptation algorithm will eventually search the entire graph and its systematicity ensures that it will do so without redundantly searching any parts of the graph. Expand
Systematic adaptation for case-based planning
TLDR
A domain-independent algorithm for case-based plan adaptation that is sound, complete, and systematic is developed, and experimental results that shed light on performance issues an implementation must confront are presented. Expand
Plan Reuse Versus Plan Generation: A Theoretical and Empirical Analysis
TLDR
The utility of plan-reuse techniques is limited and that these limits have not been determined yet, as it is revealed that plan reuse can actually be strictly more difficult than plan generation. Expand
Plan Stability: Replanning versus Plan Repair
TLDR
This work presents arguments to support the claim that plan stability is a valuable property, and proposes an implementation, based on LPG, of a plan repair strategy that adapts a plan to its new context. Expand
Characterising Plans as a Set of Constraints the Model a Framework for Comparative Analysis
TLDR
An approach to representing and manipulating plans based on a model of plans as a set of constraints is presented, intended to support new work on automatic manipulation of plans, human communication about plans, principled and reliable acquisition of plan information, and formal reasoning about plans. Expand
Plan Repair Using Unmodified Planning Systems
To make planning feasible, planning models abstract from many details of the modeled system. When executing plans in the actual system, the model might be inaccurate in a critical point, and planExpand
HTN Plan Repair via Model Transformation
TLDR
A novel approach is introduced that makes it possible to use unchanged, off-the-shelf HTN planning systems to repair broken HTN plans, and no specialized solvers are needed. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 72 REFERENCES
A Theory of Plan Modification
We present a theory of plan modification applicable to hierarchical nonlinear planning. Our theory utilizes the validation structure of the stored plans to yield a flexible and conservative planExpand
Flexible reuse of plans via annotation and verification
  • S. Kambhampati, J. Hendler
  • Computer Science
  • [1989] Proceedings. The Fifth Conference on Artificial Intelligence Applications
  • 1989
TLDR
An approach is presented for flexible reuse of old plans in the presence of a generative planner that obviates the need for any extra domain knowledge (other than that already known to the planner) during reuse and thus affords a relatively domain independent framework for plan reuse. Expand
Domain-Independent Planning: Representation and Plan Generation
Abstract A domain-independent planning program that supports both automatic and interactive generation of hierarchical, partially ordered plans is described. An improved formalism makes extensive useExpand
Control of Refitting during Plan Reuse
TLDR
This paper presents techniques for conservative refitting control by utilizing the annotated dependency structures of an existing plan and describes how these techniques are incorporated into PRIAR, a frame­ work for flexible plan reuse. Expand
Explaining and Repairing Plans that Fail
TLDR
This paper presents an alternative approach in which plan failures are described in terms of causal explanations of why they occurred, used to access different abstract replanning strategies, which are then turned into specific changes to the faulty plans. Expand
Mapping and Retrieval During Plan Reuse: A Validation Structure Based Approach
TLDR
This paper presents a domain independent strategy for ranking a set of plausible reuse candidates in the order of cost of modifying them to solve a new planning problem. Expand
Explanation-Based Generalization of Partially Ordered Plans
TLDR
The systematic derivation of the generalization algorithms from the Modal Truth Criterion obviates the need for carrying out a separate formal proof of correctness of the EBG algorithms. Expand
CHEF: A Model of Case-Based Planning
TLDR
The ideas of memory, learning and planning are implemented in the case-based planner CHEF, which creates new plans in the domain of Szechwan cooking. Expand
A Structure for Plans and Behavior
TLDR
Progress to date in the ability of a computer system to understand and reason about actions is described, and the structure of a plan of actions is as important for problem solving and execution monitoring as the nature of the actions themselves. Expand
Combining Specialized Reasoners and General Purpose Planners: A Case Study
TLDR
This paper investigates a hybrid planning model that utilizes a set of specialists to complement both the overall expressiveness and the reasoning power of a traditional hierarchical planner, and describes a preliminary implementation of a planning architecture based on this model in a manufacturing planning domain. Expand
...
1
2
3
4
5
...