Sciweavers

7 search results - page 2 / 2
» Anytime Point-Based Approximations for Large POMDPs
Sort
View
AIPS
2009
13 years 6 months ago
Navigation Planning in Probabilistic Roadmaps with Uncertainty
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks where obstacles are present in the environment. We examine the situation where the ...
Michael Kneebone, Richard Dearden
ATAL
2009
Springer
13 years 11 months ago
Point-based incremental pruning heuristic for solving finite-horizon DEC-POMDPs
Recent scaling up of decentralized partially observable Markov decision process (DEC-POMDP) solvers towards realistic applications is mainly due to approximate methods. Of this fa...
Jilles Steeve Dibangoye, Abdel-Illah Mouaddib, Bra...