By Topic

A Parallel Algorithm for the Time Decomposition Approach to Constrained Optimal Control Problems

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

3 Author(s)
Shi-Chung Chang ; Dept. of Electrical Engineering, National Taiwan University, Taipei, Taiwan 10764, R.O.C. ; Chen, Chun-Hung ; I-Kong Fong

This paper presents an effective, parallel algorithm for solving constrained optimal control problems with long time horizons. The basic idea is to first relax all contraints but the system dynamics by using the multiplier method. A time decomposition and target coordination scheme is then used to decompose the resultant unconstrained optimal control problem into a two-level optimization with a structure for parallel processing. A three-level optimization algorithm is developed to determine the multipliers and to solve the associated two-level unconstrained problem. The algorithm is a hybrid of the multiplier method, Newton method and the Differential Dynamic Programming technique, and has a highly paralel structure at each level of the algorithm. The algorithm is relatively easy to implement, convergent, and applicable to problems with quite general constraints and system dynamics. Numerical results demonstrate its feasiblity and potential computation efficiency when used for parallel processing.

Published in:

American Control Conference, 1989

Date of Conference:

21-23 June 1989