Skip to Main content Skip to Navigation
Journal articles

Maximizing the probability of attaining a target prior to extinction

Debashis Chatterjee 1 Eugenio Cinquemani 2, * John Lygeros 1 
* Corresponding author
2 IBIS - Modeling, simulation, measurement, and control of bacterial regulatory networks
LAPM - Laboratoire Adaptation et pathogénie des micro-organismes [Grenoble], Inria Grenoble - Rhône-Alpes, Institut Jean Roget
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.
Complete list of metadata
Contributor : Team Microcosme / Team Ibis Connect in order to contact the contributor
Submitted on : Thursday, February 21, 2013 - 2:33:38 PM
Last modification on : Saturday, June 25, 2022 - 7:39:55 PM

Links full text




Debashis Chatterjee, Eugenio Cinquemani, John Lygeros. Maximizing the probability of attaining a target prior to extinction. Nonlinear Analysis: Hybrid Systems, Elsevier, 2011, 5, pp.367-381. ⟨10.1016/j.nahs.2010.12.003⟩. ⟨hal-00793042⟩



Record views