Path planning method, path planning device and computer storage medium
Through the priority path planning method, child nodes are generated and expanded, and the path is re-planned using alternate nodes, solving the problem of low efficiency in mobile agent path planning in the existing technology, and achieving more efficient path planning.
Patent Information
- Application Number
- CN202411036989.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-30
- Publication Date
- 2024-12-06
AI Technical Summary
The prior art has low efficiency in mobile agent path planning in complex environments, and is prone to failure to find the optimal path, and has high limitations.
The priority path planning method is adopted to generate child nodes by obtaining conflict points in the initial path, calculate the generation value, judge and expand the child nodes, sort the priority relationship, update the conflict information, and generate alternate nodes to re-plan the optimal path.
It improves the efficiency and diversity of path planning, reduces the difficulty of solving in a specific priority sequence, increases the effective solution probability of path planning, and reduces redundant steps.
Smart Images

Figure CN119088003A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of robot applications, and in particular to a path planning method, a path planning device, and a computer storage medium. Background Art
[0002] With the development of the times and the advancement of science and technology, artificial intelligence, as an important branch of computer science, has been widely used in people's daily lives and production processes. People's demand for artificial intelligence is not only satisfied with the analysis, processing and perception of data, but also includes the use of mobile intelligent bodies such as physical robots, drones or automatic guided vehicles to perform unmanned intelligent tasks such as intelligent transportation, warehouse management, and automated production.
[0003] In the actual application scenarios of mobile agents, in order to ensure that multiple mobile agents can efficiently collaborate to complete tasks in complex environments, it is necessary to scientifically and reasonably design the paths of the mobile agent cluster. In order to better balance the efficiency of collaborative planning and the quality of the path, it is necessary to plan a feasible path that saves operating costs, increases task efficiency, and optimizes specific performance indicators. Therefore, it is particularly important to find a safe, collision-free, and efficient path for each mobile agent in a complex actual environment so that the mobile agent can quickly reach the target location to complete the task.
[0004] In the prior art, the path of a mobile agent is usually determined according to pre-set rules or based on some heuristic function. However, the efficiency of path planning in complex environments is low and has high limitations, and it is easy to fail to find the optimal path. Summary of the invention
[0005] The main technical problem solved by the present application is how to improve the efficiency of path planning of a mobile agent. To this end, the present application provides a path planning method, a path planning device and a computer-readable storage medium.
[0006] In order to solve the above technical problems, a technical solution adopted in the present application is: providing a path planning method, the method comprising: performing priority path planning for multiple mobile agents; in response to the result of the priority path planning being no solution, obtaining an unsolvable conflict whose no-solution correlation is greater than a preset threshold; generating a spare node based on the mobile agent corresponding to the unsolvable conflict; using the spare nodes to expand the sub-nodes generated in the priority path planning, and re-performing priority path planning based on the expanded nodes to obtain the optimal path.
[0007] Among them, priority path planning is performed for multiple mobile agents, including: obtaining initial paths of the multiple mobile agents, and obtaining first conflicts between each pair of mobile agents based on the initial paths; generating two first sub-nodes based on each first conflict, each first sub-node including a first priority relationship for resolving the first conflict; and priority path planning is performed for the multiple mobile agents based on the first priority relationship in each first sub-node.
[0008] Among them, after priority path planning is performed for multiple mobile agents based on the priority relationship in each first sub-node, the path planning method includes: calculating the cost value of the path corresponding to each first sub-node; judging whether there is a second conflict between each mobile agent in the path corresponding to the lowest cost value; if so, expanding the first sub-node based on the second conflict and generating two second sub-nodes again, the second sub-node including the first priority relationship of the first sub-node and the second priority relationship of the second sub-node; and re-planning the path based on the second sub-node.
[0009] Among them, the path is re-planned based on the second sub-node, including: obtaining a first mobile agent with a lower priority in the second priority relationship; sorting all mobile agents with a priority lower than the first mobile agent based on the first priority relationship, the second priority relationship and the preset priority relationship of multiple mobile agents; and re-planning the path for each mobile agent in order from high to low according to the sorting results.
[0010] Among them, after re-planning the path for each mobile agent in order from high to low according to the sorting results, the path planning method also includes: updating the conflict information of the first sub-node containing the mobile agent after the re-planned path to obtain a third sub-node; and expanding the third sub-node based on the updated conflict information.
[0011] Among them, after priority path planning is performed on multiple mobile agents based on the priority relationship in each first sub-node, the path planning method also includes: recording the result of the priority path planning in the first conflict as an unsolvable conflict as a priority conflict; when the remaining first sub-nodes are expanded, when the priority conflict exists in the conflict set of the remaining first sub-nodes, the priority conflict is used to expand the remaining first sub-nodes.
[0012] Among them, re-priority path planning based on the expanded nodes to obtain the optimal path includes: obtaining planning information in the spare node; updating the first priority relationship in the expanded nodes based on the planning information to obtain the third priority relationship; and re-priority path planning based on the third priority relationship to obtain the optimal path.
[0013] Among them, after priority path planning is performed on multiple mobile agents, the path planning method also includes: determining whether there is a conflict in the path obtained by each sub-node generated by the priority path planning; if there is a conflict in the path obtained by each sub-node, confirming that the result of the priority path planning is unsolvable.
[0014] In order to solve the above technical problems, another technical solution adopted in the present application is: to provide a path planning device, which includes a processor and a memory, the memory is coupled to the processor, the memory stores program data, and the processor is used to execute the program data to implement the path planning method as mentioned above.
[0015] In order to solve the above technical problems, another technical solution adopted by the present application is: providing a computer-readable storage medium, which stores program data. When the program data is executed, it is used to implement the above path planning method.
[0016] The beneficial effects of the present application are as follows: Different from the prior art, the path planning method provided by the present application is applied to a path planning device, and the path planning device performs priority path planning for multiple mobile agents; in response to the result of the priority path planning being no solution, an unsolvable conflict with a solution-free correlation greater than a preset threshold is obtained; a spare node is generated based on the mobile agent corresponding to the unsolvable conflict; the spare nodes are used to expand the sub-nodes generated in the priority path planning, and priority path planning is re-performed based on the expanded nodes to obtain the optimal path. In the above manner, compared with conventional path planning methods, the method provided by the present application of expanding sub-nodes by generating spare nodes when there is no solution to the priority path planning improves the planning diversity of the priority path planning, reduces the situation where a solution needs to be found in a specific priority sequence when using the priority path planning, and thus improves the efficiency of path planning. BRIEF DESCRIPTION OF THE DRAWINGS
[0017] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.
[0018] in:
[0019] Figure 1 It is a flowchart of the first embodiment of the path planning method provided by the present application;
[0020] Figure 2 It is a schematic diagram of the overall process of applying the path planning method of the path planning device provided in the present application;
[0021] Figure 3 is a flow chart of the second embodiment of the path planning method provided by the present application;
[0022] Figure 4 It is a schematic diagram of the process of generating the first sub-node in the path planning method provided by the present application;
[0023] Figure 5 is a flowchart of a third embodiment of a path planning method provided by the present application;
[0024] Figure 6 It is a schematic diagram of sorting based on the priority relationship of mobile agents in an embodiment of the path planning method provided by the present application;
[0025] Figure 7 It is a schematic diagram of generating a spare node in an embodiment of a path planning method provided by the present application;
[0026] Figure 8 is a structural schematic diagram of the first embodiment of the path planning device provided by the present application;
[0027] Fig. 9 is a structural schematic diagram of a second embodiment of a path planning device provided by the present application;
[0028] Fig.10 It is a structural schematic diagram of an embodiment of a computer-readable storage medium provided by the present application. DETAILED DESCRIPTION
[0029] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.
[0030] The term "and / or" in this article is only a description of the association relationship of associated objects, indicating that there may be three relationships. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. In addition, the character " / " in this article generally indicates that the objects associated before and after are in an "or" relationship. In addition, "many" in this article means two or more than two. In addition, the term "at least one" in this article means any combination of at least two of any one or more of a plurality of, for example, including at least one of A, B, and C, can mean including any one or more elements selected from the set consisting of A, B, and C.
[0031] The path planning method provided in the present application is mainly applied to a path planning device, wherein the path planning device of the present application can be a server, or a system composed of a server and a terminal device cooperating with each other. Accordingly, the various parts included in the path planning device, such as various units, subunits, modules, and submodules, can all be set in the server, or can be set in the server and the terminal device respectively.
[0032] Furthermore, the above-mentioned server can be hardware or software. When the server is hardware, it can be implemented as a distributed server cluster consisting of multiple servers, or it can be implemented as a single server. When the server is software, it can be implemented as multiple software or software modules, such as software or software modules used to provide distributed servers, or it can be implemented as a single software or software module, which is not specifically limited here. In some possible implementations, the path planning method of the embodiment of the present application can be implemented by a processor calling a computer-readable instruction stored in a memory.
[0033] In the prior art, the method of mobile agent path planning usually regards the mobile agent to be planned as a particle, and solves the conflict between each mobile agent by constructing a constraint tree, but the solution efficiency is low.
[0034] Therefore, the present application provides a path planning method, which expands the path nodes planned by the mobile agent by mixing two path search methods, and improves the probability of obtaining an effective solution for path planning while ensuring the efficiency of path planning. The specific implementation method is described as follows.
[0035] See also Figure 1 and Figure 2 , Figure 1 It is a flowchart of the first embodiment of the path planning method provided by the present application; Figure 2 It is a schematic diagram of the overall process of applying the path planning method of the path planning device provided in this application.
[0036] Step 11: Perform priority path planning for multiple mobile agents.
[0037] A mobile agent is an independent, intelligent, mobile entity that can replace humans in complex environments. In some embodiments, the mobile agent can be a mobile robot, such as a mobile robot that operates on the ground, in the air, on the water, and underwater. The mobile agent can also be an automatic guided vehicle or the like, which acts by receiving manual instructions or according to a preset program in the agent.
[0038] In one embodiment of the present application, the path planning device uses Figure 3 The method shown in the figure performs priority path planning for multiple mobile agents, see Figure 3 , Figure 3 It is a flowchart of the second embodiment of the path planning method provided in this application.
[0039] Step 31: Obtain initial paths of multiple mobile agents, and obtain the first conflict between any two mobile agents based on the initial paths.
[0040] Specifically, the path planning device obtains the initial paths of the multiple mobile agents, and the initial paths may include the initial positions of the mobile agents, each path node that needs to be passed through to complete the corresponding tasks, and the final destination.
[0041] For example, there are two mobile agents a1 and a2. The initial path of mobile agent a1 is A->B->D->F, that is, the initial position of mobile agent a1 is A, and it needs to pass through points B and D to finally reach point F; the initial path of mobile agent a2 is C->E->D->F, that is, the initial position of mobile agent a2 is C, and it needs to pass through points E and D to finally reach point F.
[0042] Specifically, the path planning device obtains the first conflict between the two mobile agents according to the initial path of the mobile agent. Continuing with the above mobile agent as an example, a1 and a2 both need to pass through point D at t3, then there is a point conflict between a1 and a2, recorded as (a1, a2, D, t4), indicating that a1 and a2 occupy the same vertex D at t3.
[0043] In some embodiments, the first conflict may also be an edge conflict. For example, in the above example, there is a mobile agent a3, and the initial path of a3 is B->A->E->F. Then a1 and a3 travel in opposite directions on the same path from t1 to t2, so there is an edge conflict between a1 and a3, which is recorded as (a1, a3, A, B, t2).
[0044] Step 32: Generate two first child nodes based on each first conflict, each first child node including a first priority relationship for resolving the first conflict.
[0045] In one embodiment of the present application, the path planning device uses Figure 4 The method shown generates the first child node. Figure 4 , Figure 4 It is a flowchart of generating the first sub-node in the path planning method provided in this application.
[0046] like Figure 4As shown, in the first conflict (a1, a2), the path planning device expands the first conflict into two first child nodes. The first priority relationship of the left node can be a1 < a2, and the first priority relationship of the right node can be a1 > a2. The first priority relationship in the left node and the right node can be set according to user needs. That is, in some embodiments, the first priority relationship in the left node can also be a1 > a2, and the first priority relationship in the right node can also be a1 < a2.
[0047] Step 33: Perform priority path planning for multiple mobile agents based on the first priority relationship in each first child node.
[0048] Specifically, the path planning device performs path planning for each first child node according to the first priority relationship, so that the paths of the two mobile agents involved in the first conflict in each first child node do not collide.
[0049] Specifically, after performing priority path planning for multiple mobile agents based on the priority relationship in each first child node, the path planning device calculates the cost value of the path corresponding to each first child node. For example, if the path of mobile agent a1 after planning for a first child node is A -> B -> B -> D -> F, and the path of mobile agent a2 is C -> E -> D -> F, then the cost value corresponding to this child node is 7.
[0050] Specifically, after the path planning device obtains the cost value of the path corresponding to each first child node, it obtains the first child node with the lowest cost value, and determines whether there is a second conflict between each mobile agent in the path corresponding to the lowest cost value; if so, it expands the first child node based on the second conflict to generate two second child nodes again.
[0051] Continuing with the above example, if there is still an edge conflict between mobile agent a1 and mobile agent a2 at t = t4 after the first planning, then continue to expand the first child node to generate two second child nodes. The second child nodes include the first priority relationship of the first child node and the second priority relationship of the second child node; re-plan the path based on the second child nodes.
[0052] In an embodiment of the present application, the path planning device uses the method as Figure 5 shown to re-plan the path based on the second child nodes. Refer to Figure 5 , Figure 5 which is a schematic flowchart of the third embodiment of the path planning method provided by the present application.
[0053] Step 51: Obtain the first mobile agent with the lower priority in the second priority relationship.
[0054] Specifically, the path planning device performs a priority topological sorting on the first mobile agents with lower priorities among the second priorities in the second child nodes, where the sorting result points from the lower priority to the higher priority. For the schematic diagram of the topological sorting, reference can be made to Figure 6 , Figure 6 which is the schematic diagram of the sorting based on the priority relationship of the mobile agents in an embodiment of the path planning method provided by this application.
[0055] Step 52: Based on the first priority relationship, the second priority relationship, and the preset priority relationships of multiple mobile agents, sort all the mobile agents with priorities lower than that of the first mobile agent.
[0056] Please continue to refer to Figure 6 , the preset priority relationship and the first priority relationship of the root node of the currently expanded second child node include a1 < a3, a2 < a4, a5 < a1, a7 < a1, a8 < a7, and the second conflict is between a1 and a2. Taking the second priority relationship in the second child node as a1 < a2 as an example, the priorities include a1 < a3, a2 < a4, a5 < a1, a7 < a1, a8 < a7, a1 < a2. The path planning device finds all the mobile agents a7, a8, a5 with priorities lower than that of a1; and performs a topological sorting (from lower priority to higher priority) on a1, a7, a8, a5 as: a8, a7, a5, a1.
[0057] Step 53: Re - perform path planning for each mobile agent in the order from high to low according to the sorting result.
[0058] Specifically, the path planning device sequentially selects a currently highest - priority mobile agent from the sorting result for path planning, and removes the mobile agent after path planning from the sorting result. In addition, for example, when re - planning the path of the mobile agent a1, it is also necessary to consider the paths of the mobile agents a2, a3, and a4 with priorities higher than that of a1 to ensure that the path of a1 does not conflict with the paths of the mobile agents with priorities higher than a1.
[0059] Specifically, the path planning device updates the conflict information of the first child node containing the mobile agent with the re - planned path to obtain a third child node, and expands the third child node based on the updated conflict information.
[0060] Specifically, after performing priority path planning on multiple mobile agents based on the priority relationships in each first child node, the path planning device records the conflicts with the result of the priority path planning being无解 as the priority conflicts; when expanding the remaining first child nodes, when the priority conflicts exist in the conflict sets of the remaining first child nodes, use the priority conflicts to expand the remaining first child nodes.
[0061] In the above manner, the path planning device prioritizes path planning for the two mobile agents that may cause no solution, thereby increasing the probability of obtaining a solvable path. Even if all path planning results of the two mobile agents are no solution, it can be discovered early, thereby reducing redundant steps in path planning.
[0062] Specifically, the path planning device determines whether there is a conflict in the path obtained by each sub-node generated by the priority path planning. If there is a conflict in the path obtained by each sub-node, it is confirmed that the result of the priority path planning is unsolvable.
[0063] Step 12: In response to the result of the priority path planning being that there is no solution, obtaining an unsolvable conflict whose unsolvable correlation is greater than a preset threshold.
[0064] Specifically, the path planning device uses the number of times that the priority relationship that causes no solution causes no solution recorded in the process of iterative generation of the entire sub-node as the no solution correlation, and selects the priorities involved in the no solution conflict in which the no solution correlation is greater than the preset threshold, and the two mobile agents involved in each priority are ai and aj respectively. The size of the preset threshold can be set according to user needs and is not limited here.
[0065] Step 13: Generate a backup node based on the mobile agent corresponding to the unsolvable conflict.
[0066] Specifically, the method for generating a spare node by the path planning device is as follows: Figure 7 As shown, Figure 7 The schematic diagram of generating a backup node in the first embodiment of the path planning method provided by the present application is shown in FIG. The path planning device uses multiple conflicts (a1, a2), (a2, a4), and (a3, a4) between mobile agents as root nodes, and performs a conflict-based path search on each group of two mobile agents in conflict to iteratively generate multiple child nodes.
[0067] Among the pre-generated nodes, if a node can be generated by calling a conflict-based search method according to two mobile agents corresponding to an unsolvable conflict, the node is added to the expandable node set of the path planning device as a spare node.
[0068] Step 14: Use the spare nodes to expand the sub-nodes generated in the priority path planning, and re-perform the priority path planning based on the expanded nodes to obtain the optimal path.
[0069] Specifically, the path planning device obtains planning information in the spare node; obtains a third priority relationship based on the first priority relationship in the node after updating and expanding the planning information; and re-performs priority path planning based on the third priority relationship to obtain an optimal path.
[0070] The planning information includes two mobile agents involved in applying the conflict-based search method to generate backup nodes. For example, in the expanded node, the mobile agent that currently needs to re-plan the path is a1, and the backup nodes are a1 and a3. In the first priority relationship, a3 needs to be used as a high-priority mobile agent of a1, so as to obtain the final third priority relationship.
[0071] By means of the above method, it is possible to avoid that the path of the mobile agent after re-priority path planning conflicts with the path of a mobile agent with a higher priority, thereby reducing the trial and error steps of path planning.
[0072] Different from the prior art, the path planning method provided by the present invention is applied to a path planning device, and the path planning device performs priority path planning for multiple mobile agents; in response to the result of the priority path planning being no solution, an unsolvable conflict with a solution-free correlation greater than a preset threshold is obtained; a spare node is generated based on the mobile agent corresponding to the unsolvable conflict; the spare nodes are used to expand the sub-nodes generated in the priority path planning, and priority path planning is re-performed based on the expanded nodes to obtain the optimal path. Through the above manner, compared with conventional path planning methods, the method provided by the present application of expanding sub-nodes by generating spare nodes when there is no solution to the priority path planning improves the planning diversity of the priority path planning, reduces the situation where a solution needs to be found in a specific priority sequence when using the priority path planning, and thus improves the efficiency of the path planning.
[0073] The method of the above embodiment can be implemented by using a path planning device. Figure 8 Describe, Figure 8 It is a structural schematic diagram of the first embodiment of the path planning device provided in this application.
[0074] like Figure 8 As shown, the path planning device 80 of the embodiment of the present application includes a priority path planning module 81, a judgment module 82, a backup node generation module 83 and a node expansion module 84.
[0075] Among them, the priority path planning module 81 is used to perform priority path planning for multiple mobile agents.
[0076] The judgment module 82 is used for obtaining unsolvable conflicts with an unsolvable correlation greater than a preset threshold in response to the result of the priority path planning being unsolvable.
[0077] The spare node generation module 83 is used to generate spare nodes based on the mobile agents corresponding to the unsolvable conflicts.
[0078] The node expansion module 84 is used to expand the sub-nodes generated in the priority path planning using the spare nodes, and re-plan the priority path based on the expanded nodes to obtain the optimal path.
[0079] The method of the above embodiment can be implemented by using a path planning device. Fig. 9 , Fig. 9 1 is a schematic diagram of the structure of the second embodiment of the path planning device provided by the present application. The path planning device 90 includes a memory 91 and a processor 92. The memory 91 is used to store program data, and the processor 92 is used to execute the program data to implement the following method:
[0080] Priority path planning is performed for multiple mobile agents; in response to a result of the priority path planning being unsolvable, an unsolvable conflict whose unsolvable solution correlation is greater than a preset threshold is obtained; a spare node is generated based on the mobile agent corresponding to the unsolvable conflict; the sub-nodes generated in the priority path planning are expanded using the spare nodes, and priority path planning is re-performed based on the expanded nodes to obtain an optimal path.
[0081] The method of the above embodiment can be implemented using a computer-readable storage medium. Fig.10 , Fig.10 1 is a schematic diagram of a computer-readable storage medium according to an embodiment of the present application. The computer-readable storage medium 100 stores program data 101. When the program data 101 is executed by a processor, it is used to implement the following method:
[0082] Priority path planning is performed for multiple mobile agents; in response to a result of the priority path planning being unsolvable, an unsolvable conflict whose unsolvable solution correlation is greater than a preset threshold is obtained; a spare node is generated based on the mobile agent corresponding to the unsolvable conflict; the sub-nodes generated in the priority path planning are expanded using the spare nodes, and priority path planning is re-performed based on the expanded nodes to obtain an optimal path.
[0083] When the embodiments of the present application are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including several instructions to enable a computer device (which can be a personal computer, a server, or a network device, etc.) or a processor (processor) to perform all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM, Read-Only Memory), a random access memory (RAM, Random Access Memory), a disk or an optical disk.
[0084] The above description is only an implementation method of the present application, and does not limit the patent scope of the present application. Any equivalent structure or equivalent process transformation made using the contents of the present application specification and drawings, or directly or indirectly used in other related technical fields, are also included in the patent protection scope of the present application.
Claims
1. A path planning method, It is characterized in that The path planning method comprises: Prioritize path planning for multiple mobile agents; In response to a result of the priority path planning being that there is no solution, obtaining an unsolvable conflict having an unsolvable solution correlation greater than a preset threshold; Generating a spare node based on the mobile agent corresponding to the unsolvable conflict; The spare nodes are used to expand the sub-nodes generated in the priority path planning, and the priority path planning is re-performed based on the expanded nodes to obtain the optimal path.
2. The path planning method according to claim 1, It is characterized in that The priority path planning for multiple mobile agents includes: Acquire initial paths of a plurality of the mobile agents, and obtain first conflicts between each pair of the mobile agents based on the initial paths; generating two first child nodes based on each of the first conflicts, each of the first child nodes including a first priority relationship for resolving the first conflict; Priority path planning is performed for a plurality of the mobile agents based on the first priority relationship in each of the first sub-nodes.
3. The path planning method according to claim 2, It is characterized in that After performing priority path planning for the plurality of mobile agents based on the priority relationship in each of the first sub-nodes, the path planning method includes: Calculate the cost value of the path corresponding to each of the first child nodes; Determine whether there is a second conflict between each of the mobile agents in the path corresponding to the lowest cost value; If yes, then based on the second conflict, the first sub-node is expanded to generate two second sub-nodes again, wherein the second sub-nodes include the first priority relationship of the first sub-node and the second priority relationship of the second sub-node; The path is replanned based on the second sub-node.
4. The path planning method according to claim 3, It is characterized in that The replanning of the path based on the second sub-node includes: Acquire a first mobile agent with a lower priority in the second priority relationship; Based on the first priority relationship, the second priority relationship, and the preset priority relationship of the plurality of mobile agents, sorting all the mobile agents having a lower priority than the first mobile agent; The path planning is performed again for each mobile agent according to the sorting results from high to low.
5. The path planning method according to claim 4, It is characterized in that After re-planning the path for each mobile agent in descending order of the ranking results, the path planning method further includes: Updating the conflict information of the first child node including the mobile agent after the re-planned path to obtain a third child node; The third child node is expanded based on the updated conflict information.
6. The path planning method according to claim 2, It is characterized in that After performing priority path planning for the plurality of mobile agents based on the priority relationship in each of the first sub-nodes, the path planning method further includes: Recording the conflict in which the result of the priority path planning in the first conflict is unsolvable as a priority conflict; When the remaining first sub-nodes are expanded, when the priority conflict exists in the conflict set of the remaining first sub-nodes, the remaining first sub-nodes are expanded using the priority conflict.
7. The path planning method according to claim 2, It is characterized in that The re-planning of the priority path based on the expanded nodes to obtain the optimal path includes: Obtaining planning information in the standby node; updating the first priority relationship in the expanded node based on the planning information to obtain a third priority relationship; The priority path planning is re-performed based on the third priority relationship to obtain an optimal path.
8. The path planning method according to claim 1, It is characterized in that After performing priority path planning on the plurality of mobile agents, the path planning method further includes: Determine whether there is a conflict in the path obtained by each of the sub-nodes generated by the priority path planning; If there is a conflict in the path obtained by each of the child nodes, it is confirmed that the result of the priority path planning is unsolvable.
9. A path planning device, It is characterized in that The path planning device includes a memory and a processor coupled to the memory; The memory is used to store program data, and the processor is used to execute the program data to implement the path planning method as described in any one of claims 1 to 8.
10. A computer storage medium, It is characterized in that The computer storage medium is used to store program data, and when the program data is executed by a computer, it is used to implement the path planning method according to any one of claims 1 to 8.
Citation Information
Cited By
Path optimization method and device and storage medium
CN121477873A
