Skip to main content
SpringerLink
Log in
Book cover

International Conference on Algorithms and Complexity

CIAC 2015: Algorithms and Complexity pp 127–139Cite as

MinMax-Distance Gathering on Given Meeting Points

  • Conference paper
  • First Online:

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

Abstract

We consider a set of oblivious robots moving in the plane that have to gather at one point among a predetermined set of so called meeting points. Robots operate in asynchronous Look-Compute-Move cycles. In one cycle, a robot perceives the current configuration in terms of relative positions of robots and meeting points (Look), decides whether to move toward some direction (Compute), then makes the computed move, eventually (Move). Robots are anonymous and execute the same distributed algorithm that must guarantee to gather all robots at a meeting point by minimizing the longest distance traveled by a single robot. This is a new metric for evaluating the quality of the gathering, and we start characterizing configurations where optimal gathering can be achieved. We then provide a distributed algorithm to optimally solve most of such configurations.

Work partially supported by the following Research Grants: 2010N5K7EB “PRIN 2010" ARS TechnoMedia (Algoritmica per le Reti Sociali Tecno-mediate) and 2012C4E3KT “PRIN 2012" Amanda (Algorithmics for MAssive and Networked DAta), both from the Italian Ministry of University and Research.

This is a preview of subscription content, 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 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. Bouzid, Z., Das, S., Tixeuil, S.: Gathering of mobile robots tolerating multiple crash faults. In: IEEE 33rd Int. Conf. on Distributed Computing Systems (ICDCS), pp. 337–346 (2013)

    Google Scholar 

  2. Chalopin, J., Das, S., Widmayer, P.: Rendezvous of mobile agents in directed graphs. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 282–296. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  3. Cicerone, S., Stefano, G.D., Navarra, A.: Minimum-traveled-distance gathering of oblivious robots over given meeting points. In: Gao, J., Efrat, A., Fekete, S.P., Zhang, Y. (eds.) ALGOSENSORS 2014, LNCS 8847. LNCS, vol. 8847, pp. 57–72. Springer, Heidelberg (2015)

    Chapter  Google Scholar 

  4. Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by mobile robots: Gathering. SIAM Journal on Computing 41(4), 829–879 (2012)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  6. D’Angelo, G., Di Stefano, G., Navarra, A.: Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model. In: Search Theory: A Game Theoretic Perspective, pp. 197–222. Springer (2013)

    Google Scholar 

  7. D’Angelo, G., Di Stefano, G., Navarra, A.: Gathering on rings under the look-compute-move model. Distributed Computing 27(4), 255–285 (2014)

    Article  MATH  MathSciNet  Google Scholar 

  8. Flocchini, P., Prencipe, G., Santoro, N.: Distributed Computing by Oblivious Mobile Robots. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers (2012)

    Google Scholar 

  9. Klasing, R., Markou, E., Pelc, A.: Gathering asynchronous oblivious mobile robots in a ring. Theoretical Computer Science 390, 27–39 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  10. Kranakis, E., Krizanc, D., Markou, E.: The Mobile Agent Rendezvous Problem in the Ring. Morgan & Claypool (2010)

    Google Scholar 

  11. Pelc, A.: Deterministic rendezvous in networks: A comprehensive survey. Networks 59(3), 331–347 (2012)

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  13. Sekino, J.: n-ellipses and the minimum distance sum problem. Amer. Math. Monthly 106(3), 193–202 (1999)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Ingegneria e Scienze dell’Informazione e Matematica, Università degli Studi dell’Aquila, L’Aquila, Italy

    Serafino Cicerone & Gabriele Di Stefano

  2. Dipartimento di Matematica e Informatica, Università degli Studi di Perugia, Perugia, Italy

    Alfredo Navarra

Authors
  1. Serafino Cicerone
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gabriele Di Stefano
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alfredo Navarra
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alfredo Navarra .

Editor information

Editors and Affiliations

  1. LAMSADE, Université Paris-Dauphine, Paris Cedex 16, France

    Vangelis Th. Paschos

  2. Inst. of Theoretical Computer Science, ETH Zürich, Zürich, Switzerland

    Peter Widmayer

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Cicerone, S., Di Stefano, G., Navarra, A. (2015). MinMax-Distance Gathering on Given Meeting Points. In: Paschos, V., Widmayer, P. (eds) Algorithms and Complexity. CIAC 2015. Lecture Notes in Computer Science(), vol 9079. Springer, Cham. https://doi.org/10.1007/978-3-319-18173-8_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-18173-8_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-18172-1

  • Online ISBN: 978-3-319-18173-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation