z-logo
Premium
Robust estimation for discrete time‐varying systems with limited communication capacity
Author(s) -
Wang BaoFeng,
Guo Ge
Publication year - 2012
Publication title -
asian journal of control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.769
H-Index - 53
eISSN - 1934-6093
pISSN - 1561-8625
DOI - 10.1002/asjc.300
Subject(s) - bounded function , control theory (sociology) , computer science , discrete time and continuous time , quantization (signal processing) , norm (philosophy) , upper and lower bounds , filter (signal processing) , network packet , recursive filter , filtering problem , mathematics , filter design , computation , mathematical optimization , algorithm , statistics , control (management) , root raised cosine filter , mathematical analysis , computer network , artificial intelligence , political science , law , computer vision
In this paper, we consider the state estimation problem for linear discrete time‐varying systems subject to limited communication capacity which includes measurement quantization, random transmission delay and data‐packet dropouts. Based on transforming the three communication limitations into the system with norm‐bounded uncertainties and stochastic matrices, we design a robust filter such that, for all the communication limitations, the error state of the filtering process is mean square bounded. An upper bound on the variance of the state estimation error is first found, and then, a robust filter is derived by minimizing the prescribed upper bound in the sense of the matrix norm. It is shown that the desired filter can be obtained in terms of the solutions to two Riccati‐like difference equations which also provide a recursive algorithm suitable for online computation. A simulation example is presented to demonstrate the effectiveness and applicability of the proposed algorithm.Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here