Advertisement

Maximum-Leaf Spanning Trees for Efficient Multi-Robot Recovery with Connectivity Guarantees

  • Golnaz HabibiEmail author
  • James McLurkin
Conference paper
Part of the Springer Tracts in Advanced Robotics book series (STAR, volume 104)

Abstract

This paper presents a self-stabilizing distributed algorithm for the recovery of a large population of robots in a complex environment—that is, to gather them all in a goal location. We assume the robots do not have a map of the environment, but instead use short-range network communications and local sensing to physically route themselves towards the goal location. Since the robot’s motion can disrupt robots network communication and localization in complex environments, we desire an algorithm that can maintain connectivity while preserving efficient operation. Our approach constructs a spanning tree for physical routing, but only allows the leaves of this tree to navigate the goal location. This distributed maximum-leaf spanning tree (DMLST) ensures connectivity, while providing an efficient recovery by allowing the maximum number of robots to be mobile.We present empirical results on the competitive ratio of the DMLST and it is very good, approaching the optimal solution for our communication network. DMLST recovery has been tested in simulation, and implemented on a system of thirteen robots. While a basic recovery fails in all experiments, the DMLST recovery succeeds efficiently in most trials.

Keywords

Span Tree Internal Node Competitive Ratio Goal Location Recovery Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Batalin, M., Sukhatme, G., Hattig, M.: Mobile robot navigation using a sensor network. In: Proceedings of the IEEE International Conference on Robotics and Automation, ICRA 2004, vol. 1, pp. 636–641 (2004)Google Scholar
  2. 2.
    Dolev, S.: Self-Stabilization. The MIT Press (2000)Google Scholar
  3. 3.
    Howard, A.: Multi-robot simultaneous localization and mapping using particle filters. In: Robotics: Science and Systems, pp. 201–208 (2005)Google Scholar
  4. 4.
    Kamei, S., Kakugawa, H.: A Self-Stabilizing Distributed Approximation Algorithm for the Minimum Connected Dominating Set. International Journal of Foundations of Computer Science 21(03), 459 (2010)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    LaValle, S.M., Liberzon, D.: Rendezvous without coordinates. In: 2008 47th IEEE Conference on Decision and Control, pp. 1803–1808 (2008)Google Scholar
  6. 6.
    Li, Q., Rus, D.: Navigation protocols in sensor networks. ACM Transactions on Sensor Networks 1(1), 3–35 (2005)Google Scholar
  7. 7.
    Liu, J., Yuan, K., Zou, W., Yang, Q., Localization, K.M.C.: Monte Carlo Multi-Robot Localization Based on Grid Cells and Characteristic Particles. Computer Engineering, 24–28 (2005)Google Scholar
  8. 8.
    Localization, M.: r., Fox, D., Burgard, W., Kruppa, H., Thrun, S.: A Monte Carlo Algorithm for (March 1999)Google Scholar
  9. 9.
    i Lu, H., Ravi, R., Ravi, R.: The power of local optimization: Approximation algorithms for maximum-leaf spanning tree. In: Proceedings of the Thirtieth Annual Allerton Conference on Communication, Control and Computing, pp. 533–542 (1996)Google Scholar
  10. 10.
    Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers Inc., San Francisco (1996)zbMATHGoogle Scholar
  11. 11.
    Marathe, M.V., Breu, H., Hunt, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple heuristics for unit disk graphs. Networks 25(2), 59–68 (1995)zbMATHMathSciNetGoogle Scholar
  12. 12.
    Maratic: Interference as a Tool for Designing and Evaluating Multi-Robot Controllers. In: Proceedings, AAAI 1997, pp. 637–642. AAAI Press (1997)Google Scholar
  13. 13.
    McLurkin, J.: Analysis and implementation of distributed algorithms for Multi-Robot systems. Ph.D. thesis, Massachusetts Institute of Technology (2008)Google Scholar
  14. 14.
    McLurkin, J.: Measuring the accuracy of distributed algorithms on Multi-Robot systems with dynamic network topologies. In: Proceedings of the International Symposium on Distributed Autonomous Robotic Systems, DARS (2008)Google Scholar
  15. 15.
    McLurkin, J., Lynch, A.J., Rixner, S., Barr, T.W., Chou, A., Foster, K., Bilstein, S.: A low-cost multi-robot system for research, teaching, and outreach. In: Proc. of the Tenth Int. Symp. on Distributed Autonomous Robotic Systems, DARS 2010 (October 2010)Google Scholar
  16. 16.
    Ozeki, K., Yamashita, T.: Spanning Trees: A Survey. Graphs and Combinatorics 27(1), 1–26 (2010)MathSciNetGoogle Scholar
  17. 17.
    Thrun, S., Fox, D., Burgard, W., Dellaert, F.: Robust Monte Carlo Localization for Mobile Robots (February 2001)Google Scholar
  18. 18.
    Thrun, S., Liu, Y., Koller, D., Ng, A.Y., Ghahramani, Z., Durrant-Whyte, H.F.: Simultaneous localization and mapping with sparse extended information filters. I. J. Robotic Res. 23(7-8), 693–716 (2004)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  1. 1.Rice UniversityHoustonUSA

Personalised recommendations