AGV dynamic traffic control method and system in control area containing avoidance points
A technology for traffic control and control areas, applied in control/regulation systems, two-dimensional position/channel control, motor vehicles, etc., can solve problems such as reduced operating efficiency, long avoidance time, and inability to determine vehicle movement conditions, so as to avoid Optimum effect on collision and traffic efficiency
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0052] This embodiment provides an AGV dynamic traffic control method and system in a control area containing avoidance points, such as figure 2 As shown, the control method includes the following steps:
[0053] Obtain path data: Obtain the path and path data from the starting point to the end point on the raster map through path planning algorithm, such as image 3 Shown is an example of grid map planning route. The route data includes route point number, route point running direction and travel mileage between route points; then the route data is preprocessed to obtain the running time t of the vehicle at each route point i ;
[0054] Calculation of path intersection: According to the path data and the running time t of each path point i Calculate path crossing, the necessary and sufficient condition of path crossing is coincidence in time and space, such as Figure 4 Shown is a schematic diagram of path crossing; when processing the time of each path point, a time wind...
Embodiment 2
[0063] In this embodiment, on the basis of Embodiment 1, when acquiring path data:
[0064] The running time of each path point t i The calculation method is as follows:
[0065]
[0066] Among them, t i-1 is the running time of the vehicle at the last waypoint, s i and v i Respectively, the running mileage and running average speed of the vehicle from the i-1th point to the i-th point, t turn_i is the turning time of the vehicle at the i-th point, or 0 if there is no need to turn.
[0067] Specifically, calculate the running time t of each path point i , increase the acceleration time and deceleration time of the vehicle on the path according to the scene including the start point, end point and turn.
[0068] More specifically, the path planning algorithm may use graph algorithms such as Dijkstra or A*.
Embodiment 3
[0070] In this embodiment, on the basis of Embodiment 1, when calculating path intersections:
[0071] If the running time window of vehicle 1 at waypoint i is T 11 ~T 12 , the running time window of vehicle 2 at waypoint i is T 21 ~T 22 , when one of the following relations is satisfied, it means that vehicle 1 and vehicle 2 will meet at path point i, and a path intersection will occur:
[0072] T 21 ≤T 11 ≤T 22
[0073] T 21 ≤ T 12 ≤T 22
[0074] T 11 ≤T 21 ≤T 12
[0075] T 11 ≤ T 22 ≤ T 12 .
[0076] Specifically, the selection of the time window adopts the time between one path point before and after the current path point.
[0077] More specifically, when the vehicle is running, along with the update of the current location of the vehicle, the time information of the waypoints that the vehicle has not passed also needs to be dynamically updated.
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


