Notice: Undefined index: linkPowrot in C:\wwwroot\wwwroot\publikacje\publikacje.php on line 1275
[35232] Artykuł: How Ants Can Efficiently Solve Generalized Watchman Route ProblemCzasopismo: International Journal of Swarm Intelligence Research Tom: 2, Zeszyt: 3, Strony: 1-15ISSN: 1947-9263 Opublikowano: 2011 Autorzy / Redaktorzy / Twórcy
Grupa MNiSW: Publikacja w recenzowanym czasopiśmie wymienionym w wykazie ministra MNiSzW (część B) Punkty MNiSW: 5 Pełny tekst DOI |
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.