Loading [a11y]/accessibility-menu.js
On the Dubins Traveling Salesman Problem | IEEE Journals & Magazine | IEEE Xplore

On the Dubins Traveling Salesman Problem


Abstract:

We study the traveling salesman problem for a Dubins vehicle. We prove that this problem is NP-hard, and provide lower bounds on the approximation ratio achievable by som...Show More

Abstract:

We study the traveling salesman problem for a Dubins vehicle. We prove that this problem is NP-hard, and provide lower bounds on the approximation ratio achievable by some recently proposed heuristics. We also describe new algorithms for this problem based on heading discretization, and evaluate their performance numerically.
Published in: IEEE Transactions on Automatic Control ( Volume: 57, Issue: 1, January 2012)
Page(s): 265 - 270
Date of Publication: 29 August 2011

ISSN Information:


References

References is not available for this document.