Collective Odor Source Estimation and Search in Time-Variant Airflow Environments Using Mobile Robots

This paper addresses the collective odor source localization (OSL) problem in a time-varying airflow environment using mobile robots. A novel OSL methodology which combines odor-source probability estimation and multiple robots’ search is proposed. The estimation phase consists of two steps: firstly, the separate probability-distribution map of odor source is estimated via Bayesian rules and fuzzy inference based on a single robot’s detection events; secondly, the separate maps estimated by different robots at different times are fused into a combined map by way of distance based superposition. The multi-robot search behaviors are coordinated via a particle swarm optimization algorithm, where the estimated odor-source probability distribution is used to express the fitness functions. In the process of OSL, the estimation phase provides the prior knowledge for the searching while the searching verifies the estimation results, and both phases are implemented iteratively. The results of simulations for large-scale advection–diffusion plume environments and experiments using real robots in an indoor airflow environment validate the feasibility and robustness of the proposed OSL method

Adapting an Ant Colony Metaphor for Multi-Robot Chemical Plume Tracing

We consider chemical plume tracing (CPT) in time-varying airflow environments using multiple mobile robots. The purpose of CPT is to approach a gas source with a previously unknown location in a given area. Therefore, the CPT could be considered as a dynamic optimization problem in continuous domains. The traditional ant colony optimization (ACO) algorithm has been successfully used for combinatorial optimization problems in discrete domains. To adapt the ant colony metaphor to the multi-robot CPT problem, the two-dimension continuous search area is discretized into grids and the virtual pheromone is updated according to both the gas concentration and wind information. To prevent the adapted ACO algorithm from being prematurely trapped in a local optimum, the upwind surge behavior is adopted by the robots with relatively higher gas concentration in order to explore more areas. The spiral surge (SS) algorithm is also examined for comparison. Experimental results using multiple real robots in two indoor natural ventilated airflow environments show that the proposed CPT method performs better than the SS algorithm. The simulation results for large-scale advection-diffusion plume environments show that the proposed method could also work in outdoor meandering plume environments

Optimal Spatial Formation of Swarm Robotic Gas Sensors in Odor Plume Finding

Finding the best spatial formation of stationary gas sensors in detection of odor clues is the first step of searching for olfactory targets in a given space using a swarm of robots. Considering no movement for a network of gas sensors, this paper formulates the problem of odor plume detection and analytically finds the optimal spatial configuration of the sensors for plume detection, given a set of assumptions. This solution was analyzed and verified by simulations and finally experimentally validated in a reduced scale realistic environment using a set of Roomba-based mobile robots

Optimal Swarm Formation for Odor Plume Finding

This paper presents an analytical approach to the problem of odor plume finding by a network of swarm robotic gas sensors, and finds an optimal configuration for them, given a set of assumptions. Considering cross-wind movement for the swarm, we found that the best spatial formation of robots in finding odor plumes is diagonal line configuration with equal distance between each pair of neighboring robots. We show that the distance between neighboring pairs in the line topology depends mainly on the wind speed and the environmental conditions, whereas, the number of robots and the swarm's crosswind movement distance do not show significant impact on optimal configurations. These solutions were analyzed and verified by simulations and experimentally validated in a reduced scale realistic environment using a set of mobile robots

Collective Odor Source Estimation and Search in Time-Variant Airflow Environments Using Mobile Robots

This paper addresses the collective odor source localization (OSL) problem in a time-varying airflow environment using mobile robots. A novel OSL methodology which combines odor-source probability estimation and multiple robots’ search is proposed. The estimation phase consists of two steps: firstly, the separate probability-distribution map of odor source is estimated via Bayesian rules and fuzzy inference based on a single robot’s detection events; secondly, the separate maps estimated by different robots at different times are fused into a combined map by way of distance based superposition. The multi-robot search behaviors are coordinated via a particle swarm optimization algorithm, where the estimated odor-source probability distribution is used to express the fitness functions. In the process of OSL, the estimation phase provides the prior knowledge for the searching while the searching verifies the estimation results, and both phases are implemented iteratively. The results of simulations for large-scale advection–diffusion plume environments and experiments using real robots in an indoor airflow environment validate the feasibility and robustness of the proposed OSL method