Probabilistic Analysis of UAV Routing with Dynamically Arriving Targets

Unmanned Aerial Vehicles (UAVs) are indispensable part of modern operations, from information collection and transportation in civilian and military domains alike. However, the problem of finding the best route for the UAVs for multi-target tracking, surveillance, and information collection is a very important problem which can greatly affect the performance of UAVs. In this paper, we address this problem, and propose two different greedy policies, analyze them mathematically, and find the expectation of the distance travelled in each case. Such analysis can help guide the decision maker with choices in dispatching and scheduling these important assets.