The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
How Ants Can Efficiently Solve the Generalized Watchman Route Problem
|
|
Author(s): Pawel Paduch (Kielce University of Technology, Poland)and Krzysztof Sapiecha (Kielce University of Technology, Poland)
Copyright: 2013
Pages: 16
Source title:
Recent Algorithms and Applications in Swarm Intelligence Research
Source Author(s)/Editor(s): Yuhui Shi (Southern University of Science and Technology (SUSTech), China)
DOI: 10.4018/978-1-4666-2479-5.ch010
Purchase
|
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.
Related Content
|
Rafael MartÃ, Juan-José Pantrigo, Abraham Duarte, Vicente Campos, Fred Glover.
© 2013.
21 pages.
|
|
Peng-Yeng Yin, Fred Glover, Manuel Laguna, Jia-Xian Zhu.
© 2013.
20 pages.
|
|
Volodymyr P. Shylo, Oleg V. Shylo.
© 2013.
10 pages.
|
|
Tabitha James, Cesar Rego.
© 2013.
19 pages.
|
|
Gary G. Yen, Wen-Fung Leong.
© 2013.
25 pages.
|
|
Shi Cheng, Yuhui Shi, Quande Qin.
© 2013.
29 pages.
|
|
Xin-She Yang.
© 2013.
12 pages.
|
|
|