Abstract

Unmanned Aerial Vehicles (UAVs), also known as drones, are a class of aircraft without the presence of pilots on board. UAVs have the ability to reduce the time and cost of deliveries and to respond to emergency situations. Currently, UAVs are extensively used for data delivery and/or collection to/from dangerous or inaccessible sites. However, trajectory planning is one of the major UAV issues that needs to be solved. To address this question, we focus in this paper on determining the optimized routes to be followed by the drones for data pickup and delivery with a time window with an intermittent connectivity network, while also having the possibility to recharge the drones’ batteries on the way to their destinations. To do so, we formulated the problem as a multi-objective optimization problem, and we showed how to use the Non-dominated Sorting Genetic Algorithm II (NSGA-II) to solve this problem. Several experiments were conducted to validate the proposed algorithm by considering different scenarios.

Highlights

  • We focus on the Multi-Objective Evolutionary Algorithm (MOEA) technique to solve the PDPTW using multiple Unmanned Aerial Vehicles (UAVs)

  • The Pickup and Delivery optimization Problem with a Time Window for UAVs (PDPTW-UAV) is an extended variant of the PDPTW originally designed for terrestrial vehicles

  • To better describe our optimization problem, we propose below the different terminologies used in the PDPTW-UAV

Read more

Summary

Use Case

During natural disasters such as earthquakes, floods, landslides, or hurricanes, road and telecommunications infrastructures can suffer significant damage that renders them unusable. Communication and network connectivity may be lost, or roads may become impassable and prevent emergency vehicles from reaching damaged areas, which we call critical sites. These sites need the rapid deployment of a temporary solution to communicate with the other critical sites and with the emergency headquarters management center, known as the central entity. It illustrates a scenario in which several UAVs leave a truck, operating as a depot, to pick up data at given sites, deliver them to other sites while satisfying data latency, UAV load capacity, and UAV autonomy (i.e., UAV energy), and fly back to the depot

PDPTW-UAV
Objectives
Fractional Variables
Problem Model
Solving the PDPTW-UAV Using the NSGA-II
27: Compute the crowding distance in Fi
Individual Representation
Crossover Operation
Mutation Operation
Selection Operation
Refinement UAV Task List Algorithm
Individual Improvement Algorithm
Individual Correction Algorithm
Refueling Constraints’ Verification Algorithm
Performance Evaluation
Simulation Parameters
Solving PDPTW Using Our NSGA-II
Convergence of Our NSGA-II Algorithm
Schedule Time
Solving the PDPTW-UAV Using Our NSGA-II
Coping with Uncertainties and a Real-World Scenario
Conclusions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.