Skip to main content

Investigating the Rate of Failure of Asynchronous Gathering in a Swarm of Fat Robots with Limited Visibility

  • Conference paper
Artificial Intelligence and Soft Computing (ICAISC 2014)

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

Included in the following conference series:

  • 2140 Accesses

Abstract

In the present paper we investigate the failure probability of the asynchronous gathering task in a mobile robot swarm that contains weak robots (oblivious, with limited visibility, without global navigation and communication). We are modelling fat robots, which are represented as solid discs. We performed numerous computer simulations in order to measure the rate of failure of gathering using extended Ando’s gathering algorithm [1]. The physical parameters of the simulations are based on our previous experiments on image processing based kin recognition method using Surveyor SRV-1 robots [11] [12]. It was obtained that the computational time and the travelling speed of the robots affect very strongly the rate of gathering success. If we apply SRV-1 robots with the referred kin recognition method and highest possible travelling speed, then the rate of failure is very close to 100 percent. While, reducing the travelling speed with a factor of 1/20 (or increasing the computational performance to 20 times the original) results in much better success rates of gathering. Besides, we have found that the failure rate increases together with the number of robots.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ando, H., Suzuki, I., Yamashita, M.: Formation and agreement problems for synchronous mobile robots with limited visibility. In: 1995 IEEE International Symposium on Intelligent Control, pp. 453–460. IEEE Press (1995)

    Google Scholar 

  2. Prencipe, G.: Instantaneous Actions vs. Full Asynchronicity: Controlling and Coordinating a Set of Autonomous Mobile Robots. In: Restivo, A., Ronchi Della Rocca, S., Roversi, L. (eds.) ICTCS 2001. LNCS, vol. 2202, pp. 154–171. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  3. Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Solving the Robots Gathering Problem. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 1181–1196. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous robots with limited visibility. Theoretical Computer Science 337, 147–168 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  5. Santoro, N.: Distributed Algorithms for Autonomous Mobile Robots. In: Navarro, G., Bertossi, L., Kohayakawa, Y. (eds.) Fourth IFIP International Conference on Theoretical Computer Science - TCS. IFIP, vol. 209, pp. 11–27. Springer, Boston (2006)

    Chapter  Google Scholar 

  6. Souissi, S., Défago, X., Yamashita, M.: Using Eventually Consistent Compasses to Gather Oblivious Mobile Robots with Limited Visibility. In: Datta, A.K., Gradinariu, M. (eds.) SSS 2006. LNCS, vol. 4280, pp. 484–500. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  7. Prencipe, G.: Impossibility of gathering by a set of autonomous mobile robots. Theoretical Computer Science 384, 222–231 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  8. Cohen, R., Peleg, D.: Local Spread Algorithms for Autonomous Robot Systems. Theoretical Computer Science 399, 71–82 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  9. Czyzowicz, G.J., Gasieniec, L., Pelc, A.: Gathering few fat mobile robots in the plane. Theoretical Computer Science 410, 481–499 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  10. Bolla, K., Kovacs, T., Fazekas, G.: Gathering of Fat Robots with Limited Visibility and without Global Navigation. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) EC 2012 and SIDE 2012. LNCS, vol. 7269, pp. 30–38. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  11. Bolla, K., Kovacs, T., Fazakas, G.: Compact Image Processing-based Kin Recognition, Distance Measurement and Identification Method in a Robot Swarm. In: IEEE Conference on ICCC-CONTI 2010,Timisora pp. 419–424 (2010)

    Google Scholar 

  12. Bolla, K., Kovacs, T., Fazakas, G.: A Fast Image Processing Based Robot Identification Method for Surveyor SRV-1 Robots. In: IEEE Conference on AIM 2011, Budapest, pp.1003–1009 (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Bolla, K., Kovács, T., Fazekas, G. (2014). Investigating the Rate of Failure of Asynchronous Gathering in a Swarm of Fat Robots with Limited Visibility. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds) Artificial Intelligence and Soft Computing. ICAISC 2014. Lecture Notes in Computer Science(), vol 8468. Springer, Cham. https://doi.org/10.1007/978-3-319-07176-3_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07176-3_22

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07175-6

  • Online ISBN: 978-3-319-07176-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics