We consider algorithms for the curvature-constrained traveling salesman problem, when the nonholonomic constraint is described by Dubins' model. We indicate a proof of the NP-hardness of this problem. In the case of low point densities, i.e., when the Euclidean distances between the points are larger than the turning radius of the vehicle, variousâ€¦Â (More)