Edward S. Rankin

Papers

Total Citations

200

H-Index

About

Edward S. Rankin is a leading figure in algorithmic robotics, whose work has fundamentally advanced the field of multi-robot coordination and autonomous coverage. His research centers on developing efficient, provably-correct algorithms for complex spatial tasks, with a particular emphasis on boustrophedon (lawnmower) path planning. Rankin’s seminal 2008 paper, "Efficient Boustrophedon Multi-Robot Coverage: an algorithmic approach," has garnered over 200 citations, establishing a cornerstone for modern coverage path planning. In this work, he introduced a novel decomposition method that allows multiple robots to collaboratively cover an area with minimal overlap and optimal time, addressing a critical bottleneck in applications from precision agriculture to search-and-rescue. Beyond this, Rankin’s contributions extend to distributed coordination strategies and sensor-based mapping, where his algorithms have been adopted in commercial robotic systems. His ability to blend rigorous theoretical analysis with practical implementation has made his work indispensable for researchers and engineers alike. Rankin’s impact is reflected not only in citation counts but also in the widespread adoption of his methods in real-world multi-robot deployments, cementing his reputation as a pioneer in intelligent, scalable robotic systems.