Skip to main content

K-Redundant Trees for Safe and Efficient Multi-robot Recovery in Complex Environments

  • Chapter
  • First Online:
Robotics Research

Part of the book series: Springer Tracts in Advanced Robotics ((STAR,volume 114))

Abstract

This paper presents a self-stabilizing distributed algorithm to recover a large number of robots safely and efficiently in a goal location. Previously, we designed a distributed algorithm, called DMLST, to recover robots [1]. Our approach constructed a maximum-leaf spanning tree for physical routing, such that interior robots remained stationary and leaf robots move. In this paper, we extend our approach to k-DMLST recovery that provides k-connectivity in the network, meaning that each robot is connected to the goal location through k trees. This redundancy provides stronger network connectivity by reducing the probability of losing the parent during recovery. We also propose an efficient navigation algorithm for the motion of robots which guarantees forward progress during the recovery. k-DMLST recovery has been tested and compared with other methods in simulation, and implemented on a physical multi-robot system. A basic recovery algorithm fails in all experiments, and DMLST recovery is not successful in few trials. However, k-DMLST recovery efficiently recovers more than 90 % of robots in all trials.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Habibi, G., Mclurkin, J., Maximum-Leaf Spanning Trees for Efficient Multi-Robot Recovery with Connectivity Guarantees, In: Proceedings of the Symposium on Distributed Autonomous Robotic Systems, pp. 1–14 (2012)

    Google Scholar 

  2. Muriel, M., Finn, S.G., Barry, R.A., Gallager, R.G., Fellow, L.: Redundant Trees for Preplanned Recovery in Arbitrary Vertex-Redundant or Edge-Redundant Graphs, 7(5), pp. 641–652 (1999)

    Google Scholar 

  3. Batalin, M., Sukhatme, G., Hattig, M.: Mobile robot navigation using a sensor network, In: Proceedings of IEEE International Conference on Robotics and Automation, ICRA ’04, pp. 636–641 Vol. 1 (2004) [Online] http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1307220

  4. LaValle, S.M., Liberzon, D.: Rendezvous without coordinates. In: Proceedings of 47th IEEE Conference on Decision and Control, pp. 1803–1808 (2008). [Online] http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4739343

  5. Li, Q., Rus, D.: Navigation protocols in sensor networks. ACM Trans. Sensor Netw. 1(1), 3–35 (2005)

    Article  Google Scholar 

  6. Dai, F., Wu, J.: On constructing k-connected k-dominating set in wireless ad hoc and sensor networks. J. Parallel Distrib. Comput. 66(7), 947–958 (2006)

    Article  MATH  Google Scholar 

  7. Li, Y., Yin, R., Liu, H., Hao, X.: A Reliable Connected Dominating Set Algorithm in Wireless Sensor Networks Related Work, vol. 6, pp. 2583–2592 (2012)

    Google Scholar 

  8. Maratic, Interference as a Tool for Designing and Evaluating Multi-Robot Controllers. In: Proceedings of AAAI-97. AAAI Press, pp. 637–642 (1997)

    Google Scholar 

  9. Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers Inc., San Francisco (1996)

    MATH  Google Scholar 

  10. McLurkin, J.: Analysis and implementation of distributed algorithms for Multi-Robot systems, Ph.D. thesis, Massachusetts Institute of Technology (2008)

    Google Scholar 

  11. Enachescu, M., Wang, M.: Reducing Maximum Stretch in Compact Routing, no. 0339262, pp. 977–985 (2008)

    Google Scholar 

  12. Kleinrock, L., Silvester, J.: Optimum transmission radii for packet radio networks or why six is a magic number. In: Conference Record, National Telecommunications Conference, Birmingham, Alabama, pp. 4.3.2–4.3.5, December 1978

    Google Scholar 

  13. 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 

  14. Dolev, S.: Self-Stabilization. The MIT Press, Cambridge (2000)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Golnaz Habibi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Habibi, G., Schmidt, L., Jellins, M., McLurkin, J. (2016). K-Redundant Trees for Safe and Efficient Multi-robot Recovery in Complex Environments. In: Inaba, M., Corke, P. (eds) Robotics Research. Springer Tracts in Advanced Robotics, vol 114. Springer, Cham. https://doi.org/10.1007/978-3-319-28872-7_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-28872-7_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-28870-3

  • Online ISBN: 978-3-319-28872-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics