Robot trajectory optimization using approximate inference

Authors:
Marc Toussaint
Affiliations:
TU Berlin, Berlin, Germany
Venue:
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Year:
2009

Citing 6
Cited 9

Probabilistic inference and influence diagrams

Operations Research
Decision making using probabilistic inference methods

UAI '92 Proceedings of the eighth conference on Uncertainty in Artificial Intelligence
Using expectation-maximization for reinforcement learning

Neural Computation
Expectation Propagation for approximate Bayesian inference

UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
A family of algorithms for approximate bayesian inference

A family of algorithms for approximate bayesian inference
Dynamic bayesian networks: representation, inference and learning

Dynamic bayesian networks: representation, inference and learning

EP for Efficient Stochastic Control with Obstacles

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
A dynamical system approach to realtime obstacle avoidance

Autonomous Robots
Stochastic optimal control methods for investigating the power of morphological computation

Artificial Life
Fast motion planning from experience: trajectory prediction for speeding up movement generation

Autonomous Robots
A policy-blending formalism for shared control

International Journal of Robotics Research
CHOMP: Covariant Hamiltonian optimization for motion planning

International Journal of Robotics Research
Topology-based representations for motion planning and generalization in dynamic environments with interactions

International Journal of Robotics Research
Path integral control by reproducing kernel Hilbert space embedding

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
On stochastic optimal control and reinforcement learning by approximate inference (extended abstract)

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to first compute an optimal (deterministic) trajectory and then solve a local linear-quadratic-gaussian (LQG) perturbation model to handle the system stochasticity. We present a new algorithm for this approach which improves upon previous algorithms like iLQG. We consider a probabilistic model for which the maximum likelihood (ML) trajectory coincides with the optimal trajectory and which, in the LQG case, reproduces the classical SOC solution. The algorithm then utilizes approximate inference methods (similar to expectation propagation) that efficiently generalize to non-LQG systems. We demonstrate the algorithm on a simulated 39-DoF humanoid robot.