Abstract
The problem of sequential change detection and isolation under the Bayesian setting is investigated, where the change point is a random variable with a known distribution. A recursive algorithm is proposed, which utilizes the prior distribution of the change point. We show that the proposed decision procedure is guaranteed to control the false alarm probability and the false isolation probability separately under certain regularity conditions, and it is asymptotically optimal with respect to a Bayesian criterion.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
