Multi-UAV Coverage through Two-Step Auction in Dynamic Environments

The cooperation of multiple unmanned aerial vehicles (Multi-UAV) can effectively solve the area coverage problem. However, developing an online multi-UAV coverage approach remains a challenge due to energy constraints and environmental dynamics. In this paper, we design a comprehensive framework for area coverage with multiple energy-limited UAVs in dynamic environments, which we call MCTA (Multi-UAV Coverage through Two-step Auction). Specifically, the online two-step auction mechanism is proposed to select the optimal action. Then, an obstacle avoidance mechanism is designed by defining several heuristic rules. After that, considering energy constraints, we develop the reverse auction mechanism to balance workload between multiple UAVs. Comprehensive experiments demonstrate that MCTA can achieve a high coverage rate while ensuring a low repeated coverage rate and average step deviation in most circumstances.

Automated summary

This paper presents an online multi-UAV coverage approach called MCTA, which achieves high coverage rate and low repeated coverage rate through a two-step auction mechanism and an obstacle avoidance mechanism.