一种基于优化A*算法的路径规划方法、设备及介质
By optimizing the A* algorithm to expand the search neighborhood and adopting dynamic weight coefficients, the problems of multiple turning points and long paths in AGV path planning are solved, achieving global optimality and efficient transportation.
CN117387626BActive Publication Date: 2026-07-17CHINA TRIUMPH INT ENG CO LTD
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- CHINA TRIUMPH INT ENG CO LTD
- Filing Date
- 2023-12-01
- Publication Date
- 2026-07-17
AI Technical Summary
Technical Problem
Existing path planning methods based on the A* algorithm in AGV vehicles suffer from numerous path inflection points, excessively long paths, and lack of global optimality, resulting in low transportation efficiency and high loss of fragile products.
Method used
By optimizing the A* algorithm, expanding the search neighborhood to 20 neighborhoods, using dynamic weight coefficients to optimize the heuristic function, and generating paths by removing redundant nodes, the number of inflection points is reduced and the path is shortened.
Benefits of technology
It achieves global optimization of AGV vehicle paths, improves transportation efficiency, and reduces product loss rate during transportation.
✦ Generated by Eureka AI based on patent content.
Smart Images
Figure CN117387626B_ABST
Abstract
本发明提供一种基于优化A*算法的路径规划方法、设备及介质，其方法包括：将AGV小车作业环境的平面地图划分为若干相同大小的栅格，标记障碍物节点和可通行的自由节点，并建立栅格地图；基于作业要求，在所述栅格化地图中确定起始节点、目标节点；基于优化的A*算法、所述起始节点、所述目标节点以及所述障碍物节点，生成所述AGV小车的运动路径。本发明提高了路径规划的效率，减少了生成路径的拐点，缩短了AGV小车的作业路程，相应的，也降低了AGV小车在作业过程中产品的损耗。
Need to check novelty before this filing date? Find Prior Art