Skip to main content

Interruptibility and Its Negative Impact on Graph Exploration Missions by a Team of Robots

  • Conference paper
  • 840 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7694))

Abstract

Exploring an unknown graph has several fields of applications such as search and rescue operations. A team of robots is used to speed up these exploration missions; provided that they synchronize and coordinate their activities. Here, several conditions may limit the communication capabilities of robots which are crucial for coordination (e.g. high temperature). Therefore, a periodic rendezvous is needed as a work around in order to overlap their communication ranges. Attending these periodic rendezvous sessions requires that robots interrupt their current exploration progress periodically and traverse back to the rendezvous points (i.e. Interruptibility). During their trips to these points, the robots cross the explored part of the graph. Thus, they do not gain new knowledge about the graph. Furthermore, it increases the required time of exploration. Evaluating the impact of these interruptions on the exploration process through several experiments under different exploration strategies is the scope of this paper.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Wallgrün, J.: Hierarchical Voronoi Graphs: Spatial Representation and Reasoning for Mobile Robots. Springer, Heidelberg (2010)

    MATH  Google Scholar 

  2. Fazli, P.: On Multi-robot Area Coverage. In: Farzindar, A., Kešelj, V. (eds.) Canadian AI 2010. LNCS(LNAI), vol. 6085, pp. 384–387. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  3. Thrun, S., Thayer, S., Whittaker, W., Baker, C., Burgard, W., Ferguson, D., Hähnel, D., Montemerlo, M., Morris, A., Omohundro, Z., Reverte, C., Whittaker, W.: Autonomous Exploration and Mapping of Abandoned Mines. IEEE Robotics and Automation Magazine (2004)

    Google Scholar 

  4. Murphy, R., Tadokoro, S., Nardi, D., Jacoff, A., Fiorini, P., Choset, H., Erkmen, A.: Search and Rescue Robotics. Springer Handbook of Robotics. Part. F, ch. 50. Springer (2008)

    Google Scholar 

  5. Nakatani, I.: Robotics for Planetary Exploration. The Japan Society of Mechanical Enginners 13(2) (2002)

    Google Scholar 

  6. Parker, L.: Multiple Mobile Robot Systems. In: Parker, L. (ed.) Multiple Mobile Robot Systems. Springer Handbook of Robotics, Part. E, ch. 40. Springer, Heidelberg (2008) ISBN: 978-3-540-23957-4

    Google Scholar 

  7. Nelson, B., Dong, L., Arai, F.: Micro/Nanorobots. Springer Handbook of Robotics, Part. B, ch. 18. Springer, Heidelberg (2008) ISBN: 978-3-540-23957-4

    Google Scholar 

  8. Zhao, J., Liu, G., Liu, Y., Zhu, Y.: Research on the Application of a Marsupial Robot for Coal Mine Rescue. In: Xiong, C.-H., Liu, H., Huang, Y., Xiong, Y.L. (eds.) ICIRA 2008. LNCS (LNAI), vol. 5315, pp. 1127–1136. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  9. Arkin, R., Diaz, J.: Line-of-Sight Constrained Exploration for Reactive Multi-agent robotic team. In: Proc. of AMC 7th Int. Workshop on Advanced Motion Control, Slovenia (2002)

    Google Scholar 

  10. Atay, N., Bayazit, B.: Emergent Task Allocation for Mobile Robots. In: Proc. of Robotics: Science and Systems III- Georgia Institute of Technology, Georgia-USA (2007)

    Google Scholar 

  11. Duncan, C., Kobourov, S., Kumar, V., Kumar, A.: Optimal Constrained Graph Exploration. Proc. of ACM Transactions on Algorithms 2(3) (2006)

    Google Scholar 

  12. Wellman, B., Dawson, S., Hoog, J., Anderson, M.: Using Rendezvous to Overcome Communication Limitations in Multirobot Exploration. In: Proc. of IEEE-SMC (2011)

    Google Scholar 

  13. Aplern, S., Gal, S.: Book II: The Theory of Search games and rendezvous. Int. Series in Operation Research and Management Science. Kluwer Academic Publishers (2003)

    Google Scholar 

  14. Roy, N., Dudek, G.: Collaborative Robot Exploration and Rendezvous-Algorithms, Performance Bounds and Observations. Autonomous Robots 11, 117–136 (2001)

    Article  MATH  Google Scholar 

  15. Yamuchi, B.: Frontier-Based Exploration using multiple robots. In: Proc. of 2nd Int. Conf. on Autonomous Agents. ACM Press (1998)

    Google Scholar 

  16. Keshmiri, S., Payandeh, S.: Regression Analysis of Multi-rendezvous Recharging Route in Multi-Robot Environment. In. J. Soc. Robot. 4, 15–27 (2012)

    Article  Google Scholar 

  17. Hoog, J., Cameron, S., Visser, A.: Selection of Rendezvous Points for Multi-Robot exploration in dynamic environments. In: Proc. Int. Cf. Autonomous Agents and Multi-Agent Systems (2010)

    Google Scholar 

  18. MatlabBGL, http://www.mathworks.com/matlabcentral/fileexchange/10922 (visited July 15, 2012)

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hourani, H., Hauck, E., Jeschke, S. (2012). Interruptibility and Its Negative Impact on Graph Exploration Missions by a Team of Robots. In: Sombattheera, C., Loi, N.K., Wankar, R., Quan, T. (eds) Multi-disciplinary Trends in Artificial Intelligence. MIWAI 2012. Lecture Notes in Computer Science(), vol 7694. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35455-7_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35455-7_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35454-0

  • Online ISBN: 978-3-642-35455-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics