Premium
A novel approach to L 1 filter design for asynchronously switched positive linear systems with dwell time
Author(s) -
Li Yang,
Du Wenju,
Xu Xiaozeng,
Zhang Hongbin,
Xia Jianwei
Publication year - 2019
Publication title -
international journal of robust and nonlinear control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.361
H-Index - 106
eISSN - 1099-1239
pISSN - 1049-8923
DOI - 10.1002/rnc.4702
Subject(s) - asynchronous communication , filter (signal processing) , control theory (sociology) , dwell time , bounding overwatch , interval (graph theory) , filter design , computer science , set (abstract data type) , lyapunov function , class (philosophy) , function (biology) , mathematics , nonlinear system , telecommunications , medicine , clinical psychology , physics , control (management) , combinatorics , artificial intelligence , quantum mechanics , evolutionary biology , computer vision , biology , programming language
Summary In this paper, the L 1 filtering problem is studied for continuous‐time switched positive linear systems (SPLSs) with a small delay existing in the switching of the filter and the subsystem. Unlike the existing literature concerned with asynchronous problems of SPLSs, the synchronous and asynchronous filters will be designed separately, which implies less conservative results. By introducing a class of clock‐dependent Lyapunov function (CDLF), which jumps down when the modes of the filter or the subsystem change and may increase or decrease during the asynchronous interval, clock‐dependent sufficient conditions characterizing a nonweighted L 1 ‐gain performance of the filter error systems are established. Then, based on the L 1 analysis results, a pair of error‐bounding filters are designed to estimate the outputs of SPLSs. The filter gains can be obtained by solving a set of linear programming. Finally, two numerical examples are presented to show the effectiveness and advantages of the results.