Suboptimal dynamic programming with error bounds
Authors:
- 1 January 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 2354-2359
Abstract
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 presentedKeywords
This publication has 2 references indexed in Scilit:
- Optimizing linear system switching2003
- Optimal control of Markov processes with incomplete state informationJournal of Mathematical Analysis and Applications, 1965