On computational complexity of automorphism groups in classical planning

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

2 Scopus citations

Abstract

Symmetry-based pruning is a family of powerful methods for reducing search effort in planning as heuristic search. Applying these methods requires first establishing an automorphism group that is then used for pruning within the search process. Despite the growing popularity of state-space symmetries in planning techniques, the computational complexity of finding the automorphism group of a compactly represented planning task has not been formally established. In a series of reductions, we show that computing the automorphism group of a grounded planning task is GI-hard. Furthermore, we discuss the presentations of these symmetry groups and list some of their drawbacks.

Original languageEnglish
Title of host publicationProceedings of the 29th International Conference on Automated Planning and Scheduling, ICAPS 2019
EditorsJ. Benton, Nir Lipovetzky, Eva Onaindia, David E. Smith, Siddharth Srivastava
PublisherAAAI press
Pages428-436
Number of pages9
ISBN (Electronic)9781577358077
StatePublished - 2019
Externally publishedYes
Event29th International Conference on Automated Planning and Scheduling, ICAPS 2019 - Berkeley, United States
Duration: 11 Jul 201915 Jul 2019

Publication series

NameProceedings International Conference on Automated Planning and Scheduling, ICAPS
ISSN (Print)2334-0835
ISSN (Electronic)2334-0843

Conference

Conference29th International Conference on Automated Planning and Scheduling, ICAPS 2019
Country/TerritoryUnited States
CityBerkeley
Period11/07/1915/07/19

Bibliographical note

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

Fingerprint

Dive into the research topics of 'On computational complexity of automorphism groups in classical planning'. Together they form a unique fingerprint.

Cite this