pith. sign in

arxiv: 1705.09415 · v2 · pith:GGL3YVZ3new · submitted 2017-05-26 · 💻 cs.RO · cs.SY

Near-Optimal Belief Space Planning via T-LQG

classification 💻 cs.RO cs.SY
keywords near-optimaloptimalplanningproblembeliefcontrolfeedbackorder
0
0 comments X
read the original abstract

We consider the problem of planning under observation and motion uncertainty for nonlinear robotics systems. Determining the optimal solution to this problem, generally formulated as a Partially Observed Markov Decision Process (POMDP), is computationally intractable. We propose a Trajectory-optimized Linear Quadratic Gaussian (T-LQG) approach that leads to quantifiably near-optimal solutions for the POMDP problem. We provide a novel "separation principle" for the design of an optimal nominal open-loop trajectory followed by an optimal feedback control law, which provides a near-optimal feedback control policy for belief space planning problems involving a polynomial order of calculations of minimum order.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.