'Infotaxis' as a strategy for searching without gradients

被引:597
作者
Vergassola, Massimo
Villermaux, Emmanuel
Shraiman, Boris I. [1 ]
机构
[1] Univ Calif Santa Barbara, Kavli Inst Theoret Phys, Santa Barbara, CA 93106 USA
[2] Inst Pasteur, CNRS, URA 2171, F-75724 Paris 15, France
[3] Univ Aix Marseille 1, F-13384 Marseille, France
关键词
D O I
10.1038/nature05464
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Chemotactic bacteria rely on local concentration gradients to guide them towards the source of a nutrient(1). Such local cues pointing towards the location of the source are not always available at macroscopic scales because mixing in a flowing medium breaks up regions of high concentration into random and disconnected patches. Thus, animals sensing odours in air or water detect them only intermittently as patches sweep by on the wind or currents(2-6). A macroscopic searcher must devise a strategy of movement based on sporadic cues and partial information. Here we propose a search algorithm, which we call 'infotaxis', designed to work under such conditions. Any search process can be thought of as acquisition of information on source location; for infotaxis, information plays a role similar to concentration in chemotaxis. The infotaxis strategy locally maximizes the expected rate of information gain. We demonstrate its efficiency using a computational model of odour plume propagation and experimental data on mixing flows(7). Infotactic trajectories feature 'zigzagging' and 'casting' paths similar to those observed in the flight of moths(8). The proposed search algorithm is relevant to the design of olfactory robots(9-11), but the general idea of infotaxis can be applied more broadly in the context of searching with sparse information.
引用
收藏
页码:406 / 409
页数:4
相关论文
共 31 条