Challenges in bridging plan synthesis paradigms

Authors:
Subbarao Kambhampati
Affiliations:
Department of Computer Science and Engineering, Arizona State University, Tempe, AZ
Venue:
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Year:
1997

Citing 5
Cited 10

Partial-order planning: evaluating possible efficiency gains

Artificial Intelligence
Planning as refinement search: a unified framework for evaluating design tradeoffs in partial-order planning

Artificial Intelligence - Special volume on planning and scheduling
Experimental results on the crossover point in random 3-SAT

Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Fast planning through planning graph analysis

IJCAI'95 Proceedings of the 14th 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

Hybrid planning for partially hierarchical domains

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Control knowledge in planning: benefits and tradeoffs

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
Hybrid propositional encodings of planning

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
Planning as constraint satisfaction: solving the planning graph by compiling it into CSP

Artificial Intelligence
Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search

Artificial Intelligence
Automated Planning and Scheduling for Goal-Based Autonomous Spacecraft

IEEE Intelligent Systems
Planning graph as a (dynamic) CSP: exploiting EBL, DDB and other CSP search techniques in Graphplan

Journal of Artificial Intelligence Research
Optiplan: unifying IP-based and graph-based planning

Journal of Artificial Intelligence Research
Synthesizing customized planners from specifications

Journal of Artificial Intelligence Research
Unifying SAT-based and graph-based planning

IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the last three years, several "radically new" and promising approaches have been developed for tackling the plan synthesis problem. Currently, these approaches exist in isolation as there is no coherent explanation of their sources of strength vis a vis the traditional refinement planners. In this paper, I provide a generalized view of refinement planning, that subsumes both traditional and newer approaches to plan synthesis. I will interpret the contributions of the new approaches in terms of a new subclass of refinement planners called "disjunctive planners". This unifying view raises several intriguing possibilities for complementing the strengths of the various approaches. I will identify and pose these as challenges to the planning community.