How Ants Can Efficiently Solve Generalized Watchman Route Problem
2011 ◽
Vol 2
(3)
◽
pp. 1-15
◽
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.
1966 ◽
Vol 14
(2)
◽
pp. 191-197
◽
1969 ◽
Vol 17
(6)
◽
pp. 1232-1238
◽
1965 ◽
Vol 10
(2)
◽
pp. 269-274
◽