DESIGN OF ALGORITHMS FOR SPATIAL-TIME REDUCTION COMPLEXITY OF DYNAMIC-PROGRAMMING

被引：2
作者：
MORENO, L
ACOSTA, L
SANCHEZ, JL
机构：
[1] Univ de La Laguna, La Laguna
来源：
IEE PROCEEDINGS-D CONTROL THEORY AND APPLICATIONS | 1992年 / 139卷 / 02期
关键词：
DYNAMIC PROGRAMMING; OPTIMAL CONTROL; ADAPTIVE CONTROL;
D O I：
10.1049/ip-d.1992.0024
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
The objective of the paper is the search for algorithms to reduce the spatial-time complexity of dynamic programming. These algorithms have been verified in second-order continuous systems, with indexes of performance where the time explicitly appears. The use of such algorithms is vital when dealing with third-order systems and second-order stochastic systems.
引用
收藏
页码：172 / 180
页数：9
相关论文
共 13 条
[11]  
Rao G P, 1983, PIECEWISE CONSTANT O
[12]   TIME-OPTIMAL CONTROL ALGORITHM FOR MICROPROCESSOR WITH ASYMMETRICAL BOUNDS [J].
SERRA, I ;
MORENO, L ;
LUQUE, E .
IEE PROCEEDINGS-D CONTROL THEORY AND APPLICATIONS, 1984, 131 (06) :238-242
[13]   DISCRETE-TIME APPROXIMATION OF MULTIVARIABLE CONTINUOUS-TIME SYSTEMS [J].
SINHA, NK ;
ZHOU, QJ .
IEE PROCEEDINGS-D CONTROL THEORY AND APPLICATIONS, 1983, 130 (03) :103-110
12