2011
DOI: 10.1016/j.nahs.2010.07.003
|View full text |Cite
|
Sign up to set email alerts
|

Algebraic switching time identification for a class of linear hybrid systems

Abstract: International audienceIn this paper, a method for the finite time estimation of the switching times in linear switched systems is proposed. The approach is based on algebraic tools (differential algebra, module theory and operational calculus) and distribution theory. Switching time estimates are given by explicit algebraic formulae that can be implemented in a straightforward manner using standard tools from computational mathematics. Simulations illustrate the proposed techniques

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
6
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 31 publications
(6 citation statements)
references
References 41 publications
0
6
0
Order By: Relevance
“…In this paper, we study the systems whose hybrid time trajectories satisfy the minimal dwell time definition. Moreover, it is assumed that the dwell time is sufficiently large, or it is possible to estimate it (see, e.g., [49] for the algebraic estimation of the switching times for LSS).…”
Section: Definition 7 ([2])mentioning
confidence: 99%
“…In this paper, we study the systems whose hybrid time trajectories satisfy the minimal dwell time definition. Moreover, it is assumed that the dwell time is sufficiently large, or it is possible to estimate it (see, e.g., [49] for the algebraic estimation of the switching times for LSS).…”
Section: Definition 7 ([2])mentioning
confidence: 99%
“…The principal of these systems consists in decomposing the regression domain of the system into regions, then, an ARX sub-model is assigned to every one. There exist numerous approaches in the literature for the identification of PWA models Tian et al (2011), Ferrari-Trecate et al (2003, Bemporad et al (2003), Juloski et al (2005), Bemporad et al (2005). We have advocated the use of clustering based approach Lassoued and Abderrahim (2014c), which is based on the fact that process has local affine behaviours.…”
Section: Introductionmentioning
confidence: 99%
“…To reduce this complexity, all existing approaches assume that the sub-model orders are known a priori as well as the number of sub-models for some methods. Several solutions have been presented in the literature for the identification of PWARX models such as the algebraic solution (Tian et al, 2011), the classification solution (Ferrari-Trecate et al, 2003), the greedy solution (Bemporad et al, 2003), the Bayesian solution (Juloski et al, 2005), the bounded error solution (Bemporad et al, 2005), the sparse optimization solution (Bako, 2011; Mattsson et al, 2016), and so forth. Each approach has its advantages and its drawbacks.…”
Section: Introductionmentioning
confidence: 99%