AGV path optimization algorithm
A path optimization and trolley technology, which is applied in computing, data processing applications, navigation computing tools, etc., can solve problems such as easy scheduling, difficult rectification, and node conflicts, so as to reduce workload differences and achieve reasonable distribution.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0037] The present invention will be further described below according to the accompanying drawings.
[0038] Such as figure 1 As shown, the specific process of optimizing the path of the AGV trolley is as follows:
[0039] (1) According to the actual working warehouse situation, start to import and generate maps;
[0040] (2) Input the AGV car task;
[0041] (3) Use the DIJKSTRA algorithm to calculate all paths of the AGV car;
[0042] (4) judge whether there is the shortest path, then make k=0, the 0th layer path set is the shortest path, i=0; otherwise, the feasible path is empty, and reports to the police;
[0043] (5) For the i-th point on the k-layer path of the current search, make path1=the path from the starting node of the current search path to i, search all adjacent nodes j of this node in turn, make path2=node j to the end point The shortest path, merge path1 and path2, and store it in the path set of the k+1th layer;
[0044] (6) Judging whether the total nu...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


