Solving Coverage Problems with Embedded Graph Grammars

1. Egerstedt, M., Brockett, R.W.: Feedback can reduce the specification complexity of motor programs. IEEE Transactions on Automatic Control (2003)

   Google Scholar 

2. Manikonda, V., Krishnaprasad, P.S., Hendler, J.: Languages, Behaviors, Hybrid Architectures and Motion Control. In: Mathematical Control Theory (1998)

   Google Scholar 

3. Lygeros, J., et al.: Dynamical properties of hybrid automata. IEEE Transactions on Automatic Control (2003)

   Google Scholar 

4. Henzinger, T.: The theory of hybrid automata. In: 11th Annual Symposium on Logic in Computer Science (LICS), IEEE Computer Society Press, Los Alamitos (1996)

   Google Scholar 

5. Klavins, E., Burden, S., Napp, N.: Optimal rules for programmed stochastic self-assembly. In: Robotics: Science and Systems, Philadelphia, PA (2006)

   Google Scholar 

6. Cortes, J., Martinez, S., Bullo, F.: Robust rendezvous for mobile autonomous agents via proximity graphs in arbitrary dimensions. IEEE Transactions on Automatic Control (2006)

   Google Scholar 

7. Leonard, N., Fiorelli, E.: Virtual leaders, artificial potentials and coordinated control of groups. In: Proc. of the IEEE Conference on Decision and Control, IEEE Computer Society Press, Los Alamitos (2001)

   Google Scholar 

8. McNew, J.M., Klavins, E.: Locally interacting hybrid sytems using embedded graph grammars. In: Proc. of the Conference on Decision and Control (2006)

   Google Scholar 

9. Smith, B., et al.: Embedded graph grammars for multi-robot coordination. In: Proc. of the International Conference on Robotics and Automation, submitted (2007)

   Google Scholar 

10. Shucker, B., Murphey, T., Bennett, J.K.: A method of cooperative control using occasional non-local interactions. In: Proc. of the American Control Conference (2006)

    Google Scholar 

Download references