Fast planning through planning graph analysis
Artificial Intelligence
Ignoring Irrelevant Facts and Operators in Plan Generation
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
The automatic inference of state invariants in TIM
Journal of Artificial Intelligence Research
Efficient implementation of the plan graph in STAN
Journal of Artificial Intelligence Research
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
Structural Constraint-Based Modeling and Reasoning with Basic Configuration Cells
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
On Plan Adaption through Planning Graph Analysis
AI*IA '99 Proceedings of the 6th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
Integration of symmetry and macro-operators in planning
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
The Knowledge Engineering Review
Kernel functions for case-based planning
Artificial Intelligence
Completeness-Preserving Pruning for Optimal Planning
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on 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
Symmetry breaking for distributed multi-context systems
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Analyzing search topology without running any search: on the connection between causal graphs and h+
Journal of Artificial Intelligence Research
Improving the computational efficiency in symmetrical numeric constraint satisfaction problems
CAEPIA'05 Proceedings of the 11th Spanish association conference on Current Topics in Artificial Intelligence
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Graph pruning and symmetry breaking on grid maps
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Hi-index | 0.00 |
Many planning problems exhibit a high degree of symmetry that cannot yet be exploited successfully by modern planning technology. For example, problems in the Gripper domain, in which a robot with two grippers must transfer balls from one room to another, are trivial to the human problem-solver because the high degree of symmetry in the domain means that the order in which pairs of balls are transported is irrelevant to the length of the shortest transportation plan. However, planners typically search all possible orderings giving rise to an exponential explosion of the search space. This paper describes a way of detecting and exploiting symmetry in the solution of problems that demonstrate these characteristics. We have implemented our techniques in STAN, a Graphplan-based planner that uses state analysis techniques in a number of ways to exploit the underlying structures of domains. We have achieved a dramatic improvement in performance in solving problems exhibiting symmetry. We present a range of results and indicate the further developments we are now pursuing.