*banner
 

Reachability Analysis of Controlled Discrete-Time Stochastic Hybrid Systems
S. Amin, A. Abate, M. Prandini, J. Lygeros, S. Sastry

Citation
S. Amin, A. Abate, M. Prandini, J. Lygeros, S. Sastry. "Reachability Analysis of Controlled Discrete-Time Stochastic Hybrid Systems". Hybrid Systems: Computation and Control, Proceedings of the 9th International Workshop, Santa Barbara, CA, vol. 3927 of Lecture Notes in Computer Science, J. Hespanha and A. Tiwari (eds.), Springer-Verlag, pp. 49-63, March, 2006.

Abstract
In this research, a model for discrete time stochastic hybrid systems is proposed. With reference to the introduced class of systems, a methodology for probabilistic reachability analysis is studied, which can be useful for safety verification. This methodology is based on the interpretation of the safety verification problem as an optimal control problem for a certain controlled Markov process. In particular, this allows us to characterize through some optimal cost function the set of initial conditions for the system such that its state can be maintained within a given "safe" set with sufficiently high probability.

Electronic downloads

Citation formats  
  • HTML
    S. Amin, A. Abate, M. Prandini, J. Lygeros, S. Sastry. <a
    href="http://chess.eecs.berkeley.edu/pubs/99.html"
    >Reachability Analysis of Controlled Discrete-Time
    Stochastic Hybrid Systems</a>, Hybrid Systems:
    Computation and Control, Proceedings of the 9th
    International Workshop, Santa Barbara, CA, vol. 3927 of
    Lecture Notes in Computer Science, J. Hespanha and A. Tiwari
    (eds.), Springer-Verlag, pp. 49-63, March, 2006.
  • Plain text
    S. Amin, A. Abate, M. Prandini, J. Lygeros, S. Sastry.
    "Reachability Analysis of Controlled Discrete-Time
    Stochastic Hybrid Systems". Hybrid Systems: Computation
    and Control, Proceedings of the 9th International Workshop,
    Santa Barbara, CA, vol. 3927 of Lecture Notes in Computer
    Science, J. Hespanha and A. Tiwari (eds.), Springer-Verlag,
    pp. 49-63, March, 2006.
  • BibTeX
    @inproceedings{AminAbatePrandiniLygerosSastry06_ReachabilityAnalysisOfControlledDiscreteTimeStochastic,
        author = {S. Amin and A. Abate and M. Prandini and J.
                  Lygeros and S. Sastry},
        title = {Reachability Analysis of Controlled Discrete-Time
                  Stochastic Hybrid Systems},
        booktitle = {Hybrid Systems: Computation and Control,
                  Proceedings of the 9th International Workshop,
                  Santa Barbara, CA, vol. 3927 of Lecture Notes in
                  Computer Science},
        editor = {J. Hespanha and A. Tiwari},
        organization = {Springer-Verlag},
        pages = {pp. 49-63},
        month = {March},
        year = {2006},
        abstract = {In this research, a model for discrete time
                  stochastic hybrid systems is proposed. With
                  reference to the introduced class of systems, a
                  methodology for probabilistic reachability
                  analysis is studied, which can be useful for
                  safety verification. This methodology is based on
                  the interpretation of the safety verification
                  problem as an optimal control problem for a
                  certain controlled Markov process. In particular,
                  this allows us to characterize through some
                  optimal cost function the set of initial
                  conditions for the system such that its state can
                  be maintained within a given "safe" set with
                  sufficiently high probability. },
        URL = {http://chess.eecs.berkeley.edu/pubs/99.html}
    }
    

Posted by Alessandro Abate on 15 May 2006.
For additional information, see the Publications FAQ or contact webmaster at chess eecs berkeley edu.

Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.

©2002-2018 Chess