n the priority search phase of Wilderness Search and Rescue (WiSAR), 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 in solving this problem and compare their performances against typical WiSAR scenarios. This problem is NP-hard, and our algorithms yield high quality solutions that approximate the optimal solution, making efficient use of the limited UAV flying time.