Traveling Salesperson Problems for the Dubins Vehicle
The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Abstract
In this paper, we study minimum-time motion planning and routing problems for the Dubins vehicle, i.e., a nonholonomic vehicle that is constrained to move along planar paths of bounded curvature, without reversing direction. Motivated by autonomous aerial vehicle applications, we consider the traveling salesperson problem for the Dubins vehicle (DTSP): givennpoints on a plane, what is the shortest Dubins tour through these points, and what is its length? First, we show that the worst-case length of such a tour grows linearly withnand we propose a novel algorithm with performance within a constant factor of the optimum for the worst-case point sets. In doing this, we also obtain an upper bound on the optimal length in the classical point-to-point problem. Second, we study a stochastic version of the DTSP where thentargets are randomly and independently sampled from a uniform distribution. We show that the expected length of such a tour is of order at leastn2/3and we propose a novel algorithm yielding a solution with length of ordern2/3with probability one. Third and finally, we study a dynamic version of the DTSP: given a stochastic process that generates target points, is there a policy that guarantees that the number of unvisited points does not diverge over time? If such stable policies exist, what is the minimum expected time that a newly generated target waits before being visited by the vehicle? We propose a novel stabilizing algorithm such that the expected wait time is provably within a constant factor from the optimum.
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
Cites
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
LaValle, S. M. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546877 · Cited by 5,211
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
LaValle, S. M. (2006) · Cited by 4,177
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
Lin, S., & Kernighan, B. W. (1973) · Operations Research · doi:10.1287/opre.21.2.498 · Cited by 3,821
Dubins, L. E. (1957) · American Journal of Mathematics · doi:10.2307/2372560 · Cited by 3,045
Queueing Systems. Volume 1: Theory
Kleinrock, L. (1975) · Cited by 1,972
An Introduction to Probability Theory and Its Applications
Freedman, D. A., & Feller, W. (1967) · Econometrica · doi:10.2307/1905668 · Cited by 1,244
The shortest path through many points
Beardwood, J., Halton, J. H., & Hammersley, J. M. (1959) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s0305004100034095 · Cited by 937
Intercontinental, B. (1985) · Cited by 682
Cited by
Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms
Bullo, F., Cortés, J., & Martínez, S. (2009) · Princeton University Press eBooks · doi:10.1515/9781400831470 · Cited by 1,509
Self-citationOtto, A., Agatz, N., Campbell, J., Golden, B., & Pesch, E. (2018) · Networks · doi:10.1002/net.21818 · Cited by 985
“F11 Several articles consider the TSP or the VRP with a restriction on the minimum turning radius, called the Dubins TSP and the Dubins VRP, respectively [55, 197, 223, 242, 299, 304, 320].”
BackgroundMethodInfluentialDynamic vehicle routing problems: Three decades and counting
Psaraftis, H. N., Wen, M., & Kontovas, C. A. (2016) · Networks · doi:10.1002/net.21628 · Cited by 709
Chung, S. H., Sah, B., & Lee, J. (2020) · Computers & Operations Research · doi:10.1016/j.cor.2020.105004 · Cited by 441
Metadata
- Authors
- Savla, K., Frazzoli, E., & Bullo, F.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2008-07
- Volume
- 53
- Issue
- 6
- Pages
- 1378-1391
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W2148761022
- Cited by
- 259
- References
- 23
- FWCI
- 25.77
- 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
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.