DocumentCode
3076463
Title
Reduction of the dimensionality of dynamic programming: a case study
Author
de Madrid, A.P. ; Dormido, S. ; Morilla, F.
Author_Institution
Dept. de Inf. y Autom., UNED, Madrid, Spain
Volume
4
fYear
1999
fDate
1999
Firstpage
2852
Abstract
This paper deals with the reduction of the computational complexity of dynamic programming, the well known curse of dimensionality. We show how it can be overcome by using different reduction techniques. Three of the most significant ones are introduced and compared with an example. The main conclusion is that the computational load can be reduced several orders of magnitude in an easy and intuitive way
Keywords
computational complexity; dynamic programming; interpolation; computational complexity; dimensionality reduction; dynamic programming; interpolation; optimisation; reduction techniques; Artificial intelligence; Automatic control; Computational complexity; Computer aided software engineering; Cost function; Dynamic programming; Electronic mail; Interpolation; Mathematics; Processor scheduling;
fLanguage
English
Publisher
ieee
Conference_Titel
American Control Conference, 1999. Proceedings of the 1999
Conference_Location
San Diego, CA
ISSN
0743-1619
Print_ISBN
0-7803-4990-3
Type
conf
DOI
10.1109/ACC.1999.786593
Filename
786593
Link To Document