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

Deterministic Ants In Labyrinth — Information Gained By Map Sharing

Author

Listed:
  • JANUSZ MALINOWSKI

    (Faculty of Physics and Applied Computer Science, AGH University of Science and Technology, al. Mickiewicza 30, 30-059 Cracow, Poland)

  • JAN W. KANTELHARDT

    (Martin-Luther-Universität Halle-Wittenberg, Institut für Physik, von-Seckendorff-Platz 1, D-06099 Halle/Saale, Germany)

  • KRZYSZTOF KUŁAKOWSKI

    (Faculty of Physics and Applied Computer Science, AGH University of Science and Technology, al. Mickiewicza 30, 30-059 Cracow, Poland)

Abstract

A few ant robots are placed in a labyrinth, formed by a square lattice with a small number of corridors removed. Ants move according to a deterministic algorithm designed to explore all corridors. Each ant remembers the shape of corridors which it has visited. Once two ants meet, they share the information acquired. We evaluate how the time of getting a complete information by an ant depends on the number of ants, and how the length known by an ant depends on time. Numerical results are presented in the form of scaling relations.

Suggested Citation

  • Janusz Malinowski & Jan W. Kantelhardt & Krzysztof Kułakowski, 2013. "Deterministic Ants In Labyrinth — Information Gained By Map Sharing," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 24(06), pages 1-9.
    • Handle: RePEc:wsi:ijmpcx:v:24:y:2013:i:06:n:s0129183113500356
    DOI: 10.1142/S0129183113500356
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183113500356
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0129183113500356?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:ijmpcx:v:24:y:2013:i:06:n:s0129183113500356. 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/ijmpc/ijmpc.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.