Belief space planning assuming maximum likelihood observations 论文

2010引用 308
Reinforcement Learning in RoboticsGame Theory and ApplicationsAdaptive Dynamic Programming Control

详细信息

发表日期
2010-06-27
发表年份
2010

关键词

Reinforcement Learning in RoboticsGame Theory and ApplicationsAdaptive Dynamic Programming Control

摘要

We cast the partially observable control problem as a fully observable underactuated stochastic control problem in belief space and apply standard planning and control techniques. One of the difficulties of belief space planning is modeling the stochastic dynamics resulting from unknown future observations. The core of our proposal is to define deterministic beliefsystem dynamics based on an assumption that the maximum likelihood observation (calculated just prior to the observation) is always obtained. The stochastic effects of future observations are modeled as Gaussian noise. Given this model of the dynamics, two planning and control methods are applied. In the first, linear quadratic regulation (LQR) is applied to generate policies in the belief space. This approach is shown to be optimal for linear-Gaussian systems. In the second, a planner is used to find locally optimal plans in the belief space. We propose a replanning approach that is shown to converge to the belief space goal in a finite number of replanning steps. These approaches are characterized in the context of a simple nonlinear manipulation problem where a planar robot simultaneously locates and grasps an object.