Note: This content is accessible to all versions of every browser. However, this browser does not seem to support current Web standards, preventing the display of our site's design details.

  

Maximizing the probability of attaining a target prior to extinction

Author(s):

D. Chatterjee, E. Cinquemani, J. Lygeros
Conference/Journal:

http://dx.doi.org/10.1016/j.nahs.2010.12.003, Nonlinear Analysis: Hybrid Systems, vol. 5, no. 2, pp. 367381, Also available at http://arxiv.org/abs/0904.4143
Abstract:

We present a dynamic programming-based solution to the problem of maximizing the probability of attaining a target set before hitting a cemetery set for a discrete-time Markov control process. Under mild hypotheses we establish that there exists a deterministic stationary policy that achieves the maximum value of this probability. We demonstrate how the maximization of this probability can be computed through the maximization of an expected total reward until the first hitting time to either the target or the cemetery set. Martingale characterizations of thrifty, equalizing, and optimal policies in the context of our problem are also established.

Year:

2011
Type of Publication:

(01)Article
Supervisor:

J. Lygeros

File Download:

Request a copy of this publication.
(Uses JavaScript)
% Autogenerated BibTeX entry
@Article { ChaCin:2011:IFA_3294,
    author={D. Chatterjee and E. Cinquemani and J. Lygeros},
    title={{Maximizing the probability of attaining a target prior to
	  extinction}},
    journal={Nonlinear Analysis: Hybrid Systems},
    year={2011},
    volume={5},
    number={2},
    pages={367381},
    month=may,
    url={http://control.ee.ethz.ch/index.cgi?page=publications;action=details;id=3294}
}
Permanent link