Archak Das
Papers
6
Total Citations
28
H-Index
4
About
Archak Das is a leading researcher in distributed algorithms for autonomous mobile robot swarms, with a focus on fundamental coordination problems such as dispersion and pattern formation. His most impactful work tackles the challenge of memory-optimal dispersion, where anonymous mobile robots must spread across distinct nodes of an arbitrary graph using minimal memory per robot—a problem he has addressed across multiple highly cited papers (totaling 17 citations for this line of work alone). Das has also made significant contributions to the Arbitrary Pattern Formation problem, designing distributed algorithms that enable robot teams to form any given target shape, even under challenging conditions like inaccurate movements. His 2024 paper, “The Computational Landscape of Autonomous Mobile Robots: The Visibility Perspective,” provides a comprehensive framework for understanding how varying visibility constraints affect the solvability of core robot problems. With over 28 total citations and a growing body of work published between 2020 and 2024, Das is recognized for pushing the boundaries of what is computationally possible with minimalistic, anonymous, and memory-constrained robots—making his research essential reading for anyone working in swarm robotics or distributed computing.
Research Focus
Key Achievements
Top Papers
- 1Memory Optimal Dispersion by Anonymous Mobile Robots11 citations · 2021
- 2Pattern Formation by Robots with Inaccurate Movements5 citations · 2020
- 3Memory optimal dispersion by anonymous mobile robots4 citations · 2023
- 4Distributed Pattern Formation by Autonomous Robot Swarm4 citations · 2022
- 5
- 6Memory Optimal Dispersion by Anonymous Mobile Robots2 citations · 2020