Computational analysis of real-time convex optimization for control systems
Author(s)McGovern, Lawrence Kent
MetadataShow full item record
Computational analysis is fundamental for certification of all real-time control software. Nevertheless, analysis of on-line optimization for control has received little attention to date. On-line software must pass rigorous standards in reliability, requiring that any embedded optimization algorithm possess predictable behavior and bounded run-time guarantees. This thesis examines the problem of certifying control systems which utilize real-time optimization. A general convex programming framework is used, to which primal-dual path-following algorithms are applied. The set of all optimization problem instances which may arise in an on-line procedure is characterized as a compact parametric set of convex programming problems. A method is given for checking the feasibility and well-posedness of this compact set of problems, providing certification that every problem instance has a solution and can be solved in finite time. The thesis then proposes several algorithm initialization methods, considering the fixed and time-varying constraint cases separately. Computational bounds are provided for both cases. In the event that the computational requirements cannot be met, several alternatives to on-line optimization are suggested. Of course, these alternatives must provide feasible solutions with minimal real-time computational overhead. Beyond this requirement, these methods approximate the optimal solution as well as possible. The methods explored include robust table look-up, functional approximation of the solution set, and ellipsoidal approximation of the constraint set. The final part of this thesis examines the coupled behavior of a receding horizon control scheme for constrained linear systems and real-time optimization. The driving requirement is to maintain closed-loop stability, feasibility and well-posedness of the optimal control problem, and bounded iterations for the optimization algorithm. A detailed analysis provides sufficient conditions for meeting these requirements. A realistic example of a small autonomous air vehicle is furnished, showing how a receding horizon control law using real-time optimization can be certified.
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2000.Includes bibliographical references (p. 177-189).
DepartmentMassachusetts Institute of Technology. Department of Aeronautics and Astronautics
Massachusetts Institute of Technology
Aeronautics and Astronautics