UAV-deployment for city-wide area coverage and computation of optimal response trajectories

The selection of the UAV-dispatching stations within the city's border is amongst the topics addressed in this article. Under the assumption of a concave planar city-area, a constrained minimization problem is formulated, which provides a set of near-optimum UAV-locations. Following this selection, and given the capacity of the on-board energy and the tetrahedralized-based decomposition of the concave hull of the allowable 3D-space that the UAV's can fly, an A*- algorithm optimized by an iterative procedure relying on ray casting is provided to compute the boundary of the UAV's reachable space. At the end, this article provides the necessary on-board energy so that every point within the metropolitan area can be reached by a certain number of UAVs.