Schematic Invariants by Reduction to Ground Invariants
Loading...
Access rights
openAccess
acceptedVersion
URL
Journal Title
Journal ISSN
Volume Title
A4 Artikkeli konferenssijulkaisussa
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
Authors
Date
Department
Major/Subject
Mcode
Degree programme
Language
en
Pages
7
Series
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17), pp. 3644-3650, Proceedings of the AAAI Conference on Artificial Intelligence
Abstract
Computation of invariants, which are approximate reachability information for state-space search problems such as AI planning, has been considered to be more scalable when using a schematic representation of actions/events rather than an instantiated/ground representation. A disadvantage of schematic algorithms, however, is their complexity, which also leads to high runtimes when the number of schematic events/actions is high. We propose algorithms that reduce the problem of finding schematic invariants to solving a smaller ground problem.Description
Keywords
Other note
Citation
Rintanen, J 2017, Schematic Invariants by Reduction to Ground Invariants. in Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17). Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, pp. 3644-3650, AAAI Conference on Artificial Intelligence, San Francisco, California, United States, 04/02/2017. < https://aaai.org/ocs/index.php/AAAI/AAAI17/paper/view/14955 >