Max Robotics — Global Service Robot Directory + US Certification

About

Yoav Gabriely is a robotics researcher whose work has made foundational contributions to mobile robot motion planning, with a particular focus on coverage algorithms and competitive online navigation in unknown environments. He is best known for developing the Spanning Tree Covering (STC) algorithm and its online variant, Spiral-STC, which address the challenge of efficiently covering continuous planar areas using a mobile robot equipped with a square-shaped tool. These works, accumulating over 380 and 164 citations respectively, introduced elegant grid-subdivision and spanning-tree traversal strategies that have become reference points in the autonomous coverage literature, with applications ranging from lawn mowing and vacuuming to search-and-rescue operations. Beyond coverage, Gabriely made significant contributions to competitive analysis of online robot navigation, developing algorithms such as CBUG and MRBUG that provide mathematically rigorous performance guarantees for single and multi-robot path-finding in unknown environments. His framework for classifying mobile robot problems by their competitive complexity offered the research community a structured lens through which to evaluate algorithmic efficiency against optimal offline solutions. Across his body of work, Gabriely consistently bridged theoretical rigor with practical robotics challenges, making his research particularly valuable for students and engineers designing autonomous systems that must operate reliably without prior environmental knowledge.