Abstract
The convergence properties of an iterative dynamic programming algorithm are examined by considering a singular optimal control problem involving five differential equations. Even with a relatively coarse grid, convergence to the optimal control policy is rapid. The procedure is easy to program, and the computations can be easily done on a personal computer. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
