Krishnendu Mukhopadhyaya

About

Krishnendu Mukhopadhyaya is a distinguished computer scientist whose research is deeply rooted in distributed computing, autonomous mobile robotics, and swarm intelligence. His work primarily investigates how groups of simple, anonymous, and oblivious robots can collectively solve complex geometric and coordination problems — such as circle formation, gathering, and pattern formation — without centralized control or shared memory. Among his most significant contributions are his investigations into asynchronous "fat robots" — robots with physical extent rather than idealized point representations — under conditions of limited visibility and without common orientation. His 2012 paper on circle formation by such robots has garnered 42 citations, establishing foundational results in a notoriously challenging setting. Subsequent work extended these insights to problems involving leader election, fault tolerance under one-axis agreement, and mutual visibility with lights, collectively accumulating over 170 citations across his top papers. Mukhopadhyaya has consistently pushed the boundaries of what minimally capable robots can achieve, exploring increasingly realistic models that account for asymmetry, transparency, and nonuniform visibility. His more recent work on k-circle formation further demonstrates his evolving research agenda. His contributions make him an important figure for students and researchers working at the intersection of theoretical distributed computing and autonomous robotics.

Research Focus

Key Achievements

Top Papers

1. 1
   Circle Formation by Asynchronous Fat Robots with Limited Visibility

   42 citations · 2012
2. 2
   Leader election and gathering for asynchronous fat robots without common chirality

   32 citations · 2015
3. 3
   Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement

   29 citations · 2015
4. 4
   Gathering Asynchronous Transparent Fat Robots

   25 citations · 2010
5. 5
   Circle Formation by Asynchronous Transparent Fat Robots

   22 citations · 2013
6. 6
   Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement

   19 citations · 2016
7. 7
   Optimum Algorithm for Mutual Visibility Among Asynchronous Robots with Lights

   16 citations · 2017
8. 8
   Gathering Asynchronous Swarm Robots under Nonuniform Limited Visibility

   12 citations · 2015
9. 9
   k-Circle Formation and k-epf by Asynchronous Robots

   12 citations · 2021
10. 10
    A Distributed Algorithm for Pattern Formation by Autonomous Robots, with No Agreement on Coordinate Compass

    10 citations · 2010

Key Collaborators

Contact & Links