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.

  

Verification of discrete time stochastic hybrid systems: A stochastic reach-avoid decision problem

Author(s):

S. Summers, J. Lygeros
Conference/Journal:

Automatica, vol. 46, no. 12, pp. 1951 - 1961
Abstract:

We present a dynamic programming based solution to a probabilistic reach-avoid problem for a controlled discrete time stochastic hybrid system. We address two distinct interpretations of the reach-avoid problem via stochastic optimal control. In the first case, a sum-multiplicative cost function is introduced along with a corresponding dynamic recursion which quantifies the probability of hitting a target set at some point during a finite time horizon, while avoiding an unsafe set during each time step preceding the target hitting time. In the second case, we introduce a multiplicative cost function and a dynamic recursion which quantifies the probability of hitting a target set at the terminal time, while avoiding an unsafe set during the preceding time steps. In each case, optimal reach while avoid control policies are derived as the solution to an optimal control problem via dynamic programming. Computational examples motivated by two practical problems in the management of fisheries and finance are provided.

Year:

2010
Type of Publication:

(01)Article
Supervisor:



File Download:

Request a copy of this publication.
(Uses JavaScript)
@article{Summers20101951,
title = "Verification of discrete time stochastic hybrid systems: A stochastic reach-avoid decision problem",
journal = "Automatica",
volume = "46",
number = "12",
pages = "1951 - 1961",
year = "2010",
note = "",
issn = "0005-1098",
doi = "DOI: 10.1016/j.automatica.2010.08.006",
author = "Sean Summers and John Lygeros"
}
Permanent link