Artificial pheromone for path selection by a foraging swarm of robots

被引:49
作者
Campo, Alexandre [1 ]
Gutierrez, Alvaro [2 ]
Nouyan, Shervin [1 ]
Pinciroli, Carlo [1 ]
Longchamp, Valentin [3 ]
Garnier, Simon [4 ]
Dorigo, Marco [1 ]
机构
[1] Univ Libre Bruxelles, CoDE, IRIDIA, B-1050 Brussels, Belgium
[2] Univ Politecn Madrid, ETSI Telecomunicac, E-28040 Madrid, Spain
[3] Ecole Polytech Fed Lausanne, STI IMT LSRO, CH-1015 Lausanne, Switzerland
[4] Princeton Univ, Dept Ecol & Evolutionary Biol, Princeton, NJ 08544 USA
关键词
Swarm robotics; Path selection; Artificial pheromone; COMMUNICATION;
D O I
10.1007/s00422-010-0402-x
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Foraging robots involved in a search and retrieval task may create paths to navigate faster in their environment. In this context, a swarm of robots that has found several resources and created different paths may benefit strongly from path selection. Path selection enhances the foraging behavior by allowing the swarm to focus on the most profitable resource with the possibility for unused robots to stop participating in the path maintenance and to switch to another task. In order to achieve path selection, we implement virtual ants that lay artificial pheromone inside a network of robots. Virtual ants are local messages transmitted by robots; they travel along chains of robots and deposit artificial pheromone on the robots that are literally forming the chain and indicating the path. The concentration of artificial pheromone on the robots allows them to decide whether they are part of a selected path. We parameterize the mechanism with a mathematical model and provide an experimental validation using a swarm of 20 real robots. We show that our mechanism favors the selection of the closest resource is able to select a new path if a selected resource becomes unavailable and selects a newly detected and better resource when possible. As robots use very simple messages and behaviors, the system would be particularly well suited for swarms of microrobots with minimal abilities.
引用
收藏
页码:339 / 352
页数:14
相关论文
共 33 条
  • [1] BALCH TR, 1999, P IJCAI 99 WORKSH AG, P553
  • [2] Bellman R., 1958, ROUTING PROBLEM Q AP, V16, P87
  • [3] BURGARD W, 1998, P IEEE INT C INT ROB, P1
  • [4] Campo A, 2006, LECT NOTES COMPUT SC, V4150, P191
  • [5] Cooperative mobile robotics: Antecedents and directions
    Cao, YU
    Fukunaga, AS
    Kahng, AB
    [J]. AUTONOMOUS ROBOTS, 1997, 4 (01) : 7 - 27
  • [6] Caprari G., 2000, IEEE INT C ROB AUT I
  • [7] DUDEK G, 1993, P VIS INT, P97
  • [8] GARNIER S, 2007, P IEEE SWARM INT S, P1
  • [9] GOLDBERG D, 1997, 14 AAAI 9 IAAI, P637
  • [10] SELF-ORGANIZED SHORTCUTS IN THE ARGENTINE ANT
    GOSS, S
    ARON, S
    DENEUBOURG, JL
    PASTEELS, JM
    [J]. NATURWISSENSCHAFTEN, 1989, 76 (12) : 579 - 581