DocumentCode :
3216885
Title :
Improved dynamic programming algorithms for sequential decision processes with applications to economic dispatches of power systems
Author :
Sun, M.
Author_Institution :
Dept. of Math., Alabama Univ., Tuscaloosa, AL, USA
fYear :
1993
fDate :
7-9 Mar 1993
Firstpage :
135
Lastpage :
139
Abstract :
A typical model for problems involving sequential decision processes in a discrete-time setting is considered. Several means to improve the regular dynamic programming method for solving the model problem are proposed. Reducing the sizes of the state and control domains is the key objective for improving efficiency. Theoretical justification of the domain reduction idea is provided
Keywords :
convergence of numerical methods; decision theory; discrete time systems; dynamic programming; load dispatching; power system control; discrete-time; domain reduction; dynamic programming algorithms; economic dispatches; efficiency; model problem; power systems; sequential decision processes; Cost function; Dynamic programming; Heuristic algorithms; Iterative algorithms; Power generation economics; Power system dynamics; Power system economics; Power system modeling; Size control; Sun;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
System Theory, 1993. Proceedings SSST '93., Twenty-Fifth Southeastern Symposium on
Conference_Location :
Tuscaloosa, AL
ISSN :
0094-2898
Print_ISBN :
0-8186-3560-6
Type :
conf
DOI :
10.1109/SSST.1993.522757
Filename :
522757
Link To Document :
بازگشت