On computational complexity of automorphism groups in classical planning

Alexander Shleyfman

doi:10.1609/icaps.v29i1.3507

On computational complexity of automorphism groups in classical planning

Alexander Shleyfman

Technion-Israel Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Proceedings of the 29th International Conference on Automated Planning and Scheduling, ICAPS 2019
Editors	J. Benton, Nir Lipovetzky, Eva Onaindia, David E. Smith, Siddharth Srivastava
Publisher	Association for the Advancement of Artificial Intelligence
Pages	428-436
Number of pages	9
ISBN (Electronic)	9781577358077
DOIs	https://doi.org/10.1609/icaps.v29i1.3507
State	Published - 2019
Externally published	Yes
Event	29th International Conference on Automated Planning and Scheduling, ICAPS 2019 - Berkeley, United States Duration: 11 Jul 2019 → 15 Jul 2019

Publication series

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

Conference

Conference	29th International Conference on Automated Planning and Scheduling, ICAPS 2019
Country/Territory	United States
City	Berkeley
Period	11/07/19 → 15/07/19

Bibliographical note

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

Funding

The work was supported by the Adams Fellowship Program of the Israel Academy of Sciences and Humanities. The author would like to thank Carmel Domshlak, Ilya Shitov, and the anonymous reviewers for their helpful and constructive comments that greatly contributed to the improvement of the final version of the paper.

Funders	Funder number
Israel Academy of Sciences and Humanities

Access to Document

10.1609/icaps.v29i1.3507

Cite this

Shleyfman, A. (2019). On computational complexity of automorphism groups in classical planning. In J. Benton, N. Lipovetzky, E. Onaindia, D. E. Smith, & S. Srivastava (Eds.), Proceedings of the 29th International Conference on Automated Planning and Scheduling, ICAPS 2019 (pp. 428-436). (Proceedings International Conference on Automated Planning and Scheduling, ICAPS). Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/icaps.v29i1.3507

Shleyfman, Alexander. / On computational complexity of automorphism groups in classical planning. Proceedings of the 29th International Conference on Automated Planning and Scheduling, ICAPS 2019. editor / J. Benton ; Nir Lipovetzky ; Eva Onaindia ; David E. Smith ; Siddharth Srivastava. Association for the Advancement of Artificial Intelligence, 2019. pp. 428-436 (Proceedings International Conference on Automated Planning and Scheduling, ICAPS).

@inproceedings{b81d05cb28a94a09bb280169dd9d9135,

title = "On computational complexity of automorphism groups in classical planning",

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.",

author = "Alexander Shleyfman",

note = "Publisher Copyright: {\textcopyright} 2019, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 29th International Conference on Automated Planning and Scheduling, ICAPS 2019 ; Conference date: 11-07-2019 Through 15-07-2019",

year = "2019",

doi = "10.1609/icaps.v29i1.3507",

language = "אנגלית",

series = "Proceedings International Conference on Automated Planning and Scheduling, ICAPS",

publisher = "Association for the Advancement of Artificial Intelligence",

pages = "428--436",

editor = "J. Benton and Nir Lipovetzky and Eva Onaindia and Smith, {David E.} and Siddharth Srivastava",

booktitle = "Proceedings of the 29th International Conference on Automated Planning and Scheduling, ICAPS 2019",

}

Shleyfman, A 2019, On computational complexity of automorphism groups in classical planning. in J Benton, N Lipovetzky, E Onaindia, DE Smith & S Srivastava (eds), Proceedings of the 29th International Conference on Automated Planning and Scheduling, ICAPS 2019. Proceedings International Conference on Automated Planning and Scheduling, ICAPS, Association for the Advancement of Artificial Intelligence, pp. 428-436, 29th International Conference on Automated Planning and Scheduling, ICAPS 2019, Berkeley, United States, 11/07/19. https://doi.org/10.1609/icaps.v29i1.3507

On computational complexity of automorphism groups in classical planning. / Shleyfman, Alexander.
Proceedings of the 29th International Conference on Automated Planning and Scheduling, ICAPS 2019. ed. / J. Benton; Nir Lipovetzky; Eva Onaindia; David E. Smith; Siddharth Srivastava. Association for the Advancement of Artificial Intelligence, 2019. p. 428-436 (Proceedings International Conference on Automated Planning and Scheduling, ICAPS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On computational complexity of automorphism groups in classical planning

AU - Shleyfman, Alexander

PY - 2019

Y1 - 2019

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85085594614&partnerID=8YFLogxK

U2 - 10.1609/icaps.v29i1.3507

DO - 10.1609/icaps.v29i1.3507

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85085594614

T3 - Proceedings International Conference on Automated Planning and Scheduling, ICAPS

SP - 428

EP - 436

BT - Proceedings of the 29th International Conference on Automated Planning and Scheduling, ICAPS 2019

A2 - Benton, J.

A2 - Lipovetzky, Nir

A2 - Onaindia, Eva

A2 - Smith, David E.

A2 - Srivastava, Siddharth

PB - Association for the Advancement of Artificial Intelligence

T2 - 29th International Conference on Automated Planning and Scheduling, ICAPS 2019

Y2 - 11 July 2019 through 15 July 2019

ER -

Shleyfman A. On computational complexity of automorphism groups in classical planning. In Benton J, Lipovetzky N, Onaindia E, Smith DE, Srivastava S, editors, Proceedings of the 29th International Conference on Automated Planning and Scheduling, ICAPS 2019. Association for the Advancement of Artificial Intelligence. 2019. p. 428-436. (Proceedings International Conference on Automated Planning and Scheduling, ICAPS). doi: 10.1609/icaps.v29i1.3507

On computational complexity of automorphism groups in classical planning

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this