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
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.
|
|
|