Optimal control as a graphical model inference problem

From MaRDI portal
Publication:420939

DOI10.1007/S10994-012-5278-7zbMATH Open1243.93133arXiv0901.0633OpenAlexW2107662876MaRDI QIDQ420939FDOQ420939


Authors: Hilbert J. Kappen, Vicenç Gómez, Manfred Opper Edit this on Wikidata


Publication date: 23 May 2012

Published in: Machine Learning (Search for Journal in Brave)

Abstract: We reformulate a class of non-linear stochastic optimal control problems introduced by Todorov (2007) as a Kullback-Leibler (KL) minimization problem. As a result, the optimal control computation reduces to an inference computation and approximate inference methods can be applied to efficiently compute approximate optimal controls. We show how this KL control theory contains the path integral control method as a special case. We provide an example of a block stacking task and a multi-agent cooperative game where we demonstrate how approximate inference can be successfully applied to instances that are too complex for exact computation. We discuss the relation of the KL control approach to other inference approaches to control.


Full work available at URL: https://arxiv.org/abs/0901.0633




Recommendations




Cites Work


Cited In (38)

Uses Software





This page was built for publication: Optimal control as a graphical model inference problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q420939)