Safe graph rearrangements for distributed connectivity of robotic networks

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2007, Pages 4602-4607

  Schuresko, Michael ^a   Cortés, Jorge ^b  

^a University of California Santa Cruz   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; ROBOTICS;

COORDINATION TASK; GRAPH REARRANGEMENTS; OVER-CONSTRAINED ROBOT OPERATION; ROBOTIC NETWORK;

GRAPH THEORY;

EID: 62749097904     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2007.4435014     Document Type: Conference Paper

References (16)

1. S. Boyd, "Convex optimization of graph Laplacian eigenvalues," in Proceedings of the International Congress of Mathematicians, vol. 3, 2006.
2. Y. Kim and M. Mesbahi, "On maximizing the second smallest eigenvalue of a state-dependent graph Laplacian," IEEE Transactions on Automatic Control, vol. 51, no. 1, pp. 116-120, 2006.
3. M. C. D. Gennaro and A. Jadbabaie, "Decentralized control of connectivity for multi-agent systems," in IEEE Conf. on Decision and Control, San Diego, CA, Dec. 2006, pp. 3628-3633.
4. M. M. Zavlanos and G. J. Pappas, "Controlling connectivity of dynamic graphs," in IEEE Conf. on Decision and Control, Seville, Spain, 2005, pp. 6388-6393.
5. G. Notarstefano, K. Savia, F. Bullo, and A. Jadbabaie, "Maintaining limited-range connectivity among second-order agents," in American Control Conference, Minneapolis, MN, June 2006, pp. 2124-2129.
6. J. P. Desai, J. P. Ostrowski, and V Kumar, "Modeling and control of formations of nonholonomic mobile robots," IEEE Transactions on Robotics and Automation, vol. 17, no. 6, pp. 905-908, 2001.
7. D. P. Spanos and R. M. Murray, "Motion planning with wireless network constraints," in American Control Conference, Portland, OR, June 2005, pp. 87-92.
8. F. C. Gaertner, "A Survey of Self-Stabilizing Spanning-Tree Construction Algorithms," Tech. Rep., 2003, available electronically at http://infoscience.epfl.ch/search.py?recid=52545.
9. S. Martinez, F. Bullo, J. Cortés, and E. Frazzoli, "Synchronous robotic networks and complexity of control and communication laws," Jan. 2005, preprint. Available electronically at http://arxiv.org/math.OC/0501499.
10. M. D. Schuresko and J. Cortés, "Safe graph rearrangements for distributed connectivity of robotic networks," University of California, Santa Cruz, Tech. Rep. ams2007-13, 2007, electronically available at http://www.ams.ucsc.edu/reports/trview.php.
11. R. Diestel, Graph Theory, 2nd ed., ser. Graduate Texts in Mathematics. New York: Springer Verlag, 2000, vol. 173.
12. C. D. Godsil and G. F. Royle, Algebraic Graph Theory, ser. Graduate Texts in Mathematics. New York: Springer Verlag, 2001, vol. 207.
13. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed. Cambridge, MA: MIT Press, 2001.
14. J. W. Jaromczyk and G. T. Toussaint, "Relative neighborhood graphs and their relatives," Proceedings of the IEEE, vol. 80, no. 9, pp. 1502-1517, 1992.
15. J. Cortés, S. Martínez, and F. Bullo, "Robust rendezvous for mobile networks via proximity graphs in arbitrary dimensions," IEEE Transactions on Automatic Control, vol. 51, no. 8, pp. 1289-1298, 2006.
16. N. A. Lynch, Distributed Algorithms. San Mateo, CA: Morgan Kaufmann Publishers, 1997.