Skip to main content
SpringerLink
Log in

Optimum Gathering of Asynchronous Robots

  • Conference paper
  • First Online:
Algorithms and Discrete Applied Mathematics (CALDAM 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10156))

Included in the following conference series:

Abstract

This paper considers the problem of gathering a set of asynchronous robots on the two dimensional plane under the additional requirement that the maximum distance traversed by the robots should be minimized. One of the implications of this optimization criteria is the energy efficiency for the robots. The results of this paper are two folds. First, it is proved that multiplicity detection capability is not sufficient to solve the constrained gathering problem for a set of oblivious robots even when the robots are fully synchronous. The problem is then studied for the robots having O(1) bits persistent memory and a distributed algorithm is proposed for the problem in this model for a set of \(n\ge 5\) robots. The proposed algorithm uses only two bits of persistent memory.

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

Access this chapter

Log in via an institution
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 EPUB and 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

Institutional subscriptions

References

  1. Agathangelou, C., Georgiou, C., Mavronicolas, M.: A distributed algorithm for gathering many fat mobile robots in the plane. In: Proceedings of ACM Symposium on Principles of Distributed Computing (PODC), pp. 250–259 (2013)

    Google Scholar 

  2. Bhagat, S., Chaudhuri, S.G., Mukhopadhyaya, K.: Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement. J. Discret. Algorithms 36, 50–62 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bramas, Q., Tixeuil, S.: Wait-free gathering without chirality. In: Scheideler, C. (ed.) Structural Information and Communication Complexity. LNCS, vol. 9439, pp. 313–327. Springer, Heidelberg (2015). doi:10.1007/978-3-319-25258-2_22

    Chapter  Google Scholar 

  4. Chaudhuri, S.G., Mukhopadhyaya, K.: Leader election and gathering for asynchronous fat robots without common chirality. J. Discret. Algorithms 33, 171–192 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  5. Cicerone, S., Di Stefano, G., Navarra, A.: Minmax-distance gathering on given meeting points. In: Paschos, V.T., Widmayer, P. (eds.) CIAC 2015. LNCS, vol. 9079, pp. 127–139. Springer, Heidelberg (2015). doi:10.1007/978-3-319-18173-8_9

    Chapter  Google Scholar 

  6. Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by mobile robots: gathering. SIAM J. Comput. 41(4), 829–879 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  7. Czyzowicz, J., Gasieniec, L., Pelc, A.: Gathering few fat mobile robots in the plane. Theor. Comput. Sci. 410(6), 481–499 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  8. Das, S., Flocchini, P., Prencipe, G., Santoro, N., Yamashita, M.: The power of lights: synchronizing asynchronous robots using visible bits. In: Proceedings of IEEE 32nd International Conference on Distributed Computing Systems (ICDCS), pp. 506–515 (2012)

    Google Scholar 

  9. Défago, X., Gradinariu, M., Messika, S., Raipin-Parvédy, P.: Fault-tolerant and self-stabilizing mobile robots gathering. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 46–60. Springer, Heidelberg (2006). doi:10.1007/11864219_4

    Chapter  Google Scholar 

  10. Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by oblivious mobile robots. In: Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers (2012)

    Google Scholar 

  11. Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous robots with limited visibility. Theor. Comput. Sci. 337(1–3), 147–168 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  12. Flocchini, P., Santoro, N., Viglietta, G., Yamashita, M.: Rendezvous of two robots with constant memory. In: Moscibroda, T., Rescigno, A.A. (eds.) SIROCCO 2013. LNCS, vol. 8179, pp. 189–200. Springer, Heidelberg (2013). doi:10.1007/978-3-319-03578-9_16

    Chapter  Google Scholar 

  13. Peleg, D.: Distributed coordination algorithms for mobile robot swarms: new directions and challenges. In: Pal, A., Kshemkalyani, A.D., Kumar, R., Gupta, A. (eds.) IWDC 2005. LNCS, vol. 3741, pp. 1–12. Springer, Heidelberg (2005). doi:10.1007/11603771_1

    Chapter  Google Scholar 

  14. Prencipe, G.: Instantaneous actions vs. full asynchronicity: controlling and coordinating a Sset of autonomous mobile robots. In: Restivo, A., Della Rocca, S.R., Roversi, L. (eds.) ICTCS 2001. LNCS, vol. 2202, pp. 154–171. Springer, Heidelberg (2001). doi:10.1007/3-540-45446-2_10

    Chapter  Google Scholar 

  15. Prencipe, G.: Impossibility of gathering by a set of autonomous mobile robots. Theor. Comput. Sci. 384(2–3), 222–231 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  16. Suzuki, I., Yamashita, M.: Formation and agreement problems for anonymous mobile robots. In: Proceedings of 31st Annual Conference on Communication, Control and Computing, pp. 93–102 (1993)

    Google Scholar 

  17. Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: formation of geometric patterns. SIAM J. Comput. 28, 1347–1363 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  18. Viglietta, G.: Rendezvous of two robots with visible bits. In: Flocchini, P., Gao, J., Kranakis, E., Meyer auf der Heide, F. (eds.) ALGOSENSORS 2013. LNCS, vol. 8243, pp. 291–306. Springer, Heidelberg (2014). doi:10.1007/978-3-642-45346-5_21

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ACM Unit, Indian Statistical Institute, Kolkata, India

    Subhash Bhagat & Krishnendu Mukhopadhyaya

Authors
  1. Subhash Bhagat
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Krishnendu Mukhopadhyaya
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Subhash Bhagat .

Editor information

Editors and Affiliations

  1. University of Lethbridge, Lethbridge, Alberta, Canada

    Daya Gaur

  2. Indian Institute of Technology Madras, Chennai, India

    N.S. Narayanaswamy

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Bhagat, S., Mukhopadhyaya, K. (2017). Optimum Gathering of Asynchronous Robots. In: Gaur, D., Narayanaswamy, N. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2017. Lecture Notes in Computer Science(), vol 10156. Springer, Cham. https://doi.org/10.1007/978-3-319-53007-9_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-53007-9_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-53006-2

  • Online ISBN: 978-3-319-53007-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation