POMDP Planning for Robust Robot Control

POMDPs provide a rich framework for planning and control in partially observable domains. Recent new algorithms have greatly improved the scalability of POMDPs, to the point where they can be used in robot applications. In this paper, we describe how approximate POMDP solving can be further improved by the use of a new theoretically-motivated algorithm for selecting salient information states. We present the algorithm, called PEMA, demonstrate competitive performance on a range of navigation tasks, and show how this approach is robust to mismatches between the robot’s physical environment and the model used for planning.

• Type: Conference
• Year: 2005
• Where: ISRR
• Authors: Joelle Pineau, Geoffrey J. Gordon
• Keywords: Demonstrate Competitive Performance, ISRR 2005, Observable Domains, Robotics, Robot’s Physical Environment