Max Robotics — Global Service Robot Directory + US Certification

About

Abhinav Chakraborty is a rising star in distributed computing and swarm robotics, whose work focuses on solving fundamental coordination problems for autonomous, anonymous robots. His research primarily addresses how simple, oblivious robots—with no memory of past actions—can achieve complex global tasks in the Euclidean plane and on infinite grids. Chakraborty’s major contributions include pioneering the **k-circle formation problem**, where robots must self-organize into disjoint circles of a fixed size, a challenge he solved for both asynchronous and disoriented systems. His most cited paper (2021, 12 citations) lays the groundwork for this, demonstrating a robust algorithm for asynchronous robots. He has also made significant strides in the **gathering over meeting nodes** problem, optimizing robot movement to minimize total travel distance on infinite grids, with his work on optimal gathering (2022) achieving 3 citations. More recently, Chakraborty tackled **mutual visibility** for fat robots with limited cameras (2023, 5 citations) and the **parking problem** (2024), showcasing his ability to address real-world constraints. His cumulative work, with over 39 citations, is essential reading for anyone interested in minimalist robot coordination, distributed algorithms, and the theoretical foundations of swarm intelligence.