By Topic

Improved dynamic programming algorithms for sequential decision processes with applications to economic dispatches of power systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Sun, M. ; Dept. of Math., Alabama Univ., Tuscaloosa, AL, USA

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

Published in:

System Theory, 1993. Proceedings SSST '93., Twenty-Fifth Southeastern Symposium on

Date of Conference:

7-9 Mar 1993