A two-stage UAV routing problem with time window considering rescheduling with random delivery reliability

Yan, Rui and Tian, Haotong and Gao, Kaiye and Peng, Rui and Liu, Bin (2022) A two-stage UAV routing problem with time window considering rescheduling with random delivery reliability. Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability, 237 (4). pp. 781-797. ISSN 1748-006X (https://doi.org/10.1177/1748006x221105395)

[thumbnail of Yan-etal-PIMEPO-2022-A-two-stage-UAV-routing-problem-with-time-window-considering-rescheduling]
Preview
 Text. Filename: Yan_etal_PIMEPO_2022_A_two_stage_UAV_routing_problem_with_time_window_considering_rescheduling.pdf
Accepted Author Manuscript
License: Strathprints license 1.0
Download (1MB)| Preview

Abstract

Reliability is an important metric for unmanned aerial vehicles (UAVs) to perform important, complex, and dangerous tasks. In addition, reliability influences the operational cost in UAVs routing. In order to reduce the operational cost of UAVs tasks, a method of routing strategy optimization is proposed from a view of mission reliability in this paper to address the limitations in routing scheduling. Different from previous studies on the UAVs routing optimization problem, this paper proposes a method that can reduce the operational costs of UAVs tasks based on the mission reliability. This method includes two stages: the pre-optimization stage and the rescheduling stage. In the pre-optimization stage, an optimal UAVs route solution is obtained for all the targets, while in the rescheduling stage, new UAVs are dispatched to the unvisited targets in the pre-optimization stage based on the new optimal UAVs route.

ORCID iDs

Yan, Rui, Tian, Haotong, Gao, Kaiye, Peng, Rui and Liu, Bin ORCID logoORCID: https://orcid.org/0000-0002-3946-8124;
CORE (COnnecting REpositories)