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.


A stochastic reach-avoid decision problem with random sets


S. Summers, M. Kamgarpour, C. J. Tomlin, J. Lygeros

HSCC (Hybrid Systems: Computation and Control )

We present a dynamic programming based solution to a stochastic reachability problem for a controlled discrete time stochastic hybrid system. 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 obstacle set during each time step preceding the target hitting time. In contrast with earlier works which consider the reach and avoid sets as both deterministic and time invariant, we consider the reach and avoid sets to be both time-varying and probabilistic. Optimal reach-avoid control policies are derived as the solution to an optimal control problem via dynamic programming. A computational example motivated by autonomous surveillance is provided.


Type of Publication:


File Download:

Request a copy of this publication.
(Uses JavaScript)
% Autogenerated BibTeX entry
@InProceedings { SumEtal:2011:IFA_3856,
    author={S. Summers and M. Kamgarpour and C. J. Tomlin and J. Lygeros},
    title={{A stochastic reach-avoid decision problem with random sets}},
    booktitle={HSCC (Hybrid Systems: Computation and Control )},
Permanent link