Quickest Change Detection for UAV-Based Sensing
- 25 May 2026
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 74 (1053587X) , 2114-2127
Abstract
This paper addresses the problem of quickest change detection (QCD) at two spatially separated locations monitored by a single unmanned aerial vehicle (UAV) equipped with a sensor. At any location, the UAV observes i.i.d. data sequentially in discrete time instants. The distribution of the observation data changes at some unknown, arbitrary time and the UAV has to detect this change in the shortest possible time. Change can occur at most at one location over the entire infinite time horizon. The UAV switches between these two locations in order to quickly detect the change. To this end, we propose Location Switching and Change Detection (LS-CD) algorithm which uses a repeated one-sided sequential probability ratio test (SPRT) based mechanism for observation-driven location switching and change detection. The primary goal is to minimize the worst-case average detection delay (WADD) while meeting constraints on the average run length to false alarm (ARL2FA) and the UAV’s time-averaged energy consumption. We provide a rigorous theoretical analysis of the algorithm’s performance by using theory of random walk. Specifically, we derive tight upper and lower bounds to its ARL2FA and a tight upper bound to its WADD. In the special case of a symmetrical setting, our analysis leads to a new asymptotic upper bound to the ARL2FA of the standard CUSUM algorithm, a novel contribution not available in the literature, to our knowledge. Numerical simulations demonstrate the efficacy of LS-CD.Keywords
All Related Versions
Funding Information
- Faculty Seed Grant and Professional Development Allowance of IIT Delhi
This publication has 26 references indexed in Scilit:
- Bandit Algorithms2020
- Multistream quickest change detection: Asymptotic optimality under a sparse signal2017
- Data-Efficient Minimax Quickest Change Detection in a Decentralized SystemSequential Analysis, 2015
- Sequential Change-Point Detection When the Pre- and Post-Change Parameters are UnknownSequential Analysis, 2010
- Efficient scalable schemes for monitoring a large number of data streamsBiometrika, 2010
- Stopped Random Walks2009
- Quickest Detection2008
- Decentralized quickest change detectionIEEE Transactions on Information Theory, 2001
- Information bounds and quick detection of parameter changes in stochastic systemsIEEE Transactions on Information Theory, 1998
- Sequential Analysis1985