The single train shortest route problem in a railyard

Author(s):  
Mina Aliakbari ◽  
Joseph Geunes ◽  
Kelly M. Sullivan
Keyword(s):  
1960 ◽  
Vol 8 (2) ◽  
pp. 224-230 ◽  
Author(s):  
Maurice Pollack ◽  
Walter Wiebenson
Keyword(s):  

2011 ◽  
Vol 2 (3) ◽  
pp. 1-15 ◽  
Author(s):  
Pawel Paduch ◽  
Krzysztof Sapiecha

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.


Author(s):  
K. M. Roopa ◽  
Vishwanath M. C. ◽  
Srinivasu V. K. ◽  
V. G. Umesh

Author(s):  
Pawel Paduch ◽  
Krzysztof Sapiecha

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.


Sign in / Sign up

Export Citation Format

Share Document