Premium
A convex optimization approach to adaptive stabilization of discrete‐time LTI systems with polytopic uncertainties
Author(s) -
Lee Dong Hwan,
Joo Young Hoon,
Tak Myung Hwan
Publication year - 2015
Publication title -
international journal of adaptive control and signal processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.73
H-Index - 66
eISSN - 1099-1115
pISSN - 0890-6327
DOI - 10.1002/acs.2525
Subject(s) - control theory (sociology) , convex optimization , linear matrix inequality , mathematical optimization , optimization problem , discrete time and continuous time , adaptive control , scheduling (production processes) , gain scheduling , mathematics , computer science , regular polygon , control (management) , statistics , geometry , artificial intelligence
Summary This paper suggests a simple convex optimization approach to state‐feedback adaptive stabilization problem for a class of discrete‐time LTI systems subject to polytopic uncertainties. The proposed method relies on estimating the uncertain parameters by solving an online optimization at each time step, such as a linear or quadratic programming, and then, on tuning the control law with that information, which can be conceptually viewed as a kind of gain‐scheduling or indirect adaptive control. Specifically, an admissible domain of stabilizing state‐feedback gain matrices is designed offline by means of linear matrix inequality problems, and based on the online estimation of the uncertain parameters, the state‐feedback gain matrix is calculated over the set of stabilizing feedback gains. The proposed stabilization algorithm guarantees the asymptotic stability of the overall closed‐loop control system. An example is given to show the effectiveness of the proposed approach. Copyright © 2014 John Wiley & Sons, Ltd.