Papers
16
Total Citations
100
H-Index
6
About
Debasish Pattanayak is a distributed computing researcher whose work centers on the theory and algorithms governing mobile robots and agents operating in decentralized, often anonymous environments. His research addresses fundamental coordination challenges—including evacuation, gathering, dispersion, and independent set construction—under realistic constraints such as limited visibility, crash faults, and asynchronous scheduling. Among his most recognized contributions is his work on robot evacuation from a unit disk, exploring how two wirelessly communicating robots can efficiently locate and exit through unknown exits, a problem with direct relevance to emergency response systems. His investigations into the dispersion problem—repositioning robots across graph nodes to achieve unique occupancy—have advanced understanding of fault tolerance and directed graph scenarios, earning him over a dozen citations per key paper. More recently, Pattanayak has tackled the maximal independent set problem using mobile agents on anonymous graphs, bridging classical graph theory with robot coordination paradigms. With growing attention to luminous and myopic robot models, his work on filling MIS vertices and pattern formation reflects a commitment to understanding minimal yet powerful computational models. Collectively, his publications have accumulated over 80 citations, establishing him as a meaningful contributor to theoretical distributed robotics.
Research Focus
Key Achievements
Top Papers
- 1
- 2
- 3Dispersion of Mobile Robots Tolerating Faults12 citations · 2020
- 4Maximal Independent Set via Mobile Agents10 citations · 2024
- 5
- 6Dispersion of Mobile Robots on Directed Anonymous Graphs7 citations · 2022
- 7Filling MIS Vertices of a Graph by Myopic Luminous Robots6 citations · 2023
- 8Dispersion is (Almost) Optimal under (A)synchrony4 citations · 2025
- 9
- 10The Minimum Algorithm Size of k-Grouping by Silent Oblivious Robots2 citations · 2024