IDEAS home Printed from https://ideas.repec.org/a/igg/jsir00/v2y2011i3p1-15.html
   My bibliography  Save this article

How Ants Can Efficiently Solve Generalized Watchman Route Problem

Author

Listed:
  • Pawel Paduch

    (Kielce University of Technology, Poland)

  • Krzysztof Sapiecha

    (Kielce University of Technology, Poland)

Abstract

This paper presents a new algorithm for solving the generalized watchman problem. It is the problem of mobile robot operators that must find the shortest route for the robot to see the whole area with many obstructions. The algorithm adapts the well-known ant algorithm to the new problem. An experiment where the algorithm is applied to an area containing more than 10 obstructions is described. It proves that efficiency and accuracy of the algorithm are high.

Suggested Citation

  • Pawel Paduch & Krzysztof Sapiecha, 2011. "How Ants Can Efficiently Solve Generalized Watchman Route Problem," International Journal of Swarm Intelligence Research (IJSIR), IGI Global, vol. 2(3), pages 1-15, July.
    • Handle: RePEc:igg:jsir00:v:2:y:2011:i:3:p:1-15
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jsir.2011070101
    Download Restriction: no
    ---><---

    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:igg:jsir00:v:2:y:2011:i:3:p:1-15. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.