Quadratic approximate dynamic programming for input‐affine systems

DOI10.1002/rnc.2894zbMath1285.93103OpenAlexW2146157243MaRDI QIDQ5409145

Arezou Keshavarz, Stephen P. Boyd

Publication date: 14 April 2014

Published in: International Journal of Robust and Nonlinear Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rnc.2894

zbMATH Keywords

convex optimizationstochastic controlapproximate dynamic programming

Mathematics Subject Classification ID

Related Items (2)

Decentralized optimization over tree graphs ⋮ On quadratic approximations for Hamilton-Jacobi-Bellman equations

Uses Software

• CVX
• CVXGEN
• fast_mpc

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• CVXGEN: a code generator for embedded convex optimization
• Learning a decision maker's utility function from (possibly) inconsistent behavior
• Performance bounds for linear stochastic control
• Stochastic optimal control. The discrete time case
• Rollout algorithms for stochastic scheduling problems
• \({\mathcal Q}\)-learning
• The Linear Programming Approach to Approximate Dynamic Programming
• Linear Matrix Inequalities in System and Control Theory
• An analysis of temporal-difference learning with function approximation
• Approximate Dynamic Programming via a Smoothed Linear Program
• 10.1162/1532443041827907
• Semidefinite Programming
• Approximate dynamic programming via iterated Bellman inequalities
• Approximate Dynamic Programming
• Neuro-Dynamic Programming: An Overview and Recent Results
• Estimating Dynamic Models of Imperfect Competition
• Performance Bounds in $L_p$‐norm for Approximate Value Iteration
• The explicit linear quadratic regulator for constrained systems

This page was built for publication: Quadratic approximate dynamic programming for input‐affine systems