Sciweavers

10 search results - page 1 / 2
» Decomposition and Causality in Partial-order Planning
Sort
View
AIPS
1994
14 years 9 days ago
Decomposition and Causality in Partial-order Planning
We describe DPOCL, a partial-order causal linkplanner thatincludes actiondecomposition. DPOCL builds directly on the SNLP algorithm 10 , and hence is clear and simple, and can rea...
R. Michael Young, Martha E. Pollack, Johanna D. Mo...
AIPS
2009
14 years 2 days ago
Inference and Decomposition in Planning Using Causal Consistent Chains
Current state-of-the-art planners solve problems, easy and hard alike, by search, expanding hundreds or thousands of nodes. Yet, given the ability of people to solve easy problems...
Nir Lipovetzky, Hector Geffner
AAAI
2004
14 years 11 days ago
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) planne...
Vincent Vidal, Hector Geffner
AAAI
1996
14 years 9 days ago
Is "Early Commitment" in Plan Generation Ever a Good Idea?
Partial-Order Causal Link planners typically take a "least-commitment" approach to some decisions (notably, step ordering), postponing those decisions until constraints ...
David Joslin, Martha E. Pollack
JAIR
2010
131views more  JAIR 2010»
13 years 9 months ago
Narrative Planning: Balancing Plot and Character
Narrative, and in particular storytelling, is an important part of the human experience. Consequently, computational systems that can reason about narrative can be more effective...
Mark O. Riedl, R. Michael Young