A simple CSP-based model for Unmanned Air Vehicle Mission Planning

The problem of Mission Planning for a large number of Unmanned Air Vehicles (UAV) can be formulated as a Temporal Constraint Satisfaction Problem (TCSP). It consists on a set of locations that should visit in different time windows, and the actions that the vehicle can perform based on its features such as the payload, speed or fuel capacity. In this paper, a temporal constraint model is implemented and tested by performing Backtracking search in several missions where its complexity has been incrementally modified. The experimental phase consists on two different phases. On the one hand, several mission simulations containing (n) UAVs using different sensors and characteristics located in different waypoints, and (m) requested tasks varying mission priorities have been carried out. On the other hand, the second experimental phase uses a backtracking algorithm to look through the whole solutions space to measure the scalability of the problem. This scalability has been measured as a relation between the number of tasks to be performed in the mission and the number of UAVs needed to perform it.