Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/6315
Full metadata record
DC FieldValueLanguage
dc.contributor.authorWang, Z-
dc.contributor.authorShen, B-
dc.contributor.authorLiu, X-
dc.date.accessioned2012-03-19T11:28:30Z-
dc.date.available2012-03-19T11:28:30Z-
dc.date.issued2012-
dc.identifier.citationAutomatica, 48(3): 556 - 562, Mar 2012en_US
dc.identifier.issn0005-1098-
dc.identifier.urihttp://www.sciencedirect.com/science/article/pii/S0005109812000222en
dc.identifier.urihttp://bura.brunel.ac.uk/handle/2438/6315-
dc.descriptionThis is the post-print version of the Article. The official published version can be accessed from the link below - Copyright @ 2012 Elsevieren_US
dc.description.abstractIn this paper, the H∞ filtering problem is investigated for a class of nonlinear systems with randomly occurring incomplete information. The considered incomplete information includes both the sensor saturations and the missing measurements. A new phenomenon of sensor saturation, namely, randomly occurring sensor saturation (ROSS), is put forward in order to better reflect the reality in a networked environment such as sensor networks. A novel sensor model is then established to account for both the ROSS and missing measurement in a unified representation by using two sets of Bernoulli distributed white sequences with known conditional probabilities. Based on this sensor model, a regional H∞ filter with a certain ellipsoid constraint is designed such that the filtering error dynamics is locally mean-square asymptotically stable and the H∞-norm requirement is satisfied. Note that the regional l2 gain filtering feature is specifically developed for the random saturation nonlinearity. The characterization of the desired filter gains is derived in terms of the solution to a convex optimization problem that can be easily solved by using the semi-definite program method. Finally, a simulation example is employed to show the effectiveness of the filtering scheme proposed in this paper.en_US
dc.description.sponsorshipThis work was supported in part by the Engineering and Physical Sciences Research Council (EPSRC) of the UK under Grant GR/S27658/01, the Royal Society of the UK, the National Natural Science Foundation of China under Grants 61028008 and 60974030, the National 973 Program of China under Grant 2009CB320600, and the Alexander von Humboldt Foundation of Germany.en_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.subjectRandomly occurring sensor saturationsen_US
dc.subjectMissing measurementsen_US
dc.subjectNonlinear systemsen_US
dc.subjectRegional H∞ filtersen_US
dc.subjectRandom incomplete informationen_US
dc.titleH-infinity filtering with randomly occurring sensor saturations and missing measurementsen_US
dc.typeArticleen_US
dc.identifier.doihttp://dx.doi.org/10.1016/j.automatica.2012.01.008-
pubs.organisational-data/Brunel-
pubs.organisational-data/Brunel/Brunel Active Staff-
pubs.organisational-data/Brunel/Brunel Active Staff/School of Info. Systems, Comp & Maths-
pubs.organisational-data/Brunel/Brunel Active Staff/School of Info. Systems, Comp & Maths/IS and Computing-
pubs.organisational-data/Brunel/University Research Centres and Groups-
pubs.organisational-data/Brunel/University Research Centres and Groups/School of Health Sciences and Social Care - URCs and Groups-
pubs.organisational-data/Brunel/University Research Centres and Groups/School of Health Sciences and Social Care - URCs and Groups/Centre for Systems and Synthetic Biology-
pubs.organisational-data/Brunel/University Research Centres and Groups/School of Information Systems, Computing and Mathematics - URCs and Groups-
pubs.organisational-data/Brunel/University Research Centres and Groups/School of Information Systems, Computing and Mathematics - URCs and Groups/Centre for Information and Knowledge Management-
Appears in Collections:Publications
Computer Science
Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
Fulltext.pdf201.92 kBAdobe PDFView/Open


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