Archak Das

Jadavpur University

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

4
H-Index
6
Papers
28
Total Citations
5
Avg Citations/Paper
🏆 Most Cited Paper
Memory Optimal Dispersion by Anonymous Mobile Robots
11 citations · 2021
📈 Most Prolific Year: 2020 (2 Papers)
🤝 Key Collaborators: 7
🏛 Institutions: Jadavpur University

Top Papers

  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 15 days ago