Bilevel Programming for Analysis of Low-Complexity Control of Linear Systems with Constraints
2009 (English)In: Proceedings of the 48th IEEE Conference on Decision and Control, 2009, 946-951 p.Conference paper (Refereed)
In this paper we use bilevel programming to find the maximum difference between a reference controller and a low-complexity controller in terms of the infinity-norm difference of their control laws. A nominal MPC for linear systems with constraints, and a robust MPC for linear systems with bounded additive noise are considered as reference controllers. For possible low-complexity controllers we discuss partial enumeration (PE), Voronoi/closest point, triangulation, linear controller with saturation, and others. A small difference in the norm between a low-complexity controller and a robust MPC may be used to guarantee closed-loop stability of the low-complexity controller and indicate that the behaviour or performance of the low-complexity controller will be similar to that of the reference one. We further discuss how bilevel programming may be used for closed-loop analysis of model reduction.
Place, publisher, year, edition, pages
2009. 946-951 p.
Bilevel programming, Closed-loop analysis, Optimal control
IdentifiersURN: urn:nbn:se:liu:diva-89078DOI: 10.1109/CDC.2009.5400868ISBN: 978-1-4244-3872-3ISBN: 978-1-4244-3871-6OAI: oai:DiVA.org:liu-89078DiVA: diva2:606607
48th IEEE Conference on Decision and Control, Shanghai, China, December 2009