.png){kind=icon}
返回
Adaptive Coverage Path Planning for Multiple Fixed-wing UAVs With Learning-based Initialization
.png){kind=icon}
PRE
AI
DOI：10.1007/s12555-025-0263-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This study presents a real-time feasible and dynamically adaptive coverage path planning (CPP) method for multiple fixed-wing unmanned aerial vehicles (UAVs), specifically designed to address the challenges of unstructured and mission conditions requiring rapid re-planning. To support efficient re-planning in such conditions, the proposed algorithm follows a two-stage framework consisting of region partitioning and path planning. A learning-based network is employed to generate high-quality initial solutions for region partitioning, improving computational efficiency within the baseline algorithm. In addition, a novel method is introduced to generate adaptive paths that respect the dynamic constraints of fixed-wing UAVs, thereby enhancing the practical applicability of CPP in real-world scenarios. The proposed method is validated through simulations under time-constrained conditions, demonstrating both computational efficiency and reduced risk. Experimental results further confirm its feasibility for field deployment.
Keyword:
Fixed-wing unmanned aerial vehicle
multi-agent coverage path planning
robot learning
期刊
IF:
2.9
论文数:
223
被引数:
6.5K
机构
引用论文
DARP: Divide Areas Algorithm for Optimal Multi-Robot Coverage Path PlanningDARP: 多机器人最优覆盖路径规划的区域划分算法
OAAI
OAAI分享收藏Path Planning Techniques for Real-Time Multi-Robot Systems: A Systematic Review实时多机器人系统路径规划技术：系统综述.png)
Electronics
OAAI
ElectronicsIF0
OAAI分享收藏Scalable Coverage Path Planning for Cleaning Robots Using Rectangular Map Decomposition on Large Environments在大环境下使用矩形地图分解的清洁机器人的可扩展覆盖路径规划IEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAI分享收藏
查看更多内容