An Approximate Inference Approach to Temporal Optimization for Robotics

2Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Algorithms based on iterative local approximations present a practical approach to optimal control in robotic systems. However, they generally require the temporal parameters (for e.g. the movement duration or the time point of reaching an intermediate goal) to be specified a priori. Here, we present a methodology that is capable of jointly optimizing the temporal parameters in addition to the control command profiles. The presented approach is based on a Bayesian formulation of the optimal control problem, which includes the time course of the movement as a random variable. An approximate EM algorithm is derived that efficiently optimizes both the time course of the movement and the control commands offering, for the first time, a practical approach to tackling generic via point problems in a systematic way under the optimal control framework. The proposed approach, which is applicable to plants with non-linear dynamics as well as arbitrary state dependent and quadratic control costs, is evaluated on realistic simulations of a redundant robotic plant and on a simulated KUKA robotic arm.

Cite

CITATION STYLE

APA

Rawlik, K., Zarubin, D., Toussaint, M., & Vijayakumar, S. (2018). An Approximate Inference Approach to Temporal Optimization for Robotics. In Springer Proceedings in Advanced Robotics (Vol. 3, pp. 145–162). Springer Science and Business Media B.V. https://doi.org/10.1007/978-3-319-60916-4_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free