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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Artificial intelligence Ročník 170; číslo 3; s. 298 - 335
Hlavní autoři:	Vidal, Vincent, Geffner, Héctor
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 01.03.2006 Elsevier
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!