Approximation algorithms for geometric tour and network design problems (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
Ant algorithms for discrete optimization
Artificial Life
Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
INFORMS Journal on Computing
Touring a sequence of polygons
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Art gallery theorems for guarded guards
Computational Geometry: Theory and Applications
Ant Colony Optimization
Approximation algorithms for the watchman route and zookeeper's problems
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Computing multiple watchman routes
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
| Hi-index | 0.00 |
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.