The curvature-constrained traveling salesman problem for high point densities


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)
DOI: 10.1109/CDC.2007.4434503


2 Figures and Tables

Slides referencing similar topics