Abstract

A distributed set-membership filtering algorithm is proposed for a class of nonlinear system with sensor networks with the stochastic communication protocol (SCP). The system in this paper is subject to unknown but bounded noises and a kind of nonlinearity linearized via Taylor expansion formula. Via using the SCP technology, any node in the sensor network could receive information from only one of its neighbor nodes randomly at each moment. Other neighbor nodes intending to communicate with the node need to wait for a random interval till the channel is free for the waiting node. By means of recursive linear matrix inequalities (RLMIs), sufficient conditions are established for the existence of the desired filter parameters to guarantee the state estimate contained in the certain ellipsoidal region. Then an optimization problem minimizing the ellipsoids (in the sense of matrix trace) is raised up to improve the performance of the filter. Finally, a simulation example is given to illustrate the effectiveness of the proposed filtering algorithm.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.