An Algorithm for the Calculation of the Dwell Time Constraint for Switched
Horváth, Zs and Edelmayer, András (2018) An Algorithm for the Calculation of the Dwell Time Constraint for Switched. ACTA UNIVERSITATIS SAPIENTIAE ELECTRICAL AND MECHANICAL ENGINEERING, 10. pp. 5-19. ISSN 2065-5916 10.2478/auseme-2018-0001
|
Text
Horvath_5_30401597_ny.pdf Download (731kB) | Preview |
Abstract
This paper presents a numerical algorithm for determining the minimum dwell time constraint for switched linear H-infinity fault detection filters. When applying switched systems, ensuring the stability is a crucial target, which can be guaranteed, when we switch slowly enough between the subsystems, more precisely when the intervals between two consecutive switching instants, called dwell time, are large enough. The problem formulation is based on multiple Lyapunov functions and is expressed through a special form of linear matrix inequalities (LMIs), which include a nonlinear term of the dwell time. This represents a multivariable, time dependent optimization problem. As a result, the task cannot be treated as a simple feasibility problem involving a LMI solver as it is widely used in applications of the linear control. To solve these special LMIs, we propose a numerical algorithm, called
Item Type: | Article |
---|---|
Subjects: | Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
Divisions: | Systems and Control Lab |
SWORD Depositor: | MTMT Injector |
Depositing User: | MTMT Injector |
Date Deposited: | 22 Jan 2019 07:52 |
Last Modified: | 21 Jul 2019 13:28 |
URI: | https://eprints.sztaki.hu/id/eprint/9628 |
Update Item |