The DOI matches its Crossref record.
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 some recently proposed heuristics. We also describe new algorithms for this problem based on heading discretization, and evaluate their performance numerically.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Otto, A., Agatz, N., Campbell, J., Golden, B., & Pesch, E. (2018) · Networks · doi:10.1002/net.21818 · Cited by 985
“[193] M, H, Exp drone general [195] M, Exp drone limited flight time other (traffic surveillance on roads) [197] P, H, Exp drone minimum turning radius general [198] P, H, Exp drone minimum turning radius general [204] M, P, H, Decentral H, Exp several drones minimum turning radius general”
BackgroundInfluentialChung, S. H., Sah, B., & Lee, J. (2020) · Computers & Operations Research · doi:10.1016/j.cor.2020.105004 · Cited by 441
Metadata
- Authors
- Le Ny, J., Feron, E., & Frazzoli, E.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2012-01
- Volume
- 57
- Issue
- 1
- Pages
- 265-270
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W1970071808
- Cited by
- 161
- References
- 0
- FWCI
- 25.27
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the Dubins Traveling Salesman Problem. https://app.cochat.ai/papers/10.1109/tac.2011.2166311
- The paper
- Le Ny, J., Feron, E., & Frazzoli, E. (2012). On the Dubins Traveling Salesman Problem. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2011.2166311
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.