Modeling and quickest detection of a rapidly approaching object
From MaRDI portal
Publication:6185928
DOI10.1080/07474946.2023.2247020arXiv2303.02324OpenAlexW4389078306MaRDI QIDQ6185928FDOQ6185928
Authors: Taposh Banerjee, R. K. Mishra
Publication date: 9 January 2024
Published in: Sequential Analysis (Search for Journal in Brave)
Abstract: The problem of detecting the presence of a signal that can lead to a disaster is studied. A decision-maker collects data sequentially over time. At some point in time, called the change point, the distribution of data changes. This change in distribution could be due to an event or a sudden arrival of an enemy object. If not detected quickly, this change has the potential to cause a major disaster. In space and military applications, the values of the measurements can stochastically grow with time as the enemy object moves closer to the target. A new class of stochastic processes, called exploding processes, is introduced to model stochastically growing data. An algorithm is proposed and shown to be asymptotically optimal as the mean time to a false alarm goes to infinity.
Full work available at URL: https://arxiv.org/abs/2303.02324
minimax optimalitystochastic dominancenonstationary processesmonotone likelihood ratioquickest change detection
Cites Work
- Optimal stopping times for detecting changes in distributions
- Information bounds and quick detection of parameter changes in stochastic systems
- Title not available (Why is that?)
- Procedures for Reacting to a Change in Distribution
- Optimal detection of a change in distribution
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quickest Detection
- Asymptotically optimal pointwise and minimax quickest change-point detection for dependent data
- General Asymptotic Bayesian Theory of Quickest Change Detection
- Minimax Robust Quickest Change Detection
- Partially observed Markov decision processes. From filtering to controlled sensing
- On Asymptotic Optimality in Sequential Changepoint Detection: Non-iid Case
- Probability-2
- Data-Efficient Quickest Change Detection in Minimax Settings
- A Bayesian Theory of Change Detection in Statistically Periodic Random Processes
Cited In (1)
This page was built for publication: Modeling and quickest detection of a rapidly approaching object
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6185928)