Solving Delete Free Planning with Relaxed Decision Diagram Based Heuristics

We investigate the use of relaxed decision diagrams (DDs) for computing admissible heuristics for the cost-optimal delete-free planning (DFP) problem. Our main contributions are the introduction of two novel DD encodings for a DFP task: a multivalued decision diagram that includes the sequencing asp...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	The Journal of artificial intelligence research 2020-03, Vol.67, p.607-651
Hauptverfasser:	Castro, Margarita Paz, Piacentini, Chiara, Cire, Andre Augusto, Beck, J. Christopher
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Artificial intelligence Empirical analysis Heuristic Linear programming
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!