For maritime coverage planning on irregular grids, implementation details matter more than algorithm family—a Warnsdorff variant with specific tie-breaking rules outperforms other classical methods, but no classical approach reliably produces zero-revisit tours.
This paper benchmarks 17 classical path-planning algorithms on 10,000 irregular hexagonal grid problems inspired by maritime scenarios like search and rescue.