| Título |
A distributed set-membership estimator for linear systems with reduced computational requirements |
| Autores |
IERARDI, CARMELINA, ORIHUELA ESPINA, DIEGO LUIS, JURADO FLORES, ISABEL |
| Publicación externa |
No |
| Medio |
Automatica |
| Alcance |
Article |
| Naturaleza |
Científica |
| Cuartil JCR |
1 |
| Cuartil SJR |
1 |
| Impacto JCR |
6.15000 |
| Impacto SJR |
3.79600 |
| Web |
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85110136326&doi=10.1016%2fj.automatica.2021.109802&partnerID=40&md5=8480b9bab0dce3a2fd3c337978954fa9 |
| Fecha de publicacion |
12/10/2021 |
| ISI |
000689475700001 |
| Scopus Id |
2-s2.0-85110136326 |
| DOI |
10.1016/j.automatica.2021.109802 |
| Abstract |
In this paper, a distributed set-membership estimator for linear full-coupled systems affected by bounded disturbances is presented. The estimator uses a multi-hop staircase decomposition, capturing the locally unobservable subspaces in a cascaded fashion with the information incoming from other agents involved in the network. Each agent has to find different sets for each subspace, that are mathematically described by zonotopes. The observer gains that minimize the size of those sets, i.e. the estimation uncertainty, can be designed in independent distributed steps by means of simple algebraic equations. Simulations are given to compare the proposed solution with others in the field. An important benefit of the proposed structure is the reduction of the computational requirements with respect to existing solutions. © 2021 Elsevier Ltd |
| Palabras clave |
Distributed computer systems; Multi agent systems; Bounded disturbances; Computational requirements; Coupled systems; Distributed set-membership estimation; Multi-agents systems; Multi-hop decompositi |
| Miembros de la Universidad Loyola |
|
Gestionar cookies