IDEAS home Printed from https://ideas.repec.org/a/taf/nmcmxx/v18y2011i1p87-100.html
   My bibliography  Save this article

Interaction of robot swarms using the honeybee-inspired control algorithm BEECLUST

Author

Listed:
  • Michael Bodi
  • Ronald Thenius
  • Martina Szopek
  • Thomas Schmickl
  • Karl Crailsheim

Abstract

In this work we investigated how robust a robot swarm acts against disturbances caused by another robot swarm, both using the BEECLUST algorithm, which is inspired by honeybee behaviour. For our investigation we simulated an environment with an ambient illuminance, a light spot and a shadow spot. In such an environment we tested two different castes of Jasmine III robots whereas each caste had to perform a different task. One swarm aggregates at places of high illuminance (light spot) and the other one at places of low illuminance (shadow spot). We show that small swarm populations can benefit from the presence of another robot swarm. Medium populated swarms are affected neither positively nor negatively. Large swarm populations act robust against disturbances caused by other robot swarms as long as no jamming effects occur. In this article we show that the BEECLUST algorithm provides all features for making collective decisions. Furthermore we show that the robustness of the BEECLUST algorithm allows us to control a heterogeneous robot swarm in environments which demand differing controller strategies and swarm intelligent behaviour.

Suggested Citation

  • Michael Bodi & Ronald Thenius & Martina Szopek & Thomas Schmickl & Karl Crailsheim, 2011. "Interaction of robot swarms using the honeybee-inspired control algorithm BEECLUST," Mathematical and Computer Modelling of Dynamical Systems, Taylor & Francis Journals, vol. 18(1), pages 87-100, May.
    • Handle: RePEc:taf:nmcmxx:v:18:y:2011:i:1:p:87-100
    DOI: 10.1080/13873954.2011.601420
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/13873954.2011.601420
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/13873954.2011.601420?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:nmcmxx:v:18:y:2011:i:1:p:87-100. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/NMCM20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.