.png){kind=icon}
.png){kind=icon}
Return
Multi-UAV Coverage through Two-Step Auction in Dynamic Environments
.png){kind=icon}
OA
AI
DOI：10.3390/drones6060153.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
multi-UAV
two-step auction
area coverage
obstacle avoidance
energy constraint
Journal
D
IF:
4.8
Papers:
3.8K
Citations:
8.3K