How Ants Can Efficiently Solve Generalized Watchman Route Problem

Pawel Paduch and Krzysztof Sapiecha
Additional contact information
Pawel Paduch: Kielce University of Technology, Poland
Krzysztof Sapiecha: Kielce University of Technology, Poland

International Journal of Swarm Intelligence Research (IJSIR), 2011, vol. 2, issue 3, 1-15

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.

Date: 2011
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 4018/jsir.2011070101 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jsir00:v:2:y:2011:i:3:p:1-15

Access Statistics for this article

International Journal of Swarm Intelligence Research (IJSIR) is currently edited by Yuhui Shi

More articles in International Journal of Swarm Intelligence Research (IJSIR) from IGI Global
Bibliographic data for series maintained by Journal Editor ().