Separable Dynamic Programming and Approximate Decomposition Methods

DOI10.1109/TAC.2007.895901MaRDI QIDQ5282123zbMATH OpenFDO

Authors Dimitri P. Bertsekas

Publication date 27 July 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TAC.2007.895901

Mathematics Subject Classification ID

Dynamic programming (90C39) Controllability (93B05)

Cited in

(8)

• Model-free control of Lorenz chaos using an approximate optimal control strategy
• A simple but powerful simulated certainty equivalent approximation method for dynamic stochastic problems
• Approximate model predictive control laws for constrained nonlinear discrete-time systems: analysis and offline design
• Algebraic decompositions of DP problems with linear dynamics
• Equilibria of dynamic games with many players: existence, approximation, and market structure
• A parallel distributed supervision strategy for multi-agent networked systems
• A Dynamic Programming Solution to Bounded Dejittering Problems
• Approximate model predictive control laws for constrained nonlinear discrete-time systems: analysis and offline design

This page was built for publication: Separable Dynamic Programming and Approximate Decomposition Methods

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