Symmetry-based Task Reduction for Relaxed Reachability Analysis

Röger, Gabriele and Sievers, Silvan and Katz, Michael. (2018) Symmetry-based Task Reduction for Relaxed Reachability Analysis. In: Proceedings of the 28th International Conference on Automated Planning and Scheduling (ICAPS 2018). pp. 208-217.

[img] PDF - Published Version

Official URL: https://edoc.unibas.ch/65621/

Downloads: Statistics Overview


Relaxed reachability analysis is relevant to efficient grounding, invariant synthesis as well as the computation of relaxation-based heuristics. Planning domains are typically specified in a lifted representation, where the size of the tasks grows exponentially with the number of objects in the world. This growth also affects the analysis of relaxed reachability. We present a task reduction based on symmetries of the lifted representation that allows to perform the same analysis on smaller tasks.
Faculties and Departments:05 Faculty of Science > Departement Mathematik und Informatik > Informatik > Artificial Intelligence (Helmert)
UniBasel Contributors:Röger, Gabriele and Sievers, Silvan
Item Type:Conference or Workshop Item, refereed
Conference or workshop item Subtype:Conference Paper
Publisher:AAAI Press
Note:Publication type according to Uni Basel Research Database: Conference paper
Related URLs:
edoc DOI:
Last Modified:12 Oct 2018 13:11
Deposited On:12 Oct 2018 13:10

Repository Staff Only: item control page