An evolutionary algorithm for online, resource constrained, multi-vehicle sensing mission planning

Mobile robotic platforms are an indispensable tool for various scientific and industrial applications. Robots are used to undertake missions whose execution is constrained by various factors, such as the allocated time or their remaining energy. Existing solutions for resource constrained multi-robot sensing mission planning provide optimal plans at a prohibitive computational complexity for online application [1],[2],[3]. A heuristic approach exists for an online, resource constrained sensing mission planning for a single vehicle [4]. This work proposes a Genetic Algorithm (GA) based heuristic for the Correlated Team Orienteering Problem (CTOP) that is used for planning sensing and monitoring missions for robotic teams that operate under resource constraints. The heuristic is compared against optimal Mixed Integer Quadratic Programming (MIQP) solutions. Results show that the quality of the heuristic solution is at the worst case equal to the 5% optimal solution. The heuristic solution proves to be at least 300 times more time efficient in the worst tested case. The GA heuristic execution required in the worst case less than a second making it suitable for online execution.Comment: 8 pages, 5 figures, accepted for publication in Robotics and Automation Letters (RA-L

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

Setting up a mixed reality simulator for using teams of autonomous uavs in air pollution monitoring

[Abstract]: A framework based on a mixed reality simulator for coordinating teams of autonomous Unmanned Aerial Vehicles (UAVs) is been developed. This framework would serve as a tool to facilitate crossing the reality gap for different applications; particularly when using these UAVs teams for air pollution monitoring and measurement. The system is built on a co-evolutionary simulator that makes use of data transmitted from some real UAVs to integrate them within a team of simulated UAVs. The system allows the progressive increase of the number of real UAV in the team. This facilitates the setting-up of a single UAV control system and also of the UAV collaboration schemes for different scenarios. A specific implementation of this system focussed on mapping the pollutant dispersion of a plume in the atmosphere is presented. Implementing an appropriate pollution dispersion model within the simulator is a key aspect of the system. This model should require few computational resources, should be easy to adapt in real time to ambient changes, and it should have a fair accuracy.Xunta de Galicia; GRC 2013-050The Integrated Group for Engineering Research acknowledges funding from the Xunta de Galicia and European Regional Development Funds under grant GRC 2013-05

Learning for Multi-robot Cooperation in Partially Observable Stochastic Environments with Macro-actions

This paper presents a data-driven approach for multi-robot coordination in partially-observable domains based on Decentralized Partially Observable Markov Decision Processes (Dec-POMDPs) and macro-actions (MAs). Dec-POMDPs provide a general framework for cooperative sequential decision making under uncertainty and MAs allow temporally extended and asynchronous action execution. To date, most methods assume the underlying Dec-POMDP model is known a priori or a full simulator is available during planning time. Previous methods which aim to address these issues suffer from local optimality and sensitivity to initial conditions. Additionally, few hardware demonstrations involving a large team of heterogeneous robots and with long planning horizons exist. This work addresses these gaps by proposing an iterative sampling based Expectation-Maximization algorithm (iSEM) to learn polices using only trajectory data containing observations, MAs, and rewards. Our experiments show the algorithm is able to achieve better solution quality than the state-of-the-art learning-based methods. We implement two variants of multi-robot Search and Rescue (SAR) domains (with and without obstacles) on hardware to demonstrate the learned policies can effectively control a team of distributed robots to cooperate in a partially observable stochastic environment.Comment: Accepted to the 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2017

Counterexample Guided Inductive Optimization Applied to Mobile Robots Path Planning (Extended Version)

We describe and evaluate a novel optimization-based off-line path planning algorithm for mobile robots based on the Counterexample-Guided Inductive Optimization (CEGIO) technique. CEGIO iteratively employs counterexamples generated from Boolean Satisfiability (SAT) and Satisfiability Modulo Theories (SMT) solvers, in order to guide the optimization process and to ensure global optimization. This paper marks the first application of CEGIO for planning mobile robot path. In particular, CEGIO has been successfully applied to obtain optimal two-dimensional paths for autonomous mobile robots using off-the-shelf SAT and SMT solvers.Comment: 7 pages, 14rd Latin American Robotics Symposium (LARS'2017

Comparison of 3D Versus 4D Path Planning for Unmanned Aerial Vehicles

This research compares 3D versus 4D (three spatial dimensions and the time dimension) multi-objective and multi-criteria path-planning for unmanned aerial vehicles in complex dynamic environments. In this study, we empirically analyse the performances of 3D and 4D path planning approaches. Using the empirical data, we show that the 4D approach is superior over the 3D approach especially in complex dynamic environments. The research model consisting of flight objectives and criteria is developed based on interviews with an experienced military UAV pilot and mission planner to establish realism and relevancy in  unmanned aerial vehicle flight planning. Furthermore, this study incorporates one of the most comprehensive set of criteria identified during our literature search. The simulation results clearly show that the 4D path planning approach is able to provide solutions in complex dynamic environments in which the 3D approach could not find a solution