IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

How Ants Can Efficiently Solve the Generalized Watchman Route Problem

How Ants Can Efficiently Solve the Generalized Watchman Route Problem
View Sample PDF
Author(s): Paweł Paduch (Kielce University of Technology, Poland)and Krzysztof Sapiecha (Kielce University of Technology, Poland)
Copyright: 2014
Pages: 16
Source title: Robotics: Concepts, Methodologies, Tools, and Applications
Source Author(s)/Editor(s): Information Resources Management Association (USA)
DOI: 10.4018/978-1-4666-4607-0.ch022

Purchase

View How Ants Can Efficiently Solve the Generalized Watchman Route Problem on the publisher's website for pricing and purchasing information.

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

Rashmi Rani Samantaray, Zahira Tabassum, Abdul Azeez. © 2024. 32 pages.
Sanjana Prasad, Deepashree Rajendra Prasad. © 2024. 25 pages.
Deepak Varadam, Sahana P. Shankar, Aryan Bharadwaj, Tanvi Saxena, Sarthak Agrawal, Shraddha Dayananda. © 2024. 24 pages.
Tarun Kumar Vashishth, Vikas Sharma, Kewal Krishan Sharma, Bhupendra Kumar, Sachin Chaudhary, Rajneesh Panwar. © 2024. 29 pages.
Mrutyunjaya S. Hiremath, Rajashekhar C. Biradar. © 2024. 30 pages.
C. L. Chayalakshmi, Mahabaleshwar S. Kakkasageri, Rajani S. Pujar, Nayana Hegde. © 2024. 30 pages.
Amit Kumar Tyagi. © 2024. 29 pages.
Body Bottom