Relaxing Dynamic Programming
Authors:
- A. RantzerARA. Rantzer
Top Cited Papers
- 1 August 2006
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 51 (8) , 1249-1260
Abstract
The idea of dynamic programming is general and very simple, but the "curse of dimensionality" is often prohibitive and restricts the fields of application. This paper introduces a method to reduce the complexity by relaxing the demand for optimality. The distance from optimality is kept within prespecified bounds and the size of the bounds determines the computational complexity. Several computational examples are considered. The first is optimal switching between linear systems, with application to design of a dc/dc voltage converter. The second is optimal control of a linear system with piecewise linear cost with application to stock order control. Finally, the method is applied to a partially observable Markov decision problem (POMDP)Keywords
This publication has 10 references indexed in Scilit:
- Relaxed dynamic programming in switching systemsIEE Proceedings - Control Theory and Applications, 2006
- Geometric Algorithm for Multiparametric Linear ProgrammingJournal of Optimization Theory and Applications, 2003
- HYTECH: the next generation2002
- Neuro-dynamic programming: an overview2002
- Approximate Dynamic Programming via Linear Programming2002
- The explicit linear quadratic regulator for constrained systemsAutomatica, 2002
- Planning and acting in partially observable stochastic domainsArtificial Intelligence, 1998
- Generalized polynomial approximations in Markovian decision processesJournal of Mathematical Analysis and Applications, 1985
- Optimal control of Markov processes with incomplete state informationJournal of Mathematical Analysis and Applications, 1965
- Linear Programming and Extensions1963