The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Relaxing dynamic programming

På svenska

Author

Summary, in English

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).

Publishing year

2006

Language

English

Pages

1249-1260

Publication/Series

IEEE Transactions on Automatic Control

Volume

51

Issue

8

Document type

Journal article

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Control Engineering

Keywords

  • optimal control
  • dynamic programming
  • nonlinear synthesis
  • switching
  • systems

Status

Published

ISBN/ISSN/Other

  • ISSN: 0018-9286