181 search results - page 15 / 37 » Online Planning Algorithms for POMDPs |
114
click to vote
IJCGA
2010
14 years 10 months ago
2010
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
96
Voted
NMR
2004
Springer
15 years 5 months ago
2004
Springer
In this paper, we introduce a new method to recover from discrepancies in a general monitoring framework where the agent finds some explanations (points of failure) for discrepan...
103
click to vote
AIPS
2009
15 years 26 days ago
2009
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 ...
AAAI
2006
15 years 1 months ago
2006
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
AIPS
2009
15 years 26 days ago
2009
We propose an online algorithm for planning under uncertainty in multi-agent settings modeled as DEC-POMDPs. The algorithm helps overcome the high computational complexity of solv...