Routing UAVs to minimize the chance of detection

We consider the problem of routing UAVs so as to minimize the chance of detection. This objective is achieved by developing spatially and temporally different paths for the aircraft. To apply the methods developed in this paper we first need to use terrain information to develop a network over which the rotorcraft are routed. This network development is done using GIS software and some basic rules for link lengths. Tracking information about enemy positions is utilized to determine the probability of detection on a link of the network. These probabilities can vary over time as the enemy positions change. The routing methodology itself uses concepts from well-studied problems in the OR literature. An example is provided to illustrate the methods and to gain insight into the solutions.