Decidable controller synthesis for classes of linear systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1790, Issue , 2000, Pages 407-420

  Shakernia, Omid ^a   Pappas, George J ^a,b   Sastry, Shankar ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; GAME THEORY; HYBRID SYSTEMS; LINEAR SYSTEMS;

COMPUTATIONAL ALGORITHM; CONTROLLER DESIGNS; CONTROLLER SYNTHESIS; FINITE NUMBER; GAME-THEORETIC; HAMILTON-JACOBI-ISAACS PARTIAL DIFFERENTIAL EQUATIONS; OPTIMAL CONTROLS; STEADY STATE SOLUTION;

CONTROLLERS;

EID: 84974687091     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46430-1_34     Document Type: Conference Paper

References (18)

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.
2. T. Başar and G.J. Olsder. Dynamic Noncooperative Game Theory. Academic Press, 2nd edition, 1995.
3. A. Church. Logic, arithmetic, and automata. In Proceedings of the International Congress of Mathematics, pages 23-35, 1962.
4. G.E. Collins and H. Hong. Partial cylindrical algebraic decomposition for quanti_er elimination. Journal of Symbolic Computation, 12:299-328, September 1991.
5. A. Dolzman and T. Sturm. REDLOG: Computer algebra meets computer logic. ACM SIGSAM Bulletin, 31(2):2-9, June 1997.
6. D.E. Kirk. Optimal Control Theory, An Introduction. Prentice Hall, 1970.
7. G. Lafferriere, G. J. Pappas, and S. Sastry. O-minimal hybrid systems. Mathematics of Control, Signals, and Systems. To appear.
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.
9. G. La_erriere, 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.
10. J. Lewin. Differential Games. Springer Verlag, 1994.
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.
12. J. Lygeros, C. Tomlin, and S.S. Sastry. Controllers for reachability specifications for hybrid systems. Automatica, 35(3):349-370, March 1999.
13. L.S. Pontryagin, V. Boltyanskii, R. Gamkrelidze, and E. Mischenko. The Mathe- matical Theory of Optimal Processes. John Wiley & Sons, 1962.
14. A. Tarski. A decision method for elementary algebra and geometry. University of California Press, second edition, 1951.
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.
16. C. Tomlin, G. J. Pappas, and S. Sastry. Conflict resolution for air trafic management: A study in muti-agent hybrid systems. IEEE Transactions on Automatic Control, 43(4):509-521, April 1998.
17. L. van den Dries. Tame Topology and o-minimal structures. Cambridge University Press, 1998.
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.