Kullback-Leibler control for discrete-time nonlinear systems on continuous spaces
Not on the map. Why?
Abstract (arXiv)
Kullback-Leibler (KL) control enables efficient numerical methods for nonlinear optimal control problems. The crucial assumption of KL control is the full controllability of the transition distribution. However, this assumption is often violated when the dynamics evolves in a continuous space. Consequently, applying KL control to problems with continuous spaces requires some approximation, which leads to the lost of the optimality. To avoid such approximation, in this paper, we reformulate the KL control problem for continuous spaces so that it does not require unrealistic assumptions. The key difference between the original and reformulated KL control is that the former measures the control effort by KL divergence between controlled and uncontrolled transition distributions while the latter replaces the uncontrolled transition by a noise-driven transition. We show that the reformulated KL control admits efficient numerical algorithms like the original one without unreasonable assumptions. Specifically, the associated value function can be computed by using a Monte Carlo method based on its path integral representation.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 4 of its 25 references that are in the map. First posted on arXiv 24 Mar 2022.
Builds on
4 of 25 references.
References · 4
- 2018A Tour of Reinforcement Learning: The View from Continuous Controlcited by 151
- 2019Deep Learning Theory Review: An Optimal Control and Dynamical Systems Perspectivecited by 27
- 2016Noise Response Data Reveal Novel Controllability Gramian for Nonlinear Network Dynamicscited by 2
- 2021Sparse optimal stochastic controlcited by 2
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 2; 2025: 2; 2026: 1.
6 papers.
- 2025Expected Free Energy-based Planning as Variational Inferencecited by 10
- 2022Maximum entropy optimal density control of discrete-time linear systems and Schr"odinger bridgescited by 6
- 2024Blending Data-Driven Priors in Dynamic Gamescited by 6
- 2025A Message Passing Realization of Expected Free Energy Minimizationcited by 5
- 2024Risk-sensitive control as inference with R'enyi divergencecited by 3
- 2026Expected Free Energy-based Planning as Variational Inferencecited by 0
- 2026Expected Free Energy-based Planning as Variational Inference9 Jun 2026
- 2025A Message Passing Realization of Expected Free Energy Minimization4 Aug 2025
- 2025Expected Free Energy-based Planning as Variational Inference21 Apr 2025
- 2024Risk-sensitive control as inference with R'enyi divergence4 Nov 2024
- 2024Blending Data-Driven Priors in Dynamic Games21 Feb 2024
- 2022Maximum entropy optimal density control of discrete-time linear systems and Schr"odinger bridges11 Apr 2022