CN112987721A - Multi-AGV dispatching package and fusion method of global planning and local planning thereof - Google Patents
Multi-AGV dispatching package and fusion method of global planning and local planning thereof Download PDFInfo
- Publication number
- CN112987721A CN112987721A CN202110137260.3A CN202110137260A CN112987721A CN 112987721 A CN112987721 A CN 112987721A CN 202110137260 A CN202110137260 A CN 202110137260A CN 112987721 A CN112987721 A CN 112987721A
- Authority
- CN
- China
- Prior art keywords
- global
- planning
- agv
- time
- path
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000007500 overflow downdraw method Methods 0.000 title claims abstract description 7
- 238000000034 method Methods 0.000 claims abstract description 26
- 238000004891 communication Methods 0.000 claims abstract description 10
- 238000005070 sampling Methods 0.000 claims description 8
- 238000012937 correction Methods 0.000 claims description 4
- 230000008569 process Effects 0.000 claims description 3
- 238000005457 optimization Methods 0.000 description 6
- 238000012545 processing Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 230000009471 action Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 230000001186 cumulative effect Effects 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 230000004044 response Effects 0.000 description 2
- 206010033799 Paralysis Diseases 0.000 description 1
- 238000005299 abrasion Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000005265 energy consumption Methods 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 230000004927 fusion Effects 0.000 description 1
- 238000013468 resource allocation Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05D—SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
- G05D1/00—Control of position, course, altitude or attitude of land, water, air or space vehicles, e.g. using automatic pilots
- G05D1/02—Control of position or course in two dimensions
- G05D1/021—Control of position or course in two dimensions specially adapted to land vehicles
- G05D1/0212—Control of position or course in two dimensions specially adapted to land vehicles with means for defining a desired trajectory
- G05D1/0221—Control of position or course in two dimensions specially adapted to land vehicles with means for defining a desired trajectory involving a learning process
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05D—SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
- G05D1/00—Control of position, course, altitude or attitude of land, water, air or space vehicles, e.g. using automatic pilots
- G05D1/02—Control of position or course in two dimensions
- G05D1/021—Control of position or course in two dimensions specially adapted to land vehicles
- G05D1/0257—Control of position or course in two dimensions specially adapted to land vehicles using a radar
Landscapes
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Aviation & Aerospace Engineering (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Automation & Control Theory (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a multi-AGV scheduling device and a fusion method of global planning and local planning thereof. The application layer provides an interface for developers to use an AGVTroop framework; the AGVTroop framework completes task allocation and path planning according to the issued tasks, the map information and the AGV information; the ROS layer builds a communication frame, controls bottom layer equipment and combines a software package provided by the ROS and laser information of the AGV to realize positioning of the AGV. The invention adopts a method of fusing global planning and local planning. Firstly, a route with global optimality is planned according to global indexes based on an improved A-x algorithm, and a local planner dynamically adjusts the global route according to local information and designated strategies and indexes.
Description
Technical Field
The invention belongs to the field of AGV, and particularly relates to a multi-AGV dispatching package and a fusion method of global planning and local planning thereof.
Background
And in the global planning of the multiple AGVs, the running paths, states and the like of other AGVs are referred when the path is planned for the current AGV, and global indexes such as path balance, total task completion time and the like are considered. Common global planning methods include a single-item graph method, a traffic method and the like.
The one-way graph method simplifies the driving model of the AGV by specifying a single driving direction of a route, the possible driving path in the map is single, the conflict is only possible to occur at the intersection, and the design of a conflict avoiding strategy is convenient. However, since the allowed passing directions of all the paths are defined, the problem of detour is easily caused, and the path cost for executing the task is high.
The traffic law is mainly used for the problem of crossing resource allocation, and collision occurs when a plurality of objects occupy one route at the same time. Thus, each collision can be avoided by taking appropriate measures for all the intersections in the relevant environment. By enumerating overlapping routes: along the routes and intersections in opposite directions, the same direction, traffic rules are constructed that accommodate all of these overlapping routes to avoid collisions. Common treatment methods are: intersection waiting, path reselection, etc. Although the traffic method can effectively solve the conflict and reduce the occurrence rate of accidents, the traffic method is more strategy processing when the conflict is about to occur, and when the number of AGVs is large and the traffic jam is serious, the system is easy to be paralyzed.
The global planning algorithm considers global optimality, can reduce the processing time of tasks to a certain extent, and avoids the problems of system deadlock, collision and the like. However, the time complexity of the global planning algorithm increases exponentially with the increase of the AGVs, the response time is long, the real-time performance is low, and the processing of the dynamic scenes of the AGVs is difficult.
The Dijkstra algorithm expands adjacent nodes outwards in a divergent mode with a starting point as a center, takes the cumulative cost of a search path as a heuristic method, and preferentially expands the node with the minimum cumulative cost of the path. The A-algorithm is an allowable heuristic algorithm obtained by combining a branch-and-bound method and an extended list tool, the lower bound of the residual path cost of the extended node is estimated while the accumulated path cost is considered, the search is prevented from being carried out towards the opposite direction, and the repeated extension is avoided by accessing the extended list.
The local planning of AGV only considers the path planning of current AGV, and the time complexity can not rise along with AGV quantity, keeps in can calculating the within range, and response time is short, and the real-time is high, can very benefit the dynamic scene of dealing with AGV moreover. However, since the AGVs only consider local optimality in path planning, when the number of AGVs increases, problems such as deadlock and collision frequently occur.
Disclosure of Invention
The invention provides a multi-AGV dispatching package and a fusion method of global planning and local planning thereof, which are used for solving the problems and can flexibly deal with different scenes.
The invention is realized by the following technical scheme:
a multi-AGV scheduling device comprises an application layer, an AGVTroop framework, an ROS layer and a plurality of AGVs, wherein the application layer provides an interface for developers to use the AGVTroop framework;
the AGVTroop framework completes task allocation and path planning according to the issued tasks, the map information and the AGV information;
the ROS layer builds a communication frame, controls bottom layer equipment and combines a software package provided by the ROS and laser information of the AGV to realize positioning of the AGV.
Further, the communication framework realizes communication between the AGVCluster and the AGV;
the bottom equipment is an actual AGV.
A method for fusing global planning and local planning of multiple AGV scheduling devices comprises the following specific steps:
step 1: reading information of the global planner based on the improved A-algorithm, namely time window information;
step 2: the local planner carries out local path planning by referring to the global route according to the local information and outputs a speed instruction to the time window information;
and step 3: judging whether the local planning time exceeds a threshold value, if so, returning to the global planner in the step 1, and if not, performing the step 4;
and 4, step 4: and (4) judging whether the track with the highest score is less than 0, if so, returning to the global planner in the step (1), and if so, outputting a speed instruction.
Further, the global index is used for completing the time and path balance of all tasks;
the reference indicators within the local planner include a deviation from a global route value, a directional cost, and an obstacle cost.
Further, the global planning method in the global planner in step 1 specifically includes the following steps:
step Q1: receiving a task to be executed, if the task to be executed is empty, ending the process, and if the task to be executed is not empty, entering a step Q2;
step Q2: constructing a direction time window and an occupied time window for each node of each grid map;
step Q3: calling an improved A algorithm to perform global planning by using the directional time window and the occupied time window constructed in the step Q2;
step Q4: updating the direction time window and the occupied time window of the nodes on the path by using the global planning of the step Q3;
step Q5: judging whether the node direction conflict exists according to the step Q4, if so, performing the steps Q6 and Q7, and if not, performing the step Q8;
step Q6: calculating the waiting time cost;
step Q7: replanning the path;
step Q8: judging whether the occupied time window conflict of the nodes exists according to the step Q4, if so, performing the step Q6, and if not, performing the step Q9;
step Q9: issuing the path to a corresponding AGV;
step Q10: judging whether the waiting time cost is greater than the re-planning time or not according to the step Q6 and the step Q7, if so, performing the step Q11, and if not, performing the step Q12;
step Q11: updating the global path and issuing the path to the corresponding AGV;
step Q12: waiting in place and issuing the path to the corresponding AGV.
Further, the local planning method specifically includes the following steps:
step J1: acquiring a global planning route;
step J2: reading laser radar data to obtain local information based on the global planning route of the step J1;
step J3: sampling a plurality of sets of velocities in a velocity space (v, w) based on the local information of step J2;
step J4: simulating the track within 0.01s-0.10s based on the multiple groups of sampling speeds of the step J3;
step J5: scoring the trajectory of step J4;
step J6: judging whether the score of the step J5 is larger than a threshold value, namely whether a feasible path exists, if so, entering a step J7, and if not, entering a step J8;
step J7: executing according to the track with the highest score;
step J8: correcting a direction time window, an occupied time window and a use frequency of a node on a track;
step J9: and dynamically adjusting the globally planned route based on the information modified in the step J8.
The invention has the beneficial effects that:
in order to ensure the global optimality of the AGV planning, improve the real-time performance of the system and the capability of processing dynamic scenes, the invention adopts a method of fusing global planning and local planning. Firstly, a route with global optimality is planned according to global indexes based on an improved A-x algorithm, and a local planner dynamically adjusts the global route according to local information and designated strategies and indexes.
In order to enable the framework to flexibly cope with different scenes, the system provides an extensible platform to support different optimization rules as plug-ins. The system supports various optimization models, developers can customize performance indexes of new task scheduling or path gauges, and the newly added indexes are used as plug-ins. And the AGVTroop framework needs to realize self-optimization, and adjusts the allocation scheduling strategy and the path planning of the AGV according to the newly added index. And selects the best weighted combination for these performance indicators by replaying the historical data.
The invention provides a fine-grained interface, supports action-level scheduling, enables developers to program in a task-oriented manner, only needs to define and distribute tasks and task groups, does not need to care about how to execute the tasks, and simplifies the AGV application development
Drawings
FIG. 1 is a schematic diagram of the overall architecture of the present invention.
Fig. 2 is a schematic diagram of the application layer of the present invention.
FIG. 3 is a schematic diagram of an AGVTroop layer of the present invention.
FIG. 4 is a schematic representation of the ROS layer of the present invention.
FIG. 5 is a flow chart of the fusion of global planning and local planning of the present invention.
FIG. 6 is a flow chart of the global path planning of the present invention.
Fig. 7 is a flow chart of the local path planning of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be described clearly and completely with reference to the accompanying drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
A multi-AGV scheduling device comprises an application layer, an AGVTroop framework, an ROS layer and a plurality of AGVs, wherein the application layer provides an interface for developers to use the AGVTroop framework; developers only need to release tasks according to application scenes, do not need to care about how the tasks are executed, and give the tasks to AGV execution;
the AGVTroop framework completes task allocation and path planning according to the issued tasks, the map information and the AGV information;
the ROS layer builds a communication frame, controls bottom layer equipment and combines a software package provided by the ROS and laser information of the AGV to realize positioning of the AGV.
Further, the communication framework realizes communication between the AGVCluster and the AGV;
the bottom layer equipment is an actual AGV; and relative to the AGVCluster, the AGVCluster schedules towards the virtual AGV, and the ROS finishes the binding of the virtual AGV and the actual AGV and controls the bottom layer equipment.
A method for fusing global planning and local planning of multiple AGV scheduling devices comprises the following specific steps:
step 1: reading information of the global planner based on the improved A-algorithm, namely time window information;
step 2: the local planner carries out local path planning by referring to the global route according to the local information and outputs a speed instruction to the time window information;
and step 3: judging whether the local planning time exceeds a threshold value, if so, returning to the global planner in the step 1, and if not, performing the step 4;
and 4, step 4: and (4) judging whether the track with the highest score is less than 0, if so, returning to the global planner in the step (1), and if so, outputting a speed instruction.
Further, the global index is used for completing the time and path balance of all tasks;
the reference indicators within the local planner include a deviation from a global route value, a directional cost, and an obstacle cost.
Further, the global planning method in the global planner in step 1 specifically includes the following steps:
step Q1: receiving a task to be executed, if the task to be executed is empty, ending the process, and if the task to be executed is not empty, entering a step Q2;
step Q2: constructing a direction time window and an occupied time window for each node of each grid map;
step Q3: calling an improved A algorithm to perform global planning by using the directional time window and the occupied time window constructed in the step Q2;
step Q4: updating the direction time window and the occupied time window of the nodes on the path by using the global planning of the step Q3;
step Q5: judging whether the node direction conflict exists according to the step Q4, if so, performing the steps Q6 and Q7, and if not, performing the step Q8;
step Q6: calculating the waiting time cost;
step Q7: replanning the path;
step Q8: judging whether the occupied time window conflict of the nodes exists according to the step Q4, if so, performing the step Q6, and if not, performing the step Q9;
step Q9: issuing the path to a corresponding AGV;
step Q10: judging whether the waiting time cost is greater than the re-planning time or not according to the step Q6 and the step Q7, if so, performing the step Q11, and if not, performing the step Q12;
step Q11: updating the global path and issuing the path to the corresponding AGV;
step Q12: waiting in place and issuing the path to the corresponding AGV.
Further, the local planning method specifically includes the following steps:
step J1: acquiring a global planning route;
step J2: reading laser radar data to obtain local information based on the global planning route of the step J1;
step J3: sampling a plurality of sets of velocities in a velocity space (v, w) based on the local information of step J2;
step J4: simulating the track of the step J3 in a short time (the default value is 0.05s) based on the multiple sets of sampling speeds;
step J5: scoring the trajectory of step J4;
step J6: judging whether the score of the step J5 is larger than a threshold value, namely whether a feasible path exists, if so, entering a step J7, and if not, entering a step J8;
step J7: executing according to the track with the highest score;
step J8: correcting a direction time window, an occupied time window and a use frequency of a node on a track;
step J9: and dynamically adjusting the globally planned route based on the information modified in the step J8.
Further, the improved a-x algorithm is specifically that global information is added when a path calculation node n is searched, and a calculation formula f (n) is:
f(n)＝g(n)+h(n)+α*Math.min(time_threshold,cur_time-last_time)+β*frequency[n]+δ*steering_correction
wherein g (n) a cost from the starting node to the node n; h (n): an estimated cost of the best path from node n to the target node; time _ threshold is the maximum time threshold; cur _ time: the time node n is currently in use; last _ time: point n last time usage; frequency [ n ]: the frequency of use of the node n; step _ correction: correcting steering; alpha, beta and delta are respectively time weight, frequency weight and steering weight;
the path planning of the invention adopts a mode of integrating global planning and local planning, a route with global optimality can be planned according to a series of global indexes (all task completion time, path balance and the like) based on an improved A-x algorithm, and a local planner can dynamically adjust the global route according to local information. (the reference index comprises deviation value from the global route, direction cost, obstacle cost and other adjustment strategies comprise route adjustment, quiet waiting, re-planning and the like).
The invention provides a fine-grained interface, supports action-level scheduling, enables developers to program in a task-oriented manner, only needs to define and distribute tasks, task groups and tasks, does not need to care about how to execute the tasks, and simplifies the AGV application development. The ROS provides various types of hardware abstractions and drivers, so that the system can be programmed facing the virtual AGV according to the difference of the bottom AGV.
In order to make the framework flexibly cope with different scenes, the system provides an extensible platform to support different optimization rules as plug-ins. The system supports various optimization models, developers can customize performance indexes of new task scheduling or path gauges, and the newly added indexes are used as plug-ins. And the AGVTroop framework needs to realize self-optimization, and adjusts the allocation scheduling strategy and the path planning of the AGV according to the newly added index. And selects the best weighted combination for these performance indicators.
And the global path planning adopts an A-algorithm for improving the multi-AGV path planning based on the time window, and a direction time window and an occupied time window are constructed for each node of the grid map. And calculating a global path based on an A-algorithm, and calculating an occupied time window and a direction time window of each node on the path according to the hardware information of the AGV. The algorithm A needs to plan a path according to time window information, three factors (1) are considered to be accessible, and according to the current time window information, a certain node cannot exist on the constructed path to cause the direction or occupied time to have conflict. (2) The collision is avoided, the occupied frequency of the nodes in the arrival time is considered during path planning, the imbalance of the paths (namely, a certain channel has a plurality of AGV accesses, and other channels are idle) is avoided as much as possible (3), the change of the traveling direction is avoided as much as possible during path planning, the energy consumption of the AGV can be increased seriously due to frequent turning, the abrasion of hardware is aggravated, and the AGV conflict is easily caused. And finally, issuing the global route to a local planner for adjustment. (4) Time cost, the time required to complete all tasks.
Local path planning is mainly used for dynamically adjusting globally planned routes. Global planning, while considering global optima, does not handle dynamic scenarios well (e.g., obstacles, hardware failures, and dynamic objects such as people not on the newly added map). The local path planning fine-tunes the global route according to the local information scanned by the lidar. The local path planning adopts DWA dynamic window algorithm. Sampling multiple groups of speeds in a speed space (v, w) (the speeds can be controlled within a certain range according to the limit of the trolley and the environmental limit during speed sampling), simulating the tracks of the trolley at the speeds within a certain time, evaluating the tracks after obtaining multiple groups of tracks, and selecting the speed group corresponding to the optimal track to drive the robot to move. The scoring function is a weighted sum of the following costs.
(1) And (4) oscillating cost, namely switching the walking direction for multiple times in a short time if the walking direction is oscillated.
(2) Obstacle cost, distance between obstacles on the trajectory.
(3) Path cost, and global path deviation value.
(4) The goal cost, direction is not to drive towards the goal.
(5) And (4) carrying out penalty on backward paths by reverse cost.
Claims (7)
1. The multi-AGV dispatching device is characterized by comprising an application layer, an AGVTroop framework, an ROS layer and a plurality of AGVs, wherein the application layer provides an interface for developers to use the AGVTroop framework;
the AGVTroop framework completes task allocation and path planning according to the issued tasks, the map information and the AGV information;
the ROS layer builds a communication frame, controls bottom layer equipment and combines a software package provided by the ROS and laser information of the AGV to realize positioning of the AGV.
2. The multiple AGV scheduler of claim 1 wherein the communication framework enables communication between agvclutter and AGV;
the bottom equipment is an actual AGV.
3. The fusion method of global planning and local planning of multiple AGV dispatchers according to claim 1 or 2, wherein the fusion method comprises the following steps:
step 1: reading information of the global planner based on the improved A-algorithm, namely time window information;
step 2: the local planner carries out local path planning by referring to the global route according to the local information and outputs a speed instruction to the time window information;
and step 3: judging whether the local planning time exceeds a threshold value, if so, returning to the global planner in the step 1, and if not, performing the step 4;
and 4, step 4: and (4) judging whether the track with the highest score is less than 0, if so, returning to the global planner in the step (1), and if so, outputting a speed instruction.
4. The method of claim 3, wherein the global index is indicative of the time for completing all tasks and the path balance;
the reference indicators within the local planner include a deviation from a global route value, a directional cost, and an obstacle cost.
5. The method for fusing global planning and local planning of multiple AGV dispatchers according to claim 3, wherein the global planning method in the global planner of step 1 specifically includes the following steps:
step Q1: receiving a task to be executed, if the task to be executed is empty, ending the process, and if the task to be executed is not empty, entering a step Q2;
step Q2: constructing a direction time window and an occupied time window for each node of each grid map;
step Q3: calling an improved A algorithm to perform global planning by using the directional time window and the occupied time window constructed in the step Q2;
step Q4: updating the direction time window and the occupied time window of the nodes on the path by using the global planning of the step Q3;
step Q5: judging whether the node direction conflict exists according to the step Q4, if so, performing the steps Q6 and Q7, and if not, performing the step Q8;
step Q6: calculating the waiting time cost;
step Q7: replanning the path;
step Q8: judging whether the occupied time window conflict of the nodes exists according to the step Q4, if so, performing the step Q6, and if not, performing the step Q9;
step Q9: issuing the path to a corresponding AGV;
step Q10: judging whether the waiting time cost is greater than the re-planning time or not according to the step Q6 and the step Q7, if so, performing the step Q11, and if not, performing the step Q12;
step Q11: updating the global path and issuing the path to the corresponding AGV;
step Q12: waiting in place and issuing the path to the corresponding AGV.
6. The method of claim 3, wherein the local planning method specifically comprises the following steps:
step J1: acquiring a global planning route;
step J2: reading laser radar data to obtain local information based on the global planning route of the step J1;
step J3: sampling a plurality of sets of velocities in a velocity space (v, w) based on the local information of step J2;
step J4: simulating the track within 0.01s-0.10s based on the multiple groups of sampling speeds of the step J3;
step J5: scoring the trajectory of step J4;
step J6: judging whether the score of the step J5 is larger than a threshold value, namely whether a feasible path exists, if so, entering a step J7, and if not, entering a step J8;
step J7: executing according to the track with the highest score;
step J8: correcting a direction time window, an occupied time window and a use frequency of a node on a track;
step J9: and dynamically adjusting the globally planned route based on the information modified in the step J8.
7. The method of claim 3, wherein the improved a-algorithm is specifically that global information is added when searching for a path computation node n, and the computation formula f (n) is:
f(n)＝g(n)+h(n)+α*Math.min(time_threshold,cur_time-last_time)+β*frequency[n]+δ*steering_correction
wherein g (n) a cost from the starting node to the node n; h (n): an estimated cost of the best path from node n to the target node; time _ threshold is the maximum time threshold; cur _ time: the time node n is currently in use; last _ time: point n last time usage; frequency [ n ]: the frequency of use of the node n; step _ correction: correcting steering; alpha, beta and delta are respectively time weight, frequency weight and steering weight;
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110137260.3A CN112987721B (en) | 2021-02-01 | 2021-02-01 | Multi-AGV scheduling device and fusion method of global planning and local planning thereof |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110137260.3A CN112987721B (en) | 2021-02-01 | 2021-02-01 | Multi-AGV scheduling device and fusion method of global planning and local planning thereof |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112987721A true CN112987721A (en) | 2021-06-18 |
| CN112987721B CN112987721B (en) | 2022-12-13 |
Family
ID=76346009
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110137260.3A Active CN112987721B (en) | 2021-02-01 | 2021-02-01 | Multi-AGV scheduling device and fusion method of global planning and local planning thereof |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112987721B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TWI820594B (en) * | 2021-12-23 | 2023-11-01 | 大陸商深圳富聯富桂精密工業有限公司 | Operation control method of agv, electronic equipment and computer readable storage media |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106251016A (en) * | 2016-08-01 | 2016-12-21 | 南通大学 | A kind of parking system paths planning method based on dynamic time windows |
| WO2017215044A1 (en) * | 2016-06-14 | 2017-12-21 | 广东技术师范学院 | Automatic path planning method for mobile robot and mobile robot |
| CN108413980A (en) * | 2018-06-07 | 2018-08-17 | 华北电力大学 | A kind of touring paths planning method of traffic reducing path branches |
| CN109583709A (en) * | 2018-11-09 | 2019-04-05 | 同济大学 | A kind of automatic parking robot group method for scheduling task |
| CN110244712A (en) * | 2019-05-22 | 2019-09-17 | 南通大学 | A kind of more AGV system paths planning methods |
| CN111142542A (en) * | 2020-01-15 | 2020-05-12 | 苏州晨本智能科技有限公司 | Omnidirectional mobile robot autonomous navigation system based on VFH local path planning method |
| CN111174798A (en) * | 2020-01-17 | 2020-05-19 | 长安大学 | Foot type robot path planning method |
| CN111721297A (en) * | 2020-06-19 | 2020-09-29 | 重庆大学 | Path planning method for multiple AGV of intelligent garage |
| CN112068545A (en) * | 2020-07-23 | 2020-12-11 | 哈尔滨工业大学（深圳） | Method and system for planning driving track of unmanned vehicle at crossroad and storage medium |
-
2021
- 2021-02-01 CN CN202110137260.3A patent/CN112987721B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017215044A1 (en) * | 2016-06-14 | 2017-12-21 | 广东技术师范学院 | Automatic path planning method for mobile robot and mobile robot |
| CN106251016A (en) * | 2016-08-01 | 2016-12-21 | 南通大学 | A kind of parking system paths planning method based on dynamic time windows |
| CN108413980A (en) * | 2018-06-07 | 2018-08-17 | 华北电力大学 | A kind of touring paths planning method of traffic reducing path branches |
| CN109583709A (en) * | 2018-11-09 | 2019-04-05 | 同济大学 | A kind of automatic parking robot group method for scheduling task |
| CN110244712A (en) * | 2019-05-22 | 2019-09-17 | 南通大学 | A kind of more AGV system paths planning methods |
| CN111142542A (en) * | 2020-01-15 | 2020-05-12 | 苏州晨本智能科技有限公司 | Omnidirectional mobile robot autonomous navigation system based on VFH local path planning method |
| CN111174798A (en) * | 2020-01-17 | 2020-05-19 | 长安大学 | Foot type robot path planning method |
| CN111721297A (en) * | 2020-06-19 | 2020-09-29 | 重庆大学 | Path planning method for multiple AGV of intelligent garage |
| CN112068545A (en) * | 2020-07-23 | 2020-12-11 | 哈尔滨工业大学（深圳） | Method and system for planning driving track of unmanned vehicle at crossroad and storage medium |
Non-Patent Citations (6)
| Title |
|---|
| LIU YAN，等: "The Optimal Routes and Modes Selection in Multimodal Transportation Networks Based on Improved A* Algorithm", 《2018 5TH INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND APPLICATIONS (ICIEA)》 * |
| LU WU，等: "Routing Optimization of Regional Logistics Vehicles Based on Distribution Information Matching", 《PROCEEDINGS OF THE 2019 INTERNATIONAL CONFERENCE ON ROBOTICS, INTELLIGENT CONTROL AND ARTIFICIAL INTELLIGENCE (RICAI 2019)》 * |
| ZHENG CHEN,等: "A Hybrid Path Planning Algorithm for Unmanned Surface Vehicles in Complex Environment With Dynamic Obstacles", 《IEEE ACCESS》 * |
| 刘琰: "基于多种运输方式的快递网络优化问题研究", 《中国优秀博硕士学位论文全文数据库（硕士）经济与管理科学辑》 * |
| 胡杰杰: "面向制造车间柔性物流的AGV群控系统研制", 《中国优秀博硕士学位论文全文数据库（硕士）信息科技辑》 * |
| 雷祁: "基于ROS机器人的智能物流系统设计", 《中国优秀博硕士学位论文全文数据库（硕士）信息科技辑》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TWI820594B (en) * | 2021-12-23 | 2023-11-01 | 大陸商深圳富聯富桂精密工業有限公司 | Operation control method of agv, electronic equipment and computer readable storage media |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112987721B (en) | 2022-12-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Liu et al. | A new algorithm of the best path selection based on machine learning | |
| US20220374712A1 (en) | Decision making for motion control | |
| RU2589869C2 (en) | Method and system for efficient scheduling for plurality of automated nonholonomic vehicles using scheduler of coordinated routes | |
| CN114519448A (en) | System and method for optimizing route planning in an operating environment | |
| CN109976355A (en) | Method for planning track, system, equipment and storage medium | |
| CN109557912A (en) | A kind of decision rule method of automatic Pilot job that requires special skills vehicle | |
| Wang et al. | A multi-agent based vehicles re-routing system for unexpected traffic congestion avoidance | |
| US20070233338A1 (en) | Real time planning and scheduling for a team of unmanned vehicles | |
| CN113085850B (en) | Vehicle obstacle avoidance method and device, electronic equipment and storage medium | |
| US20230045935A1 (en) | Multi-vehicle collaborative trajectory planning method, apparatus and system, and device, storage medium, and computer program product | |
| Wang et al. | Competitive and cooperative behaviour analysis of connected and autonomous vehicles across unsignalised intersections: A game-theoretic approach | |
| CN110515380A (en) | Shortest path planning method based on turning weight constraints | |
| CN112918486B (en) | Space-time behavior decision and trajectory planning system and method | |
| CN109556610A (en) | A kind of paths planning method, controller and system | |
| CN111650931A (en) | Method, apparatus and storage medium for path determination of multiple mobile devices | |
| US20230063370A1 (en) | Multi-robot route planning | |
| CN112987721B (en) | Multi-AGV scheduling device and fusion method of global planning and local planning thereof | |
| An et al. | Space-time routing in dedicated automated vehicle zones | |
| CN114545951A (en) | Path planning method and device | |
| Aguilar et al. | Ten autonomous mobile robots (and even more) in a route network like environment | |
| CN115638804B (en) | Deadlock-free unmanned vehicle online path planning method | |
| WO2023201954A1 (en) | Roundabout path planning method and apparatus | |
| CN115657676A (en) | Centralized multi-AGV multi-path channel change decision planning method based on priority | |
| Löcklin et al. | Trajectory Prediction of Moving Workers for Autonomous Mobile Robots on the Shop Floor | |
| US20220300002A1 (en) | Methods and systems for path planning in a known environment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |