This paper provides an analysis method of a robust invariant set for discrete-time linear switched systems with peak-bounded disturbances. In the case of a switched linear system, it is challenging to analyse the robust invariant set accurately than that of the linear time-invariant system. We propose a novel method to estimate a robust invariant set using a combination of a recursive state updating and an invariant ellipsoid for a common Lyapunov function. The effectiveness of the estimation accuracy by the proposed method is illustrated using numerical examples
The 19th World Congress of the International Federation of Automatic Control 2014. Cape Town, Sudáfr...
Groupe de Travail de Commande Prédictive Non Linéaire / Méthodes Ensemblistes pour l’Automatique, Pa...
Groupe de Travail de Commande Prédictive Non Linéaire / Méthodes Ensemblistes pour l’Automatique, Pa...
This paper provides an analysis method of a robust invariant set for discrete-time linear switched s...
Explanation of my following latest article published at @TaylorandFrancis1 JCMSI. Published Journal ...
The research concretized in this memory is located at the intersection of two important fields, the ...
Le travail de recherche concrétisé par ce mémoire de thèse se trouve à l’intersection de deux domain...
Abstract: This paper addresses invariant set computation for discrete-time switched systems subject ...
International audienceThe objective of this chapter is to present a methodology for computing robust...
International audienceThe objective of this chapter is to present a methodology for computing robust...
International audienceThe objective of this chapter is to present a methodology for computing robust...
A numerically stable recursive set membership state estimation algorithm for linear discrete-time sy...
This paper presents an algorithm for the computation of full‐complexity polytopic robust control inv...
A numerically stable recursive set membership state estimation algorithm for linear discrete-time sy...
This paper presents an algorithm for the computation of full?complexity polytopic robust control inv...
The 19th World Congress of the International Federation of Automatic Control 2014. Cape Town, Sudáfr...
Groupe de Travail de Commande Prédictive Non Linéaire / Méthodes Ensemblistes pour l’Automatique, Pa...
Groupe de Travail de Commande Prédictive Non Linéaire / Méthodes Ensemblistes pour l’Automatique, Pa...
This paper provides an analysis method of a robust invariant set for discrete-time linear switched s...
Explanation of my following latest article published at @TaylorandFrancis1 JCMSI. Published Journal ...
The research concretized in this memory is located at the intersection of two important fields, the ...
Le travail de recherche concrétisé par ce mémoire de thèse se trouve à l’intersection de deux domain...
Abstract: This paper addresses invariant set computation for discrete-time switched systems subject ...
International audienceThe objective of this chapter is to present a methodology for computing robust...
International audienceThe objective of this chapter is to present a methodology for computing robust...
International audienceThe objective of this chapter is to present a methodology for computing robust...
A numerically stable recursive set membership state estimation algorithm for linear discrete-time sy...
This paper presents an algorithm for the computation of full‐complexity polytopic robust control inv...
A numerically stable recursive set membership state estimation algorithm for linear discrete-time sy...
This paper presents an algorithm for the computation of full?complexity polytopic robust control inv...
The 19th World Congress of the International Federation of Automatic Control 2014. Cape Town, Sudáfr...
Groupe de Travail de Commande Prédictive Non Linéaire / Méthodes Ensemblistes pour l’Automatique, Pa...
Groupe de Travail de Commande Prédictive Non Linéaire / Méthodes Ensemblistes pour l’Automatique, Pa...