一种双阶段多智能体路径规划算法
DOI:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

TN966

基金项目:


A Two-stage Multi-agent Path Planning Algorithm
Author:
Affiliation:

Fund Project:

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

    多智能体路径规划旨在解决多个智能体在同一工作空间内生成无碰撞路径的问题,是智能体无人化工作的关键支撑技术。基于回溯思想和自适应局部避障策略,提出了一种双阶段多智能体路径规划算法。在全局路径规划阶段,基于回溯思想改进的RRT*算法(Back Tracking RRT*,BT-RRT*),减少无效父节点,并确保各智能体生成优化的无碰撞路径。在协作避障阶段,智能体依据自身的任务优先级制定局部避障策略,避开动态障碍物和其他智能体。实验结果表明,该算法可成功寻找较优路径,还可降低避障时间。

    Abstract:

    Multi-agent path planning aims at solving the problem of multi-agent generating collision free paths in the same workspace. It is a key supporting technology for agents to work without humanization. Based on the idea of backtracking and adaptive local obstacle avoidance strategy, a two-stage multi-agent path planning algorithm is proposed. In the global path planning stage, the improved RRT* algorithm (Back Tracking RRT* (BT-RRT*) based on the idea of backtracking reduces invalid parent nodes and ensures that each agent generates an optimized collision free path. In the cooperative obstacle avoidance stage, the agent formulates local obstacle avoidance strategy according to its own task priority, avoiding dynamic obstacles and other agents. Experimental results show that the algorithm can find the optimal path successfully and reduce the obstacle avoidance time.

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

李庆华,王佳慧,李海明,等. 一种双阶段多智能体路径规划算法[J]. 科学技术与工程, 2021, 21(22): 9425-9431.
Li Qinghua, Wang Jiahui, Li Haiming, et al. A Two-stage Multi-agent Path Planning Algorithm[J]. Science Technology and Engineering,2021,21(22):9425-9431.

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2021-01-09
  • 最后修改日期:2021-07-27
  • 录用日期:2021-04-08
  • 在线发布日期: 2021-08-29
  • 出版日期:
×
律回春渐,新元肇启|《科学技术与工程》编辑部恭祝新岁!
亟待确认版面费归属稿件,敬请作者关注