DocumentCode
391365
Title
Suboptimal dynamic programming with error bounds
Author
Lincoln, Bo ; Rantzer, Anders
Author_Institution
Dept. of Autom. Control, LTH, Lund, Sweden
Volume
2
fYear
2002
fDate
10-13 Dec. 2002
Firstpage
2354
Abstract
This paper presents a method to relax dynamic programming. The method makes it possible to find suboptimal solutions with known error bounds to hard problems. The bounds are chosen by the user, who can then effectively trade-off between solution time and accuracy. Several examples from different domains where the method is highly useful are presented.
Keywords
dynamic programming; optimal control; error bounds; optimal control; suboptimal dynamic programming; Automatic control; Control systems; Cost function; Dynamic programming; Memory management; Optimal control; Piecewise linear techniques;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 2002, Proceedings of the 41st IEEE Conference on
ISSN
0191-2216
Print_ISBN
0-7803-7516-5
Type
conf
DOI
10.1109/CDC.2002.1184885
Filename
1184885
Link To Document