Abstract
SummaryThis article investigates the event‐triggered Kalman consensus filtering (ET‐KCF) problem for distributed sensor networks with intermittent observations. First, a novel ET consensus filtering structure is designed for sensor networks with intermittent observations. With the proposed consensus filtering structure, a new ET mechanism that is more efficient than the existed ones is designed to schedule transmissions of local estimates. Then, an optimal ET‐KCF in the sense of minimum mean‐square error is developed. For reducing the computational complexity of filtering algorithm, a suboptimal ET‐KCF is further proposed. Moreover, the stability of the suboptimal ET‐KCF is analyzed. Simulation results verify the validity and superiority of the proposed method.
Sign-in/Register to access full text options 
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 callMore From: International Journal of Adaptive Control and Signal Processing
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.
