Hostname: page-component-78c5997874-mlc7c Total loading time: 0 Render date: 2024-11-10T12:06:42.136Z Has data issue: false hasContentIssue false
  • English
  • Français

Swarm robotic odor localization: Off-line optimization and validation with real robots

Published online by Cambridge University Press:  23 September 2003

Adam T. Hayes ,
Alcherio Martinoli  and
Rodney M. Goodman
Adam T. Hayes
Affiliation:
Collective Robotics Group, 136-93 California Institute of Technology, Pasadena CA 91125 (USA)athayes@caltech.edu
Alcherio Martinoli
Affiliation:
Collective Robotics Group, 136-93 California Institute of Technology, Pasadena CA 91125 (USA)alcherio@caltech.edu
Rodney M. Goodman
Affiliation:
Collective Robotics Group, 136-93 California Institute of Technology, Pasadena CA 91125 (USA)rogo@caltech.edu
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper presents an investigation of odor localization by groups of autonomous mobile robots using principles of Swarm Intelligence. First, we describe a distributed algorithm by which groups of agents can solve the full odor localization task more efficiently than a single agent. Next, we demonstrate that a group of real robots under fully distributed control can successfully traverse a real odor plume, and that an embodied simulator can faithfully reproduce these real robots experiments. Finally, we use the embodied simulator combined with a reinforcement learning algorithm to optimize performance across group size, showing that it can be useful not only for improving real world odor localization, but also for quantitatively characterizing the influence of group size on task performance.

Keywords

Collective autonomous roboticsOdor localizationPlume traversalOff-line optimizationSwarm intelligence
Type
Research Article
Information
Robotica , Volume 21 , Issue 4 , August 2003 , pp. 427 - 441
Copyright
© 2003 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)