Exploration and Mapping using a Sparse Robot Swarm: Simulation Results

This research report is a companion to the following paper: Atlas: Explorationand Mapping with a Sparse Swarm of Networked IoT Robots. Razanne Abu-Aisheh, FrancescoBronzino, Myriana Rifai, Brian Kilberg, Kris Pister, Thomas Watteyne. Workshop on WirelessSensors and Drones in Internet of Things (Wi-DroIT), part of DCOSS, 2020. It expands thatpaper by providing more detailed explanations and more complete results.Exploration and mapping is a fundamental capability of a swarm of robots: robots enter anunknown area, explore it, and collectively build a map of it. This capability is important regard-less of whether the robots are crawling, flying, or swimming. Existing exploration and mappingalgorithms tend to either be inefficient, or rely on having a dense swarm of robots. This paperintroduces Atlas, an exploration and mapping algorithm for sparse swarms of robots, which com-pletes a full exploration even in the extreme case of a single robot. We develop an open-sourcesimulator and show that Atlas outperforms the state-of-the-art in terms of exploration speed andcompleteness of the resulting map

Atlas: Exploration and Mapping with a Sparse Swarm of Networked IoT Robots

International audienceExploration and mapping is a fundamental capability of a swarm of robots: robots enter an unknown area, explore it, and collectively build a map of it. This capability is important regardless of whether the robots are crawling, flying,or swimming. Existing exploration and mapping algorithms tend to either be inefficient, or rely on having a dense swarm of robots.This paper introduces Atlas, an exploration and mapping algorithm for sparse swarms of robots, which completes a full exploration even in the extreme case of a single robot. We developan open-source simulator and show that Atlas out performs the state-of-the-art in terms of exploration speed and completeness of the resulting map

Learning-based wildfire tracking with unmanned aerial vehicles

This project attempts to design a path planning algorithm for a group of unmanned aerial vehicles (UAVs) to track multiple spreading wildfire zones on a wildland. Due to the physical limitations of UAVs, the wildland is partially observable. Thus, the fire spreading is difficult to model. An online training regression neural network using real-time UAV observation data is implemented for fire front positions prediction. The wildfire tracking with UAVs path planning algorithm is proposed by Q-learning. Various practical factors are considered by designing an appropriate cost function which can describe the tracking problem, such as importance of the moving targets, field of view of UAVs, spreading speed of fire zones, collision avoidance between UAVs, obstacle avoidance, and maximum information collection. To improve the computation efficiency, a vertices-based fire line feature extraction is used to reduce the fire line targets. Simulation results under various wind conditions validate the fire prediction accuracy and UAV tracking performance.Includes bibliographical references

A robust and efficient autonomous exploration methodology of unknown environments for multi-robot systems

Multi-robot systems can provide effective solutions for exploring and inspecting environments where it is unpractical or unsafe for humans, however, adequate coordination of the multi-robot system is a challenging initiative. A robust and efficient methodology for exploration of unknown environments is presented using a k-means method to improve traditional task allocation schemes. The k-means method proposed is an efficient technique due to the algorithm???s quick convergence time and its ability to segment a previously unknown map in a logical manner. In this method, a global executive receives frontiers from local robots, filters them, clusters them using the k-means method, and then reassigns them to the agents. A framework is developed in Robot Operating System (ROS) to test the effectiveness of the k-means method. The method is tested over a series of simulations and real-world tests, where it provided significant reductions in exploration time and distance travelled compared to other methods

A Survey of Evolutionary Continuous Dynamic Optimization Over Two Decades:Part B

Many real-world optimization problems are dynamic. The field of dynamic optimization deals with such problems where the search space changes over time. In this two-part paper, we present a comprehensive survey of the research in evolutionary dynamic optimization for single-objective unconstrained continuous problems over the last two decades. In Part A of this survey, we propose a new taxonomy for the components of dynamic optimization algorithms, namely, convergence detection, change detection, explicit archiving, diversity control, and population division and management. In comparison to the existing taxonomies, the proposed taxonomy covers some additional important components, such as convergence detection and computational resource allocation. Moreover, we significantly expand and improve the classifications of diversity control and multi-population methods, which are under-represented in the existing taxonomies. We then provide detailed technical descriptions and analysis of different components according to the suggested taxonomy. Part B of this survey provides an indepth analysis of the most commonly used benchmark problems, performance analysis methods, static optimization algorithms used as the optimization components in the dynamic optimization algorithms, and dynamic real-world applications. Finally, several opportunities for future work are pointed out

The Nexus between Artificial Intelligence and Economics

This book is organized as follows. Section 2 introduces the notion of the Singularity, a stage in development in which technological progress and economic growth increase at a near-infinite rate. Section 3 describes what artificial intelligence is and how it has been applied. Section 4 considers artificial happiness and the likelihood that artificial intelligence might increase human happiness. Section 5 discusses some prominent related concepts and issues. Section 6 describes the use of artificial agents in economic modeling, and section 7 considers some ways in which economic analysis can offer some hints about what the advent of artificial intelligence might bring. Chapter 8 presents some thoughts about the current state of AI and its future prospects.

Bio-inspired optimization in integrated river basin management

Water resources worldwide are facing severe challenges in terms of quality and quantity. It is essential to conserve, manage, and optimize water resources and their quality through integrated water resources management (IWRM). IWRM is an interdisciplinary field that works on multiple levels to maximize the socio-economic and ecological benefits of water resources. Since this is directly influenced by the river’s ecological health, the point of interest should start at the basin-level. The main objective of this study is to evaluate the application of bio-inspired optimization techniques in integrated river basin management (IRBM). This study demonstrates the application of versatile, flexible and yet simple metaheuristic bio-inspired algorithms in IRBM. In a novel approach, bio-inspired optimization algorithms Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO) are used to spatially distribute mitigation measures within a basin to reduce long-term annual mean total nitrogen (TN) concentration at the outlet of the basin. The Upper Fuhse river basin developed in the hydrological model, Hydrological Predictions for the Environment (HYPE), is used as a case study. ACO and PSO are coupled with the HYPE model to distribute a set of measures and compute the resulting TN reduction. The algorithms spatially distribute nine crop and subbasin-level mitigation measures under four categories. Both algorithms can successfully yield a discrete combination of measures to reduce long-term annual mean TN concentration. They achieved an 18.65% reduction, and their performance was on par with each other. This study has established the applicability of these bio-inspired optimization algorithms in successfully distributing the TN mitigation measures within the river basin. Stakeholder involvement is a crucial aspect of IRBM. It ensures that researchers and policymakers are aware of the ground reality through large amounts of information collected from the stakeholder. Including stakeholders in policy planning and decision-making legitimizes the decisions and eases their implementation. Therefore, a socio-hydrological framework is developed and tested in the Larqui river basin, Chile, based on a field survey to explore the conditions under which the farmers would implement or extend the width of vegetative filter strips (VFS) to prevent soil erosion. The framework consists of a behavioral, social model (extended Theory of Planned Behavior, TPB) and an agent-based model (developed in NetLogo) coupled with the results from the vegetative filter model (Vegetative Filter Strip Modeling System, VFSMOD-W). The results showed that the ABM corroborates with the survey results and the farmers are willing to extend the width of VFS as long as their utility stays positive. This framework can be used to develop tailor-made policies for river basins based on the conditions of the river basins and the stakeholders' requirements to motivate them to adopt sustainable practices. It is vital to assess whether the proposed management plans achieve the expected results for the river basin and if the stakeholders will accept and implement them. The assessment via simulation tools ensures effective implementation and realization of the target stipulated by the decision-makers. In this regard, this dissertation introduces the application of bio-inspired optimization techniques in the field of IRBM. The successful discrete combinatorial optimization in terms of the spatial distribution of mitigation measures by ACO and PSO and the novel socio-hydrological framework using ABM prove the forte and diverse applicability of bio-inspired optimization algorithms

Multi-Agent Systems

A multi-agent system (MAS) is a system composed of multiple interacting intelligent agents. Multi-agent systems can be used to solve problems which are difficult or impossible for an individual agent or monolithic system to solve. Agent systems are open and extensible systems that allow for the deployment of autonomous and proactive software components. Multi-agent systems have been brought up and used in several application domains

The Challenge of Machine Learning in Space Weather Nowcasting and Forecasting

The numerous recent breakthroughs in machine learning (ML) make imperative to carefully ponder how the scientific community can benefit from a technology that, although not necessarily new, is today living its golden age. This Grand Challenge review paper is focused on the present and future role of machine learning in space weather. The purpose is twofold. On one hand, we will discuss previous works that use ML for space weather forecasting, focusing in particular on the few areas that have seen most activity: the forecasting of geomagnetic indices, of relativistic electrons at geosynchronous orbits, of solar flares occurrence, of coronal mass ejection propagation time, and of solar wind speed. On the other hand, this paper serves as a gentle introduction to the field of machine learning tailored to the space weather community and as a pointer to a number of open challenges that we believe the community should undertake in the next decade. The recurring themes throughout the review are the need to shift our forecasting paradigm to a probabilistic approach focused on the reliable assessment of uncertainties, and the combination of physics-based and machine learning approaches, known as gray-box.Comment: under revie

Development, evolution and genetic analysis of C. elegans-inspired foraging algorithms under different environmental conditions

In this work 3 minimalist bio-inspired foraging algorithms based on C. elegans’ chemotaxis and foraging behaviour were developed and investigated. The main goal of the work is to apply the algorithms to robots with limited sensing capabilities. The refined versions of these algorithms were developed and optimised in 22 different environments. The results were processed using a novel set of techniques presented here, named Genotype Clustering. The results lead to two distinct conclusions, one practical and one more academic. From a practical perspective, the results suggest that, when suitably tuned, minimalist C. elegans-inspired foraging algorithms can lead to effective navigation to unknown targets even in the presence of repellents and under the influence of a significant sensor noise. From an academic perspective, the work demonstrates that even simple models can serve as an interesting and informative testbed for exploring fundamental evolutionary principles. The simulated robots were grounded in real hardware parameters, aiming at future application of the foraging algorithms in real robots. Another achievement of the project was the development of the simulation framework that provides a simple yet flexible program for the development and optimisation of behavioural algorithms