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.


On stochastic reach-avoid problem and set characterization for diffusions


P. Mohajerin Esfahani, D. Chatterjee, J. Lygeros

Automatica, accepted for publication (arXiv:1202.4375)

We develop a novel framework for formulating a class of stochastic reachability problems with state constraints as a stochastic optimal control problem. Previous approaches to solving these problems are either confined to the deterministic setting or address almost-sure stochastic notions. In contrast, we propose a new methodology to tackle probabilistic specifications that are less specific than almost sure requirements. To this end, we first establish a connection between two stochastic reach-avoid problems and classes of different stochastic optimal control problems for diffusions with discontinuous payoff functions. In the sequel, we shall focus on one of the class of stochastic optimal control problem, exit-time problem, which indeed addresses both reachability type questions. We derive a weak version of dynamic programming principle (DPP) for the value functions. Moreover, based on our DPP, we give an alternative characterization of the value function as the solution to a partial differential equation in the sense of discontinuous viscosity solutions along with Dirichlet type boundary conditions. Finally we validate the performance of the proposed framework on the stochastic Zermelo navigation problem.


Type of Publication:


J. Lygeros

File Download:

Request a copy of this publication.
(Uses JavaScript)
% Autogenerated BibTeX entry
@Article { EsfCha:2015:IFA_3772,
    author={P. Mohajerin Esfahani and D. Chatterjee and J. Lygeros},
    title={{On stochastic reach-avoid problem and set characterization
	  for diffusions}},
Permanent link