Archak Das
ABSTRACT
In this paper we discuss two important problems: Dispersion and Exploration. We have provided two optimal algorithms for each of them. For Dispersion we have provided an algorithm which is optimal in terms of memory complexity and for Exploration we have given an algorithm which is optimal in terms of number of robots in a dynamic ring. We give a brief idea about our algorithms and novelty of our techniques.
- John Augustine and William K. Moses Jr.2018. Dispersion of Mobile Robots: A Study of Memory-Time Trade-offs. In Proceedings of the 19th International Conference on Distributed Computing and Networking, ICDCN 2018, Varanasi, India, January 4-7, 2018. 1:1–1:10. doi: 10.1145/3154273.3154293.Google Scholar
Digital Library
- Archak Das, Kaustav Bose, and Buddhadeb Sau. 2021. Exploring a Dynamic Ring without Landmark. CoRR abs/2107.02769(2021). arXiv:2107.02769https://arxiv.org/abs/2107.02769Google Scholar
- Archak Das, Kaustav Bose, and Buddhadeb Sau. 2021. Memory Optimal Dispersion by Anonymous Mobile Robots. In Algorithms and Discrete Applied Mathematics - 7th International Conference, CALDAM 2021, Rupnagar, India, February 11-13, 2021, Proceedings(Lecture Notes in Computer Science, Vol. 12601), Apurva Mudgal and C. R. Subramanian (Eds.). Springer, 426–439. https://doi.org/10.1007/978-3-030-67899-9_34Google ScholarDigital Library
- Giuseppe Antonio Di Luna, Stefan Dobrev, Paola Flocchini, and Nicola Santoro. 2020. Distributed exploration of dynamic rings. Distributed Comput. 33, 1 (2020), 41–67. https://doi.org/10.1007/s00446-018-0339-1Google ScholarDigital Library
- Subhrangsu Mandal, Anisur Rahaman Molla, and William K. Moses Jr.2020. Live Exploration with Mobile Robots in a Dynamic Ring, Revisited. In 16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2020, Pisa, Italy, September 9-10, 2020(Lecture Notes in Computer Science, Vol. 12503). Springer, 92–107. https://doi.org/10.1007/978-3-030-62401-9_7Google ScholarDigital Library
- Anisur Rahaman Molla and William K. Moses Jr.2019. Dispersion of Mobile Robots: The Power of Randomness. In Theory and Applications of Models of Computation - 15th Annual Conference, TAMC 2019, Kitakyushu, Japan, April 13-16, 2019, Proceedings. 481–500. https://doi.org/10.1007/978-3-030-14812-6_30Google ScholarDigital Library
Index Terms
- A Study on the Problems of Dispersion and Exploration on Graph Topology
Recommendations
Dispersion of Mobile Robots
ICDCN '22: Proceedings of the 23rd International Conference on Distributed Computing and NetworkingIn this tutorial, we provide an extensive survey of the work on dispersion of mobile robots, introduced by Augustine and Moses Jr. [ICDCN 2018]. The problem of dispersion of k robots, initially arbitrarily placed on the nodes of an n node graph, ...
Dispersion of Mobile Robots: A Study of Memory-Time Trade-offs
ICDCN '18: Proceedings of the 19th International Conference on Distributed Computing and NetworkingWe introduce a new problem in the domain of mobile robots, which we term dispersion. In this problem, n robots are placed in an n node graph arbitrarily and must coordinate with each other to reach a final configuration such that exactly one robot is at ...
Memory optimal dispersion by anonymous mobile robots
AbstractConsider a team of k ≤ n autonomous mobile robots initially placed at a node of an arbitrary graph G with n nodes. The dispersion problem asks for a distributed algorithm that allows the robots to reach a configuration in which each robot is at a ...
Comments