Welcome to the InfoSci Platform
How Ants Can Efficiently Solve the Generalized Watchman Route Problem

How Ants Can Efficiently Solve the Generalized Watchman Route Problem

Pawel Paduch, Krzysztof Sapiecha
Copyright: © 2013 |Pages: 16
ISBN13: 9781466624795|ISBN10: 1466624795|EISBN13: 9781466624801
DOI: 10.4018/978-1-4666-2479-5.ch010
Cite Chapter Cite Chapter

MLA

Paduch, Pawel, and Krzysztof Sapiecha. "How Ants Can Efficiently Solve the Generalized Watchman Route Problem." Recent Algorithms and Applications in Swarm Intelligence Research, edited by Yuhui Shi, IGI Global, 2013, pp. 193-208. https://doi.org/10.4018/978-1-4666-2479-5.ch010

APA

Paduch, P. & Sapiecha, K. (2013). How Ants Can Efficiently Solve the Generalized Watchman Route Problem. In Y. Shi (Ed.), Recent Algorithms and Applications in Swarm Intelligence Research (pp. 193-208). IGI Global. https://doi.org/10.4018/978-1-4666-2479-5.ch010

Chicago

Paduch, Pawel, and Krzysztof Sapiecha. "How Ants Can Efficiently Solve the Generalized Watchman Route Problem." In Recent Algorithms and Applications in Swarm Intelligence Research, edited by Yuhui Shi, 193-208. Hershey, PA: IGI Global, 2013. https://doi.org/10.4018/978-1-4666-2479-5.ch010

Export Reference

Mendeley
Favorite

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.