Sciweavers

8 search results - page 1 / 2
» Engineering a Conformant Probabilistic Planner
Sort
View
JAIR
2006
71views more  JAIR 2006»
15 years 2 months ago
Engineering a Conformant Probabilistic Planner
We present a partial-order, conformant, probabilistic planner, Probapop which competed in the blind track of the Probabilistic Planning Competition in IPC-4. We explain how we ada...
Nilufer Onder, G. C. Whelan, Li Li
AIPS
2006
15 years 3 months ago
Combining Knowledge Compilation and Search for Conformant Probabilistic Planning
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
Jinbo Huang
AIPS
2006
15 years 3 months ago
Sequential Monte Carlo in Probabilistic Planning Reachability Heuristics
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
Daniel Bryce, Subbarao Kambhampati, David E. Smith
AI
2008
Springer
15 years 2 months ago
Sequential Monte Carlo in reachability heuristics for probabilistic planning
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
Daniel Bryce, Subbarao Kambhampati, David E. Smith
CAEPIA
2005
Springer
15 years 7 months ago
Mapping Conformant Planning into SAT Through Compilation and Projection
Conformant planning is a variation of classical AI planning where the initial state is partially known and actions can have nondeterministic effects. While a classical plan must a...
Héctor Palacios, Hector Geffner