Benjamin Raichel
Papers
3
Total Citations
20
H-Index
2
About
Benjamin Raichel is a leading researcher in the theory and design of approximation algorithms for multi-robot systems, with a particular focus on patrol-scheduling and latency minimization. His work addresses fundamental challenges in coordinating multiple autonomous agents to efficiently visit a set of sites while minimizing the maximum time any site goes unvisited—a problem known as min-max latency. Raichel’s major contributions include developing novel approximation algorithms that provide provable performance guarantees for this NP-hard problem, bridging the gap between theoretical computer science and practical robotics. His most-cited paper, “Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency” (2021, 15 citations), introduces efficient methods for scheduling robots in metric spaces, achieving near-optimal latency bounds. He has also explored cyclic solutions to further refine patrol strategies, as seen in his 2022 work. Raichel’s research is highly impactful, offering foundational insights for surveillance, security, and autonomous monitoring applications. His work is essential reading for students and researchers in algorithmic robotics, combinatorial optimization, and multi-agent systems.
Research Focus
Key Achievements
Top Papers
- 1
- 2
- 3