The path-planning problem for autonomous mobile robots has been addressed by classical search techniques such as A* or, more recently, Theta* or S-Theta*. However, research usually focuses on reducing the length of the path or the processing time. The common practice in the literature is to report the run-time/length of ...