skip to main content
10.1145/1967701.1967738acmconferencesArticle/Chapter ViewAbstractPublication PagescpsweekConference Proceedingsconference-collections
research-article

A stochastic reach-avoid problem with random obstacles

Published: 12 April 2011 Publication History

Abstract

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 avoid set 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 aircraft motion planning is provided.

References

[1]
A. Abate, S. Amin, M. Prandini, J. Lygeros, and S. Sastry. Computational approaches to reachability analysis of stochastic hybrid systems. In A. Bemporad, A. Bicchi, and G. C. Buttazzo, editors, Hybrid Systems: Computation and Control, volume 4416 of Lecture Notes in Computer Science, pages 4--17. Springer, 2007.
[2]
A. Abate, M. Prandini, J. Lygeros, and S. Sastry. Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems. Automatica, 44(11):2724--2734, November 2008.
[3]
S. A. Amburn and P. L. Wolf. VIL density as a hail indicator. Weather and Forecasting, 12(3):473--478, 1997.
[4]
S. Amin, A. Abate, M. Prandini, J. Lygeros, and S. Sastry. Reachability analysis for controlled discrete time stochastic hybrid systems. In Hespanha and Tiwari {15}, pages 49--63.
[5]
J.-P. Aubin. Viability theory. Birkhauser Boston Inc., Cambridge, MA, USA, 1991.
[6]
R. Bellman. Dynamic Programming. Princeton University Press, Princeton, New Jersey, USA, 1957.
[7]
D. P. Bertsekas and S. E. Shreve. Stochastic Optimal Control: The Discrete-Time Case. Athena Scientific, February 2007.
[8]
B. Boudevillain and H. Andrieu. Assessment of vertically integrated liquid (VIL) water content radar measurement. Journal of Atmospheric and Oceanic Technology, 20(6):807--819, 2003.
[9]
M. L. Bujorianu and J. Lygeros. Reachability questions in piecewise deterministic markov processes. In O. Maler and A. Pnueli, editors, Hybrid Systems: Computation and Control, volume 2623 of Lecture Notes in Computer Science, pages 126--140. Springer, 2003.
[10]
N. Cressie and G. M. Laslett. Random set theory and problems of modeling. SIAM Review, 29(4):pp. 557--574, December 1987.
[11]
M. Davis. Markov Models and Optimization. Chapman & Hall, London, 1993.
[12]
J. Evans, K. Carusone, M. Wolfson, B. Crowe, D. Meyer, and D. Klingle-Wilson. The Corridor Integrated Weather System (CIWS). In 10th Conference on Aviation, Range, and Aerospace Meteorology, 2001.
[13]
Y. Gao, J. Lygeros, and M. Quincampoix. On the Reachability Problem for Uncertain Hybrid Systems. IEEE Transactions on Automatic Control, 52(9):1572--1586, September 2007.
[14]
M. K. Ghosh, A. Arapostathis, and S. I. Marcus. Ergodic control of switching diffusions. SIAM J. Control Optim., 35(6):1952--1988, November 1997.
[15]
J. P. Hespanha and A. Tiwari, editors. Hybrid Systems: Computation and Control, volume 3927 of Lecture Notes in Computer Science. Springer, 2006.
[16]
J. Hu, J. Lygeros, and S. Sastry. Towards a theory of stochastic hybrid systems. In N. A. Lynch and B. H. Krogh, editors, Hybrid Systems: Computation and Control, volume 1790 of Lecture Notes in Computer Science, pages 160--173. Springer, 2000.
[17]
J. Lygeros. On reachability and minimum cost optimal control. Automatica, 40(6):917--927, 2004.
[18]
G. Matheron. Random Sets and Integral Geometry. Wiley, New York, 1975.
[19]
I. Mitchell. The flexible, extensible and efficient toolbox of level set methods. J. Sci. Comput., 35(2-3):300--329, 2008.
[20]
I. Mitchell and C. Tomlin. Level set methods for computation in hybrid systems. In Hybrid Systems: Computation and Control, pages 310--323, London, UK, 2000. Springer-Verlag.
[21]
I. Molchanov. Theory of Random Sets. Springer, New York, 2005.
[22]
F. Ramponi, D. Chatterjee, S. Summers, and J. Lygeros. On the connections between PCTL and dynamic programming. In HSCC '10: Proceedings of the 13th ACM international conference on Hybrid systems: computation and control, pages 253--262, New York, NY, USA, 2010. ACM.
[23]
W. Rudin. Real and complex analysis, 3rd ed. McGraw-Hill, Inc., New York, NY, USA, 1987.
[24]
D. Stoyan. Random sets: Models and statistics. International Statistical Review, 66(1):pp. 1--27, April 1998.
[25]
S. Summers and J. Lygeros. Verification of discrete time stochastic hybrid systems: A stochastic reach-avoid decision problem. Automatica, 46(12):1951--1961, 2010.
[26]
C. Tomlin, J. Lygeros, and S. Sastry. A Game Theoretic Approach to Controller Design for Hybrid Systems. Proceedings of IEEE, 88:949--969, July 2000.
[27]
C. Tomlin, G. J. Pappas, and S. Sastry. Conflict resolution for air traffic management: a study in multiagent hybrid systems. Automatic Control, IEEE Transactions on, 43(4):509--521, 1998.
[28]
C. J. Tomlin, I. Mitchell, A. M. Bayen, and M. Oishi. Computational techniques for the verification of hybrid systems. Proceedings of the IEEE, 91(7):986--1001, July 2003.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
HSCC '11: Proceedings of the 14th international conference on Hybrid systems: computation and control
April 2011
330 pages
ISBN:9781450306294
DOI:10.1145/1967701
  • General Chair:
  • Marco Caccamo,
  • Program Chairs:
  • Emilio Frazzoli,
  • Radu Grosu
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

In-Cooperation

  • IEEE

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 April 2011

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. dynamic programming
  2. markov processes
  3. random sets
  4. reachability

Qualifiers

  • Research-article

Conference

HSCC '11
Sponsor:
HSCC '11: Hybrid Systems: Computation and Control
April 12 - 14, 2011
IL, Chicago, USA

Acceptance Rates

Overall Acceptance Rate 153 of 373 submissions, 41%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)31
  • Downloads (Last 6 weeks)2
Reflects downloads up to 24 Jan 2025

Other Metrics

Citations

Cited By

View all

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media