(Sub)regular robotic languages

2011 19th Mediterranean Conference on Control and Automation, MED 2011

Volumn , Issue , 2011, Pages 321-326

  Rawal, Chetan ^a   Tanner, Herbert G ^a   Heinz, Jeffrey ^a  

^a UNIVERSITY OF DELAWARE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONALLY EFFICIENT; CONSTRUCT MODELS; CONTINUOUS DYNAMICS; FORMAL LANGUAGE THEORY; MODEL ROBOT; NATURAL LANGUAGES; PATTERN ACQUISITION;

FORMAL LANGUAGES; HYBRID SYSTEMS; LINGUISTICS; ROBOTS;

ROBOTICS;

EID: 80052381932     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MED.2011.5983140     Document Type: Conference Paper

References (32)

1. Rajeev Alur, Thao Dang, and Franjo Ivančić. Predicate abstraction for reachability analysis of hybrid systems. ACM Trans. Embed. Comput. Syst., 5:152-199, February 2006.
2. C. Belta, A. Bicchi, M. Egerstedt, E. Frazzoli, E. Klavins, and G.J. Pappas. Symbolic planning and control of robot motion [grand challenges of robotics]. Robotics Automation Magazine, IEEE, 14(1):61-70, 2007. (Pubitemid 46566619)
3. C. Belta, V. Isler, and G.J. Pappas. Discrete abstractions for robot motion planning and control in polygonal environments. Robotics, IEEE Transactions on, 21(5):864-874, 2005. (Pubitemid 41489338)
4. R.W. Brockett. On the computer control of movement. In Robotics and Automation, 1988. Proceedings., 1988 IEEE International Conference on, pages 534-540 vol.1, April 1988.
5. Magnus Egerstedt. Motion Description Languages for Multi-Modal Control in Robotics, volume 4, pages 75-89. Springer Berlin / Heidelberg, 2003.
6. G.E. Fainekos, H. Kress-Gazit, and G.J. Pappas. Temporal logic motion planning for mobile robots. In Robotics and Automation, 2005. ICRA 2005. Proceedings of the 2005 IEEE International Conference on, pages 2020-2025, 2005. (Pubitemid 46084085)
7. E. Frazzoli, M.A. Dahleh, and E. Feron. Maneuver-based motion planning for nonlinear systems with symmetries. Robotics, IEEE Transactions on, 21(6):1077-1091, 2005. (Pubitemid 43033746)
8. Paul Gastin and Denis Oddoux. Fast ltl to büchi automata translation. In Gérard Berry, Hubert Comon, and Alain Finkel, editors, Computer Aided Verification, volume 2102 of Lecture Notes in Computer Science, pages 53-65. Springer Berlin / Heidelberg, 2001. 10.1007/3-540-44585-4 6. (Pubitemid 33312904)
9. Antoine Girard and George J. Pappas. Hierarchical control system design using approximate simulation. Automatica, 45:566-571, 2009.
10. Susanne Graf and Hassen Saidi. Construction of abstract state graphs with pvs. In Orna Grumberg, editor, Computer Aided Verification, volume 1254 of Lecture Notes in Computer Science, pages 72-83. Springer Berlin / Heidelberg, 1997. 10.1007/3-540-63166-6 10. (Pubitemid 127088966)
11. Jeffrey Heinz. String extension learning. In Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics, pages 897-906, Uppsala, Sweden, July 2010. Association for Computational Linguistics.
12. Gerard J. Holzmann. The model checker spin. IEEE Trans. Softw. Eng., 23:279-295, May 1997. (Pubitemid 127828295)
13. John E. Hopcroft and Jeffrey D. Ullman. Formal languages and their relation to automata. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1969.
14. D. Hristu and S. B. Andersson. Symbolic feedback control for navigation. IEEE Transactions on Automatic Control, 51(6):926-937, 2006. (Pubitemid 43997243)
15. D. Hristu-Varsakelis, M. Egerstedt, and P.S. Krishnaprasad. On the structural complexity of the motion description language mdle. In Decision and Control, 2003. Proceedings. 42nd IEEE Conference on, volume 4, pages 3360-3365 vol.4, 2003.
16. E. Klavins, R. Ghrist, and D. Lipsky. A grammatical approach to self-organizing robotic systems. IEEE Transactions on Automatic Control, 51(6):949-962, 2006. (Pubitemid 43997245)
17. Marius Kloetzer and Calin Belta. A fully automated framework for control of linear systems from ltl specifications. In João Hespanha and Ashish Tiwari, editors, Hybrid Systems: Computation and Control, volume 3927 of Lecture Notes in Computer Science, pages 333-347. Springer Berlin / Heidelberg, 2006. 10.1007/11730637 26. (Pubitemid 44019596)
18. V. Manikonda, P.S. Krishnaprasad, and J. Hendler. A motion description language and a hybrid architecture for motion planning with nonholonomic robots. In Robotics and Automation, 1995. Proceedings., 1995 IEEE International Conference on, volume 2, pages 2021-2028 vol.2, May 1995.
19. Robert McNaughton and Seymour A. Papert. Counter-Free Automata (M.I.T. research monograph no. 65). The MIT Press, 1971.
20. J.L. Piovesan, H.G. Tanner, and C.T. Abdallah. Discrete asymptotic abstractions of hybrid systems. In Decision and Control, 2006 45th IEEE Conference on, pages 917-922, 2006. (Pubitemid 351283686)
21. James Rogers. Aural pattern recognition experiments and the subregular hierarchy. In 10th Mathematics of Language Conference, pages 1-7, 2007.
22. James Rogers, Jeffrey Heinz, Gil Bailey, Matt Edlefsen, Molly Visscher, David Wellcome, and Sean Wibel. On languages piecewise testable in the strict sense. In Christian Ebert, Gerhard Jäger, and Jens Michaelis, editors, The Mathematics of Language, volume 6149 of Lecture Notes in Computer Science, pages 255-265. Springer Berlin / Heidelberg, 2010. 10.1007/978-3-642-14322-9 19.
23. Imre Simon. Piecewise testable events. In H. Brakhage, editor, Automata Theory and Formal Languages 2nd GI Conference Kaiserslautern, May 20-23, 1975, volume 33 of Lecture Notes in Computer Science, pages 214-222. Springer Berlin / Heidelberg, 1975. 10.1007/3-540-07407-4 23.
24. Imre Simon. Piecewise testable events. In Automata Theory and Formal Languages, pages 214-222. 1975.
25. P. Tabuada. Symbolic sub-systems and symbolic control of linear systems. In Decision and Control, 2005 and 2005 European Control Conference. CDC-ECC '05. 44th IEEE Conference on, pages 18-23, 2005. (Pubitemid 46296935)
26. P. Tabuada and G.J. Pappas. Linear time logic control of discretetime linear systems. Automatic Control, IEEE Transactions on, 51(12):1862-1877, 2006. (Pubitemid 46002281)
27. Paulo Tabuada. Approximate simulation relations and finite abstractions of quantized control systems. In A. Bemporad, A. Bicchi, and G. Buttazzo, editors, Hybrid Systems: Computation and Control, volume 4416 of Lecture Notes in Computer Science, pages 529-542. Springer-Verlag, 2007.
28. Herbert G. Tanner, Chetan Rawal, Jie Fu, Jorge L. Piovesan, and Chaouki T. Abdallah. Finite asymptotic abstractions for hybrid systems with stable continuous dynamics. Discrete Event Dynamic Systems (submitted), 2010.
29. A. Tiwari and G. Khanna. Nonlinear systems: Approximating reach sets. In R. Alur and G. Pappas, editors, Hybrid Systems: Computation and Control, volume 2993 of LNCS, pages 600-614. Springer, March 2004.
30. Moshe Vardi. An automata-theoretic approach to linear temporal logic. In Faron Moller and Graham Birtwistle, editors, Logics for Concurrency, volume 1043 of Lecture Notes in Computer Science, pages 238-266. Springer Berlin / Heidelberg, 1996. 10.1007/3-540-60915-6 6. (Pubitemid 126047609)
31. Moshe Y. Vardi. An automata theoretic approach to automatic program verification. Yorktown Heights, N.Y. : International Business Machines Inc., Thomas J. Watson Research Center, 1986.
32. Sheng Yu, Qingyu Zhuang, and Kai Salomaa. The state complexities of some basic operations on regular languages. Theoretical Computer Science, 125(2):315-328, 1994.