Rik Sarkar
Papers
3
Total Citations
20
H-Index
2
About
Rik Sarkar’s research lies at the intersection of robotics, algorithms, and combinatorial optimization, with a primary focus on multi-robot patrolling and scheduling problems. His most significant contribution is the development of approximation algorithms for the min-max latency multi-robot patrol problem, where the goal is to coordinate a team of robots to repeatedly visit a set of sites while minimizing the maximum time any site goes unvisited. In his 2021 paper, which has garnered 15 citations, Sarkar introduced novel algorithmic frameworks that provide provable performance guarantees for this NP-hard problem, addressing both weighted and unweighted latency objectives. His 2022 work on cyclic solutions further refines these approaches, exploring structured patrol schedules that balance efficiency and fairness. Sarkar’s research is notable for its rigorous theoretical foundations combined with practical relevance to surveillance, security, and environmental monitoring. By bridging approximation theory with multi-agent coordination, he has advanced the state of the art in autonomous patrol systems, offering scalable solutions that can be deployed in real-world scenarios with limited robot resources.
Research Focus
Key Achievements
Top Papers
- 1
- 2
- 3