Maximal Admissible Set for Graph-Dependent Switched Systems with Dwell Time Restriction - Archive ouverte HAL
Pré-Publication, Document De Travail Année : 2024

Maximal Admissible Set for Graph-Dependent Switched Systems with Dwell Time Restriction

Résumé

In this paper we present an extension of the concept of the maximal admissible set for constrained graph-dependent switched systems with bounded disturbances under dwell time restriction. Termed as the maximal switch-dependently robustly admissible set (MSDRAS), we provide efficient numerical procedures for its determination. For this purpose, we exploit available information about the current active mode, minimum dwell times, and mode transition graph. We employ the MSDRAS for three purposes: i) characterizing the largest set of initial states ensuring constraint satisfaction; ii) establishing necessary and sufficient conditions for stability of switched systems; iii) computing the minimum mode-dependent dwell times. Furthermore, we extend the results to switched systems with parametric uncertainties. Through three numerical examples, we compare our solutions with earlier from the literature to illustrate the effectiveness of our approach.
Fichier principal
Vignette du fichier
dwelltime (1).pdf (514.81 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04664006 , version 1 (29-07-2024)
hal-04664006 , version 2 (31-07-2024)

Identifiants

  • HAL Id : hal-04664006 , version 2

Citer

Hoai Nam Nguyen. Maximal Admissible Set for Graph-Dependent Switched Systems with Dwell Time Restriction. 2024. ⟨hal-04664006v2⟩
109 Consultations
32 Téléchargements

Partager

More