Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/13621
Title: Set-membership filtering for time-varying systems with mixed time-delays under Round-Robin and Weighted Try-Once-Discard protocols
Authors: Zou, L
Wang, Z
Gao, H
Keywords: Communication protocol;Set-membership filtering;;Round-Robin protocol;;Weighted Try-Once-Discard Weighted Try-Once-Discard;Mixed time-delays;Non-Gaussian noises;Recursive matrix inequalities
Issue Date: 2016
Publisher: Elsevier
Citation: Automatica, 74: pp. 341 - 348,(2016)
Abstract: This paper is concerned with the set-membership filtering problem for a class of time-varying systems with mixed time-delays and communication protocols. Two kinds of well-known protocols (Round-Robin protocol and Weighted Try-Once-Discard protocol) are considered, with which the data transmission between the sensor nodes and the filter is implemented via a shared communication network that allows only one sensor node to send its measurement data at each transmission instant in order to prevent the data from collisions. The transmission order of sensor nodes is orchestrated by the underlying protocol of the network. The aim of the problem addressed is to design a set-membership filter capable of confining the state estimate of the system to certain ellipsoidal region subject to the bounded non-Gaussian noises. Sufficient condition is first derived for the existence of the desired filter at each time step in terms of a recursive algorithm. Then, two optimization problems are solved by optimizing the constraint ellipsoid of the estimation error subject to the underlying protocol. Simulation results demonstrate the effectiveness of the proposed filter design scheme.
URI: http://bura.brunel.ac.uk/handle/2438/13621
DOI: http://dx.doi.org/10.1016/j.automatica.2016.07.025
ISSN: 0005-1098
Appears in Collections:Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
Fulltext.pdf312.22 kBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.