Maximizing the probability of attaining a target prior to extinction - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Nonlinear Analysis: Hybrid Systems Year : 2011

Maximizing the probability of attaining a target prior to extinction

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.

Dates and versions

hal-00793042 , version 1 (21-02-2013)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook X LinkedIn More