Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Data‐driven safe gain‐scheduling control

Data‐driven safe gain‐scheduling control Data‐based safe gain‐scheduling controllers are presented for discrete‐time linear parameter‐varying systems (LPV) with polytopic models. First, λ$$ \lambda $$‐contractivity conditions are provided under which the safety and stability of the LPV systems are unified through Minkowski functions of the safe sets. Then, a data‐based representation of the closed‐loop LPV system is provided, which requires less restrictive data richness conditions than identifying the system dynamics. This sample‐efficient closed‐loop data‐based representation is leveraged to design data‐driven gain‐scheduling controllers that guarantee λ$$ \lambda $$‐contractivity and, thus, invariance of the safe sets. It is also shown that the problem of designing a data‐driven gain‐scheduling controller for a polyhedral (ellipsoidal) safe set amounts to a linear program (a semi‐definite program). The motivation behind direct learning of a safe controller is that identifying an LPV system requires satisfying the persistence of the excitation (PE) condition. It is shown in this paper, however, that directly learning a safe controller and bypassing the system identification can be achieved without satisfying the PE condition. This data‐richness reduction is of vital importance, especially for LPV systems that are open‐loop unstable, and collecting rich samples to satisfy the PE condition can jeopardize their safety. A simulation example is provided to show the effectiveness of the presented approach. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Asian Journal of Control Wiley

Data‐driven safe gain‐scheduling control

Loading next page...
 
/lp/wiley/data-driven-safe-gain-scheduling-control-ecWhsM2eqr

References (51)

Publisher
Wiley
Copyright
© 2023 Chinese Automatic Control Society and John Wiley & Sons Australia, Ltd
ISSN
1561-8625
eISSN
1934-6093
DOI
10.1002/asjc.3169
Publisher site
See Article on Publisher Site

Abstract

Data‐based safe gain‐scheduling controllers are presented for discrete‐time linear parameter‐varying systems (LPV) with polytopic models. First, λ$$ \lambda $$‐contractivity conditions are provided under which the safety and stability of the LPV systems are unified through Minkowski functions of the safe sets. Then, a data‐based representation of the closed‐loop LPV system is provided, which requires less restrictive data richness conditions than identifying the system dynamics. This sample‐efficient closed‐loop data‐based representation is leveraged to design data‐driven gain‐scheduling controllers that guarantee λ$$ \lambda $$‐contractivity and, thus, invariance of the safe sets. It is also shown that the problem of designing a data‐driven gain‐scheduling controller for a polyhedral (ellipsoidal) safe set amounts to a linear program (a semi‐definite program). The motivation behind direct learning of a safe controller is that identifying an LPV system requires satisfying the persistence of the excitation (PE) condition. It is shown in this paper, however, that directly learning a safe controller and bypassing the system identification can be achieved without satisfying the PE condition. This data‐richness reduction is of vital importance, especially for LPV systems that are open‐loop unstable, and collecting rich samples to satisfy the PE condition can jeopardize their safety. A simulation example is provided to show the effectiveness of the presented approach.

Journal

Asian Journal of ControlWiley

Published: Nov 1, 2023

Keywords: data‐driven control; gain‐scheduling control; invariant sets; safe control; set‐theoretic methods

There are no references for this article.