Probability-guaranteed set-membership filtering for systems with incomplete measurements

Guoliang Wei ^[1] ; Shuai Liu ^[1] ; Yan Song ^[1] ; Yurong Liu ^[2]
1. [1] University of Shanghai for Science and Technology
  
  University of Shanghai for Science and Technology
  
  China
2. [2] Yangzhou University
  
  Yangzhou University
  
  China
Localización: Automatica: A journal of IFAC the International Federation of Automatic Control, ISSN 0005-1098, Vol. 60, 2015, págs. 12-16
Idioma: inglés
Texto completo no disponible (Saber más ...)
Resumen
- n this note, the probability-guaranteed set-membership filtering problem is investigated for a class of time-varying systems with incomplete measurements. The uniform distribution over known finite ranges is assumed for mutually independent stochastic variables existing in the functions of system matrices. The process noise and measurement noise are unknown, bounded and confined to a specified ellipsoidal set respectively, which is handled by transformation to the inequality constraints. The purpose is to design a set-membership filter, for all the admissible unknown but bounded noises, known deterministic input and incomplete measurements, such that the ellipsoidal set including all possible states can be determined by a convex optimization approach with probability constraint. A recursive linear matrix inequality (RLMI) approach is proposed to address the probability-guaranteed set-membership filtering problem. Finally, a simulation example demonstrates the effectiveness of the proposed filtering scheme.