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.

Suboptimal dynamic programming with error bounds

På svenska

Author

Summary, in English

This paper presents a method to relax Dynamic Programming. The methodmakes it possible to findsuboptimal solutions with known error bounds to hard problems.The bounds are chosen by the user, who can then effectively trade-offbetween solution time and accuracy. Several examples from differentdomains where the method is highly useful are presented.

Publishing year

2002

Language

English

Pages

2354-2359

Publication/Series

Proceedings of the 41st IEEE Conference on Decision and Control, 2002

Volume

2

Document type

Conference paper

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Control Engineering

Keywords

  • optimal control
  • dynamic programming
  • suboptimal
  • pomdp
  • piecewise linear

Conference name

41st IEEE Conference on Decision and Control

Conference date

2002-12-10 - 2002-12-13

Conference place

Las Vegas, NV, United States

Status

Published

ISBN/ISSN/Other

  • ISSN: 0191-2216
  • ISBN: 0-7803-7516-5