Swarm Robotics

Collectively working robot teams can solve a problem more efficiently than a single robot, while also providing robustness and flexibility to the group. Swarm robotics model is a key component of a cooperative algorithm that controls the behaviors and interactions of all individuals. The robots in the swarm should have some basic functions, such as sensing, communicating, and monitoring, and satisfy the following properties

Planning Algorithms for Multi-Robot Active Perception

A fundamental task of robotic systems is to use on-board sensors and perception algorithms to understand high-level semantic properties of an environment. These semantic properties may include a map of the environment, the presence of objects, or the parameters of a dynamic field. Observations are highly viewpoint dependent and, thus, the performance of perception algorithms can be improved by planning the motion of the robots to obtain high-value observations. This motivates the problem of active perception, where the goal is to plan the motion of robots to improve perception performance. This fundamental problem is central to many robotics applications, including environmental monitoring, planetary exploration, and precision agriculture. The core contribution of this thesis is a suite of planning algorithms for multi-robot active perception. These algorithms are designed to improve system-level performance on many fronts: online and anytime planning, addressing uncertainty, optimising over a long time horizon, decentralised coordination, robustness to unreliable communication, predicting plans of other agents, and exploiting characteristics of perception models. We first propose the decentralised Monte Carlo tree search algorithm as a generally-applicable, decentralised algorithm for multi-robot planning. We then present a self-organising map algorithm designed to find paths that maximally observe points of interest. Finally, we consider the problem of mission monitoring, where a team of robots monitor the progress of a robotic mission. A spatiotemporal optimal stopping algorithm is proposed and a generalisation for decentralised monitoring. Experimental results are presented for a range of scenarios, such as marine operations and object recognition. Our analytical and empirical results demonstrate theoretically-interesting and practically-relevant properties that support the use of the approaches in practice

Cooperative localisation in underwater robotic swarms for ocean bottom seismic imaging.

Spatial information must be collected alongside the data modality of interest in wide variety of sub-sea applications, such as deep sea exploration, environmental monitoring, geological and ecological research, and samples collection. Ocean-bottom seismic surveys are vital for oil and gas exploration, and for productivity enhancement of an existing production facility. Ocean-bottom seismic sensors are deployed on the seabed to acquire those surveys. Node deployment methods used in industry today are costly, time-consuming and unusable in deep oceans. This study proposes the autonomous deployment of ocean-bottom seismic nodes, implemented by a swarm of Autonomous Underwater Vehicles (AUVs). In autonomous deployment of ocean-bottom seismic nodes, a swarm of sensor-equipped AUVs are deployed to achieve ocean-bottom seismic imaging through collaboration and communication. However, the severely limited bandwidth of underwater acoustic communications and the high cost of maritime assets limit the number of AUVs that can be deployed for experiments. A holistic fuzzy-based localisation framework for large underwater robotic swarms (i.e. with hundreds of AUVs) to dynamically fuse multiple position estimates of an autonomous underwater vehicle is proposed. Simplicity, exibility and scalability are the main three advantages inherent in the proposed localisation framework, when compared to other traditional and commonly adopted underwater localisation methods, such as the Extended Kalman Filter. The proposed fuzzy-based localisation algorithm improves the entire swarm mean localisation error and standard deviation (by 16.53% and 35.17% respectively) at a swarm size of 150 AUVs when compared to the Extended Kalman Filter based localisation with round-robin scheduling. The proposed fuzzy based localisation method requires fuzzy rules and fuzzy set parameters tuning, if the deployment scenario is changed. Therefore a cooperative localisation scheme that relies on a scalar localisation confidence value is proposed. A swarm subset is navigationally aided by ultra-short baseline and a swarm subset (i.e. navigation beacons) is configured to broadcast navigation aids (i.e. range-only), once their confidence values are higher than a predetermined confidence threshold. The confidence value and navigation beacons subset size are two key parameters for the proposed algorithm, so that they are optimised using the evolutionary multi-objective optimisation algorithm NSGA-II to enhance its localisation performance. Confidence value-based localisation is proposed to control the cooperation dynamics among the swarm agents, in terms of aiding acoustic exteroceptive sensors. Given the error characteristics of a commercially available ultra-short baseline system and the covariance matrix of a trilaterated underwater vehicle position, dead reckoning navigation - aided by Extended Kalman Filter-based acoustic exteroceptive sensors - is performed and controlled by the vehicle's confidence value. The proposed confidence-based localisation algorithm has significantly improved the entire swarm mean localisation error when compared to the fuzzy-based and round-robin Extended Kalman Filter-based localisation methods (by 67.10% and 59.28% respectively, at a swarm size of 150 AUVs). The proposed fuzzy-based and confidence-based localisation algorithms for cooperative underwater robotic swarms are validated on a co-simulation platform. A physics-based co-simulation platform that considers an environment's hydrodynamics, industrial grade inertial measurement unit and underwater acoustic communications characteristics is implemented for validation and optimisation purposes

Reactive evolutionary path planning for autonomous surface vehicles in lake environments.

Autonomous Surface Vehicles (ASVs) have found a lot of promising applications in aquatic environments, i.e., sea, lakes, rivers, etc. They can be used for applications of paramount importance, such as environmental monitoring of water resources, and for bathymetry to study the characteristics of the basing of a lake/sea or for surveillance in patrol missions, among others. These vehicles can be built with smaller dimensions when compared to regular ships since they do not need an on-board crew for operation. However, they do require at least a telemetry control as well as certain intelligence for making decisions and responding to changing scenarios. Water resources are very important in Paraguay since they provide fresh water for its inhabitants and they are crucial for the main economic activities such as agriculture and cattle raising. Furthermore, they are natural borders with the surrounding countries, and consequently the main transportation route for importing/exporting products. In fact, Paraguay is the third country in the world with the largest fleet of barges after USA and China. Thus, maintaining and monitoring the environmental conditions of these resources is key in the development of the country. This work is focused on the maintenance and monitoring of the greatest lake of the country called Ypacarai Lake. In recent years, the quality of its water has been seriously degraded due to the pollution caused by the low control of the dumping of waste thrown into the Lake. Since it is also a national icon, the government of Paraguay has put a lot of effort in recovering water quality of the Lake. As a result, it is monitored periodically but using manual procedures. Therefore, the primary objective of this work is to develop these monitoring tasks autonomously by means of an ASV with a suitable path planning strategy. Path planning is an active research area in robotics. A particular case is the Coverage Path Planning (CPP) problem, where an algorithm should find a path that achieves the best coverage of the target region to be monitored. This work mainly studies the global CPP, which returns a suitable path considering the initial conditions of the environment where the vehicle moves. The first contribution of this thesis is the modeling of the CPP using Hamiltonian Circuits (HCs) and Eulerian Circuits (ECs). Therefore, a graph adapted to the Ypacarai Lake is created by using a network of wireless beacons located at the shore of the lake, so that they can be used as data exchange points between a control center and the ASV, and also as waypoints. Regarding the proposed modeling, HCs and ECs are paths that begin and end at the same point. Therefore, the ASV travels across a given graph that is defined by a set of wireless beacons. The main difference between HC and EC is that a HC is a tour that visits each vertex only once while EC visits each edge only once. Finding optimal HCs or ECs that minimize the total distance traveled by the ASV are very complex problems known as NP-complete. To solve such problems, a meta-heuristic algorithm can be a suitable approach since they provide quasi-optimal solutions in a reasonable time. In this work, a GA (Genetic Algorithm) approach is proposed and tested. First, an evaluation of the performance of the algorithm with different values of its hyper-parameters has been carried out. Second, the proposed approach has been compared to other approaches such as randomized and greedy algorithms. Third, a thorough comparison between the performance of HC and EC based approaches is presented. The simulation results show that EC-based approach outperforms the HC-based approach almost 2% which in terms of the Lake size is about 1.4 km2 or 140 ha (hectares). Therefore, it has been demonstrated that the modeling of the problem as an Eulerian graph provides better results. Furthermore, it has been investigated the relationship between the number of beacons to be visited and the distance traveled by the ASV in the EC-based approach. Findings indicate that there is a quasi-lineal relationship between the number of beacons and the distance traveled. The second contribution of this work is the development of an on-line learning strategy using the same model but considering dynamic contamination events in the Lake. Dynamic events mean the appearance and evolution of an algae bloom, which is a strong indicator of the degradation of the lake. The strategy is divided into two-phases, the initial exploration phase to discover the presence of the algae bloom and next the intensification phase to focus on the region where the contamination event is detected. This intensification effect is achieved by modifying the beacon-based graph, reducing the number of vertices and selecting those that are closer to the region of interest. The simulation results reveal that the proposed strategy detects two events and monitors them, keeping a high level of coverage while minimizing the distance traveled by the ASV. The proposed scheme is a reactive path planning that adapts to the environmental conditions. This scheme makes decisions in an autonomous way and it switches from the exploratory phase to the intensification phase depending on the external conditions, leading to a variable granularity in the monitoring task. Therefore, there is a balance between coverage and the energy consumed by the ASV. The main benefits obtained from the second contribution includes a better monitoring in the quality of water and control of waste dumping, and the possibility to predict the appearance of algae-bloom from the collected environmental data

Application of swarm robotics systems to marine environmental monitoring

Automated environmental monitoring in marine environments is currently carried out either by small-scale robotic systems, composed of one or few robots, or static sensor networks. In this paper, we propose the use of swarm robotics systems to carry out marine environmental monitoring missions. In swarm robotics systems, each individual unit is relatively simple and inexpensive. The robots rely on decentralized control and local communication, allowing the swarm to scale to hundreds of units and to cover large areas. We study the application of a swarm of aquatic robots to environmental monitoring tasks. In the first part of the study, we synthesize swarm control for a temperature monitoring mission and validate our results with a real swarm robotics system. Then, we conduct a simulation-based evaluation of the robots' performance over large areas and with large swarm sizes, and demonstrate the swarm's robustness to faults. Our results show that swarm robotics systems are suited for environmental monitoring tasks by efficiently covering a target area, allowing for redundancy in the data collection process, and tolerating individual robot faults.info:eu-repo/semantics/acceptedVersio

The Dynamic Multi-objective Multi-vehicle Covering Tour Problem

This work introduces a new routing problem called the Dynamic Multi-Objective Multi-vehicle Covering Tour Problem (DMOMCTP). The DMOMCTPs is a combinatorial optimization problem that represents the problem of routing multiple vehicles to survey an area in which unpredictable target nodes may appear during execution. The formulation includes multiple objectives that include minimizing the cost of the combined tour cost, minimizing the longest tour cost, minimizing the distance to nodes to be covered and maximizing the distance to hazardous nodes. This study adapts several existing algorithms to the problem with several operator and solution encoding variations. The efficacy of this set of solvers is measured against six problem instances created from existing Traveling Salesman Problem instances which represent several real countries. The results indicate that repair operators, variable length solution encodings and variable-length operators obtain a better approximation of the true Pareto front

A Comparison of Local Path Planning Techniques of Autonomous Surface Vehicles for Monitoring Applications: The Ypacarai Lake Case-study

Local path planning is important in the development of autonomous vehicles since it allows a vehicle to adapt their movements to dynamic environments, for instance, when obstacles are detected. This work presents an evaluation of the performance of different local path planning techniques for an Autonomous Surface Vehicle, using a custom-made simulator based on the open-source Robotarium framework. The conducted simulations allow to verify, compare and visualize the solutions of the different techniques. The selected techniques for evaluation include A*, Potential Fields (PF), Rapidly-Exploring Random Trees* (RRT*) and variations of the Fast Marching Method (FMM), along with a proposed new method called Updating the Fast Marching Square method (uFMS). The evaluation proposed in this work includes ways to summarize time and safety measures for local path planning techniques. The results in a Lake environment present the advantages and disadvantages of using each technique. The proposed uFMS and A* have been shown to achieve interesting performance in terms of processing time, distance travelled and security levels. Furthermore, the proposed uFMS algorithm is capable of generating smoother routes.Consejo Nacional de Ciencia de Tecnología (CONACYT) de Paraguay PINV15-177Ministerio de Ciencia, Innovación y Universidades RTI2018-098964-B-I00Junta de Andalucía US-1257508Junta de Andalucía PY18-RE0009Junta de Andalucía 2018/ACDE/00077