Quadratic approximate dynamic programming for input‐affine systems
- 23 August 2012
- journal article
- research article
- Published by Wiley in International Journal of Robust and Nonlinear Control
- Vol. 24 (3) , 432-449
Abstract
SUMMARY: We consider the use of quadratic approximate value functions for stochastic control problems with input‐affine dynamics and convex stage cost and constraints. Evaluating the approximate dynamic programming policy in such cases requires the solution of an explicit convex optimization problem, such as a quadratic program, which can be carried out efficiently. We describe a simple and general method for approximate value iteration that also relies on our ability to solve convex optimization problems, in this case, typically a semidefinite program. Although we have no theoretical guarantee on the performance attained using our method, we observe that very good performance can be obtained in practice.Copyright © 2012 John Wiley & Sons, Ltd.Keywords
This publication has 25 references indexed in Scilit:
- Autonomous Helicopter Aerobatics through Apprenticeship LearningThe International Journal of Robotics Research, 2010
- Performance bounds for linear stochastic controlSystems & Control Letters, 2009
- Estimating Dynamic Models of Imperfect CompetitionEconometrica, 2007
- Performance Bounds in $L_p$‐norm for Approximate Value IterationSIAM Journal on Control and Optimization, 2007
- Learning a decision maker's utility function from (possibly) inconsistent behaviorArtificial Intelligence, 2004
- The explicit linear quadratic regulator for constrained systemsAutomatica, 2002
- 10.1162/jmlr.2003.4.6.1107Applied Physics Letters, 2000
- An analysis of temporal-difference learning with function approximationIEEE Transactions on Automatic Control, 1997
- Semidefinite ProgrammingSIAM Review, 1996
- Q-learningMachine Learning, 1992