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.

Relaxed dynamic programming in switching systems

På svenska

Author

Summary, in English

In order to simplify computational methods based on dynamic programming, a relaxed procedure based on upper and lower bounds of the optimal cost was recently introduced. The convergence properties of this procedure are analysed here. In particular, it is shown that the computational effort in finding an approximately optimal control law by relaxed value iteration is related to the polynomial degree that is needed to approximate the optimal cost. This gives a rigorous foundation for the claim that the search for optimal control laws requires complex computations only if the optimal cost function is complex. A computational example is given for switching control on a graph with 60 nodes, 120 edges and 30 continuous states.

Publishing year

2006

Language

English

Pages

567-574

Publication/Series

IEE Proceedings: Control Theory and Applications

Volume

153

Issue

5

Document type

Journal article

Publisher

Institution of Engineering and Technology

Topic

  • Control Engineering

Status

Published

ISBN/ISSN/Other

  • ISSN: 1350-2379