Particle swarm-based olfactory guided search

被引:158
作者
Marques, Lino [1 ]
Nunes, Urbano [1 ]
de Almeida, A. T. [1 ]
机构
[1] Univ Coimbra, Dept Elect & Comp Engn, Inst Syst & Robot, P-3030290 Coimbra, Portugal
关键词
olfactive search; cooperative robotics; particle swarm optimization;
D O I
10.1007/s10514-006-7567-0
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This article presents a new algorithm for searching odour sources across large search spaces with groups of mobile robots. The proposed algorithm is inspired in the particle swarm optimization (PSO) method. In this method, the search space is sampled by dynamic particles that use their knowledge about the previous sampled space and share this knowledge with other neighbour searching particles allowing the emergence of efficient local searching behaviours. In this case, chemical searching cues about the potential existence of upwind odour sources are exchanged. By default, the agents tend to avoid each other, leading to the emergence of exploration behaviours when no chemical cue exists in the neighbourhood. This behaviour improves the global searching performance. The article explains the relevance of searching odour sources with autonomous agents and identifies the main difficulties for solving this problem. A major difficulty is related with the chaotic nature of the odour transport in the atmosphere due to turbulent phenomena. The characteristics of this problem are described in detail and a simulation framework for testing and analysing different odour searching algorithms was constructed. The proposed PSO-based searching algorithm and modified versions of gradient-based searching and biased random walk-based searching strategies were tested in different environmental conditions and the results, showing the effectiveness of the proposed strategy, were analysed and discussed.
引用
收藏
页码:277 / 287
页数:11
相关论文
共 35 条
[1]  
ALMEIDA N, 2004, IEEE INT C SENS
[2]  
ALMEIDA N, 2003, P EUROSENSORS
[3]  
ANDERSON CW, 2001, P INT C MOD SIM, P911
[4]   Olfactory search at high Reynolds number [J].
Balkovsky, E ;
Shraiman, BI .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2002, 99 (20) :12589-12593
[5]   A stochastic model for intermittent search strategies [J].
Bénichou, O ;
Coppey, M ;
Moreau, M ;
Suet, PH ;
Voituriez, R .
JOURNAL OF PHYSICS-CONDENSED MATTER, 2005, 17 (49) :S4275-S4286
[6]   Coordinated multi-robot exploration [J].
Burgard, W ;
Moors, M ;
Stachniss, C ;
Schneider, FE .
IEEE TRANSACTIONS ON ROBOTICS, 2005, 21 (03) :376-386
[7]  
Capell K, 2005, BUS WEEK, P52
[8]   Plume mapping via hidden Markov methods [J].
Farrell, JA ;
Pang, S ;
Li, W .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2003, 33 (06) :850-863
[9]   The scientific foundation and efficacy of the use of canines as chemical detectors for explosives [J].
Furton, KG ;
Myers, LJ .
TALANTA, 2001, 54 (03) :487-500
[10]  
Gage D.W., 1993, SPIE Mobile Robors VIII, Boston, P270