Dispersion of Mobile Agents
Time-efficient dispersion of mobile agents on anonymous graphs under asynchrony and limited communication.
-
2Conference SPAA · 2025
-
3
Room No. 19,
CGS Advanced Research Complex,
IIT Indore.
Office
Room No. 19,
CGS Advanced Research Complex,
IIT Indore.
Featured project · Living survey
A Living Survey of Open Problems on Autonomous Agents, Robots and Particles
A public atlas of research problems in distributed computing by mobile entities: agents on graphs, robots in the plane, geometric search, and programmable matter. Each problem is mapped across its model settings, with the known results, the papers behind them, and what is still open.
Beyond the Boundary: Optimal Grid Dispersion by Spread, Reverse, and Collect accepted to ICDCN 2027, to be held at NIT Karnataka, Surathkal.
Read the latest posts on The Oblivious Robot.
Selected work by theme. Search the full list or open the publications page.
Overview
My research interests lie in the design and analysis of algorithms for mobile agents and mobile robots operating in both discrete (graphs) and continuous spaces. I focus on fundamental problems such as exploration, search, rendezvous, evacuation, and filling under constraints of limited memory, communication, or environmental knowledge. I am particularly interested in distributed coordination, fault-tolerant behavior, and the impact of structure and complexity on algorithmic performance. My work spans deterministic and randomized strategies, with applications in swarm robotics, multi-agent coordination, and autonomous systems. I also work on developing simulators for these systems, a couple of them are linked here, under CCM Model and LCM Model.
Time-efficient dispersion of mobile agents on anonymous graphs under asynchrony and limited communication.
Universal pattern formation, dancing, and geometric arrangements by luminous and oblivious robots.
Coordination and exploration under crash faults, Byzantine companions, and hazardous environments.
Leader election, connectivity, treasure hunt, and computation via mobile agents on graphs.
Work with me on these themes
Open problems, supervision, and student opportunities.
AI Agents: Life and Money
Ethereum Day
Introduction to Distributed Algorithms
Foundational Lecture Series on Theoretical Computer Science (FSTCS) 2026
AI Agents: The Moving Frontier
Department of Mathematics, IIT Guwahati
Best paper award for Universal Dancing paper in SIROCCO 2026.
Best Doctoral Thesis award from the Department of Mathematics, IIT Guwahati.
Best Paper award at ICDCIT 2023 for paper on MIS Filling.
PM-ECRG (Prime Minister Early Career Research Grant Scheme) (2026)
Funding Agency: ANRF
Project: Collective Resilience: Harnessing Swarm Intelligence Against Byzantine Faults
YFRSG (Young Faculty Research Seed Grant Scheme)
Funding Agency: IIT Indore
Project: Schedulers Galore: Asynchronous, Synchronous and Sequential
Project Pankhuri Coordinator
Alongside my academic work, I help run Project Pankhuri, a small learning and enrichment initiative for students of Classes 6-8 from tribal and rural communities. We create spaces where they can learn with curiosity, ask questions freely, explore new ideas, and experience the joy of learning. Pankhuri is our small effort to ensure that a child's background does not define the opportunities they have to learn, explore, dream, and grow.
Started by Dr. Lawqueen Kanesh. Coordinated with Dr. Subhra Mazumdar.
Interactive simulator for the coordinated concurrent movement model.
Interactive simulator for the classic Look-Compute-Move model.
Interactive simulator for the Black Hole Search problem with Byzantine agents.
Interactive simulator for the SILBOT mobile robot model.
Interactive simulator for the MobileAutomata model.
Interactive simulator of flight vs high-speed rail vs hybrid city-center journeys.
Step-by-step demos by category: traversal, shortest paths, spanning trees, online algorithms, and distributed agents.