A Primal-Dual Method for Low Order H-Infinity Controller Synthesis
2009 (English)In: Proceedings of the 48th IEEE Conference on Decision and Control held jointly with the 28th Chinese Control Conference, IEEE , 2009, 6674-6679 p.Conference paper (Refereed)
When designing robust controllers, H-infinity synthesisis a common tool to use. The controllers that result from these algorithms are typically of very high order, which complicates implementation. However, if a constraint on the maximum order of the controller is set, that is lower than the order of the (augmented) system, the problem becomes nonconvex and it is relatively hard to solve. These problems become very complex,even when the order of the system is low.
The approach used in this work is based on formulating the constraint on the maximum order of the controller as a polynomial (or rational) equation. By using the fact that the polynomial (or rational) is non-negative on the feasible set, the problem is reformulated as an optimization problem where the nonconvex function is to be minimized over a convex set defined by linear matrix inequalities.
The proposed method is evaluated together with a wellknown method from the literature. The results indicate that the proposed method performs slightly better.
Place, publisher, year, edition, pages
IEEE , 2009. 6674-6679 p.
, I E E E Conference on Decision and Control, Including the Symposium on Adaptive Processes. Proceedings, ISSN 0191-2216
H-infinity synthesis, Primal-dual methods, Rational constraints, Optimization
IdentifiersURN: urn:nbn:se:liu:diva-54117DOI: 10.1109/CDC.2009.5400422ISBN: 978-1-4244-3871-6ISBN: 978-1-4244-3872-3OAI: oai:DiVA.org:liu-54117DiVA: diva2:299720
48th IEEE Conference on Decision and Control held jointly with the 28th Chinese Control Conference, Shanghai, China, 15-18 December, 2009
FunderSwedish Research Council, 60519401