How Ants Can Efficiently Solve Generalized Watchman Route Problem-Reference-Cited by-同舟云学术

How Ants Can Efficiently Solve Generalized Watchman Route Problem

Published:2011-07 Issue:3 Volume:2 Page:1-15
ISSN:1947-9263
Container-title:International Journal of Swarm Intelligence Research
language:en
Short-container-title:

Author:

Paduch Pawel¹,Sapiecha Krzysztof¹

Affiliation:

1. 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.

Publisher

IGI Global

Subject

Artificial Intelligence,Computational Theory and Mathematics,Computer Science Applications

Reference29 articles.

1. Bjorling-Sachs, I., & Souvaine, D. (1991). A tight bound for guarding general polygons with holes (Tech. Rep. No. LCSR-TR-165). New Brunswick, NJ: Rutgers University.

2. Blum, C., & Dorigo, M. (2001). HC-ACO: The hyper-cube framework for ant colony optimization. In Proceedings of the Metaheuristics International Conference (pp. 399-403).

3. A new rank based version of the ant system - a computational study.;B.Bullnheimer;Central European Journal for Operations Research and Economics,1997

4. Optimum zoo-keeper routes.;W. P.Chin;Congressus Numerantium,1987

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Running-time Analysis of Ant System Algorithms with Upper-bound Comparison;International Journal of Swarm Intelligence Research;2017-10