Improving Navigation Through Cooperation and Path Planning

The ability to reliably estimate own-states is very important for Unmanned Aerial Vehicles (UAVs) in executing their missions. Most current approaches for UAV state estimation rely on fusing inertial information from accelerometers and gyroscopes with absolute position information from a position sensor. Global Positioning System (GPS) is one of the most widely used position sensors. However, GPS signals are not reliable, and can be jammed by adversarial forces. Without the aid of an absolute position reference such as GPS the navigation solution of the system is going to drift with time. The problem of two autonomous vehicles traveling in a two dimensional environment from an initial location to a known goal location without any absolute position reference is considered. The effect of cooperation between the vehicles by considering the measurements such as relative range to help in improving the navigation state estimation and its effect on the observability of the system is discussed. The reduction in the navigation solution drift of the system, with cooperation between the agents, using measured relative information and its effect on the observability of the system while taking different paths is discussed. Simulations and theoretical results show that relative motion between the agents helps reduce the navigation drift of the agents when there is no absolute position reference.Mechanical & Aerospace Engineerin

Collaborative Control of Autonomous Swarms with Resource Constraints

This dissertation focuses on the collaborative control of homogeneous UAV swarms. A two-level scheme is proposed by combining the high-level path planning and the lowlevel vehicle motion control. A decentralized artificial potential function (APF) based approach, which mimics the bacteria foraging process, is studied for the high-level path planning. The deterministic potential based approach, however, suffers from the local minima entrapment dilemma, which motivate us to fix the "flaw" that is naturally embedded. An innovative decentralized stochastic approach based on the Markov Random Filed (MRF) theory is proposed; this approach traditionally used in statistical mechanics and in image processing. By modeling the local interactions as Gibbs potentials, the movements of vehicles are then decided by using Gibbs sampler based simulated annealing (SA) algorithm. A two-step sampling scheme is proposed to coordinate vehicle networks: in the first sampling step, a vehicle is picked through a properly designed, configuration-dependent proposal distribution, and in the second sampling step, the vehicle makes a move by using the local characteristics of the Gibbs distribution. Convergence properties are established theoretically and confirmed with simulations. In order to reduce the communication cost and the delay, a fully parallel sampling algorithm is studied and analyzed accordingly. In practice, the stochastic nature of the proposed algorithm might lead to a high traveling cost. To mitigate this problem, a hybrid algorithm is eveloped by combining the Gibbs sampler based method with the deterministic gradient-flow method to gain the advantages of both approaches. The robustness of the Gibbs sampler based algorithm is also studied. The convergence properties are investigated for different types sensor errors including range-error and random-error. Error bounds are derived to guarantee the convergence of the stochastic algorithm. In the low-level motion control module, a model predictive control (MPC) approach is investigated for car-like UAV model. Multiple control objectives, for example, minimizing tracking error, avoiding actuator/state saturation, and minimizing control effort, are easily encoded in the objective function. Two numerical optimization approaches, gradient descendent approach and dynamic programming approach, are studied to strike the balance between computation time and complexity

Real-Time Obstacle and Collision Avoidance System for Fixed-Wing Unmanned Aerial Systems

The motivation for the research presented in this dissertation is to provide a two-fold solution to the problem of non-cooperative reactive mid-air threat avoidance for fixed-wing unmanned aerial systems. The first phase is an offline UAS trajectory planning designed for an altitude-specific mission. The second phase leans on the results produced during the first phase to provide intelligent, real-time, reactive mid-air threat avoidance logic. That real-time operating logic provides a given fixed-wing UAS with local threat awareness so it can get a feel for the danger represented by a potential threat before using results produced during the first phase to require aircraft rerouting. The first original contribution of this research is the Advanced Mapping and Waypoint Generator (AMWG), a piece of software which processes publicly available elevation data in order to only retain the information necessary for a given altitude-specific flight mission. The AMWG is what makes systematic offline trajectory possible. The AMWG first creates altitude groups in order to discard elevations points which are not relevant to a specific mission because of the altitude flown at. Those groups referred to as altitude layers can in turn be reused if the original layer becomes unsafe for the altitude range in use, and the other layers are used for altitude re-scheduling in order to update the current altitude layer to a safer layer. Each layer is bounded by a lower and higher altitude, within which terrain contours are considered constant according to a conservative approach involving the principle of natural erosion. The AMWG then proceeds to obstacle contours extraction using threshold and edge detection vision algorithms. A simplification of those obstacle contours and their corresponding free space zones counterparts is performed using a fixed -tolerance Douglas-Peucker algorithm. This simplification allows free space zones to be described by vectors instead of point clouds, which enables UAS point location. The resulting geometry is then processed through a vertical trapezoidal decomposition where for each vertex defining a contour a vertical line is drawn, and the results of this decomposition is a set of trapezoidal cells. The cells corresponding to obstacle contours are then removed from the original trapezoidal decomposition in order to solely retain the obstacle-free trapezoidal cells. After decomposition, cells sharing part of a common edge are considered from a graph theory perspective so it becomes possible to list all acyclic paths between two cells by applying a depth first search (DFS) algorithm. The final product of the AWMG is a network of connected free space trapezoidal cells with embedded connectivity information referred to as the Synthetic Terrain Avoidance (STA network). The walls of the trapezoidal cells are then extruded as the AWMG essentially approximates a three-dimensional world by considering it as a stratification of two-dimensional layers, but the real-time phase needs 3D support. Using the graph conceptual view and the depth first search algorithm, all the connected cell sequences joining the departure to the arrival cell can be listed, a capability which is used during aircraft rerouting. By connecting two adjacent cells' centroids to their common midpoint located on the shared edge, the resulting flying legs remain within the two cells. The next step for paths between two cells is to be converted into flyable paths, and the conversion uses main and fallback methods to achieve that. The preferred method is the closed-form Dubins paths method involving the design of sequences of arc circle-straight line-arc circle (CLC) in order to account for the minimum radius turn constrain of the UAS. An additional geometric transformation is developed and applied to the initial waypoints used in the Dubins method so the flying leg directions are respected which is not possible by using the Dubins method alone. When consecutive waypoints are too close from one another, a condition called the Dubins condition cannot be respected, and the UAS trajectory design switches to the numerical integration of a system of ordinary differential equations accounting for the minimum turning constraint. Using the Dubins method and the ODE method makes it possible for the AWMG to design flyable offline trajectories accounting for the lateral dynamic of the fixed-wing UAS. The second original contribution of this research is the development and demonstration of the Double Dispersion reduction RRT (DDRRT), an algorithm which employs two new developed logic schemes respectively referred to as Punctual Dispersion Reduction (PDR), and Spatial Dispersion Reduction exploration (SDR). The DDRRT is employed during the real-time in-flight phase where it initially assumes a perfect terrain and no unpredictable threat, consequently following a 100% adaptive goal biasing toward the next waypoint in its list. When a threat such as an unpredicted obstacle is detected, the (PDR) acknowledges the fact that the DDRRT tree branches have met an obstacle and the its goal-biasing toward the next waypoint is decreased. If the PDR keeps decreasing, the DDRRT develops awareness of its surrounding obstacles by relaxing its PDR and switching to SDR which has the effect of increasing the dispersion of its branches, but keeping their extension bounded by the cell containing the last good position of the UAS, Csafe. If a number of branches reach a limit proportional to the Csafe and its relative area, then the STA network is queried for alternative rerouting. The two phases provide real-time reactive mid - air threat avoidance scenarios with the ability for a UAS to develop local and realistic threat awareness before considering intelligent rerouting. Either the local exploration of the DDRRT is successful before reaching a maximum number of points, or the STA Network is required to find another route

Models for Human Navigation and Optimal Path Planning Using Level Set Methods and Hamilton-Jacobi Equations

We present several models for different physical scenarios which are centered around human movement or optimal path planning, and use partial differential equations and concepts from control theory. The first model is a game-theoretic model for environmental crime which tracks criminals' movement using the level set method, and improves upon previous continuous models by removing overly restrictive assumptions of symmetry. Next, we design a method for determining optimal hiking paths in mountainous regions using an anisotropic level set equation. After this, we present a model for optimal human navigation with uncertainty which is rooted in dynamic programming and stochastic optimal control theory. Lastly, we consider optimal path planning for simple, self-driving cars in the Hamilton-Jacobi formulation. We improve upon previous models which simplify the car to a point mass, and present a reasonably general upwind, sweeping scheme to solve the relevant Hamilton-Jacobi equation

Drone Base Station Trajectory Management for Optimal Scheduling in LTE-Based Sparse Delay-Sensitive M2M Networks

Providing connectivity in areas out of reach of the cellular infrastructure is a very active area of research. This connectivity is particularly needed in case of the deployment of machine type communication devices (MTCDs) for critical purposes such as homeland security. In such applications, MTCDs are deployed in areas that are hard to reach using regular communications infrastructure while the collected data is timely critical. Drone-supported communications constitute a new trend in complementing the reach of the terrestrial communication infrastructure. In this study, drones are used as base stations to provide real-time communication services to gather critical data out of a group of MTCDs that are sparsely deployed in a marine environment. Studying different communication technologies as LTE, WiFi, LPWAN and Free-Space Optical communication (FSOC) incorporated with the drone communications was important in the first phase of this research to identify the best candidate for addressing this need. We have determined the cellular technology, and particularly LTE, to be the most suitable candidate to support such applications. In this case, an LTE base station would be mounted on the drone which will help communicate with the different MTCDs to transmit their data to the network backhaul. We then formulate the problem model mathematically and devise the trajectory planning and scheduling algorithm that decides the drone path and the resulting scheduling. Based on this formulation, we decided to compare between an Ant Colony Optimization (ACO) based technique that optimizes the drone movement among the sparsely-deployed MTCDs and a Genetic Algorithm (GA) based solution that achieves the same purpose. This optimization is based on minimizing the energy cost of the drone movement while ensuring the data transmission deadline missing is minimized. We present the results of several simulation experiments that validate the different performance aspects of the technique

Contributions to shared control and coordination of single and multiple robots

L’ensemble des travaux présentés dans cette habilitation traite de l'interface entre un d'un opérateur humain avec un ou plusieurs robots semi-autonomes aussi connu comme le problème du « contrôle partagé ».Le premier chapitre traite de la possibilité de fournir des repères visuels / vestibulaires à un opérateur humain pour la commande à distance de robots mobiles.Le second chapitre aborde le problème, plus classique, de la mise à disposition à l’opérateur d’indices visuels ou de retour haptique pour la commande d’un ou plusieurs robots mobiles (en particulier pour les drones quadri-rotors).Le troisième chapitre se concentre sur certains des défis algorithmiques rencontrés lors de l'élaboration de techniques de coordination multi-robots.Le quatrième chapitre introduit une nouvelle conception mécanique pour un drone quadrirotor sur-actionné avec pour objectif de pouvoir, à terme, avoir 6 degrés de liberté sur une plateforme quadrirotor classique (mais sous-actionné).Enfin, le cinquième chapitre présente une cadre général pour la vision active permettant, en optimisant les mouvements de la caméra, l’optimisation en ligne des performances (en terme de vitesse de convergence et de précision finale) de processus d’estimation « basés vision »

Coordinated Multi-Agent Motion Planning Under Realistic Constraints

Considered is a class of cooperative control problems that has a special affine characterization. Included in this class of multi-agent problems are the so called radar deception problem, formation keeping and formation reconfiguration. An intrinsic geometric formulation of the associated constraints unifies this class of problems and it is the first time such a generalization has been presented. Based on this geometric formulation, a real-time motion planning algorithm is proposed to generate dynamically feasible reference trajectories for the class. The proposed approach explicitly considers actuator and operating constraints of the individual agents and constrained dynamics are derived intrinsically for the multi-agent system which makes these constraints transparent. Deriving the constrained dynamics eliminates the need for nonlinear programming to account for the system constraints, making the approach amenable to real-time control. Explicit consideration of actuator and operating limitations and nonholonomic constraints in the design of the reference trajectories addresses the important issue of dynamic feasibility. The motion planning algorithm developed here is verified through simulations for the radar deception, rigid formation keeping and formation reconfiguration problems. A key objective of this study is to advocate a change in paradigm in the approach to formation control by addressing the key issues of dynamic feasibility and computational complexity. The other important contributions of this study are: Unifying formulation of constrained dynamics for a class of problems in formation control through the intrinsic geometry of their nonholonomic and holonomic constraints; Deriving these constrained dynamics in any choice of frame that can even be coordinate free; Explicit consideration of actuator and operating limits in formation control to design dynamically feasible reference trajectories and Developing a real-time, distributed, scalable motion planning algorithm applicable to a class of autonomous multi-agent systems in formation control

Fixed-wing drones for communication networks

In the last decade, drones became frequently used to provide eye-in-the-sky overview in the outdoor environment. Their main advantage compared to the other types of robots is that they can fly above obstacles and rough terrains and they can quickly cover large areas. These properties also open a new application; drones could provide a multi-hop, line of sight communication for groups of ground users. The aim of this thesis is to develop a drone team that will establish wireless ad-hoc network between users on the ground and distributively adapt links and spatial arrangement to the requirements and motion of the ground users. For this application, we use fixed wing drones. Such platforms can be easily and quickly deployed. Fixed wing drones have higher forward speed and higher battery life than hovering platforms. On the other hand, fixed wing drones have unicycle dynamics with constrained forward speed which makes them unable to hover or perform sharp turns. The first challenge consists in bridging unicycle dynamics of the fixed wing drones. Some control strategies have been proposed and validated in simulations using the average distance between the target and the drone as a performance metric. However, besides the distance metric, energy expenditure of the flight also plays an important role in assessing the overall performance of the flight. We propose a new methodology that introduces a new metric (energy expenditure), we compare existing methods on a large set of target motion patterns and present a comparison between the simulation and field experiments on proposed target motion patterns. The second challenge consists in developing a formation control algorithm that will allow fixed wing robots to provide a wide area coverage and to relay data in a wireless ad-hoc network. In such applications fixed wing drones have to be able to regulate an inter-drone distance. Their reduced maneuverability presents the main challenge to design a formation algorithm that will regulate an inter-drone distance. To address this challenge, we present a distributed control strategy that relies only on local information. Each drone has its own virtual agent, it follows the virtual agent by performing previously evaluated and selected target tracking strategy, and flocking interaction rules are implemented between virtual agents. It is shown in simulation and in field experiments with a team of fixed wing drones that using this distributed formation algorithm, drones can cover an area by creating an equilateral triangular lattice and regulate communication link quality between neighboring drones. The third challenge consists in allowing connectivity between independently moving ground users using fixed wing drone team. We design two distributed control algorithms that change drones' spatial arrangement and interaction topology to maintain the connectivity. We propose a potential field based strategy which adapts distance between drones to shrink and expand the fixed wing drones' formation. In second approach, market-based adaptation, drones distributively delete interaction links to expand the formation graph to a tree graph. In simulations and field experiments we show that our proposed strategies successfully maintain independently moving ground users connected. Overall, this thesis presents synthesis of distributed algorithms for fixed wing drones to establish and maintain wireless ad-hoc communication networks

New Development on Sense and Avoid Strategies for Unmanned Aerial Vehicles

Unmanned Aerial Vehicles (UAVs) can carry out more complex civilian and military applications with less cost and more flexibility in comparison of manned aircraft. Mid-air collision thus becomes profoundly important considering the safe operation of air transportation systems, when UAVs are increasingly used more with various applications and share the same airspace with manned air vehicles. To ensure safe flights, UAVs have to configure Sense and Avoid (S&A) systems performing necessary maneuvers to avoid collisions. After analyzing the manner of S&A system, avoidance strategies based on a subset of possible collision scenarios are proposed in this thesis. 1) To avoid a face-to-face intruder, a feasible trajectory is generated by differential geometric guidance, where the constraints of UAV dynamics are considered. 2) The Biogeography Based Optimization (BBO) approach is exploited to generate an optimal trajectory to avoid multiple intruders’ threats in the landing phase. 3) By formulating the collision avoidance problem within a Markov Decision Process (MDP) framework, a desired trajectory is produced to avoid multiple intruders in the 2D plane. 4) MDP optimization method is extended to address the problem of optimal 3D conflict resolution involving multiple aircraft. 5) Considering that the safety of UAVs is directly related to the dynamic constraints, the differential flatness technique is developed to smoothen the optimal trajectory. 6) Energy based controller is designed such that the UAV is capable of following the generated trajectory

Simultaneous Nonlinear Model Predictive Control and State Estimation: Theory and Applications

As computational power increases, online optimization is becoming a ubiquitous approach for solving control and estimation problems in both academia and industry. This widespread popularity of online optimization techniques is largely due to their abilities to solve complex problems in real time and to explicitly accommodate hard constraints. In this dissertation, we discuss an especially popular online optimization control technique called model predictive control (MPC). Specifically, we present a novel output-feedback approach to nonlinear MPC, which combines the problems of state estimation and control into a single min-max optimization. In this way, the control and estimation problems are solved simultaneously providing an output-feedback controller that is robust to worst-case system disturbances and noise. This min-max optimization is subject to the nonlinear system dynamics as well as constraints that come from practical considerations such as actuator limits. Furthermore, we introduce a novel primal-dual interior-point method that can be used to efficiently solve the min-max optimization problem numerically and present several examples showing that the method succeeds even for severely nonlinear and non-convex problems. Unlike other output-feedback nonlinear optimal control approaches that solve the estimation and control problems separately, this combined estimation and control approach facilitates straightforward analysis of the resulting constrained, nonlinear, closed-loop system and yields improved performance over other standard approaches. Under appropriate assumptions that encode controllability and observability of the nonlinear process to be controlled, we show that this approach ensures that the state of the closed-loop system remains bounded. Finally, we investigate the use of this approach in several applications including the coordination of multiple unmanned aerial vehicles for vision-based target tracking of a moving ground vehicle and feedback control of an artificial pancreas system for the treatment of Type 1 Diabetes. We discuss why this novel combined control and estimation approach is especially beneficial for these applications and show promising simulation results for the eventual implementation of this approach in real-life scenarios