Soroush Alamdari

Cornell University, University of Waterloo

Papers

Total Citations

130

H-Index

About

Soroush Alamdari’s research lies at the intersection of robotics, algorithms, and graph theory, with a central focus on persistent monitoring and path planning in discrete environments. His major contribution is the formulation and solution of the min-max latency walk problem, where a robot must repeatedly visit weighted vertices to minimize the maximum time between observations. This work directly addresses real-world surveillance and environmental monitoring tasks, where timely data collection is critical. His most-cited paper, “Persistent monitoring in discrete environments: Minimizing the maximum weighted latency between observations” (2013, 125 citations), introduces approximation algorithms that balance travel time and vertex importance, providing provable performance guarantees. Alamdari’s approach models environments as vertex- and edge-weighted graphs, enabling efficient patrol strategies that scale to complex settings. While his later papers on the same topic have fewer citations, the foundational 2013 work remains a key reference in the field. His research is notable for bridging theoretical computer science with practical robotics, offering rigorous solutions to problems in autonomous surveillance, sensor networks, and infrastructure inspection. For students and researchers, Alamdari’s work exemplifies how algorithmic thinking can directly impact robotic system design.