Branching and pruning: An optimal temporal POCL planner based on constraint programming
- 31 March 2006
- journal article
- Published by Elsevier BV in Artificial Intelligence
- Vol. 170 (3), 298-335
- https://doi.org/10.1016/j.artint.2005.08.004
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new resultsArtificial Intelligence, 2003
- Planning as heuristic searchArtificial Intelligence, 2001
- The OPL Optimization Programming LanguageJournal of the Operational Research Society, 2000
- Bridging the gap between planning and schedulingThe Knowledge Engineering Review, 2000
- Arc Consistency on n-ary Monotonic and Linear ConstraintsLecture Notes in Computer Science, 2000
- Extending planning graphs to an ADL subsetLecture Notes in Computer Science, 1997
- Planning as refinement search: a unified framework for evaluating design tradeoffs in partial-order planningArtificial Intelligence, 1995
- Constraint satisfaction using constraint logic programmingArtificial Intelligence, 1992
- Temporal constraint networksArtificial Intelligence, 1991
- An Algorithm for Solving the Job-Shop ProblemManagement Science, 1989