Krishnendu Mukhopadyaya

Papers

Total Citations

H-Index

About

Krishnendu Mukhopadyaya is a leading researcher in distributed computing and multi-robot systems, with a focus on fundamental coordination problems for autonomous mobile robots. His work addresses critical challenges in swarm robotics, particularly how simple, oblivious robots can achieve complex collective behaviors with minimal capabilities. Mukhopadyaya's major contributions include solving the Gathering problem—where robots must converge to a single point—under realistic constraints such as crash faults and obstructed visibility. His 2017 paper on fault-tolerant gathering of semi-synchronous robots (9 citations) provides algorithms that ensure convergence even when robots may fail. In 2018, he extended this to three-dimensional space with opaque robots (8 citations), addressing the added complexity of blocked lines of sight. Perhaps his most innovative work is the 2020 study on "weak robots" performing conflicting tasks without knowing team membership (11 citations), where two teams of identical robots must solve separate tasks while unable to distinguish teammates from opponents. This work has significant implications for real-world applications like search-and-rescue or environmental monitoring. Mukhopadyaya's research consistently pushes the boundaries of what minimal, fault-prone robots can achieve, making him a key figure in theoretical robotics and distributed algorithms.