IDEAS home Printed from https://ideas.repec.org/a/wsi/acsxxx/v15y2012i08ns0219525911500251.html
   My bibliography  Save this article

Stigmergic Landmark Optimization

Author

Listed:
  • N. LEMMENS

    (Department of Knowledge Engineering, Maastricht University, Minderbroedersberg 4-6, Maastricht, 6211 LK, The Netherlands)

  • K. TUYLS

    (Department of Knowledge Engineering, Maastricht University, Minderbroedersberg 4-6, Maastricht, 6211 LK, The Netherlands)

Abstract

In this paper we present three Swarm Intelligence algorithms which we evaluate on the complex foraging task domain. Each of the algorithms draws inspiration from biologic bee foraging/nest-site selection behavior. The main focus will be on the third algorithm, namely STIGMERGIC LANDMARK FORAGING which is a novel hybrid approach. It combines the high performance of bee-inspired navigation with ant-inspired recruitment. More precisely, navigation is based on Path Integration which results in vectors indicating the distance and direction to a destination. Recruitment only occurs at key locations (i.e., landmarks) inside of the environment. Each landmark contains a collection of vectors with which visiting agents can find their way to a certain goal or to another landmark in an unknown environment. Each vector represents a local segment of a global route. In contrast to ant-inspired recruitment, no attracting or repelling pheromone is used to indicate where to go and how worthwhile a route is in comparison to other routes. Instead, each vector in a landmark has a certain strength indicating how worthwhile it is. In analogy to ant-inspired recruitment, vector strength can be reinforced by visiting agents. Moreover, vector strength decays over time. In the end, this results in optimal routes to destinations. STIGMERGIC LANDMARK FORAGING proves to be very efficient in terms of building and adapting solutions.

Suggested Citation

  • N. Lemmens & K. Tuyls, 2012. "Stigmergic Landmark Optimization," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 15(08), pages 1-41.
  • Handle: RePEc:wsi:acsxxx:v:15:y:2012:i:08:n:s0219525911500251
    DOI: 10.1142/S0219525911500251
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0219525911500251
    Download Restriction: Access to full text is restricted to subscribers

    File URL: https://libkey.io/10.1142/S0219525911500251?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.

    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:wsi:acsxxx:v:15:y:2012:i:08:n:s0219525911500251. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/acs/acs.shtml .

    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.