Institutional Repository [SANDBOX]
Technical University of Crete
EN  |  EL

Search

Browse

My Space

A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning

Kyriakakis Nikolaos-Antonios, Marinaki Magdalini, Matsatsinis Nikolaos, Marinakis Ioannis

Simple record


URIhttp://purl.tuc.gr/dl/dias/31EC9D33-BE4D-4EB8-ADDE-03EECC3E9039-
Identifierhttps://doi.org/10.1016/j.ejor.2021.09.008-
Identifierhttps://www.sciencedirect.com/science/article/pii/S0377221721007670-
Languageen-
Extent13 pagesen
TitleA cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planningen
CreatorKyriakakis Nikolaos-Antoniosen
CreatorΚυριακακης Νικολαος-Αντωνιοςel
CreatorMarinaki Magdalinien
CreatorΜαρινακη Μαγδαληνηel
CreatorMatsatsinis Nikolaosen
CreatorΜατσατσινης Νικολαοςel
CreatorMarinakis Ioannisen
CreatorΜαρινακης Ιωαννηςel
PublisherElsevieren
Content SummaryThis paper presents a Cumulative Unmanned Aerial Vehicle Routing Problem (CUAVRP) approach to optimize Humanitarian Coverage Path Planning (HCPP). Coverage path planning consists of finding the route which covers every point of a certain area of interest. This paper considers a Search & Rescue mission, using a homogeneous fleet of Unmanned Aerial Vehicles (UAVs). In this scenario, the objective is to minimize the sum of arrival times at all points of the area of interest, thus, completing the search with minimum latency. The HCPP problem is transformed into a Vehicle Routing Problem by using an approximate cellular decomposition technique to discretize the area into a grid, where the rectangles represent the UAV sensor’s field of view. The center points of the formed rectangles, become the nodes used for a UAV routing problem. This approach uses the objective of minimizing the sum of arrival times at customers, found in the Cumulative Capacitated Vehicle Routing Problem (CCVRP), adjusted for the Search & Rescue Coverage Path Planning using UAVs. The Min-max objective is also implemented and tested. Three versions of a Parallel Weighted Greedy Randomized Adaptive Search Procedure - Variable Neighborhood Decent (GRASP-VND) algorithm is implemented to solve the Cumulative UAV Routing Problem for Humanitarian Coverage Path Planning.en
Type of ItemPeer-Reviewed Journal Publicationen
Type of ItemΔημοσίευση σε Περιοδικό με Κριτέςel
Licensehttp://creativecommons.org/licenses/by/4.0/en
Date of Item2023-05-02-
Date of Publication2022-
SubjectHumanitarian coverage path planningen
SubjectUnmanned aerial vehicle routingen
SubjectGreedy randomized adaptive search procedureen
Bibliographic CitationN. A. Kyriakakis, M. Marinaki, N. Matsatsinis and Y. Marinakis, "A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning," Eur. J. Oper. Res., vol. 300, no. 3, pp. 992-1004, Aug. 2022, doi: 10.1016/j.ejor.2021.09.008.en

Services

Statistics