Algorithms for multi-robot systems on the cooperative exploration & last-mile delivery problems

La aparición de los vehículos aéreos no tripulados (UAVs) y de los vehículos terrestres no tripulados (UGVs) ha llevado a la comunidad científica a enfrentarse a problemas ideando paradigmas de cooperación con UGVs y UAVs. Sin embargo, no suele ser trivial determinar si la cooperación entre UGVs y UAVs es adecuada para un determinado problema. Por esta razón, en esta tesis, investigamos un paradigma particular de cooperación UGV-UAV en dos problemas de la literatura, y proponemos un controlador autónomo para probarlo en escenarios simulados. Primero, formulamos un problema particular de exploración cooperativa que consiste en alcanzar un conjunto de puntos de destino en un área de exploración a gran escala. Este problema define al UGV como una estación de carga móvil para transportar el UAV a través de diferentes lugares desde donde el UAV puede alcanzar los puntos de destino. Por consiguiente, proponemos el algoritmo TERRA para resolverlo. Este algoritmo se destaca por dividir el problema de exploración en cinco subproblemas, en los que cada subproblema se resuelve en una etapa particular del algoritmo. Debido a la explosión de la entrega de paquetes en las empresas de comercio electrónico, formulamos también una generalización del conocido problema de la entrega en la última milla. En este caso, el UGV actúa como una estación de carga móvil que transporta a los paquetes y a los UAVs, y estos se encargan de entregarlos. De esta manera, seguimos la estrategia de división descrita por TERRA, y proponemos el algoritmo COURIER. Este algoritmo replica las cuatro primeras etapas de TERRA, pero construye una nueva quinta etapa para producir un plan de tareas que resuelva el problema. Para evaluar el paradigma de cooperación UGV-UAV en escenarios simulados, proponemos el controlador autónomo ARIES. Este controlador sigue un enfoque jerárquico descentralizado de líder-seguidor para integrar cualquier paradigma de cooperación de manera distribuida. Ambos algoritmos han sido caracterizados para identificar los aspectos relevantes del paradigma de cooperación en los problemas relacionados. Además, ambos demuestran un gran rendimiento del paradigma de cooperación en tales problemas, y al igual que el controlador autónomo, revelan un gran potencial para futuras aplicaciones reales.The emergence of Unmanned Aerial Vehicles (UAVs) and Unmanned Ground Vehicles (UGVs) has conducted the research community to face historical complex problems by devising UGV-UAV cooperation paradigms. However, it is usually not a trivial task to determine whether or not a UGV-UAV cooperation is suitable for a particular problem. For this reason, in this thesis, we investigate a particular UGV-UAV cooperation paradigm over two problems in the literature, and we propose an autonomous controller to test it on simulated scenarios. Driven by the planetary exploration, we formulate a particular cooperative exploration problem consisting of reaching a set of target points in a large-scale exploration area. This problem defines the UGV as a moving charging station to carry the UAV through different locations from where the UAV can reach the target points. Consequently, we propose the cooperaTive ExploRation Routing Algorithm (TERRA) to solve it. This algorithm stands out for splitting up the exploration problem into five sub-problems, in which each sub-problem is solved in a particular stage of the algorithm. In the same way, driven by the explosion of parcels delivery in e-commerce companies, we formulate a generalization of the well-known last-mile delivery problem. This generalization defines the same UGV’s and UAV’s rol as the exploration problem. That is, the UGV acts as a moving charging station which carries the parcels along several UAVs to deliver them. In this way, we follow the split strategy depicted by TERRA to propose the COoperative Unmanned deliveRIEs planning algoRithm (COURIER). This algorithm replicates the first four TERRA’s stages, but it builds a new fifth stage to produce a task plan solving the problem. In order to evaluate the UGV-UAV cooperation paradigm on simulated scenarios, we propose the Autonomous coopeRatIve Execution System (ARIES). This controller follows a hierarchical decentralized leader-follower approach to integrate any cooperation paradigm in a distributed manner. Both algorithms have been characterized to identify the relevant aspects of the cooperation paradigm in the related problems. Also, both of them demonstrate a great performance of the cooperation paradigm in such problems, and as well as the autonomous controller, reveal a great potential for future real applications

The Unmanned Aerial Vehicle Routing and Trajectory Optimisation Problem, a Taxonomic Review

Over the past few years, Unmanned Aerial Vehicles (UAVs) have become more and more popular. The complexity of routing UAVs has not been fully investigated in the literature. In this paper, we provide a formal definition of the UAV Routing and Trajectory Optimisation Problem (UAVRTOP). Next, we introduce a taxonomy and review recent contributions in UAV trajectory optimisation, UAV routing and articles addressing these problems, and their variants, simultaneously. We conclude with the identification of future research opportunities.<br/

Multiple Drone and Truck Arc Routing Problem

In this thesis we introduce the Multiple Drone and Truck Arc Routing Problem (MDTARP) which considers a fleet of drones used in synchronization with a ground vehicle to provide service to edges in a network within a given time-horizon. Drones launch from a ground vehicle to perform services on a set of edges and return to recharge batteries ready for its next trip. We formulate a multi-objective mathematical model that maximizes coverage of edges on a network based on given weights while minimizing unnecessary travel by drones and the ground vehicle. We develop an Iterated Local Search heuristic and a Cluster-based Location Search heuristic and assess their performance on several instances representing different scenarios. We compare results with solutions obtained using a commercial solver to showcase the effectiveness of the heuristics and perform computational experiments to provide recommendations for the users

Collaborative Multi-Robot Search and Rescue: Planning, Coordination, Perception, and Active Vision

Search and rescue (SAR) operations can take significant advantage from supporting autonomous or teleoperated robots and multi-robot systems. These can aid in mapping and situational assessment, monitoring and surveillance, establishing communication networks, or searching for victims. This paper provides a review of multi-robot systems supporting SAR operations, with system-level considerations and focusing on the algorithmic perspectives for multi-robot coordination and perception. This is, to the best of our knowledge, the first survey paper to cover (i) heterogeneous SAR robots in different environments, (ii) active perception in multi-robot systems, while (iii) giving two complementary points of view from the multi-agent perception and control perspectives. We also discuss the most significant open research questions: shared autonomy, sim-to-real transferability of existing methods, awareness of victims' conditions, coordination and interoperability in heterogeneous multi-robot systems, and active perception. The different topics in the survey are put in the context of the different challenges and constraints that various types of robots (ground, aerial, surface, or underwater) encounter in different SAR environments (maritime, urban, wilderness, or other post-disaster scenarios). The objective of this survey is to serve as an entry point to the various aspects of multi-robot SAR systems to researchers in both the machine learning and control fields by giving a global overview of the main approaches being taken in the SAR robotics area

Development of Aerial-Ground Sensing Network: Architecture, Sensor Activation, and Spatial Path-Energy Optimization

Title from PDF of title page viewed May 13, 2019Dissertation advisor: ZhiQiang ChenVitaIncludes bibliographical references (pages 101-110)Thesis (Ph.D.)--School of Computing and Engineering. University of Missouri--Kansas City, 2019The advent of autonomous navigation, positioning, and in general robotics technologies has enabled the maturity of small to miniature-sized unmanned aerial vehicles (UAVs; or colloquially called drones) and their wide use in engineering practice as a low-cost and effective geospatial remote sensing solution. Meanwhile, wireless sensing network technology (WSN) has also matured in recent years with many applications found in engineering practice. In this dissertation, a novel aerial ground wireless sensing network (AG-WSN) is developed, which is expected to transform a number of critical geospatial sensing and monitoring practices, such as precision agriculture, civil infrastructure protection, and disaster response. Towards the maximal energy efficiency, three research problems are concerned in this dissertation. First, a radio-frequency (RF) wake-up mechanism is investigated for aerial activation of ground sensors using a UAV platform. Second, the data transmission under wireless interference between the UAV and ground WSN is experimentally investigated, which suggests practical relations and parameters for aerial-ground communication configuration. Last, this dissertation theoretically explores and develops an optimization framework for UAV's aerial path planning when collecting ground-sensor data. An improved mixed-integer non-linear programming approach is proposed for solving the optimal spatial path-energy using the framework of the traveling-salesman problem with neighborhoods.Introduction -- Development of radio-frequency sensor wake-up through UAV as an aerial gateway -- Experimental investigation of aerial-ground network communication towards geospatially large-scale structural health monitoring -- Spatial path-energy optimization for tactic unmanned aerial vehicles operation in aerial-ground networking -- Conclusion and future wor

Swarm Robotic Systems with Minimal Information Processing

This thesis is concerned with the design and analysis of behaviors in swarm robotic systems using minimal information acquisition and processing. The motivation for this work is to contribute in paving the way for the implementation of swarm robotic systems at physically small scales, which will open up new application domains for their operation. At these scales, the space and energy available for the integration of sensors and computational hardware within the individual robots is at a premium. As a result, trade-offs in performance can be justified if a task can be achieved in a more parsimonious way. A framework is developed whereby meaningful collective behaviors in swarms of robots can be shown to emerge without the robots, in principle, possessing any run-time memory or performing any arithmetic computations. This is achieved by the robots having only discrete-valued sensors, and purely reactive controllers. Black-box search methods are used to automatically synthesize these controllers for desired collective behaviors. This framework is successfully applied to two canonical tasks in swarm robotics: self-organized aggregation of robots, and self-organized clustering of objects by robots. In the case of aggregation, the robots are equipped with one binary sensor, which informs them whether or not there is another robot in their line of sight. This makes the structure of the robots’ controller simple enough that its entire space can be systematically searched to locate the optimal controller (within a finite resolution). In the case of object clustering, the robots’ sensor is extended to have three states, distinguishing between robots, objects, and the background. This still requires no run-time memory or arithmetic computations on the part of the robots. It is statistically shown that the extension of the sensor to have three states leads to a better performance as compared to the cases where the sensor is binary, and cannot distinguish between robots and objects, or robots and the background