Sciweavers

169 search results - page 8 / 34
» Tractability of Planning with Loops
Sort
View
ICCBR
1997
Springer
13 years 11 months ago
Supporting Combined Human and Machine Planning: An Interface for Planning by Analogical Reasoning
Realistic and complex planning situations require a mixed-initiative planning framework in which human and automated planners interact to mutually construct a desired plan. Ideally...
Michael T. Cox, Manuela M. Veloso
ATAL
2010
Springer
13 years 8 months ago
Merging example plans into generalized plans for non-deterministic environments
We present a new approach for finding generalized contingent plans with loops and branches in situations where there is uncertainty in state properties and object quantities, but ...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...
UAI
2000
13 years 8 months ago
Approximately Optimal Monitoring of Plan Preconditions
Monitoring plan preconditions can allow for replanning when a precondition fails, generally far in advance of the point in the plan where the precondition is relevant. However, mo...
Craig Boutilier
ICTAI
2008
IEEE
14 years 1 months ago
FIP: A Fast Planning-Graph-Based Iterative Planner
We present a fast iterative planner (FIP) that aims to handle planning problems involving nondeterministic actions. In contrast to existing iterative planners, FIP is built upon G...
Jicheng Fu, Farokh B. Bastani, Vincent Ng, I-Ling ...
CORR
1998
Springer
135views Education» more  CORR 1998»
13 years 7 months ago
The Computational Complexity of Probabilistic Planning
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
Michael L. Littman, Judy Goldsmith, Martin Mundhen...