Urban Air Logistics with Unmanned Aerial Vehicles (UAVs): Double-Chromosome Genetic Task Scheduling with Safe Route Planning

In an efficient aerial package delivery scenario carried out by multiple Unmanned Aerial Vehicles (UAVs), a task allocation problem has to be formulated and solved in order to select the most suitable assignment for each delivery task. This paper presents the development methodology of an evolutionary-based optimization framework designed to tackle a specific formulation of a Drone Delivery Problem (DDP) with charging hubs. The proposed evolutionary-based optimization framework is based on a double-chromosome task encoding logic. The goal of the algorithm is to find optimal (and feasible) UAV task assignments such that (i) the tasks’ due dates are met, (ii) an energy consumption model is minimized, (iii) re-charge tasks are allocated to ensure service persistency, (iv) risk-aware flyable paths are included in the paradigm. Hard and soft constraints are defined such that the optimizer can also tackle very demanding instances of the DDP, such as tens of package delivery tasks with random temporal deadlines. Simulation results show how the algorithm’s development methodology influences the capability of the UAVs to be assigned to different tasks with different temporal constraints. Monte Carlo simulations corroborate the results for two different realistic scenarios in the city of Turin, Italy.

Authors

Institutions

Publication Details

Journal
Smart Cities
Published
2024-10-06
DOI
https://doi.org/10.3390/smartcities7050110
Citations
11
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
2.74
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Urban Air Logistics with Unmanned Aerial Vehicles (UAVs): Double-Chromosome Genetic Task Scheduling with Safe Route Planning

Martin Bugaj, Giorgio Guglieri, Ján Rostáš, Marco Rinaldi et al.
11 citations
Smart Cities
Robotic Path Planning Algorithms
2.74
article

Urban Air Logistics with Unmanned Aerial Vehicles (UAVs): Double-Chromosome Genetic Task Scheduling with Safe Route Planning

Martin Bugaj, Giorgio Guglieri, Ján Rostáš, Marco Rinaldi, Stefano Primatesta
article en
11 citations

Abstract

In an efficient aerial package delivery scenario carried out by multiple Unmanned Aerial Vehicles (UAVs), a task allocation problem has to be formulated and solved in order to select the most suitable assignment for each delivery task. This paper presents the development methodology of an evolutionary-based optimization framework designed to tackle a specific formulation of a Drone Delivery Problem (DDP) with charging hubs. The proposed evolutionary-based optimization framework is based on a double-chromosome task encoding logic. The goal of the algorithm is to find optimal (and feasible) UAV task assignments such that (i) the tasks’ due dates are met, (ii) an energy consumption model is minimized, (iii) re-charge tasks are allocated to ensure service persistency, (iv) risk-aware flyable paths are included in the paradigm. Hard and soft constraints are defined such that the optimizer can also tackle very demanding instances of the DDP, such as tens of package delivery tasks with random temporal deadlines. Simulation results show how the algorithm’s development methodology influences the capability of the UAVs to be assigned to different tasks with different temporal constraints. Monte Carlo simulations corroborate the results for two different realistic scenarios in the city of Turin, Italy.

Smart CitiesVol. 7(5)
Politecnico di Torino (IT), University of Žilina (SK)
Affordable and clean energy
Openalex Percentile: Top 8%
Robotic Path Planning Algorithms
2.74
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.