基于时空冲突和非完整约束下的多AMR调度算法研究
CSTR:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

TP18

基金项目:

国家自然科学基金项目(62003276);中央高校基本科研业务费专项资金项目(JZ2022HGTB0299).


Research on multi-AMR scheduling algorithm based on spatiotemporal conflicts and nonholonomic constraints
Author:
Affiliation:

Fund Project:

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

    针对多自主移动机器人(AMR)调度系统中的决策规划问题, 提出一种分层策略的基于时空冲突和非完整约束下的多AMR调度算法. 首先, 提出加权时空混合A*算法作为算法的底层, 进行单AMR路径规划, 以确保规划的路径满足阿克曼类型AMR的运动学模型; 然后, 引入结合分离轴定理的冲突检测树作为算法的上层, 对底层算法规划出的路径进行精确地时空冲突检测, 检测出的时空冲突被用作底层算法的时空约束; 最后, 再次调用底层算法, 考虑时空约束进行路径规划, 以实现高效的 AMR 冲突消解. 仿真结果表明, 所提出算法能够为多AMR调度系统高效地规划出满足非完整约束的无冲突路径.

    Abstract:

    In order to address the decision planning problem in multi-AMR scheduling systems, this paper proposes a hierarchical strategy-based multi-AMR scheduling algorithm under spatiotemporal conflicts and nonholonomic constraints. Firstly, this paper proposes the weighted spatiotemporal hybrid A* algorithm as the lower-level of this algorithm to conduct single AMR path planning, ensuring that the planned paths conform to the kinematic model of the Ackermann-type AMR. Then, this paper proposes a conflict detection tree combined with the separating axis theorem as the upper-level algorithm to conduct precise spatiotemporal conflict detection on the paths planned by the lower-level of this algorithm. The detected spatiotemporal conflicts are utilized as the spatiotemporal constraints for the lower-level of this algorithm. Finally, the lower-level of this algorithm is utilized once again, taking into account the spatiotemporal constraints for path planning, to achieve efficient AMR conflict resolution. Simulation results demonstrate that the proposed approach efficiently generates conflict-free paths satisfying nonholonomic constraints for multi-AMR scheduling systems.

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

申子祥,孙训红,从永正,等.基于时空冲突和非完整约束下的多AMR调度算法研究[J].控制与决策,2025,40(3):981-986

复制
相关视频

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