Subhash Bhagat

About

Subhash Bhagat is a researcher specializing in distributed computing and autonomous mobile robotics, with a particular focus on coordination algorithms for swarms of autonomous agents operating in Euclidean spaces. His work addresses foundational challenges in multi-robot systems, including gathering, formation, and visibility problems under realistic constraints such as asynchrony, fault tolerance, and limited sensing capabilities. Bhagat has made notable contributions to fault-tolerant gathering algorithms, demonstrating how asynchronous, oblivious robots can reliably converge even in the presence of crash faults, a problem he has explored across both two-dimensional and three-dimensional settings. His investigations into mutual visibility—asking robots to reposition so that no robot obstructs another's line of sight—have produced optimum algorithms that have become reference works in the field, collectively accumulating over 30 citations. He has also advanced understanding of formation problems, including general position formation and the innovative k-circle formation problem, where robots self-organize into multiple disjoint circular arrangements without centralized coordination. More recently, Bhagat has extended his research to graph-theoretic problems solved by mobile agents, including a 2024 study on maximal independent set computation in anonymous graphs. His body of work, spanning nearly a decade and garnering over 138 citations, reflects a sustained commitment to understanding the theoretical boundaries of what minimally equipped autonomous robots can collectively achieve.

Research Focus

Key Achievements

Top Papers

1. 1
   Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement

   29 citations · 2015
2. 2
   Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement

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

   16 citations · 2017
4. 4
   Optimum Algorithm for the Mutual Visibility Problem

   14 citations · 2020
5. 5
   k-Circle Formation and k-epf by Asynchronous Robots

   12 citations · 2021
6. 6
   Weak robots performing conflicting tasks without knowing who is in their team

   11 citations · 2020
7. 7
   Maximal Independent Set via Mobile Agents

   10 citations · 2024
8. 8
   Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement

   10 citations · 2015
9. 9
   Fault-tolerant Gathering of Semi-synchronous Robots

   9 citations · 2017
10. 10
    Gathering of Opaque Robots in 3D Space

    8 citations · 2018

Key Collaborators

Contact & Links