We eliminate symmetry from a problem before searching for a plan. The planning problem with symmetries is decomposed into a set of isomorphic subproblems. One plan is computed for a small planning problem posed by a descriptive quotient, a description of any such subproblem. A concrete plan is synthesized by concatenating instantiations of that one plan for each subproble
Searching for computational tools that can further push the boundary of satisficing planning, we sho...
Many planning problems contain collections of symmetric objects, actions and structures which render...
International audienceOne important issue of automated theorem proving is the complexity of the infe...
Symmetries arise in planning in a variety of ways. This paper describes the ways that symmetry aises...
This thesis focuses on improving the process of automated planing through symmetry breaking. The aim...
Previous research in Artificial Intelligence has identified the possibility of simplifying planning ...
This paper briefly reviews sources of symmetry in planning and highlights one source that has not pr...
Previous work in symmetry detection for planning has identified symmetries between domain objects an...
The exploitation of symmetry in combinatorial search has typically focused on using information abou...
Many planning problems exhibit a high degree of symmetry that cannot yet be exploited suc-cessfully ...
Many planning problems exhibit a high degree of symmetry that cannot yet be exploited successfully b...
Symmetry-based pruning is a powerful method for reducing the search effort in finitedomain planning....
Heuristic search is a state-of-the-art approach to classical planning. Several heuristic families we...
Many planning problems contain collections of symmetric objects, actions and structures which render...
This document contains a detailed proof that the symmetry group of the colored numeric problem descr...
Searching for computational tools that can further push the boundary of satisficing planning, we sho...
Many planning problems contain collections of symmetric objects, actions and structures which render...
International audienceOne important issue of automated theorem proving is the complexity of the infe...
Symmetries arise in planning in a variety of ways. This paper describes the ways that symmetry aises...
This thesis focuses on improving the process of automated planing through symmetry breaking. The aim...
Previous research in Artificial Intelligence has identified the possibility of simplifying planning ...
This paper briefly reviews sources of symmetry in planning and highlights one source that has not pr...
Previous work in symmetry detection for planning has identified symmetries between domain objects an...
The exploitation of symmetry in combinatorial search has typically focused on using information abou...
Many planning problems exhibit a high degree of symmetry that cannot yet be exploited suc-cessfully ...
Many planning problems exhibit a high degree of symmetry that cannot yet be exploited successfully b...
Symmetry-based pruning is a powerful method for reducing the search effort in finitedomain planning....
Heuristic search is a state-of-the-art approach to classical planning. Several heuristic families we...
Many planning problems contain collections of symmetric objects, actions and structures which render...
This document contains a detailed proof that the symmetry group of the colored numeric problem descr...
Searching for computational tools that can further push the boundary of satisficing planning, we sho...
Many planning problems contain collections of symmetric objects, actions and structures which render...
International audienceOne important issue of automated theorem proving is the complexity of the infe...