Supratik Mukhopadhyay
Papers
7
Total Citations
103
H-Index
6
About
Supratik Mukhopadhyay is a leading researcher in distributed robotics, specializing in the coordination of autonomous mobile robot swarms. His work focuses on fundamental geometric problems, particularly the **Mutual Visibility** and **Complete Visibility** problems, where robots must reposition themselves so that every robot is visible to all others, even under obstructed visibility or when robots have physical extent. Mukhopadhyay’s major contributions include developing optimal algorithms for these tasks, such as achieving mutual visibility with the minimum number of communication colors (43 citations), and providing tight analyses for collisionless gathering (13 citations). He has advanced the field by addressing realistic constraints like fat robots (18 citations) and oblivious robots with limited sensing, proving that complete visibility can be achieved in linear time. His work on bounds for mutual visibility algorithms (11 citations) offers critical theoretical foundations. Mukhopadhyay’s research bridges theory and practice, enabling robust, scalable coordination for multi-robot systems in applications like search-and-rescue and environmental monitoring. His achievements include multiple conference publications and brief announcements that have shaped the trajectory of distributed robot algorithms.
Research Focus
Key Achievements
Top Papers
- 1Mutual Visibility with an Optimal Number of Colors43 citations · 2015
- 2The Complete Visibility Problem for Fat Robots with Lights18 citations · 2018
- 3Tight Analysis of a Collisionless Robot Gathering Algorithm13 citations · 2017
- 4Bounds on mutual visibility algorithms11 citations · 2015
- 5Brief Announcement10 citations · 2017
- 6How to Make Fat Autonomous Robots See all Others Fast?6 citations · 2018
- 7Complete Visibility for Oblivious Robots in $$\mathcal{O}(N)$$ Time2 citations · 2019