pith. the verified trust layer for science. sign in

arxiv: 0910.4688 · v1 · pith:IOOIEOZUnew · submitted 2009-10-24 · 💻 cs.IT · math.IT

Quickest detection in coupled systems

classification 💻 cs.IT math.IT
keywords detectioncoupledproblemsensorsensorstimealarmsfalse
0
0 comments X p. Extension
Add this Pith Number to your LaTeX paper What is a Pith Number?
\usepackage{pith}
\pithnumber{IOOIEOZU}

Prints a linked pith:IOOIEOZU badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original abstract

This work considers the problem of quickest detection of signals in a coupled system of N sensors, which receive continuous sequential observations from the environment. It is assumed that the signals, which are modeled a general Ito processes, are coupled across sensors, but that their onset times may differ from sensor to sensor. The objective is the optimal detection of the first time at which any sensor in the system receives a signal. The problem is formulated as a stochastic optimization problem in which an extended average Kullback- Leibler divergence criterion is used as a measure of detection delay, with a constraint on the mean time between false alarms. The case in which the sensors employ cumulative sum (CUSUM) strategies is considered, and it is proved that the minimum of N CUSUMs is asymptotically optimal as the mean time between false alarms increases without bound.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.