An AGV obstacle avoidance and detour method and system for automated docks

By generating restricted areas and planning diagonal detour paths in automated terminals, and utilizing Dijkstra's algorithm and the Try-Claim method, the congestion problem caused by AGV malfunctions was solved, enabling automatic unlocking and efficient operation of AGVs.

CN117707160BActive Publication Date: 2026-11-10SHANGHAI ZHENHUA HEAVY IND
View PDF 1 Cites 0 Cited by

Patent Information

Application Number
CN202311708551.9
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-12-13
Publication Date
2026-11-10
Estimated Expiration
2043-12-13

AI Technical Summary

Technical Problem

When AGVs in automated terminals malfunction, multiple AGVs can easily become stuck in traffic, and existing path planning algorithms cannot automatically resolve congestion or deadlocks.

Method used

The VMS system generates restricted areas and plans diagonal detour routes. Using Dijkstra's algorithm and Try-Claim method, deadlocks and congestion of AGVs are gradually resolved. The map management module and the path planning module work together to realize the detour of AGVs.

Benefits of technology

Effectively resolves AGV deadlocks and congestion, ensuring that subsequent AGVs avoid deadlocks and achieving efficient operation of the automated terminal.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN117707160B_ABST
    Figure CN117707160B_ABST
Patent Text Reader

Abstract

This invention discloses an AGV obstacle avoidance and detour method and system for automated terminal vehicles (AGVs), comprising the following steps: S1, the AGV stops due to malfunction or deadlock and reports the malfunction to the VMS system; S2, the VMS system draws a no-entry zone for the AGV; S3, the VMS system plans a forward diagonal detour path for subsequent AGVs; S4, it checks whether the detour path can bypass the no-entry zone. If so, the AGV detours away; otherwise, it proceeds to step S5; S5, the VMS system plans a backward diagonal detour path for subsequent AGVs; S6, it checks whether the detour path is deadlocked. If so, it returns to step S2; otherwise, the AGV detours away; S7, steps S3 to S6 are repeated until all AGVs have detoured away. This invention enables AGVs to bypass malfunctioning AGVs and automatically resolves subsequent congestion, preventing deadlocks for subsequent AGVs.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to AGV control technology for automated terminals, and more specifically, to a method and system for AGV obstacle avoidance and detour in automated terminals. Background Technology

[0002] In automated terminals, the VMS (Horizontal Transport Management System) plans the route and then issues instructions to the AGVs in segments to control their movement along the path. If an AGV malfunctions, it will brake to a stop. Subsequent AGVs, because the preceding vehicle hasn't left, only receive instructions to its rear. After completing their instructions, they will approach the preceding vehicle, causing multiple AGVs to become stuck in traffic. The VMS system uses A* or Dijkstra's algorithm for route planning. If there are no restricted areas, the route remains the same, and congestion will not be automatically resolved. Summary of the Invention

[0003] In view of the above-mentioned defects in the existing technology, the purpose of this invention is to provide an automated terminal AGV obstacle avoidance and detour method and system, so that the AGV can bypass the faulty AGV and automatically solve the subsequent congestion, so that the subsequent AGV can avoid deadlock, or if deadlock has already occurred, it can automatically unlock the deadlock and detour.

[0004] To achieve the above objectives, the present invention adopts the following technical solution:

[0005] The first aspect of this invention provides a method for obstacle avoidance and detour by an automated terminal AGV, comprising the following steps:

[0006] S1, if the AGV trolley malfunctions or locks up and stops, it will communicate with the VMS system to report the malfunction and stop.

[0007] S2, the VMS system draws a no-entry zone for the AGV vehicle;

[0008] S3, the VMS system plans a forward-sloping detour path for the subsequent AGV vehicle;

[0009] S4. Check if the detour route can bypass the restricted area. If yes, the AGV will detour and leave. If not, proceed to step S5.

[0010] S5, the VMS system plans a backward diagonal detour path for the subsequent AGV vehicle;

[0011] S6, check if the detour path is deadlocked. If so, return to step S2. If not, the AGV will detour and leave.

[0012] S7. Repeat steps S3 to S6 until all the AGVs have driven away.

[0013] Preferably, in step S3, the VMS system uses Dijkstra's algorithm to plan a detour path, specifically including:

[0014] First, find the edges that originate from the starting point and check whether these edges overlap with the restricted area. Edges that overlap are discarded, and edges that do not overlap are saved.

[0015] Then, starting from the saved edges, find the connected edges, filter out the edges that do not overlap with the restricted area, and save the edges that are the shortest to the starting point.

[0016] Repeat the process until the endpoint is found, or until all edges have been saved but the endpoint is not found.

[0017] Preferably, the VMS system uses a try-claim method to request the use of a detour route, and issues a driving command to the AGV. The AGV drives according to the driving command, and stops after completing the occupied detour route, until it finally reaches the destination.

[0018] A second aspect of the present invention provides an automated terminal AGV obstacle avoidance and detour system, comprising:

[0019] The VMS system is used to plan the start and end points of detour routes;

[0020] The restricted area management module establishes data communication with the VMS system to draw restricted areas for malfunctioning AGVs;

[0021] The map management module establishes data communication with the VMS system to establish a coordinate system;

[0022] The AGV management module establishes data communication with the VMS system to obtain signals from the AGV vehicles on site.

[0023] The obstacle avoidance and detour system of the automated terminal AGV realizes the obstacle avoidance and detour method of the automated terminal AGV provided in the first aspect of the present invention.

[0024] Preferably, the VMS system includes a route planning module and a traffic control module.

[0025] Preferably, the map management module is used to divide the dock site into segments of edges, with directions assigned to the edges;

[0026] Edges are connected end-to-end;

[0027] A path consists of a set of edges that are connected end to end.

[0028] This invention provides an automated terminal AGV obstacle avoidance and detour method and system. Congested AGVs are sequentially surrounded by restricted areas until the last AGV. Since there are no subsequent AGVs obstructing the way, its detour path is acceptable. After the last AGV leaves, the penultimate AGV can also detour and leave. The congested AGVs detour sequentially from back to front, thus relieving the congestion. AGVs can bypass faulty AGVs and automatically resolve subsequent congestion, preventing deadlocks for subsequent AGVs, or automatically unlocking and detouring if a deadlock has already occurred. Attached Figure Description

[0029] Figure 1 This is a flowchart illustrating the obstacle avoidance and detour method of the AGV at the automated dock of the present invention.

[0030] Figure 2 This is a schematic diagram of the framework structure of the automated dock AGV obstacle avoidance and detour system of the present invention;

[0031] Figure 3 This is a schematic diagram of the principle of the automated dock AGV obstacle avoidance and detour system of the present invention;

[0032] Figure 4 This is a schematic diagram of the organization of the map management module in the automated dock AGV obstacle avoidance and detour system of the present invention;

[0033] Figure 5 This is a schematic diagram of the path and Try-Claim usage of the AGV obstacle avoidance and detour system for automated docks according to the present invention;

[0034] Figure 6 This is a schematic diagram of the path planning module using Dijkstra's algorithm in the obstacle avoidance and detour system of the automated dock AGV of this invention. Figure 1 ;

[0035] Figure 7 This is a schematic diagram of the path planning module using Dijkstra's algorithm in the obstacle avoidance and detour system of the automated dock AGV of this invention. Figure 2 ;

[0036] Figure 8 This is a schematic diagram of the path planning module using Dijkstra's algorithm in the obstacle avoidance and detour system of the automated dock AGV of this invention. Figure 3 ;

[0037] Figure 9 This is a schematic diagram of the path planning module using Dijkstra's algorithm in the obstacle avoidance and detour system of the automated dock AGV of this invention. Figure 4 ;

[0038] Figure 10This is a schematic diagram of the subsequent AGV trolleys traveling along the path in the AGV obstacle avoidance and detour method of the automated terminal of the present invention. Figure 1 ;

[0039] Figure 11 This is a schematic diagram of the subsequent AGV trolleys traveling along the path in the AGV obstacle avoidance and detour method of the automated terminal of the present invention. Figure 2 ;

[0040] Figure 12 This is a schematic diagram of the subsequent AGV trolleys traveling along the path in the AGV obstacle avoidance and detour method of the automated terminal of the present invention. Figure 3 ;

[0041] Figure 13 This is a schematic diagram of the subsequent AGV trolleys traveling along the path in the AGV obstacle avoidance and detour method of the automated terminal of the present invention. Figure 4 ;

[0042] Figure 14 This is a schematic diagram of fault detour in the obstacle avoidance and detour method of the AGV at the automated dock of the present invention. Figure 1 ;

[0043] Figure 15 This is a schematic diagram of fault detour in the obstacle avoidance and detour method of the AGV at the automated dock of the present invention. Figure 2 ;

[0044] Figure 16 This is a schematic diagram of fault detour in the obstacle avoidance and detour method of the AGV at the automated dock of the present invention. Figure 3 ;

[0045] Figure 17 This is a schematic diagram of fault detour in the obstacle avoidance and detour method of the AGV at the automated dock of the present invention. Figure 4 ;

[0046] Figure 18 This is a diagram illustrating the failure of the AGV at the rear of the queue to detour in the AGV obstacle avoidance and detour method of the automated terminal in this invention. Figure 1 ;

[0047] Figure 19 This is a diagram illustrating the failure of the AGV at the rear of the queue to detour in the AGV obstacle avoidance and detour method of the automated terminal in this invention. Figure 2 ;

[0048] Figure 20 This is a diagram illustrating the successful obstacle avoidance and detour of the AGV at the rear of the queue in the AGV obstacle avoidance and detour method of the automated terminal of this invention. Figure 1 ;

[0049] Figure 21 This is a diagram illustrating the successful obstacle avoidance and detour of the AGV at the rear of the queue in the AGV obstacle avoidance and detour method of the automated terminal of this invention. Figure 2 ;

[0050] Figure 22 This is a schematic diagram of a deadlock between two paths in the obstacle avoidance and detour method of the automated dock AGV of the present invention. Detailed Implementation

[0051] To better understand the above-mentioned technical solutions of the present invention, the technical solutions of the present invention will be further described below in conjunction with the accompanying drawings and embodiments.

[0052] Combination Figure 1 As shown, the obstacle avoidance and detour method for an automated terminal AGV provided by the present invention includes the following steps:

[0053] S1, when the AGV stops due to a malfunction or deadlock, it communicates with the VMS system to report the malfunction and stop.

[0054] S2, the VMS system draws a no-entry zone for the AGV that has malfunctioned or deadlocked (the situation returned from step S6) to protect the AGV;

[0055] S3, the VMS system checks the AGVs that pass through the restricted area and sorts them from closest to furthest from the restricted area; the VMS system processes the sorted AGVs in sequence and plans a forward diagonal detour path for the subsequent AGVs.

[0056] S4. Check if the detour route can bypass the restricted area without being blocked. If so, the AGV will detour and leave, and the next AGV will be processed. If not, proceed to step S5.

[0057] S5, the VMS system plans a backward diagonal detour path for the subsequent AGV vehicles;

[0058] S6, check if the detour path is deadlocked. If so, return to step S2. If not, the AGV car detours away.

[0059] S7. Repeat steps S3 to S6 until all AGVs have driven away.

[0060] In step S3 above, the VMS system uses Dijkstra's algorithm to plan the detour path, and the map management module provides the edges connecting the beginning and end of the entire route, specifically including:

[0061] First, find the edges that originate from the starting point and check whether these edges overlap with the restricted area. Edges that overlap are discarded, and edges that do not overlap are saved.

[0062] Then, starting from the saved edges, find the connected edges, and similarly filter out the edges that do not overlap with the restricted area, and save the edge that is the shortest to the starting point.

[0063] Repeat the process until the endpoint is found (path planning succeeded, shortest path found), or until all edges are saved but the endpoint is not found (path planning failed).

[0064] The VMS system issues driving instructions to the AGV in the Try-Claim manner to request the use of a detour route. The AGV then drives according to the driving instructions, stops after completing the detour route, and continues until it finally reaches its destination.

[0065] Combination Figure 2 and Figure 3 As shown, a second aspect of the present invention provides an automated terminal AGV obstacle avoidance and detour system, comprising:

[0066] VMS system 1 is used to plan the start and end points of detour routes;

[0067] The restricted area management module 2 establishes data communication with the VMS system 1 to draw a restricted area for AGV vehicles that have malfunctioned;

[0068] Map management module 3 establishes data communication with VMS system 1 to establish a coordinate system;

[0069] AGV management module 4 establishes data communication with VMS system 1 to obtain signals from the AGV vehicles on site;

[0070] The obstacle avoidance and detour system of the automated terminal AGV of the present invention implements the obstacle avoidance and detour method of the automated terminal AGV of the present invention.

[0071] VMS system 1 includes a route planning module 11 and a traffic control module 12.

[0072] The AGV has navigation and positioning capabilities and basic laser obstacle avoidance. It can report its own position or faults to the VMS system 1 and execute driving commands issued by the VMS system 1. The VMS system 1 analyzes the start and end points of the task in the path planning module 11 and finds the corresponding coordinates on the map management module 3. The path planning module 11 uses Dijkstra's algorithm to plan the path from the start point to the end point. During the planning process, it avoids restricted areas and plans the optimal path (shortest distance priority).

[0073] Combination Figure 4 and Figure 5As shown, the map management module 3 is used to divide the dock area into segments of edges, each with a direction. Edges are connected end-to-end, and a path consists of a set of connected edges. AGVs travel along these paths. To ensure safety, Try-Claim protection is required. First, a Try operation attempts to occupy a segment of the path and checks if this segment conflicts with claims from restricted areas or other AGVs. If a conflict exists, the Try operation fails; otherwise, it is converted to a Claim, indicating that the path segment has been occupied.

[0074] Combination Figures 6 to 9 As shown, VMS system 1 uses Dijkstra's algorithm to plan the path. The map management module 3 provides edges that connect the entire field. First, it finds edges originating from the starting point and checks whether these edges overlap with the restricted area. Edges that overlap are discarded, while edges that do not overlap are saved. Then, it finds connecting edges from the saved edges, similarly filtering out edges that do not overlap with the restricted area, and saves the shortest edge to the starting point. The second step is repeated until the destination is found (path planning is successful, shortest path found), or all edges are saved but there is no destination (path planning fails).

[0075] Combination Figures 10 to 13 As shown, the subsequent AGVs execute the driving instructions issued by VMS system 1. VMS system 1 uses the Try-Claim method to request the use of a path and issues driving instructions to the AGVs. The AGVs move forward according to the driving instructions and stop after completing the occupied path, until they finally reach the end of the path.

[0076] Combination Figures 14 to 17 As shown, V1, V2, and V3 are AGVs traveling from right to left in the diagram. After V1 malfunctions, V2 and V3 stop behind V1 in sequence. A no-entry zone is drawn after V1's malfunction. When V2 attempts to claim a path, it detects the no-entry zone and triggers a re-path planning. When V2 uses Dijkstra's algorithm to plan its path, the forward edges fail due to the no-entry zone from V1, while the backward edges are unaffected, thus the path planning succeeds. The re-planned path by V2 interferes with V3's path, so V2's attempt to claim fails. However, since no no-entry zone was detected, V2 continues to wait.

[0077] Combination Figures 18 to 19 As shown, after V1 malfunctions, V2 and V3 stop behind V1 in sequence. There is no AGV behind V3. As shown in the figure, V3 uses Dijkstra's algorithm to plan a path. Its forward attempt is interfered with by V2, but V2 is a normal AGV. Before the no-entry zone is drawn, V3's attempt can succeed. V3 uses Dijkstra's algorithm to plan a path, but the generated path is interfered with by V2, and V3 still cannot detour.

[0078] Combination Figures 20 to 21 As shown, V3 uses Dijkstra's algorithm to plan a path. Its forward attempts are interfered with by V2, which has already drawn a no-entry zone, so the forward attempt fails, while the backward attempt succeeds. V3 uses Dijkstra's algorithm to plan a path, and the generated path is not interfered with by V2, allowing V3 to successfully bypass the obstacle.

[0079] Combination Figure 22 As shown, V2 and V3 are the locations of their own Claims. V2's Try passes through V3's Claim, and V3's Try passes through V2's Claim. Based on this, it can be determined that the paths of V2 and V3 constitute a deadlock.

[0080] A deadlock occurs when the next displacement of each AGV in a set is waiting for another AGV in the set to leave its current position; in this case, the AGVs in the set are deadlocked.

[0081] Example

[0082] See again Figure 1 As shown, the obstacle avoidance and detour method of the automated terminal AGV in this embodiment specifically includes the following steps:

[0083] S1, if the AGV malfunctions and stops, the AGV will communicate with the VMS system to report the malfunction and stop.

[0084] S2, the VMS system receives the AGV car's fault (or deadlock) stopping information, draws a no-entry zone to surround the faulty AGV car, and protects the AGV car;

[0085] S3, the VMS system checks the AGVs that pass through the restricted area and sorts them from closest to furthest from the restricted area; the VMS system processes the sorted AGVs in sequence and first plans a detour path to the adjacent lane by moving diagonally forward.

[0086] S4, check if the detour route can bypass the restricted area without being blocked;

[0087] S5, if possible, the AGV will detour and leave, and the process will jump to step S3 to start processing the next AGV; if not, a detour path will be planned to move diagonally backward to the adjacent lane.

[0088] S6, check whether the detour path forms a deadlock with the subsequent AGV trolley path;

[0089] S7, if no deadlock occurs, the AGV will detour and leave, and the process will jump to step 3 to start processing the next AGV; if a deadlock occurs, the VMS system will wait for the AGV to stop.

[0090] S8, the VMS system receives the AGV stop information, draws a no-entry zone around the AGV, and protects the AGV;

[0091] S9. Repeat steps S2 to S8 until all AGVs have bypassed and left.

[0092] In summary, in the AGV obstacle avoidance and detour method of this invention, the VMS system plans paths that avoid restricted areas (areas where AGVs from outside the designated area are prohibited from entering). Therefore, when a faulty AGV is detected, the VMS system automatically generates a restricted area surrounding the faulty AGV. The VMS system then generates paths for subsequent AGVs to bypass the faulty AGV. If a subsequent AGV has already approached the faulty AGV, the planned path is to move diagonally backward to an adjacent lane, and then plan a forward path to bypass the faulty AGV. The newly planned path... When a path travels diagonally backward, it may create a deadlock with the forward path of the subsequent AGVs. Such a detour is not acceptable, so the VMS system will automatically generate a restricted zone to enclose it. Congested AGVs will be enclosed by restricted zones one by one until the last AGV. Since there are no subsequent AGVs blocking the way, its detour is acceptable. After the last AGV leaves, the second to last AGV can also detour and leave. The congested AGVs detour and leave in turn from back to front, thus relieving the congestion.

[0093] Those skilled in the art should recognize that the above embodiments are merely illustrative of the present invention and are not intended to limit the present invention. Any variations or modifications to the above embodiments that are within the spirit and essence of the present invention will fall within the scope of the claims of the present invention.

Claims

1. A method for obstacle avoidance and detour by AGVs at an automated terminal, characterized in that, Includes the following steps: S1, if the AGV stops due to a malfunction or deadlock, it communicates with the VMS system to report the malfunction and stop. S2, the VMS system draws a no-entry zone for the AGV that has malfunctioned or deadlocked, thus protecting the AGV; S3, the VMS system checks the AGVs that pass through the restricted area in subsequent paths, and sorts them from near to far from the restricted area; the VMS system processes the sorted AGVs in sequence and plans a forward diagonal detour path for the subsequent AGVs; The VMS system uses Dijkstra's algorithm to plan detour paths, and the map management module provides edges that connect the entire site, specifically including: First, find the edges originating from the starting point and check whether these edges overlap with the restricted area. Edges that overlap are discarded, while edges that do not overlap are saved. Then, starting from the saved edges, find the connected edges, filter out the edges that do not overlap with the restricted area, and save the edges that are the shortest to the starting point. Repeat the process until the endpoint is found, or until all edges have been saved but the endpoint is not found. S4. Check whether the detour path can bypass the restricted area without being blocked. If so, the AGV car detours and leaves, and the next AGV car is processed. If not, proceed to step S5. S5, the VMS system plans a backward diagonal detour path for the subsequent AGV vehicle; S6, check if the detour path is deadlocked. If yes, return to step S2. If no, the AGV car detours away. S7. Repeat steps S3 to S6 until all the AGVs have driven away.

2. The obstacle avoidance and detour method for AGVs at automated terminals according to claim 1, characterized in that: The VMS system uses a try-claim method to request the use of a detour route and issues a driving command to the AGV. The AGV drives according to the driving command and stops after completing the detour route until it finally reaches the destination.

3. An automated terminal AGV obstacle avoidance and detour system, characterized in that, include: The VMS system is used to plan the start and end points of detour routes; The restricted area management module establishes data communication with the VMS system to draw restricted areas for malfunctioning AGVs; The map management module establishes data communication with the VMS system to establish a coordinate system; The AGV management module establishes data communication with the VMS system to obtain signals from the AGV vehicles on site. The automated terminal AGV obstacle avoidance and detour system implements the automated terminal AGV obstacle avoidance and detour method as described in any one of claims 1-2.

4. The AGV obstacle avoidance and detour system for automated docks according to claim 3, characterized in that: The VMS system includes a route planning module and a traffic control module.

5. The AGV obstacle avoidance and detour system for automated docks according to claim 3, characterized in that: The map management module is used to divide the dock site into segments of edges, with directions indicated on the edges; Edges are connected end-to-end; A path consists of a set of edges that are connected end to end.

Citation Information

Patent Citations

  • Automatic guiding vehicle distributed autonomous cooperation control system and control method

    CN102231233A