分解
计算机科学
工作量
路径(计算)
运动规划
数学优化
能量(信号处理)
分解法(排队论)
算法
模拟
人工智能
数学
机器人
统计
操作系统
程序设计语言
生物
生态学
作者
Hung Pham Quang,Hung Pham Duy
标识
DOI:10.1109/iccais59597.2023.10382340
摘要
This paper presents a multi-UAV coverage strategy employing a balanced decomposition approach for patrol and surveillance tasks. The balanced decomposition method, based on coverage paths utilizing the Rotating Caliper Path Planning (RCPP) algorithm, facilitates the partitioning of a Region of Interest (ROI) into convex sub-regions with uniform size. Subsequently, the Hungarian algorithm is applied to assign these sub-regions to the UAVs, taking into account estimated travel distances and energy reserves, to ensure that the UAVs accomplish their designated coverage mission at an optimal cost. Simulation experiments conducted in various ROIs with varying numbers of UAVs validate the high performance of the proposed approach. This is evidenced by the precise balanced decomposition of ROIs, resulting in workload equilibrium among UAVs, nearly absolute coverage rates, and enhanced energy efficiency.
科研通智能强力驱动
Strongly Powered by AbleSci AI