Efficient Online Optimization of Aerial Base Station Movements to Maximize Coverage for Mobile Ground Users in Site-Specific Environments

The key idea is to efficiently solve the NP-hard problem of optimizing the movements of multiple aerial base stations to maximize the coverage rate for mobile ground users in site-specific environments with obstacles, by constructing a global connectivity map and using a fast online algorithm.