Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2509.14106

Asymptotic Boundedness of Distributed Set-Membership Filtering

Yudong Li·Yirui Cong·Shimin Wang·Martin Guay·Jiuxiang Dong
View original source ↗Read source document ↗Export metadata ↓

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 Collective Observation-Information Tower (COIT), is introduced to characterize the fundamental relationship between the structure of graphs and the set estimates, which enables the boundedness analysis. Leveraging the COIT, 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.

Explore related subjects

eess.SYcs.SY

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yudong Li, Yirui Cong, Shimin Wang, Martin Guay, Jiuxiang Dong. 2025-09-17. Asymptotic Boundedness of Distributed Set-Membership Filtering. https://arxiv.org/abs/2509.14106

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Structured Stochastic Representations of Integrated Dynamic Strategies

Dynamic allocation decisions couple present resource use to evolving internal conditions, delayed returns, and future costs. We represent this interaction by four probability localizations linked through regime-indexed, graph-constrained column-stochastic operators. Pre-action state or context selects a locally affine model, while action-dependent changes update subsequent regimes, yielding a causal switched representation of nonlinear evolution. We characterize operator identifiability relative to the graph, the stochastic constraints, and the sampled embedding, separating coefficient recovery from predictive equivalence on the decision domain. Decision making is then formulated through implementable return--cost acceptability regions. Finite-horizon error propagation supplies conservative classification margins, and simultaneous intervals distinguish model-relative near-optimality from certified $\epsilon$-optimality over a declared finite policy class. Regime-indexed stochastic feedback is admitted when it satisfies the same certification test. Reproducible synthetic laboratories for personal preparation, supplier participation, and customer retention illustrate exact, operator-supplied, and noisy feedback cases. Multinomial experiments show improving recovery of the feedback function and fewer unresolved decisions with increasing sample size, while unrestricted off-policy recovery remains limited. The contribution is a structure-preserving representation--identification--decision workflow, not a domain-specific physiological or commercial calibration.

eess.SY↗
arXiv2026

Fusion Estimation in Multi-sensor Systems for Data Packets with Disrupted Identities

In this paper, we explore the problem of fusion estimation for a multi-sensor system where the identity of the data packet received by each sensor may be disrupted or incorrect due to confusion in device identity allocation, communication protocol defects, or the lack of a clear sensor identifier. This can result in a random shuffle of the data components during the fusion estimation process, compromising the performance of the fusion estimation. To address this issue, we introduce the concepts of permutations and symmetry groups to describe this phenomenon as data packet permutation. We construct statistics to simplify the information set, developing two algorithms: a Bayesian approach, which performs fusion using posterior arrangement probabilities, and a greedy approach, which effectively improves estimation performance by guessing the likely data arrangement. We compare these two algorithms and demonstrate that both are expectation error-bounded. We improve algorithms for information-scarce scenarios. By employing the expectation-maximization algorithm, we fill in the prior information of data arrangement where the correct convergence is proven. Finally, we present numerical simulations to validate our results.

eess.SY↗
arXiv2026

Quantifying the Reality Gap for RL-Based UAV Placement at mmWave and Sub-THz

Reinforcement learning (RL) policies for unmanned aerial vehicle (UAV) placement in mmWave and sub-terahertz networks are typically trained on simplified analytical channels. We quantify the resulting sim-to-real gap on a real urban map of Doha, Qatar, at carriers {28, 140, 183, 300} GHz and altitudes {50, 75, 100, 125} m, evaluating three channel pipelines: an analytical model (FSPL + atmospheric absorption + cuboid LoS), full Monte-Carlo ray tracing in Sionna RT with ITU-R P.676-13 absorption, and a deterministic-LoS hybrid that reuses Sionna's mesh under a closed-form path-gain expression. We formalize the gap on the spatial SNR distribution via four metrics, namely bias, RMSE, Jensen-Shannon divergence, and optimum-deployment displacement. Three findings emerge: at 28/140 GHz, $\sim$70% of the apparent -5.6/-4.8 dB Sionna bias is Monte-Carlo undersampling and shrinks to -1.7/-1.5 dB after mitigation; at 183 GHz a -9.2 dB residual isolates the atmospheric absorption / ITU-R P.676 line-shape disagreement; at 300 GHz the stochastic ray tracer agrees with the analytical model only coincidentally, with a +3.8 dB structural offset exposed by the deterministic-LoS pipeline. Across all carriers the linear-domain regret of the analytical-trained policy stays $\geq$ 0.93, indicating practical near-optimality but with a carrier-resolved SNR bias that warrants explicit reporting.

eess.SY↗