An approximation algorithm for the curvature-constrained traveling salesman problem
Jérôme Le Ny, Éric Féron · PolyPublie (École Polytechnique de Montréal) · 2005
We present an approximation algorithm for the Traveling Salesman Problem when the vehicle is constrained to move forward along paths with bounded cur-vature (Dubins ’ vehicle). A deterministic algorithm returns in time O(n3) a tour within 1 + max