Abstract
A two-level computational algorithm with parallel computing capability for general minimum-time control problems is proposed. The two-level approach is presented to solve a large-dimension parameter optimization problem transformed from the continuous minimum-time control problem considered. This algorithm consists of a master and a slave program. An efficient parallel computing scheme is developed to solve the slave program, while the master program is solved by a one-dimensional gradient program. The convergence of this back-and-forth two-level algorithm is shown. An O(1) computational complexity is achieved for each primitive iteration of the algorithm if enough arithmetic operators are available. A numerical example is presented to demonstrate the broad convergence region and the extremely fast computation of the algorithm. A feedback scheme based on the two-level algorithm is introduced to reduce the influence of a noisy environment and eliminate a numerical imperfection that appears in the open-loop computation.
| Original language | English |
|---|---|
| Pages (from-to) | 2583-2588 |
| Number of pages | 6 |
| Journal | Proceedings of the American Control Conference |
| DOIs | |
| State | Published - 1990 |
| Externally published | Yes |
| Event | Proceedings of the 1990 American Control Conference - San Diego, CA, USA Duration: 23 05 1990 → 25 05 1990 |