Papers
Topics
Authors
Recent
Search
2000 character limit reached

Efficient Self-stabilizing Simulations of Energy-Restricted Mobile Robots by Asynchronous Luminous Mobile Robots

Published 4 Feb 2024 in cs.DC and cs.RO | (2403.05542v1)

Abstract: In this study, we explore efficient simulation implementations to demonstrate computational equivalence across various models of autonomous mobile robot swarms. Our focus is on Rsynch, a scheduler designed for energy-restricted robots, which falls between Fsynch and Ssynch. We propose efficient protocols for simulating n(>=2) luminous (LUMI) robots operating in Rsynch using LUMI robots in Ssynch or Asynch. Our contributions are twofold: (1) We introduce protocols that simulate LUMI robots in Rsynch using 4k colors in Ssynch and 5k colors in Asynch, for algorithms that employ k colors. This approach notably reduces the number of colors needed for Ssynch simulations of Rsynch, compared to previous efforts. Meanwhile, the color requirement for Asynch simulations remains consistent with previous Asynch simulations of Ssynch, facilitating the simulation of Rsynch in Asynch. (2) We establish that for n=2, Rsynch can be optimally simulated in Asynch using a minimal number of colors. Additionally, we confirm that all our proposed simulation protocols are self-stabilizing, ensuring functionality from any initial configuration.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (26)
  1. N. Agmon and D. Peleg. Fault-tolerant gathering algorithms for autonomous mobile robots. SIAM Journal on Computing, 36(1):56–82, 2006.
  2. A distributed memoryless point convergence algorithm for mobile robots with limited visivility. IEEE Transactions on Robotics and Automation, 15(5):818–828, 1999.
  3. Gathering of mobile robots tolerating multiple crash faults. In the 33rd Int. Conf. on Distributed Computing Systems, pages 334–346, 2013.
  4. Autonomous mobile robots: Refining the computational landscape. In APDCM 2021, pages 576–585, 2021.
  5. On the computational power of energy-constrained mobile robots: Algorithms and cross-model analysis. In Proc. 29th Int. Colloquium on Structural Information and Communication Complexity (SIROCCO), pages 42–61, 2022.
  6. D. Canepa and M. Potop-Butucaru. Stabilizing flocking via leader election in robot networks. In Proc. 10th Int. Symp. on Stabilization, Safety, and Security of Distributed Systems (SSS), pages 52–66, 2007.
  7. Gathering of robots on meeting-points. Distributed Computing, 31(1):1–50, 2018.
  8. Distributed computing by mobile robots: Gathering. SIAM Journal on Computing, 41(4):829–879, 2012.
  9. R. Cohen and D. Peleg. Convergence properties of the gravitational algorithms in asynchronous robot systems. SIAM J. on Computing, 34(15):1516–1528, 2005.
  10. Autonomous mobile robots with lights. Theoretical Computer Science, 609:171–184, 2016.
  11. Hard tasks for weak robots: the role of common knowledge in pattern formation by autonomous mobile robots. In 10th Int. Symp. on Algorithms and Computation (ISAAC), pages 93–102, 1999.
  12. Gathering of asynchronous robots with limited visibility. Theoretical Computer Science, 337(1–3):147–169, 2005.
  13. Arbitrary pattern formation by asynchronous oblivious robots. Theoretical Computer Science, 407:412–447, 2008.
  14. Rendezvous with constant memory. Theoretical Computer Science, 621:57–72, 2016.
  15. On memory, communication, and synchronous schedulers when moving and computing. In Proc. 23rd Int. Conference on Principles of Distributed Systems (OPODIS), pages 25:1–25:17, 2019.
  16. Pattern formation by oblivious asynchronous mobile robots. SIAM Journal on Computing, 44(3):740–785, 2015.
  17. V. Gervasi and G. Prencipe. Coordination without communication: The case of the flocking problem. Discrete Applied Mathematics, 144(3):324–344, 2004.
  18. The gathering problem for two oblivious robots with unreliable compasses. SIAM Journal on Computing, 41(1):26–46, 2012.
  19. Asynchronous gathering algorithms for autonomous mobile robots with lights. In Proc. 23rd Int. Symposium (SSS), pages 410–424, 2021.
  20. Optimal rendezvous ℒℒ\mathcal{L}caligraphic_L-algorithms for asynchronous mobile robots with external-lights. In Proc. 22nd Int. Conference on Principles of Distributed Systems (OPODIS), pages 24:1–24:16, 2018.
  21. Brief announcement: Optimal asynchronous rendezvous for mobile robots with lights. In Proc. 19th Int. Symp. on Stabilization, Safety, and Security of Distributed Systems (SSS), pages 484–488, 2017.
  22. D. Peleg. Distributed coordination algorithms for mobile robot swarms: New directions and challenges. In Distributed Computing-IWDC 2005, pages 1–12, 2005.
  23. Oracle-based flocking of mobile robots in crash-recovery model. In Proc. 11th Int. Symp. on Stabilization, Safety, and Security of Distributed Systems (SSS), pages 683–697, 2009.
  24. I. Suzuki and M. Yamashita. Distributed anonymous mobile robots: Formation of geometric patterns. SIAM Journal on Computing, 28:1347–1363, 1999.
  25. M. Yamashita and I. Suzuki. Characterizing geometric patterns formable by oblivious anonymous mobile robots. Theoretical Computer Science, 411(26–28):2433–2453, 2010.
  26. Plane formation by synchronous mobile robots in the three-dimensional euclidean space. J. ACM, 64:3(16):16:1–16:43, 2017.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.

Sign Up for Free