计算机科学
瓶颈
模块化设计
差异进化
人工智能
运动规划
趋同(经济学)
路径(计算)
进化算法
机器学习
航程(航空)
避障
障碍物
钥匙(锁)
粒子群优化
计算复杂性理论
最优化问题
适应(眼睛)
集成学习
遗传算法
混乱的
数学优化
分布式计算
高效能源利用
群体行为
过程(计算)
质量(理念)
多目标优化
进化计算
作者
Shrishti Chamoli,Anupam Yadav
摘要
ABSTRACT The increasing application of unmanned aerial vehicles (UAVs) in diverse domains demands highly robust and autonomous path‐planning algorithms capable of navigating complex and dynamic environments. To address the multifaceted challenges posed by obstacle avoidance, energy constraints, and environmental uncertainty, this work proposes an ensemble of learning strategies for the optimal path planning of UAVs. We introduce a modular particle swarm optimization and differential evolution (PSO‐DE) ensemble framework and systematically investigate the impact of multiple learning and adaptation strategies, such as chaotic parameter adaptation, opposition‐based learning (OBL), and a range of DE mutation schemes, to enhance the optimization process. We perform extensive experimentation across 16 carefully designed scenarios with varying complexity against ten competitive algorithms. We demonstrate that the integration of the PSO‐DE hybrid with the opposition‐based learning (OBLPSODE) achieves faster convergence while maintaining superior solution quality across all scenarios. The proposed OBLPSODE algorithm substantially outperforms other hybrid variants in both computational efficiency and path optimality, particularly excelling in cluttered environments where traditional algorithms often converge prematurely. Beyond algorithmic contributions, this work provides critical complexity analysis identifying obstacle‐checking operations as the primary computational bottleneck in UAV path planning. The findings offer practical guidance for deploying UAVs in real‐world applications and establish transferable design principles for developing adaptive meta‐heuristics in complex optimization domains.
科研通智能强力驱动
Strongly Powered by AbleSci AI