The selective travelling salesman problem
Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Machine Learning
Solving the Orienteering Problem Through Branch-And-Cut
INFORMS Journal on Computing
Supporting wilderness search and rescue using a camera-equipped mini UAV: Research Articles
Journal of Field Robotics - Special Issue on Search and Rescue Robots
Computational & Mathematical Organization Theory
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part IV
Hi-index | 0.00 |
In the priority search phase of Wilderness Search and Rescue, a probability distribution map is created. Areas with higher probabilities are searched first in order to find the missing person in the shortest expected time. When using a UAV to support search, the onboard video camera should cover as much of the important areas as possible within a set time. We explore several algorithms (with and without set destination) and describe some novel techniques in solving this problem and compare their performances against typical WiSAR scenarios. This problem is NP-hard, but our algorithms yield high quality solutions that approximate the optimal solution, making efficient use of the limited UAV flying time.