AIAA Guidance, Navigation, and Control Conference 2010
DOI: 10.2514/6.2010-8435
|View full text |Cite
|
Sign up to set email alerts
|

Vehicle Routing Problem Instances: Application to Multi-UAV Mission Planning

Abstract: For many decades, the Vehicle Routing Problem (VRP) and its different variants have been studied and found applications in the real world. This paper briefly surveys VRP instances with applications to multi-objective Unmanned Aerial Vehicle (UAV) operations. Focusing on multi-objective multi-UAV mission planning problems, we try to take advantage of the literature in the VRP and its variants. We show that each military multi-UAV mission has its corresponding VRP variant. We present a novel algorithm that relie… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 20 publications
(11 citation statements)
references
References 19 publications
(22 reference statements)
0
9
0
Order By: Relevance
“…In general vehicle routing problems, the standard objective function is typically time minimization for visiting a set number of nodes. In UAV fleet mission planning, several variants of objective functions such as reducing individual UAV costs, increasing safety in operations, reducing lead time, and increasing the load capacity of the entire system are considered [3,[21][22][23][24]. Furthermore, the problem can be considered an extension of the vehicle routing and scheduling problems and belongs to the class of NP-hard problems [2,4].…”
Section: Literature Reviewmentioning
confidence: 99%
“…In general vehicle routing problems, the standard objective function is typically time minimization for visiting a set number of nodes. In UAV fleet mission planning, several variants of objective functions such as reducing individual UAV costs, increasing safety in operations, reducing lead time, and increasing the load capacity of the entire system are considered [3,[21][22][23][24]. Furthermore, the problem can be considered an extension of the vehicle routing and scheduling problems and belongs to the class of NP-hard problems [2,4].…”
Section: Literature Reviewmentioning
confidence: 99%
“…T w here represents the time window. For example, for location-2 we have a time window [1][2][3][4][5] which means that an agent cannot be somewhere else between time step 1 and 5. Because of that, we can not assign UAVs 1, 2 and 3 to location-1, as it's time window collides with the time window of location-1.…”
Section: Problem Descriptionmentioning
confidence: 99%
“…However, for some cases, classical VRP formulation is inadequate to represent real-world scenarios. Because of that VRP has several variations, Faied et al [2] provided a survey about these variations. One variation of VRP is capacitated vehicle routing problem (CVRP).…”
Section: Introductionmentioning
confidence: 99%
“…Studies in the literature have used methods for UAV mission planning where the routes have been derived by satisfying the UAV dynamics using linear approximations for energy-consumption models [25,26]. Certain existing models have not considered all the significant physical properties related to UAVs and have used approaches such as VRP with time windows (VRPTW) [27,28].…”
Section: Introductionmentioning
confidence: 99%