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...

Full description

Saved in:

Bibliographic Details
Published in:	Artificial intelligence Vol. 170; no. 3; pp. 298 - 335
Main Authors:	Vidal, Vincent, Geffner, Héctor
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.03.2006 Elsevier
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!