Path planning and collision risk management strategy for multi-UAV systems in 3D environments

This article belongs to the Special Issue Smooth Motion Planning for Autonomous VehiclesMulti-UAV systems are attracting, especially in the last decade, the attention of researchers and companies of very different fields due to the great interest in developing systems capable of operating in a coordinated manner in complex scenarios and to cover and speed up applications that can be dangerous or tedious for people: search and rescue tasks, inspection of facilities, delivery of goods, surveillance, etc. Inspired by these needs, this work aims to design, implement and analyze a trajectory planning and collision avoidance strategy for multi-UAV systems in 3D environments. For this purpose, a study of the existing techniques for both problems is carried out and an innovative strategy based on Fast Marching Square¿for the planning phase¿and a simple priority-based speed control¿as the method for conflict resolution¿is proposed, together with prevention measures designed to try to limit and reduce the greatest number of conflicting situations that may occur between vehicles while they carry out their missions in a simulated 3D urban environment. The performance of the algorithm is evaluated successfully on the basis of certain conveniently chosen statistical measures that are collected throughout the simulation runs.This research was funded by the EUROPEAN COMMISSION: Innovation and Networks Executive Agency (INEA), through the European H2020 LABYRINTH project. Grant agreement H2020-MG-2019-TwoStages-861696

2020 NASA Technology Taxonomy

This document is an update (new photos used) of the PDF version of the 2020 NASA Technology Taxonomy that will be available to download on the OCT Public Website. The updated 2020 NASA Technology Taxonomy, or "technology dictionary", uses a technology discipline based approach that realigns like-technologies independent of their application within the NASA mission portfolio. This tool is meant to serve as a common technology discipline-based communication tool across the agency and with its partners in other government agencies, academia, industry, and across the world

Motion Planning

Motion planning is a fundamental function in robotics and numerous intelligent machines. The global concept of planning involves multiple capabilities, such as path generation, dynamic planning, optimization, tracking, and control. This book has organized different planning topics into three general perspectives that are classified by the type of robotic applications. The chapters are a selection of recent developments in a) planning and tracking methods for unmanned aerial vehicles, b) heuristically based methods for navigation planning and routes optimization, and c) control techniques developed for path planning of autonomous wheeled platforms

Aerial Vehicles

This book contains 35 chapters written by experts in developing techniques for making aerial vehicles more intelligent, more reliable, more flexible in use, and safer in operation.It will also serve as an inspiration for further improvement of the design and application of aeral vehicles. The advanced techniques and research described here may also be applicable to other high-tech areas such as robotics, avionics, vetronics, and space

Visual guidance of unmanned aerial manipulators

The ability to fly has greatly expanded the possibilities for robots to perform surveillance, inspection or map generation tasks. Yet it was only in recent years that research in aerial robotics was mature enough to allow active interactions with the environment. The robots responsible for these interactions are called aerial manipulators and usually combine a multirotor platform and one or more robotic arms. The main objective of this thesis is to formalize the concept of aerial manipulator and present guidance methods, using visual information, to provide them with autonomous functionalities. A key competence to control an aerial manipulator is the ability to localize it in the environment. Traditionally, this localization has required external infrastructure of sensors (e.g., GPS or IR cameras), restricting the real applications. Furthermore, localization methods with on-board sensors, exported from other robotics fields such as simultaneous localization and mapping (SLAM), require large computational units becoming a handicap in vehicles where size, load, and power consumption are important restrictions. In this regard, this thesis proposes a method to estimate the state of the vehicle (i.e., position, orientation, velocity and acceleration) by means of on-board, low-cost, light-weight and high-rate sensors. With the physical complexity of these robots, it is required to use advanced control techniques during navigation. Thanks to their redundancy on degrees-of-freedom, they offer the possibility to accomplish not only with mobility requirements but with other tasks simultaneously and hierarchically, prioritizing them depending on their impact to the overall mission success. In this work we present such control laws and define a number of these tasks to drive the vehicle using visual information, guarantee the robot integrity during flight, and improve the platform stability or increase arm operability. The main contributions of this research work are threefold: (1) Present a localization technique to allow autonomous navigation, this method is specifically designed for aerial platforms with size, load and computational burden restrictions. (2) Obtain control commands to drive the vehicle using visual information (visual servo). (3) Integrate the visual servo commands into a hierarchical control law by exploiting the redundancy of the robot to accomplish secondary tasks during flight. These tasks are specific for aerial manipulators and they are also provided. All the techniques presented in this document have been validated throughout extensive experimentation with real robotic platforms.La capacitat de volar ha incrementat molt les possibilitats dels robots per a realitzar tasques de vigilància, inspecció o generació de mapes. Tot i això, no és fins fa pocs anys que la recerca en robòtica aèria ha estat prou madura com per començar a permetre interaccions amb l’entorn d’una manera activa. Els robots per a fer-ho s’anomenen manipuladors aeris i habitualment combinen una plataforma multirotor i un braç robòtic. L’objectiu d’aquesta tesi és formalitzar el concepte de manipulador aeri i presentar mètodes de guiatge, utilitzant informació visual, per dotar d’autonomia aquest tipus de vehicles. Una competència clau per controlar un manipulador aeri és la capacitat de localitzar-se en l’entorn. Tradicionalment aquesta localització ha requerit d’infraestructura sensorial externa (GPS, càmeres IR, etc.), limitant així les aplicacions reals. Pel contrari, sistemes de localització exportats d’altres camps de la robòtica basats en sensors a bord, com per exemple mètodes de localització i mapejat simultànis (SLAM), requereixen de gran capacitat de còmput, característica que penalitza molt en vehicles on la mida, pes i consum elèctric son grans restriccions. En aquest sentit, aquesta tesi proposa un mètode d’estimació d’estat del robot (posició, velocitat, orientació i acceleració) a partir de sensors instal·lats a bord, de baix cost, baix consum computacional i que proporcionen mesures a alta freqüència. Degut a la complexitat física d’aquests robots, és necessari l’ús de tècniques de control avançades. Gràcies a la seva redundància de graus de llibertat, aquests robots ens ofereixen la possibilitat de complir amb els requeriments de mobilitat i, simultàniament, realitzar tasques de manera jeràrquica, ordenant-les segons l’impacte en l’acompliment de la missió. En aquest treball es presenten aquestes lleis de control, juntament amb la descripció de tasques per tal de guiar visualment el vehicle, garantir la integritat del robot durant el vol, millorar de l’estabilitat del vehicle o augmentar la manipulabilitat del braç. Aquesta tesi es centra en tres aspectes fonamentals: (1) Presentar una tècnica de localització per dotar d’autonomia el robot. Aquest mètode està especialment dissenyat per a plataformes amb restriccions de capacitat computacional, mida i pes. (2) Obtenir les comandes de control necessàries per guiar el vehicle a partir d’informació visual. (3) Integrar aquestes accions dins una estructura de control jeràrquica utilitzant la redundància del robot per complir altres tasques durant el vol. Aquestes tasques son específiques per a manipuladors aeris i també es defineixen en aquest document. Totes les tècniques presentades en aquesta tesi han estat avaluades de manera experimental amb plataformes robòtiques real

Mission-based mobility models for UAV networks

Las redes UAV han atraído la atención de los investigadores durante la última década. Las numerosas posibilidades que ofrecen los sistemas single-UAV aumentan considerablemente al usar múltiples UAV. Sin embargo, el gran potencial del sistema multi-UAV viene con un precio: la complejidad de controlar todos los aspectos necesarios para garantizar que los UAVs cumplen la misión que se les ha asignado. Ha habido numerosas investigaciones dedicadas a los sistemas multi-UAV en el campo de la robótica en las cuales se han utilizado grupos de UAVs para diferentes aplicaciones. Sin embargo, los aspectos relacionados con la red que forman estos sistemas han comenzado a reclamar un lugar entre la comunidad de investigación y han hecho que las redes de UAVs se consideren como un nuevo paradigma entre las redes multi-salto. La investigación de redes de UAVs, de manera similar a otras redes multi-salto, se divide principalmente en dos categorías: i) modelos de movilidad que capturan la movilidad de la red, y ii) algoritmos de enrutamiento. Ambas categorías han heredado muchos algoritmos que pertenecían a las redes MANET, que fueron el primer paradigma de redes multi-salto que atrajo la atención de los investigadores. Aunque hay esfuerzos de investigación en curso que proponen soluciones para ambas categorías, el número de modelos de movilidad y algoritmos de enrutamiento específicos para redes UAV es limitado. Además, en el caso de los modelos de movilidad, las soluciones existentes propuestas son simplistas y apenas representan la movilidad real de un equipo de UAVs, los cuales se utilizan principalmente en operaciones orientadas a misiones, en la que cada UAV tiene asignados movimientos específicos. Esta tesis propone dos modelos de movilidad basados en misiones para una red de UAVs que realiza dos operaciones diferentes. El escenario elegido en el que se desarrollan las misiones corresponde con una región en la que ha ocurrido, por ejemplo, un desastre natural. La elección de este tipo de escenario se debe a que en zonas de desastre, la infraestructura de comunicaciones comúnmente está dañada o totalmente destruida. En este tipo de situaciones, una red de UAVs ofrece la posibilidad de desplegar rápidamente una red de comunicaciones. El primer modelo de movilidad, llamado dPSO-U, ha sido diseñado para capturar la movilidad de una red UAV en una misión con dos objetivos principales: i) explorar el área del escenario para descubrir las ubicaciones de los nodos terrestres, y ii) hacer que los UAVs converjan de manera autónoma a los grupos en los que se organizan los nodos terrestres (también conocidos como clusters). El modelo de movilidad dPSO-U se basa en el conocido algoritmo particle swarm optimization (PSO), considerando los UAV como las partículas del algoritmo, y también utilizando el concepto de valores dinámicos para la inercia, el local best y el neighbour best de manera que el modelo de movilidad tenga ambas capacidades: la de exploración y la de convergencia. El segundo modelo, denominado modelo de movilidad Jaccard-based, captura la movilidad de una red UAV que tiene asignada la misión de proporcionar servicios de comunicación inalámbrica en un escenario de mediano tamaño. En este modelo de movilidad se ha utilizado una combinación del virtual forces algorithm (VFA), de la distancia Jaccard entre cada par de UAVs y metaheurísticas como hill climbing y simulated annealing, para cumplir los dos objetivos de la misión: i) maximizar el número de nodos terrestres (víctimas) que se encuentran bajo el área de cobertura inalámbrica de la red UAV, y ii) mantener la red UAV como una red conectada, es decir, evitando las desconexiones entre UAV. Se han realizado simulaciones exhaustivas con herramientas software específicamente desarrolladas para los modelos de movilidad propuestos. También se ha definido un conjunto de métricas para cada modelo de movilidad. Estas métricas se han utilizado para validar la capacidad de los modelos de movilidad propuestos de emular los movimientos de una red UAV en cada misión.UAV networks have attracted the attention of the research community in the last decade. The numerous capabilities of single-UAV systems increase considerably by using multiple UAVs. The great potential of a multi-UAV system comes with a price though: the complexity of controlling all the aspects required to guarantee that the UAV team accomplish the mission that it has been assigned. There have been numerous research works devoted to multi-UAV systems in the field of robotics using UAV teams for different applications. However, the networking aspects of multi-UAV systems started to claim a place among the research community and have made UAV networks to be considered as a new paradigm among the multihop ad hoc networks. UAV networks research, in a similar manner to other multihop ad hoc networks, is mainly divided into two categories: i) mobility models that capture the network mobility, and ii) routing algorithms. Both categories have inherited previous algorithms mechanisms that originally belong to MANETs, being these the first multihop networking paradigm attracting the attention of researchers. Although there are ongoing research efforts proposing solutions for the aforementioned categories, the number of UAV networks-specific mobility models and routing algorithms is limited. In addition, in the case of the mobility models, the existing solutions proposed are simplistic and barely represent the real mobility of a UAV team, which are mainly used in missions-oriented operations. This thesis proposes two mission-based mobility models for a UAV network carrying out two different operations over a disaster-like scenario. The reason for selecting a disaster scenario is because, usually, the common communication infrastructure is malfunctioning or completely destroyed. In these cases, a UAV network allows building a support communication network which is rapidly deployed. The first mobility model, called dPSO-U, has been designed for capturing the mobility of a UAV network in a mission with two main objectives: i) exploring the scenario area for discovering the location of ground nodes, and ii) making the UAVs to autonomously converge to the groups in which the nodes are organized (also referred to as clusters). The dPSO-U mobility model is based on the well-known particle swarm optimization algorithm (PSO), considering the UAVs as the particles of the algorithm, and also using the concept of dynamic inertia, local best and neighbour best weights so the mobility model can have both abilities: exploration and convergence. The second one, called Jaccard-based mobility model, captures the mobility of a UAV network that has been assigned with the mission of providing wireless communication services in a medium-scale scenario. A combination of the virtual forces algorithm (VFA), the Jaccard distance between each pair of UAVs and metaheuristics such as hill climbing or simulated annealing have been used in this mobility model in order to meet the two mission objectives: i) to maximize the number of ground nodes (i.e. victims) under the UAV network wireless coverage area, and ii) to maintain the UAV network as a connected network, i.e. avoiding UAV disconnections. Extensive simulations have been performed with software tools that have been specifically developed for the proposed mobility models. Also, a set of metrics have been defined and measured for each mobility model. These metrics have been used for validating the ability of the proposed mobility models to emulate the movements of a UAV network in each mission

Reinforcement Learning and Planning for Preference Balancing Tasks

Robots are often highly non-linear dynamical systems with many degrees of freedom, making solving motion problems computationally challenging. One solution has been reinforcement learning (RL), which learns through experimentation to automatically perform the near-optimal motions that complete a task. However, high-dimensional problems and task formulation often prove challenging for RL. We address these problems with PrEference Appraisal Reinforcement Learning (PEARL), which solves Preference Balancing Tasks (PBTs). PBTs define a problem as a set of preferences that the system must balance to achieve a goal. The method is appropriate for acceleration-controlled systems with continuous state-space and either discrete or continuous action spaces with unknown system dynamics. We show that PEARL learns a sub-optimal policy on a subset of states and actions, and transfers the policy to the expanded domain to produce a more refined plan on a class of robotic problems. We establish convergence to task goal conditions, and even when preconditions are not verifiable, show that this is a valuable method to use before other more expensive approaches. Evaluation is done on several robotic problems, such as Aerial Cargo Delivery, Multi-Agent Pursuit, Rendezvous, and Inverted Flying Pendulum both in simulation and experimentally. Additionally, PEARL is leveraged outside of robotics as an array sorting agent. The results demonstrate high accuracy and fast learning times on a large set of practical applications