Towards scalable algorithms with formal guarantees for Lyapunov analysis of control systems via algebraic optimization
Exciting recent developments at the interface of optimization and control have shown that several fundamental problems in dynamics and control, such as stability, collision avoidance, robust performance, and controller synthesis can be addressed by a synergy of classical tools from Lyapunov theory a...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2016
|
Online Access: | http://hdl.handle.net/1721.1/100985 https://orcid.org/0000-0003-1132-8477 |
Summary: | Exciting recent developments at the interface of optimization and control have shown that several fundamental problems in dynamics and control, such as stability, collision avoidance, robust performance, and controller synthesis can be addressed by a synergy of classical tools from Lyapunov theory and modern computational techniques from algebraic optimization. In this paper, we give a brief overview of our recent research efforts (with various coauthors) to (i) enhance the scalability of the algorithms in this field, and (ii) understand their worst case performance guarantees as well as fundamental limitations. Our results are tersely surveyed and challenges/opportunities that lie ahead are stated. |
---|