3D path planning is critical for autonomous systems operating in complex environments. However, existing meta-heuristic algorithms face limitations in handling high-dimensional obstacles, computational inefficiency, and premature convergence. To address these challenges, this study proposes a hybrid framework integrating a periodic pattern search reward mechanism into active subspace particle swarm optimization algorithm, combined with a novel mutation mechanism to enhance population diversity, thereby balancing exploration and exploitation. Furthermore, by leveraging the geometric invariance of B-spline curves, a multi-phase optimization strategy is developed to iteratively refine sparse control points from coarse to fine resolutions, ensuring globally optimal and smooth 3D trajectories while mitigating computational complexity. Comparative evaluations against benchmark algorithms demonstrate that the proposed framework performs better than the existing ones in path optima, convergence speed, and robustness across diverse scenarios, including cluttered urban environments and undulating marine terrains.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A Multi-phase Hybrid Optimization Framework Integrating Active Subspace PSO and Periodic Pattern Search for 3D Path Planning

  • Juanjuan Gao,
  • Xing Liu,
  • Chang Li,
  • Benyuan Yang

摘要

3D path planning is critical for autonomous systems operating in complex environments. However, existing meta-heuristic algorithms face limitations in handling high-dimensional obstacles, computational inefficiency, and premature convergence. To address these challenges, this study proposes a hybrid framework integrating a periodic pattern search reward mechanism into active subspace particle swarm optimization algorithm, combined with a novel mutation mechanism to enhance population diversity, thereby balancing exploration and exploitation. Furthermore, by leveraging the geometric invariance of B-spline curves, a multi-phase optimization strategy is developed to iteratively refine sparse control points from coarse to fine resolutions, ensuring globally optimal and smooth 3D trajectories while mitigating computational complexity. Comparative evaluations against benchmark algorithms demonstrate that the proposed framework performs better than the existing ones in path optima, convergence speed, and robustness across diverse scenarios, including cluttered urban environments and undulating marine terrains.