Sciweavers

914 search results - page 54 / 183
» The Computational Complexity of Probabilistic Planning
Sort
View
JAIR
2008
130views more  JAIR 2008»
13 years 10 months ago
Online Planning Algorithms for POMDPs
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
Stéphane Ross, Joelle Pineau, Sébast...
CMSB
2010
Springer
13 years 5 months ago
Stochasticity in reactions: a probabilistic Boolean modeling approach
Boolean modeling frameworks have long since proved their worth for capturing and analyzing essential characteristics of complex systems. Hybrid approaches aim at exploiting the ad...
Sven Twardziok, Heike Siebert, Alexander Heyl
ATAL
2009
Springer
14 years 5 months ago
Decommitting in multi-agent execution in non-deterministic environment: experimental approach
The process of planning in complex, multi-actor environment depends strongly on the ability of the individual actors to perform intelligent decommitment upon specific changes in ...
Jirí Vokrínek, Antonín Komend...
ICRA
2003
IEEE
119views Robotics» more  ICRA 2003»
14 years 4 months ago
HPRM: a hierarchical PRM
— We introduce a hierarchical variant of the probabilistic roadmap method for motion planning. By recursively refining an initially sparse sampling in neighborhoods of the C-obs...
Anne D. Collins, Pankaj K. Agarwal, John Harer
WSC
2008
14 years 29 days ago
A multi threaded and resolution approach to simulated futures evaluation
As part of the DARPA Deep Green efforts, SAIC developed a multi-threaded and resolution approach to constructing and evaluating simulated futures to address the SimPath component....
David R. Pratt, Robert W. Franceschini, Robert B. ...