Plume mapping via hidden Markov methods

Authors:
J. A. Farrell;Shuo Pang;Wei Li
Affiliations:
Dept. of Electr. Eng., Univ. of California, Riverside, CA, USA;-;-
Venue:
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Year:
2003

Citing 0
Cited 4

Robot algorithms for localization of multiple emission sources

ACM Computing Surveys (CSUR)
A learning particle swarm optimization algorithm for odor source localization

International Journal of Automation and Computing
Mapping multiple gas/odor sources in an uncontrolled indoor environment using a Bayesian occupancy grid mapping based method

Robotics and Autonomous Systems
Experimental studies on chemical concentration map building by a multi-robot system using bio-inspired algorithms

Autonomous Agents and Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the problem of mapping likely locations of a chemical source using an autonomous vehicle operating in a fluid flow. The paper reviews biological plume-tracing concepts, reviews previous strategies for vehicle-based plume tracing, and presents a new plume mapping approach based on hidden Markov methods (HMM). HMM provide efficient algorithms for predicting the likelihood of odor detection versus position, the likelihood of source location versus position, the most likely path taken by the odor to a given location, and the path between two points most likely to result in odor detection. All four are useful for solving the odor source localization problem using an autonomous vehicle. The vehicle is assumed to be capable of detecting above threshold chemical concentration and sensing the fluid flow velocity at the vehicle location. The fluid flow is assumed to vary with space and time, and to have a high Reynolds number (Re10).