Priority-based routing of unmanned combat aerial vehicles

This paper considers routing of unmanned combat aerial vehicles to destroy a set of targets characterized by priorities, munitions levels, and time windows. Some additional constraints to be considered are the unmanned combat aerial vehicles´ dynamics and collision avoidance. This paper illustrates an integrated formulation of such a routing problem. The complexity of the problem is addressed through a receding horizon strategy and a decomposition method. Using some test problems, we have established the applicability of these approaches to solve the routing problem.