Cart (Loading....) | Create Account
Close category search window
 

Constrained Partially Observed Markov Decision Processes With Probabilistic Criteria for Adaptive Sequential Detection

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Chen, R.C. ; Naval Res. Lab., Washington, DC, USA ; Wagner, K. ; Blankenship, G.L.

Dynamic programming equations are derived which characterize the optimal value functions for a partially observed constrained Markov decision process problem with both total cost and probabilistic criteria. More specifically, the goal is to minimize an expected total cost subject to a constraint on the probability that another total cost exceeds a prescribed threshold. The Markov decision process is partially observed, but it is assumed that the constraint costs are available to the controller, i.e., they are fully observed. The problem is motivated by an adaptive sequential detection application. The application of the dynamic programming results to optimal adaptive truncated sequential detection is demonstrated using an example involving the optimization of a radar detection process.

Published in:

Automatic Control, IEEE Transactions on  (Volume:58 ,  Issue: 2 )

Date of Publication:

Feb. 2013

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.