Exploiting problem symmetries in state-based planners

Nir Pochter*, Aviv Zohar, Jeffrey S. Rosenschein

*Corresponding author for this work

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

34 Scopus citations

Abstract

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 publicationAAAI-11 / IAAI-11 - Proceedings of the 25th AAAI Conference on Artificial Intelligence and the 23rd Innovative Applications of Artificial Intelligence Conference
Pages1004-1009
Number of pages6
StatePublished - 2011
Event25th AAAI Conference on Artificial Intelligence and the 23rd Innovative Applications of Artificial Intelligence Conference, AAAI-11 / IAAI-11 - San Francisco, CA, United States
Duration: 7 Aug 201111 Aug 2011

Publication series

NameProceedings of the National Conference on Artificial Intelligence
Volume2

Conference

Conference25th AAAI Conference on Artificial Intelligence and the 23rd Innovative Applications of Artificial Intelligence Conference, AAAI-11 / IAAI-11
Country/TerritoryUnited States
CitySan Francisco, CA
Period7/08/1111/08/11

Fingerprint

Dive into the research topics of 'Exploiting problem symmetries in state-based planners'. Together they form a unique fingerprint.

Cite this