Multi-Sensor Sequential Change Detection with Unknown Change Propagation Pattern
Mehmet Necip Kurt, Xiaodong Wang

TL;DR
This paper develops Bayesian change detection algorithms for multi-sensor systems with unknown change propagation patterns, providing near-optimal solutions and efficient sampling strategies for practical applications like infrastructure monitoring.
Contribution
It introduces a Bayesian framework for unknown change propagation, derives optimal and practical algorithms, and demonstrates improved performance with event-triggered sampling schemes.
Findings
Proposed multichart test is asymptotically optimal in rare change regime.
Algorithms based on online pattern estimation perform near-optimally.
Event-triggered sampling with LCSH improves detection efficiency over uniform sampling.
Abstract
The problem of detecting changes with multiple sensors has received significant attention in the literature. In many practical applications such as critical infrastructure monitoring and modeling of disease spread, a useful change propagation model is one where change eventually happens at all sensors, but where not all sensors witness change at the same time instant. While prior work considered the case of known change propagation dynamics, this paper studies a more general setting of unknown change propagation pattern (trajectory). A Bayesian formulation of the problem in both centralized and decentralized settings is studied with the goal of detecting the first time instant at which any sensor witnesses a change. Using the dynamic programming (DP) framework, the optimal solution structure is derived and in the rare change regime, several more practical change detection algorithms are…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
