Skip to main content

Brief Announcement: Self-stabilizing LCM Schedulers for Autonomous Mobile Robots Using Neighborhood Mutual Remainder

  • Conference paper
  • First Online:
Stabilization, Safety, and Security of Distributed Systems (SSS 2019)

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

Abstract

A vast number of algorithms for robots assume a given schedule that ensures the simultaneous LOOK (observing the location of all other non-moving robots), only then simultaneous COMPUTE (computing the target for moving) and only then simultaneous MOVE (LCM). The assumption on the existence of synchronization signal for movements, when other robots do not LOOK is questionable. We present several self-stabilizing techniques to implement such a scheduler using global/local clock pulses and thus converting the vast numbers of robot algorithms that assume the LCM schedule, to eliminate this assumption at once. Namely, we present implementation of a move-atomic property scheduler, where robots possess an independent clock that is advanced at the same speed.We realize it by applying the neighborhood mutual remainder. This research presents the first self-stabilizing implementations of the LCM synchronization.

This work was supported in part by JSPS KAKENHI No. 17K00019, 18K11167, 19K11823 and 19K11828, Rita Altura Trust Chair in Computer Science, the Ministry of Science and Technology, Israel&Japan Science and Technology Agency (JST) SICORP (Grant#JPMJSC1806) and the German Research Funding Organization (DFG, Grant#8767581199).

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

Notes

  1. 1.

    Because the maximal number of neighboring terminals is typically much less than the total number of terminals, the number of colors is typically much smaller than the number of terminals. Moreover, when a global upper bound on the number of neighbors is known and used, only two colors of light suffices (indicating whether \( Clock \) value is 0 or not) for the entire operation of the algorithm.

Reference

  1. Dolev, S., Kamei, S., Katayama, Y., Ooshita, F., Wada, K.: Neighborhood mutual remainder: Self-stabilizing implementation of look compute move. arXiv:1903.02843 (2019)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sayaka Kamei .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Dolev, S., Kamei, S., Katayama, Y., Ooshita, F., Wada, K. (2019). Brief Announcement: Self-stabilizing LCM Schedulers for Autonomous Mobile Robots Using Neighborhood Mutual Remainder. In: Ghaffari, M., Nesterenko, M., Tixeuil, S., Tucci, S., Yamauchi, Y. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2019. Lecture Notes in Computer Science(), vol 11914. Springer, Cham. https://doi.org/10.1007/978-3-030-34992-9_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-34992-9_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-34991-2

  • Online ISBN: 978-3-030-34992-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics