Abstract
This work investigates some of the computational issues involved in the solution of probabilistic reachability problems for discrete-time, controlled stochastic hybrid systems. It is first argued that, under rather weak continuity assumptions on the stochastic kernels that characterize the dynamics of the system, the numerical solution of a discretized version of the probabilistic reachability problem is guaranteed to converge to the optimal one, as the discretization level decreases. With reference to a benchmark problem, it is then discussed how some of the structural properties of the hybrid system under study can be exploited to solve the probabilistic reachability problem more efficiently. Possible techniques that can increase the scale-up potential of the proposed numerical approximation scheme are suggested.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amin, S., et al.: Reachability analysis for controlled discrete time stochastic hybrid systems. In: Hespanha, J.P., Tiwari, A. (eds.) HSCC 2006. LNCS, vol. 3927, pp. 49–63. Springer, Heidelberg (2006)
Abate, A., et al.: Probabilistic Reachability for Safety and Regulation of Controlled Discrete-Time Stochastic Hybrid Systems. In: Proceedings of the 45th IEEE Conference on Decision and Control, San Diego, CA, December 2006, pp. 258–263. IEEE Computer Society Press, Los Alamitos (2006)
Bertsekas, D.: Convergence of Discretization Procedures in Dynamic Programming. IEEE Transactions on Automatic Control 20(3), 415–419 (1975)
Bertsekas, D.: Distributed Dynamic Programming. IEEE Transactions on Automatic Control 27(3), 610–616 (1982)
Kveton, B., Hauskrecht, M., Guestrin, C.: Solving factored MDPs with Hybrid State and Action Variables. Journal of Artificial Intelligence Research 27, 1–49 (2006)
Prandini, M., Hu, J.: Stochastic reachability: Theoretical foundations and numerical approximation. In: Cassandras, C., Lygeros, J. (eds.) Stochastic Hybrid Systems, CRC Press, Boca Raton (2006)
Fehnker, A., Ivancic, F.: Benchmarks for Hybrid Systems Verifications. In: Alur, R., Pappas, G.J. (eds.) HSCC 2004. LNCS, vol. 2993, pp. 326–341. Springer, Heidelberg (2004)
Mitchell, I., Templeton, J.: A Toolbox of Hamilton-Jacobi Solvers for Analysis of Nondeterministic Continuous and Hybrid Systems. In: Morari, M., Thiele, L. (eds.) HSCC 2005. LNCS, vol. 3414, pp. 480–494. Springer, Heidelberg (2005)
Bertsekas, D.P., Tsitsiklis, J.N.: Neuro-Dynamic Programming. Athena Scientific, Belmont (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Abate, A., Amin, S., Prandini, M., Lygeros, J., Sastry, S. (2007). Computational Approaches to Reachability Analysis of Stochastic Hybrid Systems. In: Bemporad, A., Bicchi, A., Buttazzo, G. (eds) Hybrid Systems: Computation and Control. HSCC 2007. Lecture Notes in Computer Science, vol 4416. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71493-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-71493-4_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71492-7
Online ISBN: 978-3-540-71493-4
eBook Packages: Computer ScienceComputer Science (R0)