Search-based Motion Planning for Aggressive Flight in SE(3)

Quadrotors with large thrust-to-weight ratios are able to track aggressive trajectories with sharp turns and high accelerations. In this work, we develop a search-based trajectory planning approach that exploits the quadrotor maneuverability to generate sequences of motion primitives in cluttered environments. We model the quadrotor body as an ellipsoid and compute its flight attitude along trajectories in order to check for collisions against obstacles. The ellipsoid model allows the quadrotor to pass through gaps that are smaller than its diameter with non-zero pitch or roll angles. Without any prior information about the location of gaps and associated attitude constraints, our algorithm is able to find a safe and optimal trajectory that guides the robot to its goal as fast as possible. To accelerate planning, we first perform a lower dimensional search and use it as a heuristic to guide the generation of a final dynamically feasible trajectory. We analyze critical discretization parameters of motion primitive planning and demonstrate the feasibility of the generated trajectories in various simulations and real-world experiments.Comment: 8 pages, submitted to RAL and ICRA 201

Perception-aware time optimal path parameterization for quadrotors

The increasing popularity of quadrotors has given rise to a class of predominantly vision-driven vehicles. This paper addresses the problem of perception-aware time optimal path parametrization for quadrotors. Although many different choices of perceptual modalities are available, the low weight and power budgets of quadrotor systems makes a camera ideal for on-board navigation and estimation algorithms. However, this does come with a set of challenges. The limited field of view of the camera can restrict the visibility of salient regions in the environment, which dictates the necessity to consider perception and planning jointly. The main contribution of this paper is an efficient time optimal path parametrization algorithm for quadrotors with limited field of view constraints. We show in a simulation study that a state-of-the-art controller can track planned trajectories, and we validate the proposed algorithm on a quadrotor platform in experiments.Comment: Accepted to appear at ICRA 202

Minimum Distance and Minimum Time Optimal Path Planning with Bioinspired Machine Learning Algorithms for Impaired Unmanned Air Vehicles

Unmanned air vehicles operate in highly dynamic and unknown environments where they can encounter unexpected and unseen failures. In the presence of emergencies, autonomous unmanned air vehicles should be able to land at a minimum distance or minimum time. Impaired unmanned air vehicles define actuator failures and this impairment changes their unstable and uncertain dynamics; henceforth, path planning algorithms must be adaptive and model-free. In addition, path planning optimization problems must consider the unavoidable actuator saturations, kinematic and dynamic constraints for successful real-time applications. Therefore, this paper develops 3D path planning algorithms for quadrotors with parametric uncertainties and various constraints. In this respect, this paper constructs a multi-dimensional particle swarm optimization and a multi-dimensional genetic algorithm to plan paths for translational, rotational, and Euler angles and generates the corresponding control signals. The algorithms are assessed and compared both in the simulation and experimental environments. Results show that the multi-dimensional genetic algorithm produces shorter minimum distance and minimum time paths under the constraints. The real-time experiments prove that the quadrotor exactly follows the produced path utilizing the available maximum rotor speeds

Multi-Layered Optimal Navigation System For Quadrotors UAV

Purpose This paper aims to propose a new multi-layered optimal navigation system that jointly optimizes the energy consumption, improves the robustness and raises the performance of a quadrotor unmanned aerial vehicle (UAV). Design/methodology/approach The proposed system is designed as a multi-layered system. First, the control architecture layer links the input and the output spaces via quaternion-based differential flatness equations. Then, the trajectory generation layer determines the optimal reference path and avoids obstacles to secure the UAV from collisions. Finally, the control layer allows the quadrotor to track the generated path and guarantees the stability using a double loop non-linear optimal backstepping controller (OBS). Findings All the obtained results are confirmed using several scenarios in different situations to prove the accuracy, energy optimization and the robustness of the designed system. Practical implications The proposed controllers are easily implementable on-board and are computationally efficient. Originality/value The originality of this research is the design of a multi-layered optimal navigation system for quadrotor UAV. The proposed control architecture presents a direct relation between the states and their derivatives, which then simplifies the trajectory generation problem. Furthermore, the derived differentially flat equations allow optimization to occur within the output space as opposed to the control space. This is beneficial because constraints such as obstacle avoidance occur in the output space; hence, the computation time for constraint handling is reduced. For the OBS, the novelty is that all controller parameters are derived using the multi-objective genetic algorithm (MO-GA) that optimizes all the quadrotor state’s cost functions jointly

Efficient Motion Primitives-Based Trajectory Planning for UAVs in the Presence of Obstacles

The achievement of full autonomy in Unmanned Aerial Vehicles (UAVs) is significantly dependent on effective motion planning. Specifically, it is crucial to plan collision-free trajectories for smooth transitions from initial to final configurations. However, finding a solution executable by the actual system adds complexity: the planned motion must be dynamically feasible. This involves meeting rigorous criteria, including vehicle dynamics, input constraints, and state constraints. This work addresses optimal kinodynamic motion planning for UAVs in the presence of obstacles by employing a hybrid technique instead of conventional search-based or direct trajectory optimization approaches. This technique involves precomputing a library of motion primitives by solving several Two-Point-Boundary-Value Problems (TPBVP) offline. This library is then repeatedly used online within a graph-search framework. Moreover, to make the method computationally tractable, continuity between consecutive motion primitives is enforced only on a subset of the state variables. This approach is compared with a state-of-the-art quadrotor-tailored search-based approach, which generates motion primitives online through control input discretization and forward propagation of the dynamic equations of a simplified model. The effectiveness of both methods is assessed through simulations and real-world experiments, demonstrating their ability to generate resolution-complete, resolution-optimal, collision-free, and dynamically feasible trajectories. Finally, a comparative analysis highlights the advantages, disadvantages, and optimal usage scenarios for each approach

Swarm assignment and trajectory optimization using variable-swarm, distributed auction assignment and sequential convex programming

This paper presents a distributed, guidance and control algorithm for reconfiguring swarms composed of hundreds to thousands of agents with limited communication and computation capabilities. This algorithm solves both the optimal assignment and collision-free trajectory generation for robotic swarms, in an integrated manner, when given the desired shape of the swarm (without pre-assigned terminal positions). The optimal assignment problem is solved using a distributed auction assignment that can vary the number of target positions in the assignment, and the collision-free trajectories are generated using sequential convex programming. Finally, model predictive control is used to solve the assignment and trajectory generation in real time using a receding horizon. The model predictive control formulation uses current state measurements to resolve for the optimal assignment and trajectory. The implementation of the distributed auction algorithm and sequential convex programming using model predictive control produces the swarm assignment and trajectory optimization (SATO) algorithm that transfers a swarm of robots or vehicles to a desired shape in a distributed fashion. Once the desired shape is uploaded to the swarm, the algorithm determines where each robot goes and how it should get there in a fuel-efficient, collision-free manner. Results of flight experiments using multiple quadcopters show the effectiveness of the proposed SATO algorithm