The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Planning Paths for Package Delivery in Heterogeneous Multirobot Teams
Abstract
This paper addresses the task scheduling and path planning problem for a team of cooperating vehicles performing autonomous deliveries in urban environments. The cooperating team comprises two vehicles with complementary capabilities, a truck restricted to travel along a street network, and a quadrotor micro-aerial vehicle of capacity one that can be deployed from the truck to perform deliveries. The problem is formulated as an optimal path planning problem on a graph and the goal is to find the shortest cooperative route enabling the quadrotor to deliver items at all requested locations. The problem is shown to be NP-hard. A solution is then proposed using a novel reduction to the Generalized Traveling Salesman Problem, for which well-established heuristic solvers exist. The heterogeneous delivery problem contains as a special case the problem of scheduling deliveries from multiple static warehouses. We propose two additional algorithms, based on enumeration and a reduction to the traveling salesman problem, for this special case. Simulation results compare the performance of the presented algorithms and demonstrate examples of delivery route computations over real urban street maps.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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 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
The Traveling salesman problem: a computational study
(2007) · Choice Reviews Online · doi:10.5860/choice.45-0928 · Cited by 1,726
(2006) · Algorithms and Combinatorics 21 · doi:10.1007/3-540-29297-7 · Cited by 1,156
Combinatorial optimization: Theory and algorithms
(2001) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(01)90023-9 · Cited by 600
Combinatorial Optimization: Theory and Algorithms
Korte, B., & Vygen, J. (2012) · Algorithms and Combinatorics · doi:10.1007/978-3-642-24488-9 · Cited by 507
General k-opt submoves for the Lin–Kernighan TSP heuristic
Helsgaun, K. (2009) · Mathematical Programming Computation · doi:10.1007/s12532-009-0004-6 · Cited by 414
Korte, B., & Vygen, J. (2000) · Algorithms and Combinatorics · doi:10.1007/978-3-662-21708-5 · Cited by 393
Guest Editorial Can Drones Deliver?
D'Andrea, R. (2014) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2014.2326952 · Cited by 329
Sensing and coverage for a network of heterogeneous robots
Pimenta, L. C. A., Kumar, V., Mesquita, R. C., & Pereira, G. A. S. (2008) · 2008 47th IEEE Conference on Decision and Control · doi:10.1109/cdc.2008.4739194 · Cited by 279
Current State of the Art in Distributed Autonomous Mobile Robotics
Parker, L. E. (2000) · Distributed Autonomous Robotic Systems 4 · doi:10.1007/978-4-431-67919-6_1 · Cited by 276
Cited by
Otto, A., Agatz, N., Campbell, J., Golden, B., & Pesch, E. (2018) · Networks · doi:10.1002/net.21818 · Cited by 985
“[167] P, Exp drone, UGV limited flight time, delivery of 1 package per sortie transport”
BackgroundInfluentialOn the min-cost Traveling Salesman Problem with Drone
Ha, Q. M., Deville, Y., Pham, Q. D., & Hà, M. H. (2018) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2017.11.015 · Cited by 622
The multiple flying sidekicks traveling salesman problem: Parcel delivery with multiple drones
Murray, C. C., & Raj, R. (2020) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2019.11.003 · Cited by 575
An adaptive large neighborhood search metaheuristic for the vehicle routing problem with drones
Sacramento, D., Pisinger, D., & Ropke, S. (2019) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2019.02.018 · Cited by 563
Drone-aided routing: A literature review
Macrina, G., Di Puglia Pugliese, L., Guerriero, F., & Laporte, G. (2020) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2020.102762 · Cited by 522
Metadata
- Authors
- Mathew, N., Smith, S. L., & Waslander, S. L.
- Venue
- IEEE Transactions on Automation Science and Engineering
- Published
- 2015-10
- Volume
- 12
- Issue
- 4
- Pages
- 1298-1308
- ISSN
- 1545-5955 (ISSN-L)
- 1558-3783
- OpenAlex
- W1650780448
- Cited by
- 301
- References
- 22
- FWCI
- 27.53
- 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: Planning Paths for Package Delivery in Heterogeneous Multirobot Teams. https://app.cochat.ai/papers/10.1109/tase.2015.2461213
- The paper
- Mathew, N., Smith, S. L., & Waslander, S. L. (2015). Planning Paths for Package Delivery in Heterogeneous Multirobot Teams. IEEE Transactions on Automation Science and Engineering. https://doi.org/10.1109/tase.2015.2461213
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.