Decentralized sequential detection

1 May 1989

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory

Vol. 35 (3) , 509-520
https://doi.org/10.1109/18.30973

Abstract

A class of decentralized sequential detection problems is investigated. Under appropriate independence assumptions, it is shown that at each time instant the optimal local strategies are given by threshold tests on the likelihood of ratios. Furthermore, local decisions depend not only on the present and past observations, but on the past local decision as well. That is, for each local processor a different threshold exists for every different sequence of past decisions. Examples, computational techniques, discussions of the difficulties at hand, and suggestions for further exploration of the problem are presented.

Keywords

This publication has 9 references indexed in Scilit:

The decentralized wald problem
Information and Computation, 1987
On the complexity of decentralized decision making and detection problems
IEEE Transactions on Automatic Control, 1985
The decentralized quickest detection problem
IEEE Transactions on Automatic Control, 1984
Detection networks
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1982
A simulation study of a decentralized detection problem
IEEE Transactions on Automatic Control, 1982
Algorithms for Distributed Detection Given Waveform Observations.
Published by Defense Technical Information Center (DTIC) ,1982
Distributed Detection with Waveform Observations: Correlated Observation Processes
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1982
Detection with Distributed Sensors
IEEE Transactions on Aerospace and Electronic Systems, 1981
Team decision theory and information structures
Proceedings of the IEEE, 1980