Welcome to the UPF Digital Repository

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

Show simple item record

dc.contributor.author Vidal, Vincent
dc.contributor.author Geffner, Héctor
dc.date.accessioned 2019-02-06T08:54:49Z
dc.date.available 2019-02-06T08:54:49Z
dc.date.issued 2006
dc.identifier.citation Vidal V, Geffner H. Branching and pruning: an optimal temporal POCL planner based on constraint programming. Artif Intell. 2006 Mar;170(3):298-335. DOI: 10.1016/j.artint.2005.08.004
dc.identifier.issn 0004-3702
dc.identifier.uri http://hdl.handle.net/10230/36508
dc.description.abstract 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 paper, a domain-independent formulation of temporal planning based on Constraint Programming is introduced that successfully combines a POCL branching scheme with powerful and sound pruning rules. The key novelty in the formulation is the ability to reason about supports, precedences, and causal links involving actions that are not in the plan. Experiments over a wide range of benchmarks show that the resulting optimal temporal planner is much faster than current ones and is competitive with the best parallel planners in the special case in which actions have all the same duration.1
dc.description.sponsorship H. Geffner is partially supported by Grant TIC2002-04470-C03-02, MCyT, Spain.
dc.format.mimetype application/pdf
dc.language.iso eng
dc.publisher Elsevier
dc.relation.ispartof Artificial Intelligence. 2006 Mar;170(3):298-335.
dc.rights © Elsevier http://dx.doi.org/10.1016/j.artint.2005.08.004
dc.title Branching and pruning: an optimal temporal POCL planner based on constraint programming
dc.type info:eu-repo/semantics/article
dc.identifier.doi http://dx.doi.org/10.1016/j.artint.2005.08.004
dc.subject.keyword Planning
dc.subject.keyword Constraint programming
dc.subject.keyword Temporal reasoning
dc.relation.projectID info:eu-repo/grantAgreement/ES/1PN/TIC2002-04470-C03-02
dc.rights.accessRights info:eu-repo/semantics/openAccess
dc.type.version info:eu-repo/semantics/acceptedVersion


This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account

Statistics

Compliant to Partaking