Collective Infotaxis with Reactive Amoebae: A Note on a Simple Bio-inspired Mechanism

详细信息    查看全文

• 关键词：Bio ; inspired models ; Multi ; agent systems ; Infotaxis ; Asynchronous cellular automata ; Probabilistic cellular automata
• 刊名：Lecture Notes in Computer Science
• 出版年：2016
• 出版时间：2016
• 年：2016
• 卷：9863
• 期：1
• 页码：157-165
• 全文大小：238 KB
• 参考文献：1.Berry, H., Fatès, N.: Robustness of the critical behaviour in the stochastic Greenberg-Hastings cellular automaton model. Int. J. Unconventional Comput. 7(1–2), 65–85 (2011)
  2.Fatès, N.: Solving the decentralised gathering problem with a reaction-diffusion-chemotaxis scheme - social amoebae as a source of inspiration. Swarm Intell. 4(2), 91–115 (2010)CrossRef
  3.Fatès, N., Vlassopoulos, N.: A robust scheme for aggregating quasi-blind robots in an active environment. Int. J. Swarm Intell. Res. 3(3), 66–80 (2012)CrossRef
  4.Masson, J.-B.: Olfactory searches with limited space perception. Proc. Nat. Acad. Sci. 110(28), 11261–11266 (2013)CrossRef
  5.Silva, F., Correia, L., Christensen, A.L.: Modelling synchronisation in multirobot systems with cellular automata: analysis of update methods and topology perturbations. In: Sirakoulis, G.C., Adamatzky, A. (eds.) Robots and Lattice Automata. Emergence, Complexity and Computation, vol. 13, pp. 267–293. Springer International Publishing, Cham (2015)
  6.Vergassola, M., Villermaux, E., Shraiman, B.I.: ‘Infotaxis’ as a strategy for searching without gradients. Nature 445(7126), 406–409 (2007)CrossRef
  7.Zhang, S., Martinez, D., Masson, J.-B.: Multi-robot searching with sparse binary cues and limited space perception. Front. Robot. AI 2(12) (2015). doi:10.​3389/​frobt.​2015.​00012
  
• 作者单位：Nazim Fatès (16)
  
  16. Inria Nancy – Grand Est, LORIA UMR 7503, Vandœuvre-lès-Nancy, France
  
• 丛书名：Cellular Automata
• ISBN：978-3-319-44365-2
• 刊物类别：Computer Science
• 刊物主题：Artificial Intelligence and Robotics
  Computer Communication Networks
  Software Engineering
  Data Encryption
  Database Management
  Computation by Abstract Devices
  Algorithm Analysis and Problem Complexity
  
• 出版者：Springer Berlin / Heidelberg
• ISSN：1611-3349
• 卷排序：9863

文摘

We study how to coordinate a team of agents to locate a hidden source on a two-dimensional discrete grid. The challenge is to find the position of the source with only sporadic detections. This problem arises in various situations, for instance when insects emit pheromones to attract their partners. A search mechanism named infotaxis was proposed to explain how agents may progressively approach the source by using only intermittent detections.