Quickest Change Detection With Observation Scheduling

The quickest change detection problem is to detect an abrupt change event as quickly as possible subject to constraints on false detection. Unlike the classical problem, where the decision maker can access only one sequence of observations, in this paper, the decision maker chooses one of two differ...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on automatic control Vol. 62; no. 6; pp. 2635 - 2647
Main Authors:	Xiaoqiang Ren, Johansson, Karl H., Ling Shi
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.06.2017 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Alarm systems Algorithms Asymptotic properties Cameras Change detection Change detection algorithms Control charts CuSum Decision making Delay Delays minimax Monitoring multi-channel observation scheduling Optimization Probability theory quickest change detection Randomness Schedules Scheduling sensor networks Sensors Statistics
ISSN:	0018-9286, 1558-2523, 1558-2523
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!