Max Robotics — Global Service Robot Directory + US Certification

About

Prabhat Kumar Chand is a rising researcher in distributed computing and mobile agent algorithms, with a focus on solving fundamental graph problems through multi-agent collaboration. His work centers on developing efficient, fault-tolerant protocols for anonymous and dynamic networks, where agents must coordinate without prior knowledge of the network topology. In his highly cited paper "Run for Cover: Dominating Set via Mobile Agents" (2023, 11 citations), Chand introduced novel strategies for agents to collaboratively compute a dominating set—a critical primitive for network monitoring and coverage. He further advanced the field with "Fault-Tolerant Dispersion of Mobile Robots" (2023, 8 citations), addressing how agents can reliably spread across a network despite failures, a key challenge for resilient autonomous systems. More recently, his 2024 works on agent-driven BFS tree construction and triangle counting have unlocked powerful applications, including truss decomposition and triangle centrality measures. These contributions demonstrate Chand’s ability to bridge theoretical algorithm design with practical graph analytics, earning him recognition as an emerging leader in distributed algorithms. His research continues to push the boundaries of what mobile agents can achieve in complex, anonymous environments.