Towards scalable algorithms with formal guarantees for Lyapunov analysis of control systems via algebraic optimization
Name
Parrilo_Towards scalable.pdf
Size
824.96 KB
Format
Adobe PDF
Checksum (MD5)
a88e973ecd07b1f45a3199aa9fadc784
Author(s)
Ahmadi, Amir Ali
Parrilo, Pablo A.
Date Issued
December 2014
Journal
Proceedings of the 53rd IEEE Conference on Decision and Control
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Ahmadi, Amir Ali, and Pablo A. Parrilo. “Towards Scalable Algorithms with Formal Guarantees for Lyapunov Analysis of Control Systems via Algebraic Optimization.” 53rd IEEE Conference on Decision and Control (December 2014).
Version
Author's final manuscript
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/CDC.2014.7039734
