|
||||||||
| Web Mail Mailing Lists Computing Resources Site Map |
Efficient optimization for robust optimal control with constraints Dr. Eric Kerrigan, Imperial College London, UK Tuesday, November 14, 200611:00 AM to 12:00 PM 114 Steele (Library) This talk will present an efficient computational technique for the optimal control of linear discrete-time systems subject to bounded disturbances with linear constraints on the states and inputs. The problem of computing a finite-horizon state feedback control policy, which guarantees robust constraint satisfaction, is known to be non- convex. However, a recent breakthrough has been the application of robust optimization techniques to reparameterize this problem as a convex program. While the reparameterized problem is theoretically tractable, the number of variables is quadratic in the number of stages or horizon length N and has no apparent exploitable structure, leading to a computational time of O(N^6) per iteration of an interior-point method. We focus on the case when the disturbance set is infinity-norm bounded or the linear map of a hypercube. Here we make use of state variables to regain a sparse problem structure that is related to the structure of the original problem, that is, the policy optimization problem may be decomposed into a set of coupled finite horizon control problems. This decomposition can then be formulated as a highly structured optimization problem, solvable by primal-dual interior-point methods in which each iteration requires O(N^3) time. This cubic iteration time can be guaranteed using a Riccati-based block factorization technique, which is standard in discrete-time optimal control. Numerical results are presented, using a standard sparse primal-dual interior point solver, that illustrate the efficiency of this approach. |
|||||||
|