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 language||American English|
|Title of host publication||Proceedings of the 25th AAAI Conference on Artificial Intelligence, AAAI 2011|
|Number of pages||6|
|State||Published - 11 Aug 2011|
|Event||25th AAAI Conference on Artificial Intelligence, AAAI 2011 - San Francisco, United States|
Duration: 7 Aug 2011 → 11 Aug 2011
|Name||Proceedings of the 25th AAAI Conference on Artificial Intelligence, AAAI 2011|
|Conference||25th AAAI Conference on Artificial Intelligence, AAAI 2011|
|Period||7/08/11 → 11/08/11|
Bibliographical noteFunding Information:
Acknowledgments This work was partially supported by Israel Science Foundation grant #898/05, and Israel Ministry of Science and Technology grant #3-6797.
Copyright © 2011, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.