Relaxed Decision Diagrams for Delete-Free Planning

Corrêa, Augusto B. and Pommerening, Florian and Francès, Guillem. (2018) Relaxed Decision Diagrams for Delete-Free Planning. Proceedings of the CP 2018 Workshop on Constraints and AI Planning (ConsAIPlan 2018).

[img] PDF - Published Version

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

Downloads: Statistics Overview


In this work, we investigate the computation of optimal plans for delete-free tasks using relaxed decision diagrams. We introduce a new method to compute approximations of h+ in polynomial time on the width of the RDD and show that this approximation is a lower bound for the optimal solution. We analyze different strategies to construct decision diagrams and compare these approximations to h+.
Faculties and Departments:05 Faculty of Science > Departement Mathematik und Informatik > Informatik > Artificial Intelligence (Helmert)
UniBasel Contributors:Pommerening, Florian and Francès Medina, Guillem and Blaas Corrêa, Augusto
Item Type:Other
Note:Publication type according to Uni Basel Research Database: Other publications
edoc DOI:
Last Modified:20 Jan 2020 12:49
Deposited On:19 Feb 2019 09:58

Repository Staff Only: item control page