Planning for conjunctive goals
Artificial Intelligence
Introduction to artificial intelligence
Introduction to artificial intelligence
Case-based planning: viewing planning as a memory task
Case-based planning: viewing planning as a memory task
Explaining and repairing plans that fail
Artificial Intelligence
A validation-structure-based theory of plan modification and reuse
Artificial Intelligence
Learning by analogical reasoning in general problem-solving
Learning by analogical reasoning in general problem-solving
Derivational Analogy in PRODIGY: Automating Case Acquisition, Storage, and Utilization
Machine Learning - Special issue on case-based reasoning
Partial-order planning: evaluating possible efficiency gains
Artificial Intelligence
Flexible strategy learning: analogical replay of problem solving episodes
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Omnipotence without omniscience: efficient sensor management for planning
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Task-decomposition via plan parsing
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Dynamic Memory: A Theory of Reminding and Learning in Computers and People
Dynamic Memory: A Theory of Reminding and Learning in Computers and People
Lazy Incremental Learning of Control Knowledge for EfficientlyObtaining Quality Plans
Artificial Intelligence Review - Special issue on lazy learning
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A Survey on Case-Based Planning
Artificial Intelligence Review
Knowledge Management by Reusing Experience (Short Paper)
EKAW '00 Proceedings of the 12th European Workshop on Knowledge Acquisition, Modeling and Management
Replanning in a Resource-Based Framework
Proceedings of the 9th ECCAI-ACAI/EASSS 2001, AEMAS 2001, HoloMAS 2001 on Multi-Agent-Systems and Applications II-Selected Revised Papers
A Replanning Algorithm for a Reactive Agent Architecture
AIMSA '02 Proceedings of the 10th International Conference on Artificial Intelligence: Methodology, Systems, and Applications
ECCBR '02 Proceedings of the 6th European Conference on Advances in Case-Based Reasoning
Towards a Unified Theory of Adaption in Case-Based Reasoning
ICCBR '99 Proceedings of the Third International Conference on Case-Based Reasoning and Development
A Knowledge-Level Task Model of Adaption in Case-Based Reasoning
ICCBR '99 Proceedings of the Third International Conference on Case-Based Reasoning and Development
An Architecture for Normative Reactive Agents
Proceedings of the 5th Pacific Rim International Workshop on Multi Agents: Intelligent Agents and Multi-Agent Systems
Lifelong Planning for Mobile Robots
Revised Papers from the International Seminar on Advances in Plan-Based Control of Robotic Agents,
A Multiple-Domain Evaluation of Stratified Case-Based Reasoning
ICCBR '99 Proceedings of the Third International Conference on Case-Based Reasoning and Development
Eighteenth national conference on Artificial intelligence
Artificial Intelligence
A resource based framework for planning and replanning
Web Intelligence and Agent Systems
Incremental heuristic search in AI
AI Magazine
Real-Time Plan Adaptation for Case-Based Planning in Real-Time Strategy Games
ECCBR '08 Proceedings of the 9th European conference on Advances in Case-Based Reasoning
Applied Artificial Intelligence
Adaptation versus Retrieval Trade-Off Revisited: An Analysis of Boundary Conditions
ICCBR '09 Proceedings of the 8th International Conference on Case-Based Reasoning: Case-Based Reasoning Research and Development
On-line case-based plan adaptation for real-time strategy games
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
An analysis of transformational analogy: general framework and complexity
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Temporal planning using subgoal partitioning and resolution in SGPlan
Journal of Artificial Intelligence Research
Storing and indexing plan derivations through explanation-based analysis of retrieval failures
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Remembering to add: competence-preserving case-addition policies for case-base maintenance
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Stratified case-based reasoning: reusing hierarchical problem solving episodes
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Generating optimal plans in highly-dynamic domains
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Kernel functions for case-based planning
Artificial Intelligence
Planning by rewriting: efficiently generating high-quality plans
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Efficient Plan Adaptation through Replanning Windows and Heuristic Goals
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
The complexity of action redundancy
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
Learning similarity metrics from case solution similarity
IBERAMIA-SBIA'06 Proceedings of the 2nd international joint conference, and Proceedings of the 10th Ibero-American Conference on AI 18th Brazilian conference on Advances in Artificial Intelligence
An analysis on transformational analogy: general framework and complexity
ECCBR'06 Proceedings of the 8th European conference on Advances in Case-Based Reasoning
Amalgams: a formal approach for combining multiple case solutions
ICCBR'10 Proceedings of the 18th international conference on Case-Based Reasoning Research and Development
Amalgam-Based reuse for multiagent case-based reasoning
ICCBR'11 Proceedings of the 19th international conference on Case-Based Reasoning Research and Development
Hi-index | 0.00 |
The paradigms of transformational planning, case-based planning, and plan debugging all involve a process known as plan adaptation -- modifying or repairing an old plan so it solves a new problem. In this paper we provide a domain-independent algorithm for plan adaptation, demonstrate that it is sound, complete, and systematic, and compare it to other adaptation algorithms in the literature. Our approach is based on a view of planning as searching a graph of partial plans. Generative planning starts at the graph's root and moves from node to node using plan-refinement operators. In planning by adaptation, a library plan--an arbitrary node in the plan graph--is the starting point for the search, and the plan-adaptation algorithm can apply both the same refinement operators available to a generative planner and can also retract constraints and steps from the plan. Our 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.