A validation-structure-based theory of plan modification and reuse
Artificial Intelligence
EXCALIBUR: a program for planning and reasoning with processes
Artificial Intelligence
Plan reuse versus plan generation: a theoretical and empirical analysis
Artificial Intelligence - Special volume on planning and scheduling
Fast planning through planning graph analysis
Artificial Intelligence
Fast planning through greedy action graphs
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Planning and Learning by Analogical Reasoning
Planning and Learning by Analogical Reasoning
Discovering State Constraints in DISCOPLAN: Some New Results
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Extending Planning Graphs to an ADL Subset
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Graph-based multiagent replanning algorithm
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Suspending and resuming tasks in BDI agents
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
The 3rd international planning competition: results and analysis
Journal of Artificial Intelligence Research
Planning through stochastic local search and temporal action graphs in LPG
Journal of Artificial Intelligence Research
VHPOP: versatile heuristic partial order planner
Journal of Artificial Intelligence Research
The fast downward planning system
Journal of Artificial Intelligence Research
A domain-independent algorithm for plan adaptation
Journal of Artificial Intelligence Research
The detection and exploitation of symmetry in planning problems
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 2
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Hi-index | 0.00 |
Fast plan adaptation is important in many AI applications. From a theoretical point of view, in the worst case adapting an existing plan to solve a new problem is no more efficient than a complete regeneration of the plan. However, in practice plan adaptation can be much more efficient than plan generation, especially when the adapted plan can be obtained by performing a limited amount of changes to the original plan. In this paper, we investigate a domain-independent method for plan adaptation that modifies the original plan by replanning within limited temporal windows containing portions of the plan that need to be revised. Each window is associated with a particular replanning subproblem that contains some “heuristic goals” facilitating the plan adaptation, and that can be solved using different planning methods. An experimental analysis shows that, in practice, adapting a given plan for solving a new problem using our techniques can be much more efficient than replanning from scratch.