Peyman Afshani
Papers
3
Total Citations
20
H-Index
2
About
Peyman Afshani is a researcher specializing in computational geometry, algorithm design, and multi-robot systems, with a particular focus on optimization problems in metric spaces. His most prominent contributions center on the challenging domain of multi-robot patrol scheduling, where he has developed approximation algorithms for minimizing worst-case latency across surveillance sites — a problem with significant real-world implications for autonomous systems and security applications. Afshani's most cited work, "Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency," has garnered 15 citations since its 2021 publication, reflecting growing interest in scalable, theoretically grounded solutions for coordinating robotic teams. This research addresses the fundamental question of how k robots can efficiently cover n sites in a metric space while minimizing the maximum time any location goes unvisited — a combinatorially complex problem with practical urgency. His subsequent 2022 work on cyclic solutions further refines this framework by exploring structured, repeating patrol schedules, offering both theoretical elegance and implementational clarity. Through these contributions, Afshani has helped establish rigorous algorithmic foundations for multi-agent patrolling, making his work valuable reading for researchers in robotics, operations research, and theoretical computer science.
Research Focus
Key Achievements
Top Papers
- 1
- 2
- 3