Asymptotic Boundedness of Distributed Set-Membership Filtering
- 1 November 2026
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (11) , 7463-7470
Abstract
Asymptotic boundedness is a crucial property of Distributed Set-Membership Filtering (DSMFing) that prevents the unbounded growth of the set estimates caused by the wrapping effect. However, this important property remains underinvestigated, compared to its noise-free and stochastic-noise counterparts, i.e., the convergence of Distributed Observers (DOs) and the bounded error covariance of Distributed Kalman Filters (DKFs). This paper studies the asymptotic boundedness of DSMFing for linear discrete-time systems. A novel concept, termed the Distributed Observation-Information Tower (DOIT), is introduced to characterize the fundamental relationship between the structure of graphs and the set estimates, which enables the boundedness analysis. Leveraging the DOIT, an easily verifiable sufficient condition for the asymptotic boundedness of linear DSMFing is established. Surprisingly, the sufficient condition generalizes the well-known collective detectability condition for DOs and DKFs; it links DSMFs to existing distributed estimation methods and reveals the unique characteristic of DSMFs.Keywords
All Related Versions
Funding Information
- National Natural Science Foundation of China (62273079)
- Research Fund of State Key Laboratory of Synthetical Automation for Process Industries in China (2013ZCX01)
This publication has 27 references indexed in Scilit:
- Mean-shift-based robust distributed set-membership fusion filtering for sensor network systems with outliersAutomatica, 2025
- Stability of linear set-membership filters with respect to initial conditions: An observation-information perspectiveAutomatica, 2024
- Distributed state estimation for jointly observable linear systems over time-varying networksAutomatica, 2024
- A distributed set-membership estimator for linear systems with reduced computational requirementsAutomatica, 2021
- Distributed set-membership filtering for time-varying systems: A coding–decoding-based approachAutomatica, 2021
- Distributed estimation based on multi-hop subspace decompositionAutomatica, 2019
- Distributed set-membership observers for interconnected multi-rate systemsAutomatica, 2017
- Constrained zonotopes: A new tool for set-based estimation and fault detectionAutomatica, 2016
- Zonotopes and Kalman observers: Gain optimality under distinct uncertainty paradigms and robust convergenceAutomatica, 2015
- Kullback–Leibler average, consensus on probability densities, and distributed state estimation with guaranteed stabilityAutomatica, 2014