Exploiting Problem Symmetries in State-Based Planners

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

16 Scopus citations


Previous research in Artificial Intelligence has identified the possibility of simplifying planning problems via the identification and exploitation of symmetries. We advance the state of the art in algorithms that exploit symmetry in planning problems by generalizing previous approaches, and applying symmetry reductions to state-based planners. We suggest several algorithms for symmetry exploitation in state-based search, but also provide a comprehensive view through which additional algorithms can be developed and fine-tuned. We evaluate our approach to symmetry exploitation on instances from previous planning competitions, and demonstrate that our algorithms significantly improve the solution time of instances with symmetries.

Original languageAmerican English
Title of host publicationProceedings of the 25th AAAI Conference on Artificial Intelligence, AAAI 2011
PublisherAAAI Press
Number of pages6
ISBN (Electronic)9781577355083
StatePublished - 11 Aug 2011
Event25th AAAI Conference on Artificial Intelligence, AAAI 2011 - San Francisco, United States
Duration: 7 Aug 201111 Aug 2011

Publication series

NameProceedings of the 25th AAAI Conference on Artificial Intelligence, AAAI 2011


Conference25th AAAI Conference on Artificial Intelligence, AAAI 2011
Country/TerritoryUnited States
CitySan Francisco

Bibliographical note

Funding Information:
Acknowledgments This work was partially supported by Israel Science Foundation grant #898/05, and Israel Ministry of Science and Technology grant #3-6797.

Publisher Copyright:
Copyright © 2011, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.


Dive into the research topics of 'Exploiting Problem Symmetries in State-Based Planners'. Together they form a unique fingerprint.

Cite this