基于常春藤高斯引导算法的无人车路径规划
CSTR:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

TP242

基金项目:

国家自然科学基金项目(52472314).


Path planning for automated guided vehicles based on ivy Gaussian-guided algorithm
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    针对常春藤算法这类固定维连续域优化方法难以直接处理具有离散约束和连贯性要求的无人车路径规划问题, 提出一种基于改进常春藤优化的高斯引导算法. 首先设计高斯引导机制, 提供一种可行的桥接式应用建模方式, 通过迭代优化引导点参数引导路径生成, 并利用路径离散特性大幅降低计算量; 然后对常春藤算法低值偏好的操作进行修正改进, 使路径搜索在全局范围更均衡, 并提出螺旋衰减策略更新生长速率, 使算法更适应路径离散环境; 最后设计一种局部陷阱逃脱机制, 利用动态时间规整算法检测局部陷阱, 重新分散种群以摆脱局部最优, 以增强全局搜索能力与算法稳定性. 在不同规模的仿真环境中进行实验, 结果表明所提出算法具有较好的求解质量和收敛效率, 同时展现出强大的稳定性与平滑性, 更符合无人车的行驶需求.

    Abstract:

    This paper addresses the challenge of applying fixed-dimension continuous-domain optimization methods such as the ivy algorithm to autonomous vehicle path planning with discrete constraints and continuity requirements. To this end, we propose a Gaussian-guided algorithm based on an improved ivy optimization method. A Gaussian guidance mechanism is introduced as a bridging modeling approach that iteratively optimizes guide point parameters to steer path generation while leveraging the discrete nature of the problem to substantially reduce computational cost. In addition, the original bias of the ivy algorithm toward low-value solutions is corrected to achieve a more balanced global search, a spiral decay strategy is employed to update the growth rate smoothly for better adaptation to discrete grid environments, and a dynamic time warping (DTW)-based trap escape mechanism is designed to detect stagnation and restore population diversity. Simulation experiments across environments of different scales demonstrate that the proposed method achieves high-quality solutions with improved convergence efficiency, stability, and path smoothness, making it well suited for autonomous navigation tasks.

    参考文献
    相似文献
    引证文献
引用本文

沈波,杜鹏桢.基于常春藤高斯引导算法的无人车路径规划[J].控制与决策,2026,41(3):822-834

复制
相关视频

分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2025-03-21
  • 最后修改日期:
  • 录用日期:
  • 在线发布日期: 2026-03-04
  • 出版日期: 2026-03-10
文章二维码