Skip to main content

Decidable Controller Synthesis for Classes of Linear Systems

  • Conference paper
  • First Online:
Hybrid Systems: Computation and Control (HSCC 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1790))

Included in the following conference series:

Abstract

A problem of great interest in the control of hybrid systems is the design of least restrictive controllers for reachability specifications. Controller design typically uses game theoretic methods which compute the region of the state space for which there exists a control such that for all disturbances, an unsafe set is not reached. In general, the computation of the controllers requires the steady state solution of a Hamilton-Jacobi-Isaacs partial differential equation which is very difficult to compute, if it exists. In this paper, we show that for classes of linear systems, the controller synthesis problem is decidable: There exists a computational algorithm which, after a finite number of steps, will exactly compute the least restrictive controller. This result is achieved by a very interesting interaction of results from mathematical logic and optimal control.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Asarin, O. Maler, and A. Pnueli. Symbolic controller synthesis for discrete and timed systems. In P. Antsaklis, W. Kohn, A. Nerode, and S. Sastry, editors, Hybrid Systems II, volume 999 of Lecture Notes in Computer Science. Springer-Verlag, 1995.

    Google Scholar 

  2. T. BaÅŸar and G.J. Olsder. Dynamic Noncooperative Game Theory. Academic Press, 2nd edition, 1995.

    Google Scholar 

  3. A. Church. Logic, arithmetic, and automata. In Proceedings of the International Congress of Mathematics, pages 23–35, 1962.

    Google Scholar 

  4. G.E. Collins and H. Hong. Partial cylindrical algebraic decomposition for quantifier elimination. Journal of Symbolic Computation, 12:299–328, September 1991.

    Article  MATH  MathSciNet  Google Scholar 

  5. A. Dolzman and T. Sturm. REDLOG: Computer algebra meets computer logic. ACM SIGSAM Bulletin, 31(2):2–9, June 1997.

    Article  Google Scholar 

  6. D.E. Kirk. Optimal Control Theory, An Introduction. Prentice Hall, 1970.

    Google Scholar 

  7. G. Lafferriere, G. J. Pappas, and S. Sastry. O-minimal hybrid systems. Mathematics of Control, Signals, and Systems. To appear.

    Google Scholar 

  8. G. Lafferriere, G. J. Pappas, and S. Yovine. A new class of decidable hybrid systems. In Hybrid Systems: Computation and Control, volume 1569 of Lecture Notes in Computer Science, pages 137–151. Springer Verlag, 1999.

    Chapter  Google Scholar 

  9. G. Lafferriere, G. J. Pappas, and Sergio Yovine. Reachability computation for linear hybrid systems. In Proceedings of the 14th IFAC World Congress, volume E, pages 7–12, Beijing, P.R. China, July 1999.

    Google Scholar 

  10. J. Lewin. Differential Games. Springer Verlag, 1994.

    Google Scholar 

  11. J. Lygeros, D.N. Godbole, and S. Sastry. Verified hybrid controllers for automated vehicles. IEEE Transactions on Automatic Control, 43(4):522–539, April 1998.

    Article  MATH  MathSciNet  Google Scholar 

  12. J. Lygeros, C. Tomlin, and S.S. Sastry. Controllers for reachability specifications for hybrid systems. Automatica, 35(3):349–370, March 1999.

    Article  MATH  MathSciNet  Google Scholar 

  13. L.S. Pontryagin, V. Boltyanskii, R. Gamkrelidze, and E. Mischenko. The Mathematical Theory of Optimal Processes. John Wiley & Sons, 1962.

    Google Scholar 

  14. A. Tarski. A decision method for elementary algebra and geometry. University of California Press, second edition, 1951.

    Google Scholar 

  15. W. Thomas. On the synthesis of strategies in infinite games. In Ernst W. Mayr and Claude Puech, editors, Proceedings of STACS 95, Volume 900 of LNCS, pages 1–13. Springer Verlag, Munich, 1995.

    Google Scholar 

  16. C. Tomlin, G. J. Pappas, and S. Sastry. Conflict resolution for air traffic management: A study in muti-agent hybrid systems. IEEE Transactions on Automatic Control, 43(4):509–521, April 1998.

    Article  MATH  MathSciNet  Google Scholar 

  17. L. van den Dries. Tame Topology and o-minimal structures. Cambridge University Press, 1998.

    Google Scholar 

  18. H. Wong-Toi. The synthesis of controllers for linear hybrid automata. In Proceedings of the 36th IEEE Conference on Decision and Control, San Diego, CA, December 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shakernia, O., Pappas, G.J., Sastry, S. (2000). Decidable Controller Synthesis for Classes of Linear Systems. In: Lynch, N., Krogh, B.H. (eds) Hybrid Systems: Computation and Control. HSCC 2000. Lecture Notes in Computer Science, vol 1790. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46430-1_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-46430-1_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67259-3

  • Online ISBN: 978-3-540-46430-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics