Modeling and controlling highly nonlinear, multivariable, unstable, coupled and underactuated systems are challenging problems to which a unique solution does not exist. Modeling and control of Unmanned Aerial Vehicles (UAVs) with four rotors fall into that category of problems. In this paper, a nonlinear quadrotor UAV dynamical model is developed with the Newton–Euler method, and a control architecture is proposed for 3D trajectory tracking. The controller design is decoupled into two parts: an inner loop for attitude stabilization and an outer loop for trajectory tracking. A few attitude stabilization methods are discussed, implemented and compared, considering the following control approaches: Proportional–Integral–Derivative (PID), Linear–Quadratic Regulator (LQR), Model Predictive Control (MPC), Feedback Linearization (FL) and Sliding Mode Control (SMC). This paper is intended to serve as a guideline work for selecting quadcopters’ control strategies, both in terms of quantitative and qualitative considerations. PID and LQR controllers are designed, exploiting the model linearized about the hovering condition, while MPC, FL and SMC directly exploit the nonlinear model, with minor simplifications. The fast dynamics ensured by the SMC-based controller together with its robustness and the limited estimated command effort of the controller make it the most promising controller for quadrotor attitude stabilization. The outer loop consists of three independent PID controllers: one for altitude control and the other two, together with a dynamics’ inversion, are entitled to the computation of the reference attitude for the inner loop. The capability of the controlled closed-loop system of executing complex trajectories is demonstrated by means of simulations in MATLAB/Simulink^®.

Unmanned Aerial Vehicles (UAVs) are gaining momentum in many civil and military sectors. An example is represented by the logistics sector, where UAVs have been proven to be able to improve the efficiency of the process itself, as their cooperation with trucks can decrease the delivery time and reduce fuel consumption. In this paper, we first state a mathematical formulation of the Travelling Salesman Problem (TSP) applied to logistic routing, where a truck cooperates synchronously with multiple UAVs for parcel delivery. Then, we propose, implement, and compare different sub-optimal routing approaches to the formulated mFSTSP (multiple Flying Sidekick Travelling Salesman Problem) since the inherent combinatorial computational complexity of the problem makes it unattractable for commercial Mixed-Integer Linear Programming (MILP) solvers. A local search algorithm, two hybrid genetic algorithms that permutate feasible and infeasible solutions, and an alternative ad-hoc greedy method are evaluated in terms of the total delivery time of the output schedule. For the sake of the evaluation, the savings in terms of delivery time over the well-documented truck-only TSP solution are investigated for each proposed routing solution, and this is repeated for two different scenarios. Monte Carlo simulations corroborate the results.

Unmanned aerial vehicles (UAVs), commonly known as drones, are being seen as the most promising type of autonomous vehicles in the context of intelligent transportation system (ITS) technology. A key enabling factor for the current development of ITS technology based on autonomous vehicles is the task allocation architecture. This approach allows tasks to be efficiently assigned to robots of a multi-agent system, taking into account both the robots’ capabilities and service requirements. Consequently, this study provides an overview of the application of drones in ITSs, focusing on the applications of task allocation algorithms for UAV networks. Currently, there are different types of algorithms that are employed for task allocation in drone-based intelligent transportation systems, including market-based approaches, game-theory-based algorithms, optimization-based algorithms, machine learning techniques, and other hybrid methodologies. This paper offers a comprehensive literature review of how such approaches are being utilized to optimize the allocation of tasks in UAV-based ITSs. The main characteristics, constraints, and limitations are detailed to highlight their advantages, current achievements, and applicability to different types of UAV-based ITSs. Current research trends in this field as well as gaps in the literature are also thoughtfully discussed.

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.

This paper tackles the problem of resource sharing and dynamic task assignment in a task scheduling architecture designed to enable a persistent, safe, and energy-efficient Intelligent Transportation System (ITS) based on multi-rotor Unmanned Aerial Vehicles (UAVs). The addressed task allocation problem consists of heterogenous pick-up and delivery tasks with time deadline constraints to be allocated to a heterogenous fleet of UAVs in an urban operational area. The proposed architecture is distributed among the UAVs and inspired by market-based allocation algorithms. By exploiting a multi-auctioneer behavior for allocating both delivery tasks and re-charge tasks, the fleet of UAVs is able to (i) self-balance the utilization of each drone, (ii) assign dynamic tasks with high priority within each round of the allocation process, (iii) minimize the estimated energy consumption related to the completion of the task set, and (iv) minimize the impact of re-charge tasks on the delivery process. A risk-aware path planner sampling a 2D risk map of the operational area is included in the allocation architecture to demonstrate the feasibility of deployment in urban environments. Thanks to the message exchange redundancy, the proposed multi-auctioneer architecture features improved robustness with respect to lossy communication scenarios. Simulation results based on Monte Carlo campaigns corroborate the validity of the approach.