Vala Zeinali
Papers
1
Total Citations
9
H-Index
1
About
Vala Zeinali is a researcher in robotics and computational geometry, with a focus on coverage path planning and approximation algorithms for constrained robotic systems. Their most cited work, "A 2-Approximation Algorithm for the Online Tethered Coverage Problem" (2019, 9 citations), addresses a fundamental challenge in autonomous exploration: how to systematically cover a planar environment using a robot tethered to a fixed point by a cable of finite length. Zeinali’s key contribution is a provably optimal 2-approximation algorithm that discretizes the environment into 4-connected grid cells, enabling efficient coverage even in the presence of unknown obstacles. This work has significant implications for search-and-rescue operations, industrial inspection, and environmental monitoring, where tethered robots must balance mobility with cable constraints. While their citation count is modest, the problem’s novelty and the algorithm’s theoretical guarantees mark Zeinali as an emerging voice in online coverage problems. Their research bridges practical robotics with rigorous algorithmic analysis, offering a foundation for future work on resource-constrained autonomous systems. For students and researchers, Zeinali’s work exemplifies how elegant theoretical solutions can address real-world robotic limitations.
Research Focus
Key Achievements
Top Papers
- 1A 2-Approximation Algorithm for the Online Tethered Coverage Problem9 citations · 2019