Partha Sarathi Mandal
Papers
15
Total Citations
90
H-Index
5
About
Partha Sarathi Mandal is a leading researcher in distributed computing and mobile robotics, whose work addresses fundamental coordination problems in autonomous multi-robot systems. His research focuses on evacuation, gathering, dispersion, and visibility problems, with a strong emphasis on fault tolerance and minimal assumptions about robot capabilities. Mandal’s most cited paper, “Evacuating Two Robots from Two Unknown Exits on the Perimeter of a Disk with Wireless Communication” (2018, 24 citations), tackles the novel challenge of emergency evacuation in distributed systems. He has made significant contributions to the dispersion problem, where robots must occupy distinct nodes on a graph, developing algorithms that tolerate faults (2020, 12 citations). His work on gathering with weak multiplicity detection in the presence of crash-faults (2018, 14 citations) demonstrates his ability to solve complex coordination tasks under realistic constraints. Mandal has also advanced the mutual visibility problem, addressing angular inaccuracy and mobility failures (2024, 5 and 2 citations). His recent papers on filling maximal independent sets with myopic luminous robots (2023, 7 and 6 citations) and collaborative dispersion by silent robots (2022, 4 citations) showcase his ongoing impact. Mandal’s research is essential reading for anyone interested in the theoretical foundations of swarm robotics and distributed algorithms.
Research Focus
Key Achievements
Top Papers
- 1
- 2
- 3Dispersion of Mobile Robots Tolerating Faults12 citations · 2020
- 4
- 5Filling MIS Vertices of a Graph by Myopic Luminous Robots6 citations · 2023
- 6Mutual visibility of luminous robots despite angular inaccuracy5 citations · 2024
- 7Collaborative Dispersion by Silent Robots4 citations · 2022
- 8Collaborative dispersion by silent robots4 citations · 2024
- 9
- 10