UAV Optimal Cooperative Obstacle Avoidance and Target Tracking in Dynamic Stochastic Environments

Cette thèse propose une stratégie de contrôle avancée pour guider une flotte d'aéronefs sans pilote (UAV) dans un environnement à la fois stochastique et dynamique. Pour ce faire, un simulateur de vol 3D a été développé avec MATLAB® pour tester les algorithmes de la stratégie de guidage en fonctions de différents scénarios. L'objectif des missions simulées est de s'assurer que chaque UAV intercepte une cible ellipsoïdale mobile tout en évitant une panoplie d'obstacles ellipsoïdaux mobiles détectés en route. Les UAVs situés à l'intérieur des limites de communication peuvent coopérer afin d'améliorer leurs performances au cours de la mission. Le simulateur a été conçu de façon à ce que les UAV soient dotés de capteurs et d'appareils de communication de portée limitée. De plus, chaque UAV possède un pilote automatique qui stabilise l'aéronef en vol et un planificateur de trajectoires qui génère les commandes à envoyer au pilote automatique. Au coeur du planificateur de trajectoires se trouve un contrôleur prédictif à horizon fuyant qui détermine les commandes à envoyer à l'UAV. Ces commandes optimisent un critère de performance assujetti à des contraintes. Le critère de performance est conçu de sorte que les UAV atteignent les objectifs de la mission, alors que les contraintes assurent que les commandes générées adhèrent aux limites de manoeuvrabilité de l'aéronef. La planification de trajectoires pour UAV opérant dans un environnement dynamique et stochastique dépend fortement des déplacements anticipés des objets (obstacle, cible). Un filtre de Kalman étendu est donc utilisé pour prédire les trajectoires les plus probables des objets à partir de leurs états estimés. Des stratégies de poursuite et d'évitement ont aussi été développées en fonction des trajectoires prédites des objets détectés. Pour des raisons de sécurité, la conception de stratégies d'évitement de collision à la fois efficaces et robustes est primordiale au guidage d'UAV. Une nouvelle stratégie d'évitement d'obstacles par approche probabiliste a donc été développée. La méthode cherche à minimiser la probabilité de collision entre l'UAV et tous ses obstacles détectés sur l'horizon de prédiction, tout en s'assurant que, à chaque pas de prédiction, la probabilité de collision entre l'UAV et chacun de ses obstacles détectés ne surpasse pas un seuil prescrit. Des simulations sont présentées au cours de cette thèse pour démontrer l'efficacité des algorithmes proposés

Receding Horizon based Cooperative Vehicle Control with Optimal Task Allocation

The problem of cooperative multi-target interception in an uncertain environment is investigated in this thesis. The targets arrive in the mission space sequentially at a priori unknown time instants and a priori unknown locations, and then move on a priori unknown trajectories. A group of vehicles with known dynamics are employed to visit the targets as quickly and efficiently as possible. To this end, a time-discounting reward is defined for each target which can be collected only if one of the vehicles visits that target. A cooperative receding horizon scheme is designed, which predicts the future positions of the targets and maximizes the estimate of the expected total collectible rewards, accordingly. The problem is initially investigated for the case when there are a finite number of targets arriving in the mission space sequentially. It is shown that the number of targets that are not visited by any vehicle in the mission space will be sufficiently small if the targets arrive sufficiently infrequently. The problem is then generalized to the case of infinite number of targets and a finite-time convergence analysis is also presented. A more practical case where the vehicles have limited sensing and communication ranges is also investigated using a game-theoretic approach. The problem is then solved for the case when a cluster of vehicles is required to visit each target. Simulations confirm the efficacy of the proposed strategies

Computational intelligence approaches to robotics, automation, and control [Volume guest editors]

No abstract available

A Survey on Aerial Swarm Robotics

The use of aerial swarms to solve real-world problems has been increasing steadily, accompanied by falling prices and improving performance of communication, sensing, and processing hardware. The commoditization of hardware has reduced unit costs, thereby lowering the barriers to entry to the field of aerial swarm robotics. A key enabling technology for swarms is the family of algorithms that allow the individual members of the swarm to communicate and allocate tasks amongst themselves, plan their trajectories, and coordinate their flight in such a way that the overall objectives of the swarm are achieved efficiently. These algorithms, often organized in a hierarchical fashion, endow the swarm with autonomy at every level, and the role of a human operator can be reduced, in principle, to interactions at a higher level without direct intervention. This technology depends on the clever and innovative application of theoretical tools from control and estimation. This paper reviews the state of the art of these theoretical tools, specifically focusing on how they have been developed for, and applied to, aerial swarms. Aerial swarms differ from swarms of ground-based vehicles in two respects: they operate in a three-dimensional space and the dynamics of individual vehicles adds an extra layer of complexity. We review dynamic modeling and conditions for stability and controllability that are essential in order to achieve cooperative flight and distributed sensing. The main sections of this paper focus on major results covering trajectory generation, task allocation, adversarial control, distributed sensing, monitoring, and mapping. Wherever possible, we indicate how the physics and subsystem technologies of aerial robots are brought to bear on these individual areas

Optimal Control Methods for Missile Evasion

Optimal control theory is applied to the study of missile evasion, particularly in the case of a single pursuing missile versus a single evading aircraft. It is proposed to divide the evasion problem into two phases, where the primary considerations are energy and maneuverability, respectively. Traditional evasion tactics are well documented for use in the maneuverability phase. To represent the first phase dominated by energy management, the optimal control problem may be posed in two ways, as a fixed final time problem with the objective of maximizing the final distance between the evader and pursuer, and as a free final time problem with the objective of maximizing the final time when the missile reaches some capture distance away from the evader.These two optimal control problems are studied under several different scenarios regarding assumptions about the pursuer. First, a suboptimal control strategy, proportional navigation, is used for the pursuer. Second, it is assumed that the pursuer acts optimally, requiring the solution of a two-sided optimal control problem, otherwise known as a differential game. The resulting trajectory is known as a minimax, and it can be shown that it accounts for uncertainty in the pursuer\u27s control strategy. Finally, a pursuer whose motion and state are uncertain is studied in the context of Receding Horizon Control and Real Time Optimal Control. The results highlight how updating the optimal control trajectory reduces the uncertainty in the resulting miss distance

Fixed-wing UAV tracking of evasive targets in 3-dimensional space

In this thesis, we explore the development of autonomous tracking and interception strategies for single and multiple fixed-wing Unmanned Aerial Vehicles (UAVs) pursuing single or multiple evasive targets in 3-dimensional (3D) space. We considered a scenario where we intend to protect high-value facilities from adversarial groups employing ground-based vehicles and quadrotor swarms and focused on solving the target tracking problem. Accordingly, we refined a min-max optimal control algorithm for fixed-wing UAVs tracking ground-based targets, by introducing constraints on bank angles and turn rates to enhance actuator reliability when pursuing agile and evasive targets. An intelligent and persistent evasive control strategy for the target was also devised to ensure robust performance testing and optimisation. These strategies were extended to 3D space, incorporating three altitude control algorithms to facilitate flexible UAV altitude control, leveraging various parameters such as desired UAV altitude and image size on the tracking camera lens. A novel evasive quadrotor algorithm was introduced, systematically testing UAV tracking efficacy against various evasive scenarios while implementing anti-collision measures to ensure UAV safety and adaptive optimisation improve the achieved performance. Using decentralised control strategies, cooperative tracking by multiple UAVs of single evasive quadrotor-type and dynamic target clusters was developed along with a new altitude control strategy and task assignment logic for efficient target interception. Lastly, a countermeasure strategy for tracking and neutralising non-cooperative adversarial targets within restricted airspace was implemented, using both Nonlinear Model Predictive Control (NMPC) and optimal controllers. The major contributions of this thesis include optimal control strategies, evasive target control, 3D target tracking, altitude control, cooperative multi-UAV tracking, adaptive optimisation, high-precision projectile algorithms, and countermeasures. We envision practical applications of the findings from this research in surveillance, security, search and rescue, agriculture, environmental monitoring, drone defence, and autonomous delivery systems. Future efforts to extend this research could explore adaptive evasion, enhanced collaborative UAV swarms, machine learning integration, sensor technologies, and real-world testing

An Overview of Recent Progress in the Study of Distributed Multi-agent Coordination

This article reviews some main results and progress in distributed multi-agent coordination, focusing on papers published in major control systems and robotics journals since 2006. Distributed coordination of multiple vehicles, including unmanned aerial vehicles, unmanned ground vehicles and unmanned underwater vehicles, has been a very active research subject studied extensively by the systems and control community. The recent results in this area are categorized into several directions, such as consensus, formation control, optimization, task assignment, and estimation. After the review, a short discussion section is included to summarize the existing research and to propose several promising research directions along with some open problems that are deemed important for further investigations

Game-Theoretic Safety Assurance for Human-Centered Robotic Systems

In order for autonomous systems like robots, drones, and self-driving cars to be reliably introduced into our society, they must have the ability to actively account for safety during their operation. While safety analysis has traditionally been conducted offline for controlled environments like cages on factory floors, the much higher complexity of open, human-populated spaces like our homes, cities, and roads makes it unviable to rely on common design-time assumptions, since these may be violated once the system is deployed. Instead, the next generation of robotic technologies will need to reason about safety online, constructing high-confidence assurances informed by ongoing observations of the environment and other agents, in spite of models of them being necessarily fallible.This dissertation aims to lay down the necessary foundations to enable autonomous systems to ensure their own safety in complex, changing, and uncertain environments, by explicitly reasoning about the gap between their models and the real world. It first introduces a suite of novel robust optimal control formulations and algorithmic tools that permit tractable safety analysis in time-varying, multi-agent systems, as well as safe real-time robotic navigation in partially unknown environments; these approaches are demonstrated on large-scale unmanned air traffic simulation and physical quadrotor platforms. After this, it draws on Bayesian machine learning methods to translate model-based guarantees into high-confidence assurances, monitoring the reliability of predictive models in light of changing evidence about the physical system and surrounding agents. This principle is first applied to a general safety framework allowing the use of learning-based control (e.g. reinforcement learning) for safety-critical robotic systems such as drones, and then combined with insights from cognitive science and dynamic game theory to enable safe human-centered navigation and interaction; these techniques are showcased on physical quadrotors—flying in unmodeled wind and among human pedestrians—and simulated highway driving. The dissertation ends with a discussion of challenges and opportunities ahead, including the bridging of safety analysis and reinforcement learning and the need to ``close the loop'' around learning and adaptation in order to deploy increasingly advanced autonomous systems with confidence

Computational intelligence approaches to robotics, automation, and control [Volume guest editors]

No abstract available

Visibility maximization with unmanned aerial vehicles in complex environments

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2010.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.Cataloged from student-submitted PDF version of thesis.Includes bibliographical references (p. 157-164).Unmanned aerial vehicles are used extensively in persistent surveillance, search and track, border patrol, and environment monitoring applications. Each of these applications requires the obtainment of information using a dynamic observer equipped with a constrained sensor. Information can only be gained when visibility exists between the sensor and a number of targets in a cluttered environment. Maximizing visibility is therefore essential for acquiring as much information about targets as possible, to subsequently enable informed decision making. Proposed is an algorithm that can design a maximum visibility path given models of the vehicle, target, sensor, environment, and visibility. An approximate visibility, finite-horizon dynamic programming approach is used to find flyable, maximum visibility paths. This algorithm is compared against a state-of-the-art optimal control solver for validation. Complex scenarios involving multiple stationary or moving targets are considered, leading to loiter patterns or pursuit paths which negotiate planar, three-dimensional, or elevation environment models. Robustness to disturbances is addressed by treating targets as regions instead of points, to improve visibility performance in the presence of uncertainty. A testbed implementation validates the algorithm in a hardware setting with a quadrotor observer, multiple moving ground vehicle targets, and an urban-like setting providing occlusions to visibility.by Kenneth Lee.S.M