A survey of point-based POMDP solvers

G Shani, J Pineau, R Kaplow - Autonomous Agents and Multi-Agent …, 2013 - Springer
The past decade has seen a significant breakthrough in research on solving partially
observable Markov decision processes (POMDPs). Where past solvers could not scale …

SARSOP: Efficient point-based POMDP planning by approximating optimally reachable belief spaces

H Kurniawati, D Hsu, WS Lee - 2009 - direct.mit.edu
Motion planning in uncertain and dynamic environments is an essential capability for
autonomous robots. Partially observable Markov decision processes (POMDPs) provide a …

Partially observable Markov decision processes

MTJ Spaan - Reinforcement learning: State-of-the-art, 2012 - Springer
For reinforcement learning in environments in which an agent has access to a reliable state
signal, methods based on the Markov decision process (MDP) have had many successes. In …

Approximate information state for approximate planning and reinforcement learning in partially observed systems

J Subramanian, A Sinha, R Seraj, A Mahajan - Journal of Machine …, 2022 - jmlr.org
We propose a theoretical framework for approximate planning and learning in partially
observed systems. Our framework is based on the fundamental notion of information state …

Motion planning under uncertainty for robotic tasks with long time horizons

H Kurniawati, Y Du, D Hsu… - The International Journal …, 2011 - journals.sagepub.com
Motion planning with imperfect state information is a crucial capability for autonomous robots
to operate reliably in uncertain and dynamic environments. Partially observable Markov …

POMDPs for robotic tasks with mixed observability

SCW Ong, SW Png, D Hsu, WS Lee - 2010 - direct.mit.edu
(POMDPs) provide a principled mathematical framework for motion planning of autonomous
robots in uncertain and dynamic environments. They have been successfully applied to …

[PDF][PDF] Solving POMDPs: RTDP-Bel vs. Point-based Algorithms.

B Bonet, H Geffner - IJCAI, 2009 - www-i6.informatik.rwth-aachen.de
Point-based algorithms and RTDP-Bel are approximate methods for solving POMDPs that
replace the full updates of parallel value iteration by faster and more effective updates at …

Monte Carlo value iteration for continuous-state POMDPs

H Bai, D Hsu, WS Lee, VA Ngo - … of Robotics IX: Selected Contributions of …, 2011 - Springer
Partially observable Markov decision processes (POMDPs) have been successfully applied
to various robot motion planning tasks under uncertainty. However, most existing POMDP …

Towards autonomous navigation of unsignalized intersections under uncertainty of human driver intent

V Sezer, T Bandyopadhyay, D Rus… - 2015 IEEE/RSJ …, 2015 - ieeexplore.ieee.org
In a mixed environment of autonomous driverless vehicles and human driven vehicles
operating on the same road, identifying intentions of human drivers and interacting with …

[图书][B] Probabilistic planning for robotic exploration

T Smith - 2007 - search.proquest.com
Robotic exploration tasks involve inherent uncertainty. They typically include navigating
through unknown terrain, searching for features that may or may not be present, and …