一种基于冲突关系的AGV路径重规划方法及系统

CN121898438BActive Publication Date: 2026-07-17QINGDAO PORT INT CO LTD +1

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
QINGDAO PORT INT CO LTD
Filing Date
2026-03-26
Publication Date
2026-07-17

AI Technical Summary

Technical Problem

Existing technologies in multi-AGV path planning struggle to effectively mitigate path entanglement and interaction conflicts while maintaining real-time performance and computational efficiency. Furthermore, the lack of targeted iterative strategies results in limited improvement in solution quality.

Method used

By detecting the conflict relationships between AGVs, a modification set is constructed, and the AGV paths in the modification set are replanned using the optimal path planning algorithm. Other AGVs are fixed as dynamic obstacles, thus optimizing the path planning process.

Benefits of technology

It significantly improves the efficiency and solution quality of iterative improvement, with the average solution quality improvement rate increasing from 6.64% to 8.37%, making it suitable for large-scale industrial and warehousing logistics scenarios.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN121898438B_ABST
    Figure CN121898438B_ABST
Patent Text Reader

Abstract

本申请涉及路径规划领域,具体提供一种基于冲突关系的AGV路径重规划方法及系统,包括:步骤1,使用快速MAPF求解器为每个AGV生成初解路径;步骤2,根据AGV的起点、终点位置检测并保存任意两个AGV之间的冲突关系;步骤3,根据各个AGV之间的冲突关系构造修改集;步骤4,固定修改集之外的所有AGV的路径,将它们视为动态障碍物,使用最优路径规划算法重新规划修改集中AGV的路径;步骤5,用步骤4得到的新路径更新当前路径,重复执行步骤2至步骤5直到满足迭代终止条件。本发明通过基于冲突关系精准构造修改集并迭代重规划,在保持实时性的同时提升平均解质量。
Need to check novelty before this filing date? Find Prior Art