Branching and pruning: An optimal temporal POCL planner based on constraint programming

A key feature of modern optimal planners such as graphplan and blackbox is their ability to prune large parts of the search space. Previous Partial Order Causal Link (POCL) planners provide an alternative branching scheme but lacking comparable pruning mechanisms do not perform as well. In this pape...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Artificial intelligence Jg. 170; H. 3; S. 298 - 335
Hauptverfasser:	Vidal, Vincent, Geffner, Héctor
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 01.03.2006 Elsevier
Schlagworte:	Applied sciences Artificial Intelligence Computer Science Computer science; control theory; systems Constraint programming Exact sciences and technology Learning and adaptive systems Planning Temporal reasoning Temporal reasoning Constraint programming Planning Branching Partial ordering Constraint satisfaction Duration Causality Artificial intelligence Temporal constraint Temporal logic Constrained optimization
ISSN:	0004-3702, 1872-7921
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!