Multi-robot path planning method and device and electronic equipment
By detecting and re-planning multi-robot path conflicts, the improved A* search algorithm solves the problem of inefficiency of traditional algorithms in large maps and multi-robot environments, achieving faster and accurate path planning.
Patent Information
- Application Number
- CN202411188101.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-28
- Publication Date
- 2024-12-03
AI Technical Summary
Traditional multi-robot path planning algorithms have problems such as long solution time, low path planning efficiency, and inaccurate planning of optimal paths in large maps and multi-robot environments.
By detecting the conflict types and attributes of robot path conflicts, re-plan the path using different path search algorithms (such as the improved A* search algorithm) until there is no conflict and output the optimal path.
The solution time is shortened, the path planning efficiency is improved, and the optimization of multi-robot paths is ensured.
Smart Images

Figure CN119063734A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the technical field of path planning, and in particular to a multi-robot path planning method, device and electronic equipment. Background Art
[0002] In modern intelligent systems, multi-robot path planning is an important and complex task, which requires multiple robots to move from a starting position to a target position in a known complex environment while avoiding collisions with other robots. With the rise of applications such as autonomous vehicles, logistics robots, and collaborative drones, multi-robot path planning has gradually become a research hotspot in recent years.
[0003] In the related art, the conflict-based search (CBS) algorithm is usually used for multi-robot path planning. However, as the map becomes larger and the number of robots increases, the traditional CBS algorithm will have problems such as extended solution time, low path planning efficiency, and inability to accurately plan the optimal path when performing path planning. Summary of the invention
[0004] In view of this, the embodiments of the present application provide a multi-robot path planning method, device and electronic device to solve the technical problems of related technologies in multi-robot path planning, such as long solution time, low path planning efficiency and inability to accurately plan the optimal path.
[0005] In a first aspect, an embodiment of the present application provides a multi-robot path planning method, comprising:
[0006] Obtaining starting positions and target positions corresponding to a plurality of robots in the map, respectively, performing path planning based on the starting positions and target positions of each robot, and determining an optimal path for each robot;
[0007] Detecting whether there is a path conflict between the optimal paths of the robots; if there is a path conflict between the optimal paths of any two robots, detecting the conflict type of the path conflict, and determining the conflict attribute of the path conflict according to the conflict type; the conflict attribute includes a conflict attribute that can avoid replanning and a conflict attribute that cannot avoid replanning;
[0008] According to the conflict attribute, a corresponding path search algorithm is used to re-plan the path of the robot corresponding to the path conflict to obtain a new optimal path as the optimal path;
[0009] The step of detecting whether there is a path conflict in the optimal path of each robot is re-executed until there is no path conflict in the optimal path of each robot, and the current optimal path of each robot is output.
[0010] In a possible implementation manner of the first aspect, the conflict types include vertex conflicts and edge conflicts;
[0011] The determining the conflict attribute of the path conflict according to the conflict type includes:
[0012] If the path conflict is a vertex conflict, the vertex conflict type of the path conflict is determined according to the load conditions of the two robots and the driving directions at the last moment when the path conflict occurred, and the conflict attribute of the path conflict is determined according to the vertex conflict type; wherein the vertex conflict types include intersection vertex conflict, opposite vertex conflict, map vertex intersection vertex conflict and pursuit vertex conflict;
[0013] If the path conflict is an edge conflict, the conflict attribute of the path conflict is determined to be a conflict attribute of unavoidable replanning.
[0014] In a possible implementation manner of the first aspect, the load condition includes a loaded state and a no-load state;
[0015] Determining the vertex conflict type of the path conflict according to the load conditions of the two robots and the driving directions at the last moment when the path conflict occurred includes:
[0016] Detecting the load conditions of the two robots;
[0017] If the two robots were traveling sideways at the last moment when the path conflict occurred, and the vertex corresponding to the path conflict is not located at the vertex of the map, then the path conflict is determined to be a cross vertex conflict;
[0018] If the two robots were traveling in opposite directions at the last moment when the path conflict occurred, then the path conflict is determined to be an opposite vertex conflict;
[0019] If the two robots have different load conditions and are traveling in the same direction at the last moment when the path conflict occurs, and the robot in the unloaded state lags behind the robot in the loaded state at the last moment when the path conflict occurs, then the path conflict is determined to be a pursuit vertex conflict;
[0020] If the two robots were traveling sideways at the last moment when the path conflict occurred, and the vertex corresponding to the path conflict is located at the vertex of the map, then it is determined that the path conflict is a map vertex intersection vertex conflict.
[0021] In a possible implementation of the first aspect, determining the conflict attribute of the path conflict according to the vertex conflict type includes:
[0022] If the vertex conflict type is a crossing vertex conflict, an opposing vertex conflict, or a pursuing vertex conflict, determining the conflict attribute of the path conflict to be a conflict attribute that can avoid replanning;
[0023] If the vertex conflict type is a map vertex intersection vertex conflict, then the conflict attribute of the path conflict is determined to be a conflict attribute of unavoidable replanning.
[0024] In a possible implementation of the first aspect, the path search algorithm includes a first path search algorithm and a second path search algorithm;
[0025] Before re-planning the optimal path corresponding to the path conflict by using a corresponding path search algorithm according to the conflict attribute to obtain a new optimal path as the optimal path, the method further includes:
[0026] According to the load conditions of the two robots, setting constraint conditions; the constraint conditions include a first constraint condition and a second constraint condition;
[0027] The method of re-planning the path of the robot corresponding to the path conflict by using a corresponding path search algorithm according to the conflict attribute to obtain a new optimal path as the optimal path includes:
[0028] If the conflict attribute is a conflict attribute that can avoid re-planning, based on the first constraint condition, using a first path search algorithm to re-plan the path of the robot corresponding to the path conflict;
[0029] If the conflict attribute is a conflict attribute that cannot be avoided by re-planning, then based on the second constraint condition, a second path search algorithm is used to re-plan the path of the robot corresponding to the path conflict.
[0030] In a possible implementation manner of the first aspect, setting the constraint condition according to load conditions of the two robots includes:
[0031] If the load conditions of the two robots are the same, a first constraint condition prohibiting the two robots from occupying a target vertex or a target edge is set for each of the two robots;
[0032] If the load conditions of the two robots are different, a second constraint condition is set to prohibit the robot in the unloaded state among the two robots from occupying the target vertex or the target edge;
[0033] The target vertex is a vertex in a path conflict whose conflict type is vertex conflict, and the target edge is an edge in a path conflict whose conflict type is edge conflict.
[0034] In a possible implementation of the first aspect, the first path search algorithm is a first improved A* search algorithm;
[0035] The re-planning of the path of the robot corresponding to the path conflict by using a first path search algorithm based on the first constraint condition includes:
[0036] According to the starting position and the target position of the two robots and the first constraint condition, the paths of the two robots are replanned using the first improved A* search algorithm; wherein the heuristic function h1 of the first improved A* search algorithm is
[0037]
[0038] In the formula, x(s) and x(g) are the x-coordinate of the robot's starting position and the x-coordinate of the target position, y(s) and y(g) are the y-coordinate of the robot's starting position and the y-coordinate of the target position, respectively, and k is a numeric value. dx is the absolute value of the difference between the x-coordinate of the robot's starting position and the x-coordinate of the target position, and dy is the absolute value of the difference between the y-coordinate of the robot's starting position and the y-coordinate of the target position.
[0039] In a possible implementation manner of the first aspect, the second path search algorithm is a second improved A* search algorithm;
[0040] The re-planning of the path of the robot corresponding to the path conflict by using a second path search algorithm based on the second constraint condition includes:
[0041] According to the starting position and the target position of the robot in the unloaded state among the two robots and the second constraint condition, the path of the robot in the unloaded state is replanned using the second improved A* search algorithm; wherein the heuristic function h2 of the second improved A* search algorithm is
[0042]
[0043] In the formula, δ is the adaptive factor, cross is the cross influence factor, and d(s) is the diagonal distance from the robot's starting position to the target position.
[0044] In a second aspect, an embodiment of the present application provides a multi-robot path planning device, comprising:
[0045] An acquisition module, used to acquire the starting position and target position corresponding to each of the multiple robots in the map, perform path planning based on the starting position and target position of each robot, and determine the optimal path of each robot;
[0046] A determination module, used to detect whether there is a path conflict between the optimal paths of the robots, and if there is a path conflict between the optimal paths of any two robots, detect the conflict type of the path conflict, and determine the conflict attribute of the path conflict according to the conflict type; the conflict attribute includes a conflict attribute that can avoid replanning and a conflict attribute that cannot avoid replanning;
[0047] An obtaining module is used to re-plan the path of the robot corresponding to the path conflict by using a corresponding path search algorithm according to the conflict attribute, and obtain a new optimal path as the optimal path;
[0048] The output module is used to re-execute the step of detecting whether there is a path conflict in the optimal path of each robot until there is no path conflict in the optimal path of each robot, and output the current optimal path of each robot.
[0049] In a third aspect, an embodiment of the present application provides an electronic device comprising a memory and a processor, wherein the memory stores a computer program that can be run on the processor, and when the processor executes the computer program, the multi-robot path planning method as described in any one of the first aspects is implemented.
[0050] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, which stores a computer program. When the computer program is executed by a processor, it implements the multi-robot path planning method as described in any one of the first aspects.
[0051] In a fifth aspect, an embodiment of the present application provides a computer program product. When the computer program product is run on an electronic device, the electronic device executes the multi-robot path planning method described in any one of the first aspects above.
[0052] It can be understood that the beneficial effects of the second to fifth aspects mentioned above can be found in the relevant description of the first aspect mentioned above, and will not be repeated here.
[0053] The multi-robot path planning method, device and electronic device provided in the embodiments of the present application perform path planning for each robot and determine the optimal path for each robot. Then, when it is detected that there is a path conflict between the optimal paths of any two robots, the conflict attributes of the path conflict are determined according to the conflict type of the path conflict. Here, the conflict attributes include conflict attributes that can avoid re-planning and conflict attributes that cannot avoid re-planning. Then, for different conflict attributes, different path search algorithms are used to re-plan the paths of the corresponding robots, and the optimal paths of each robot are repeatedly detected to see if there is a path conflict until there is no path conflict for the optimal paths of each robot, and the current optimal path of each robot is output. In this way, different conflict types of path conflicts are distinguished, the conflict attributes of the path conflicts are determined, and different path search algorithms are used to re-plan the paths for different conflict attributes, which can shorten the solution time, improve the path planning efficiency, and accurately plan the optimal paths of multiple robots.
[0054] It is to be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present specification. BRIEF DESCRIPTION OF THE DRAWINGS
[0055] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for use in the embodiments or the description of the prior art 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 paying any creative work.
[0056] Figure 1 It is a schematic diagram of an application scenario provided by an embodiment of the present application;
[0057] Figure 2 It is a flowchart of a multi-robot path planning method provided by an embodiment of the present application;
[0058] Figure 3 is a schematic diagram of vertex conflict types provided by an embodiment of the present application;
[0059] Figure 4 is a schematic diagram of the number of robots and solution time provided by an embodiment of the present application;
[0060] Figure 5 is a path planning diagram of multiple robots provided in an embodiment of the present application;
[0061] Figure 6 is a schematic diagram of the structure of a multi-robot path planning device provided in one embodiment of the present application;
[0062] Figure 7 It is a schematic diagram of the structure of an electronic device provided in one embodiment of the present application. DETAILED DESCRIPTION
[0063] The present application is described more clearly below in conjunction with specific embodiments. The following embodiments will help those skilled in the art to further understand the effects of the present application, but are not intended to limit the present application in any form. It should be noted that, for those of ordinary skill in the art, several variations and improvements may be made without departing from the concept of the present application. These all fall within the scope of protection of the present application.
[0064] It should be understood that when used in the present specification and the appended claims, the term "comprising" indicates the presence of described features, wholes, steps, operations, elements and / or components, but does not exclude the presence or addition of one or more other features, wholes, steps, operations, elements, components and / or combinations thereof.
[0065] It should also be understood that the term “and / or” used in the specification and appended claims refers to any and all possible combinations of one or more of the associated listed items, and includes these combinations.
[0066] In the description of the present application specification and the appended claims, the terms "first", "second", "third", etc. are only used to distinguish the descriptions and cannot be understood as indicating or implying relative importance.
[0067] References to "one embodiment" or "some embodiments" etc. described in the specification of this application mean that one or more embodiments of the present application include specific features, structures or characteristics described in conjunction with the embodiment. Therefore, the statements "in one embodiment", "in some embodiments", "in some other embodiments", "in some other embodiments", etc. that appear in different places in this specification do not necessarily refer to the same embodiment, but mean "one or more but not all embodiments", unless otherwise specifically emphasized in other ways. The terms "including", "comprising", "having" and their variations all mean "including but not limited to", unless otherwise specifically emphasized in other ways.
[0068] In addition, the “plurality” mentioned in the embodiments of the present application should be interpreted as two or more.
[0069] The inventors have found that the CBS algorithm is usually used in related technologies for multi-robot path planning. The CBS lower-level algorithm determines the optimal path for each robot. The CBS upper-level algorithm traverses the obtained optimal paths, detects whether there are conflicts between the optimal paths, and imposes constraints when there are conflicts. The CBS lower-level algorithm re-plans the optimal paths of the corresponding robots until all the obtained optimal paths are conflict-free.
[0070] However, with the increase in the size of the map and the number of robots, the traditional CBS lower-level algorithm will search for many useless paths when performing path planning for a single robot, resulting in a longer solution time. At the same time, the increase in the size of the map and the number of robots leads to more and more complex path conflicts. The traditional CBS upper-level algorithm cannot distinguish between the various types of path conflicts and can only select a single CBS lower-level algorithm to re-plan the path, which ultimately leads to the inability to accurately plan the optimal path, waste time, and low path planning efficiency.
[0071] In order to plan the paths of multiple robots efficiently and accurately, the embodiment of the present application further detects and distinguishes the conflict types of the path conflicts when it detects that the optimal paths of any two robots have path conflicts, and determines the conflict attributes of the path conflicts according to the conflict types. Here, the conflict attributes are divided into conflict attributes that can avoid replanning and conflict attributes that cannot avoid replanning. After that, for different conflict attributes, different path search algorithms are used to replan the paths of the robots corresponding to the path conflicts, and repeatedly detect whether the optimal paths of each robot have path conflicts, until the optimal paths of each robot have no path conflicts, and output the current optimal paths of each robot. In this way, the solution time can be shortened, the efficiency of path planning can be improved, and the optimal paths of multiple robots can be accurately planned.
[0072] In order to make the purpose, technical solutions and advantages of the present invention more clear, specific embodiments will be described below in conjunction with the accompanying drawings.
[0073] First reference Figure 1 , Figure 1 The application scenario of the present application is schematically illustrated. In this application scenario, the electronic device obtains the starting point positions and target positions corresponding to multiple robots in the map, performs path planning based on the starting point position and target position of each robot, determines the optimal path of each robot, and then detects whether there is a path conflict in the optimal path of each robot. If there is a path conflict in the optimal paths of any two robots, the conflict type of the path conflict is detected, and the conflict attribute of the path conflict is determined according to the conflict type. Then, according to the conflict attribute, the robot corresponding to the path conflict is re-planned using the corresponding path search algorithm to obtain a new optimal path as the optimal path, and the step of detecting whether there is a path conflict in the optimal path of each robot is re-executed until there is no path conflict in the optimal path of each robot, and the current optimal path of each robot is output.
[0074] The conflict attributes include conflict attributes that can avoid replanning and conflict attributes that cannot avoid replanning. The robot may be an automated guided vehicle (AGV) or a logistics robot or other robot used for various purposes. The electronic device may be a hardware device with data storage, processing and analysis functions.
[0075] Combine the following Figure 1 ,refer to Figure 2 To describe the multi-robot path planning method provided according to an exemplary embodiment of the present application.
[0076] Figure 2 FIG. 1 is a flow chart of a multi-robot path planning method provided by an embodiment of the present application. Figure 2 As shown, the method in the embodiment of the present application may include:
[0077] Step 201: Obtain the starting positions and target positions corresponding to a plurality of robots in the map, perform path planning based on the starting positions and target positions of each robot, and determine the optimal path for each robot.
[0078] Exemplarily, in this embodiment, the map may be a grid map or the like, which is a known map. The starting position of the robot may be represented by the starting point coordinates, and the target position is the final destination to be reached by the robot, which may be represented by the target coordinates. In addition, the grid map also includes relevant data of obstacles and the initial time of each robot. According to the starting position, target position and relevant data of obstacles of each robot, the CBS lower layer algorithm is used for path planning to obtain the optimal path of each robot from the corresponding starting position to the target position. Here, the CBS lower layer algorithm may be an A* search algorithm or the first improved A* search algorithm mentioned in the following embodiments, etc. The A* search algorithm is also called the A* algorithm or the A star algorithm, which is a heuristic search algorithm. It is a prior art to obtain the optimal path of each robot using the A* search algorithm, which will not be described in detail here.
[0079] Step 202: Detect whether there is a path conflict between the optimal paths of each robot. If there is a path conflict between the optimal paths of any two robots, detect the conflict type of the path conflict, and determine the conflict attribute of the path conflict according to the conflict type.
[0080] Exemplarily, in this embodiment, the CBS upper layer algorithm can be used to detect whether there is a path conflict in the optimal path of each robot, and when there is a path conflict in the optimal path of any two robots, the conflict type of the path conflict is determined. Here, the conflict types include vertex conflict and edge conflict. Vertex conflict means that any two robots jointly occupy the same vertex at the same time, and edge conflict means that any two robots jointly occupy the same edge at the same time (time period), that is, occupy a series of vertices that constitute the edge. Using the CBS upper layer algorithm to detect path conflicts and determine whether the path conflict is an edge conflict or a vertex conflict is a prior art and will not be repeated here.
[0081] It should be noted that when detecting whether there is a path conflict in the optimal path of each robot, it is possible to detect whether there is a path conflict between the optimal path of each robot and the optimal path of other robots in the order of time nodes, and when it is detected that there is a path conflict between the optimal paths of any two robots, stop detecting the path conflict, first execute the conflict type of detecting the path conflict and the subsequent related steps, and then re-execute the steps of detecting whether there is a path conflict in the optimal path of each robot.
[0082] It should be noted that the two robots mentioned in the following embodiments refer to two robots that have a path conflict.
[0083] Optionally, the above-mentioned conflict attributes include the conflict attributes of avoidable replanning path (Avoidable Replanning Path, ARP) and the conflict attributes of unavoidable replanning path (Unavoidable Replanning Path, URP). For the conflict attribute of avoidable replanning, it can be defined here as the conflict attribute that can avoid path conflict by making one robot wait, and for the conflict attribute of unavoidable replanning, if the strategy of making one robot wait is adopted to avoid conflict, the time cost of the waiting robot is too high, so the conflict attribute of unavoidable replanning can be defined here as the conflict attribute that cannot avoid path conflict by making one robot wait.
[0084] In a possible implementation manner, this embodiment may include steps A1 to A2 when determining the conflict attribute of the path conflict according to the conflict type.
[0085] A1. If the path conflict is a vertex conflict, the vertex conflict type of the path conflict is determined according to the load conditions of the two robots and the driving directions at the last moment when the path conflict occurred, and the conflict attributes of the path conflict are determined according to the vertex conflict type. Among them, the vertex conflict types include cross vertex conflict, opposite vertex conflict, map vertex cross vertex conflict and pursuit vertex conflict.
[0086] A2. If the path conflict is an edge conflict, then the conflict attribute of the path conflict is determined to be a conflict attribute of inevitable replanning.
[0087] Exemplarily, the load conditions in this embodiment include a loaded state and an unloaded state. The running speed of the robot in the unloaded state is higher than the running speed of the robot in the loaded state. For example, in this embodiment, the running speed of the robot in the unloaded state is set to be 1.5 times that of the robot in the loaded state.
[0088] In this embodiment, when the path conflict is detected as an edge conflict, it means that the two robots occupy the same edge at the same time (time period), and the path conflict cannot be avoided by letting one robot wait. Therefore, the conflict attribute of this type of path conflict is classified as the conflict attribute of inevitable replanning.
[0089] Vertex conflicts are more complicated, so in this embodiment, vertex conflicts are further differentiated into cross vertex conflicts, opposite vertex conflicts, map vertex cross vertex conflicts, and pursuit vertex conflicts, so as to more accurately determine the conflict attributes of path conflicts according to the vertex conflict types. Here, the relevant description of vertex conflict types can refer to the following embodiments, which will not be repeated here.
[0090] In some embodiments, when determining the vertex conflict type of the path conflict, steps B1 to B5 may be included.
[0091] B1. Check the load conditions of the two robots.
[0092] B2. If the two robots were traveling sideways at the last moment when the path conflict occurred, and the vertex corresponding to the path conflict is not located at the vertex of the map, then the path conflict is determined to be a cross vertex conflict.
[0093] B3. If the two robots were traveling in opposite directions at the last moment when the path conflict occurred, the path conflict is determined to be an opposite vertex conflict.
[0094] B4. If the load conditions of the two robots are different, they are traveling in the same direction at the last moment when the path conflict occurs, and the robot in the unloaded state lags behind the robot in the loaded state at the last moment when the path conflict occurs, then the path conflict is determined to be a pursuit vertex conflict.
[0095] B5. If the two robots were traveling sideways at the last moment before the path conflict occurred, and the vertex corresponding to the path conflict is located at the vertex of the map, then the path conflict is determined to be a map vertex intersection vertex conflict.
[0096] In some embodiments, when determining the conflict attributes of the path conflict based on the vertex conflict type, when the vertex conflict type is a cross-vertex conflict, an opposite-vertex conflict, or a pursuit vertex conflict, the conflict attributes of the path conflict can be determined as conflict attributes that can avoid replanning; when the vertex conflict type is a map vertex cross-vertex conflict, the conflict attributes of the path conflict can be determined as conflict attributes that cannot avoid replanning.
[0097] In this embodiment, refer to Figure 3 The mathematical representations of cross vertex conflicts and opposite vertex conflicts can be expressed as (a i ,a j ,V,t), that is, robot a i With robot a j At time t, they jointly occupy vertex V, and vertex V is not a vertex in the map. The difference is that the cross vertex conflict is robot a i With robot a j At time t-1, it is driving sideways, and the collision at the opposite vertex is robot a i With robot a j At time t-1, the robots are traveling in opposite directions. It can be seen that the above-mentioned intersection vertex conflicts and opposite vertex conflicts can be avoided by letting one of the two corresponding robots wait. Therefore, the conflict attributes of the corresponding path conflicts of the intersection vertex conflicts and opposite vertex conflicts are conflict attributes that can avoid replanning.
[0098] Map vertex intersection conflict is similar to intersection vertex conflict and can also be expressed as (a i ,a j ,V,t), and the difference from the cross vertex conflict is that in the map vertex cross vertex conflict, the vertex V is a vertex of the map, so there are only two traversable paths, and the path conflict cannot be avoided by letting one robot wait, so the map vertex cross vertex conflict can also be understood as a special edge conflict. In this way, the conflict attribute of the path conflict corresponding to the map vertex cross vertex conflict is the conflict attribute of inevitable replanning.
[0099] It should be noted that for cross-vertex conflicts, opposite-vertex conflicts, and map-vertex cross-vertex conflicts, the load conditions of the two robots corresponding to them can be the same or different, that is, the two robots can both be in an unloaded state or both be in a loaded state, or one can be in an unloaded state and the other in a loaded state.
[0100] The pursuit vertex conflict can also be expressed as)a i ,a j ,V,t), but the load conditions of the two robots corresponding to the pursuit vertex conflict are different, that is, the robot a in the unloaded state i Since the running speed is higher than the robot a in the load statej , at time t, both robots jointly occupy vertex V. In this way, the path conflict can be avoided by letting the robot in the unloaded state of the corresponding two robots wait. Therefore, the conflict attribute of the path conflict corresponding to the pursuit vertex conflict is a conflict attribute that can avoid replanning.
[0101] Optionally, in this embodiment, if it is detected that there is no path conflict in the optimal path of each robot, the current optimal path of each robot is output to complete the path planning of the multiple robots.
[0102] Step 203: According to the conflict attribute, a corresponding path search algorithm is used to re-plan the path of the robot corresponding to the path conflict, and a new optimal path is obtained as the optimal path.
[0103] The path search algorithm includes a first path search algorithm and a second path search algorithm. The path search algorithm may be an A* search algorithm, etc. In this embodiment, an improved A* search algorithm is used as an example for description.
[0104] Optionally, in this embodiment, before re-planning the path and obtaining a new optimal path as the optimal path, constraint conditions may be set according to the load conditions of the two robots. The above constraint conditions include a first constraint condition and a second constraint condition.
[0105] In some embodiments, if the load conditions of the two robots are the same, a first constraint condition is set for each of the two robots to prohibit them from occupying a target vertex or a target edge; if the load conditions of the two robots are different, a second constraint condition is set to prohibit the robot in an unloaded state from occupying a target vertex or a target edge.
[0106] The target vertex is a vertex in a path conflict whose conflict type is vertex conflict, and the target edge is an edge in a path conflict whose conflict type is edge conflict.
[0107] In this embodiment, the constraint condition is set according to the load conditions of the two robots that cause the path conflict. If both robots are in an unloaded state or in a loaded state, the first constraint condition is set as (a i ,V / X,t) and (a j ,V / X,t), that is, robot a i At time t, robot a is prohibited from occupying vertex V or edge X. j It is forbidden to occupy vertex V or edge X at time t. If one of the two robots is unloaded and the other is loaded, then the second constraint condition is set as (a i / j ,V / X,t), that is, the robot a in the unloaded state i or a j It is forbidden to occupy vertex V or edge X at time t.
[0108] In a possible implementation, when this embodiment re-plans the path and obtains a new optimal path as the optimal path, when the conflict attribute is a conflict attribute that can avoid re-planning, based on the first constraint condition, a first path search algorithm is used to re-plan the path of the robot corresponding to the path conflict; when the conflict attribute is a conflict attribute that cannot avoid re-planning, based on the second constraint condition, a second path search algorithm is used to re-plan the path of the robot corresponding to the path conflict.
[0109] In this embodiment, for path conflicts with different conflict attributes, different path search algorithms are used to re-plan the path of the corresponding robot. Compared with not distinguishing path conflicts and only selecting a single CBS algorithm to re-plan the path, this embodiment can select a more appropriate path search algorithm based on the conflict attributes, thereby improving the path planning efficiency and accurately planning the optimal path.
[0110] In some embodiments, the first path search algorithm is a first improved A* search algorithm. When the first path search algorithm is used to re-plan the path of the robot corresponding to the path conflict based on the first constraint condition, the first improved A* search algorithm can be used to re-plan the path of the two robots based on the starting position and the target position of the two robots and the first constraint condition. The heuristic function h1 of the first improved A* search algorithm is
[0111]
[0112] In the formula, x(s) and x(g) are the x-coordinate of the robot's starting position and the x-coordinate of the target position, y(s) and y(g) are the y-coordinate of the robot's starting position and the y-coordinate of the target position, respectively, and k is a numeric value. dx is the absolute value of the difference between the x-coordinate of the robot's starting position and the x-coordinate of the target position, and dy is the absolute value of the difference between the y-coordinate of the robot's starting position and the y-coordinate of the target position.
[0113] From the foregoing, it can be seen that the conflict attribute that can avoid re-planning is a conflict attribute that can avoid path conflict by making one robot wait. Therefore, for the path conflict corresponding to the conflict attribute that can avoid re-planning, the design feature of this embodiment is an improved A* search algorithm that ensures the optimality of the path while speeding up the path search speed.
[0114] Here, in order to achieve the optimality of the path while speeding up the path search speed, the present embodiment improves the heuristic function of the A* search algorithm. Commonly used heuristic function distance algorithms include Manhattan distance and Euclidean distance, etc., wherein the diagonal distance is a special case of the Euclidean distance, and compared with the Manhattan distance and the Euclidean distance, the diagonal distance is closer to the real distance. The inventor found that if the Manhattan distance is used in the present embodiment, the final output of the optimal path cannot be guaranteed, and the use of the Euclidean distance will expand too many useless nodes. Only when the distance from the starting position of the robot to the target position is infinitely close to the distance from the current position of the robot to the target position, the algorithm works best. Based on this idea, the present embodiment improves the diagonal distance algorithm by adding an optimization factor (i.e., k in the heuristic function h1) so that the improved diagonal distance represents the distance between two points closer to the terrain of the map.
[0115] In this way, the first improved A* search algorithm is characterized by ensuring path optimality while accelerating path search speed.
[0116] When the first improved A* search algorithm is used for path planning, the specific steps may include:
[0117] (1) Determine the robot's starting position (starting node), target position (target node) and initial time, and initialize the open list and closed list to store the nodes to be expanded and the nodes that have been expanded.
[0118] (2) Add the starting node to the open list, initialize g(n) to 0, and calculate h(n) using the heuristic function h1, where g(n) represents the cost from the starting node to the current node, and h(n) represents the cost from the current node to the target node.
[0119] (3) Select the node n whose node comprehensive evaluation function f(n) = g(n) + h(n) is the smallest from the open list, and jump to (6) when the current node is the target node, and jump to (4) when the current node is not the target node, where f(n) represents the total estimated cost from the starting node through the current node n to the target node.
[0120] (4) Based on the position and time of the current node, possible neighbor nodes are generated, and the value of g(n) and h(n) of each neighbor node is calculated, and the parent node information and f(n) value of the neighbor node are updated.
[0121] (5) Check whether there is a spatial and temporal conflict between the current node and its neighboring nodes. If so, the conflict information is fed back to the CBS upper-layer algorithm. If not, the neighboring node is added to the open list, and the process returns to (3). The current node is marked as an expanded node and moved to the closed list.
[0122] (6) Find the path from the start node to the target node, start backtracking from the target node, find the complete path through the parent node information of each node, output the complete path from the start node to the target node in chronological order, and obtain the final optimal path.
[0123] Here, the specific process and principle of using the first improved A* search algorithm for path planning can refer to the specific process and principle of the A* search algorithm in the prior art for path planning, and will not be described in detail here.
[0124] It should be noted that after re-planning the paths of the two robots respectively, new optimal paths corresponding to the two robots are obtained, and the new optimal path with the smallest total cost is selected from the two new optimal paths, and the new optimal path with the smallest total cost is used as the optimal path of the corresponding robot, while the optimal path of the other robot is not updated, that is, the original optimal path is maintained instead of being updated to a new optimal path.
[0125] If the total costs of the two new optimal paths are the same, a new optimal path is selected in the order from left to right in the map, and the new optimal path is used as the optimal path of the corresponding robot, while the optimal path of the other robot is not updated, that is, the original optimal path is maintained without being updated to a new optimal path.
[0126] In some embodiments, the second path search algorithm is a second improved A* search algorithm. When the second path search algorithm is used to re-plan the path of the robot corresponding to the path conflict based on the second constraint condition, the second improved A* search algorithm can be used to re-plan the path of the robot in the no-load state according to the starting position and target position of the robot in the no-load state among the two robots and the second constraint condition. The heuristic function h2 of the second improved A* search algorithm is
[0127]
[0128] In the formula, δ is the adaptive factor, cross is the cross influence factor, and d(s) is the diagonal distance from the robot's starting position to the target position.
[0129] As can be seen from the foregoing, the conflict attribute of inevitable replanning is a conflict attribute that cannot be avoided by making one robot wait. Therefore, for the path conflict corresponding to the conflict attribute of inevitable replanning, the design feature of this embodiment is an improved A* search algorithm that may sacrifice path optimality but ensures the fastest search speed.
[0130] Here, considering that the A* search algorithm usually moves quickly to any position in the initial stage, and near the end of the search, in order to achieve the fastest search speed, it is necessary to ensure that it can move to the target node accurately and quickly. Therefore, this embodiment improves the heuristic function of the A* search algorithm, introduces a weight δ (δ≥1) in the heuristic function, and reduces the weight when approaching the target node, thereby weakening the influence of the heuristic function.
[0131] In this way, the characteristic of the obtained second improved A* search algorithm is to ensure the fastest search speed but may sacrifice path optimality. The specific process and principle of using the second improved A* search algorithm for path planning can refer to the relevant description of using the first improved A* search algorithm for path planning in the aforementioned embodiment, which will not be repeated here.
[0132] In this embodiment, according to different conflict attributes, a suitable improved A* search algorithm is used to re-plan the path of the corresponding robot, which ensures the search speed, shortens the solution time and improves the path planning efficiency, while accurately planning the optimal path of multiple robots.
[0133] Step 204 , re-execute the step of detecting whether there is any path conflict in the optimal path of each robot, until there is no path conflict in the optimal path of each robot, and output the current optimal path of each robot.
[0134] In this embodiment, the CBS upper-layer algorithm is reused to detect whether there is a path conflict in the optimal path of each robot, that is, steps 202 to 203 are repeatedly executed until there is no path conflict in the optimal path of each robot, and the current optimal path of each robot is output to complete the path planning of multiple robots.
[0135] The multi-robot path planning method provided in the embodiment of the present application performs path planning for each robot and determines the optimal path of each robot. Then, when it is detected that there is a path conflict between the optimal paths of any two robots, the conflict attributes of the path conflict are determined according to the conflict type of the path conflict. Here, the conflict attributes include conflict attributes that can avoid re-planning and conflict attributes that cannot avoid re-planning. Then, for different conflict attributes, different path search algorithms are used to re-plan the paths of the corresponding robots, and the optimal paths of each robot are repeatedly detected to see if there is a path conflict until there is no path conflict for the optimal paths of each robot, and the current optimal path of each robot is output. In this way, different conflict types of path conflicts are distinguished, the conflict attributes of the path conflicts are determined, and different path search algorithms are used to re-plan the paths for different conflict attributes. This can shorten the solution time, improve the path planning efficiency, and accurately plan the optimal paths of multiple robots.
[0136] It should be understood that the size of the serial numbers of the steps in the above embodiments does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.
[0137] In order to verify the rapidity and efficiency of the multi-robot path planning method provided in the embodiment of the present application for multi-robot path planning, the multi-robot path planning method provided in the embodiment of the present application and the traditional CBS algorithm are used to perform path planning for different numbers of multi-robots, and the relationship between the number of robots and the solution time is obtained (refer to Figure 4 ), it can be seen that when performing multi-robot path planning, the multi-robot path planning method provided by the embodiment of the present application takes less time to solve than the traditional CBS algorithm, especially when the number of robots is large (greater than 8), the solution time is greatly shortened compared with the traditional CBS algorithm. This shows that the multi-robot path planning method provided by the embodiment of the present application is fast and efficient in multi-robot path planning.
[0138] The multi-robot path planning method provided in the embodiment of the present application and the traditional CBS algorithm are used to plan the paths of 15 robots. Figure 5 As shown, the path planning diagrams of 15 robots are obtained, among which, Figure 5 (a) is the path planning diagram obtained by using the traditional CBS algorithm to plan the paths of 15 robots. Figure 5 (b) is a path planning diagram obtained by performing path planning on 15 robots using the multi-robot path planning method provided in the embodiment of the present application. Figure 4 It can be seen that when performing path planning for 15 robots at the same time, the solution time of the multi-robot path planning method provided in the embodiment of the present application is greatly reduced, the path planning efficiency is improved, and the accuracy of the optimal path of each robot is also guaranteed.
[0139] Figure 6 Schematic diagram of the structure of a multi-robot path planning device provided by an embodiment of the present application. Figure 6 As shown, the multi-robot path planning device provided in this embodiment may include: an acquisition module 601, a determination module 602, a obtaining module 603 and an output module 604.
[0140] The acquisition module 601 is used to acquire the starting positions and target positions corresponding to the multiple robots in the map, perform path planning based on the starting positions and target positions of the robots, and determine the optimal path for the robots.
[0141] The determination module 602 is used to detect whether there is a path conflict between the optimal paths of the robots. If there is a path conflict between the optimal paths of any two robots, the conflict type of the path conflict is detected, and the conflict attributes of the path conflict are determined according to the conflict type; the conflict attributes include conflict attributes that can avoid replanning and conflict attributes that cannot avoid replanning.
[0142] The obtaining module 603 is used to re-plan the path of the robot corresponding to the path conflict by using a corresponding path search algorithm according to the conflict attribute, and obtain a new optimal path as the optimal path.
[0143] The output module 604 is used to re-execute the step of detecting whether there is any path conflict in the optimal path of each robot until there is no path conflict in the optimal path of each robot, and output the current optimal path of each robot.
[0144] Optionally, the conflict type includes vertex conflict and edge conflict; the determination module 602 is specifically used for:
[0145] If the path conflict is a vertex conflict, the vertex conflict type of the path conflict is determined according to the load conditions of the two robots and the driving directions at the last moment when the path conflict occurred, and the conflict attribute of the path conflict is determined according to the vertex conflict type; wherein the vertex conflict types include intersection vertex conflict, opposite vertex conflict, map vertex intersection vertex conflict and pursuit vertex conflict;
[0146] If the path conflict is an edge conflict, the conflict attribute of the path conflict is determined to be a conflict attribute of unavoidable replanning.
[0147] Optionally, the load condition includes a loaded state and a no-load state; the determination module 602 is further specifically configured to:
[0148] Detecting the load conditions of the two robots;
[0149] If the two robots were traveling sideways at the last moment when the path conflict occurred, and the vertex corresponding to the path conflict is not located at the vertex of the map, then the path conflict is determined to be a cross vertex conflict;
[0150] If the two robots were traveling in opposite directions at the last moment when the path conflict occurred, then the path conflict is determined to be an opposite vertex conflict;
[0151] If the two robots have different load conditions and are traveling in the same direction at the last moment when the path conflict occurs, and the robot in the unloaded state lags behind the robot in the loaded state at the last moment when the path conflict occurs, then the path conflict is determined to be a pursuit vertex conflict;
[0152] If the two robots were traveling sideways at the last moment of the path conflict, and the vertex corresponding to the path conflict is located at the vertex of the map, then it is determined that the path conflict is a map vertex intersection vertex conflict.
[0153] Optionally, the determining module 602 is further specifically configured to:
[0154] If the vertex conflict type is a crossing vertex conflict, an opposing vertex conflict, or a pursuing vertex conflict, determining the conflict attribute of the path conflict to be a conflict attribute that can avoid replanning;
[0155] If the vertex conflict type is a map vertex intersection vertex conflict, then the conflict attribute of the path conflict is determined to be a conflict attribute of unavoidable replanning.
[0156] Optionally, the path search algorithm includes a first path search algorithm and a second path search algorithm; the obtaining module 603 is further used for:
[0157] According to the load conditions of the two robots, setting constraint conditions; the constraint conditions include a first constraint condition and a second constraint condition;
[0158] Accordingly, the module 603 is specifically used for:
[0159] If the conflict attribute is a conflict attribute that can avoid re-planning, based on the first constraint condition, using a first path search algorithm to re-plan the path of the robot corresponding to the path conflict;
[0160] If the conflict attribute is a conflict attribute that cannot be avoided by re-planning, then based on the second constraint condition, a second path search algorithm is used to re-plan the path of the robot corresponding to the path conflict.
[0161] Optionally, obtaining module 603 is specifically used for:
[0162] If the load conditions of the two robots are the same, a first constraint condition prohibiting the two robots from occupying a target vertex or a target edge is set for each of the two robots;
[0163] If the load conditions of the two robots are different, a second constraint condition is set to prohibit the robot in the unloaded state among the two robots from occupying the target vertex or the target edge;
[0164] The target vertex is a vertex in a path conflict whose conflict type is vertex conflict, and the target edge is an edge in a path conflict whose conflict type is edge conflict.
[0165] Optionally, the first path search algorithm is a first improved A* search algorithm; the obtaining module 603 is specifically used for:
[0166] According to the starting position and the target position of the two robots and the first constraint condition, the paths of the two robots are replanned using the first improved A* search algorithm; wherein the heuristic function h1 of the first improved A* search algorithm is
[0167]
[0168] In the formula, x(s) and x(g) are the x-coordinate of the robot's starting position and the x-coordinate of the target position, y(s) and y(g) are the y-coordinate of the robot's starting position and the y-coordinate of the target position, respectively, and k is a numeric value. dx is the absolute value of the difference between the x-coordinate of the robot's starting position and the x-coordinate of the target position, and dy is the absolute value of the difference between the y-coordinate of the robot's starting position and the y-coordinate of the target position.
[0169] Optionally, obtaining module 603 is specifically used for:
[0170] The second path search algorithm is a second improved A* search algorithm;
[0171] The re-planning of the path of the robot corresponding to the path conflict by using a second path search algorithm based on the second constraint condition includes:
[0172] According to the starting position and the target position of the robot in the unloaded state among the two robots and the second constraint condition, the path of the robot in the unloaded state is replanned using the second improved A* search algorithm; wherein the heuristic function h2 of the second improved A* search algorithm is
[0173]
[0174] In the formula, δ is the adaptive factor, cross is the cross influence factor, and d(s) is the diagonal distance from the robot's starting position to the target position.
[0175] It should be noted that the information interaction, execution process, etc. between the above-mentioned devices / units are based on the same concept as the method embodiment of the present application. Their specific functions and technical effects can be found in the method embodiment part and will not be repeated here.
[0176] Figure 7 Schematic diagram of the structure of an electronic device provided by an embodiment of the present application. Figure 7As shown, the electronic device 700 of this embodiment includes: a processor 710 and a memory 720, wherein the memory 720 stores a computer program 721 that can be run on the processor 710. When the processor 710 executes the computer program 721, the steps in any of the above method embodiments are implemented, for example Figure 2 Alternatively, when the processor 710 executes the computer program 721, the functions of each module / unit in the above-mentioned device embodiments are implemented, for example Figure 6 Functions of modules 601 to 604 are shown.
[0177] Exemplarily, the computer program 721 may be divided into one or more modules / units, one or more modules / units are stored in the memory 720, and are executed by the processor 710 to complete the present application. The one or more modules / units may be a series of computer program instruction segments capable of completing specific functions, and the instruction segments are used to describe the execution process of the computer program 721 in the electronic device 700.
[0178] Those skilled in the art will understand that Figure 7 These are merely examples of electronic devices and do not constitute a limitation of the electronic device. The electronic device may include more or fewer components than those shown in the figure, or a combination of certain components, or different components, such as input and output devices, network access devices, buses, etc.
[0179] The processor 710 may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or the processor may be any conventional processor, etc.
[0180] The memory 720 may be an internal storage unit of the electronic device, such as a hard disk or memory of the electronic device, or an external storage device of the electronic device, such as a plug-in hard disk, a smart memory card (SmartMedia Card, SMC), a secure digital (Secure Digital, SD) card, a flash card (Flash Card), etc. equipped on the electronic device. The above-mentioned memory 720 may also include both an internal storage unit of the electronic device and an external storage device. The above-mentioned memory 720 is used to store computer programs and other programs and data required by the electronic device. The memory 720 may also be used to temporarily store data that has been output or is to be output.
[0181] The technicians in the relevant field can clearly understand that for the convenience and simplicity of description, only the division of the above-mentioned functional units and modules is used as an example for illustration. In practical applications, the above-mentioned function allocation can be completed by different functional units and modules as needed, that is, the internal structure of the device can be divided into different functional units or modules to complete all or part of the functions described above. The functional units and modules in the embodiment can be integrated in a processing unit, or each unit can exist physically separately, or two or more units can be integrated in one unit. The above-mentioned integrated unit can be implemented in the form of hardware or in the form of software functional units. In addition, the specific names of the functional units and modules are only for the convenience of distinguishing each other, and are not used to limit the scope of protection of this application. The specific working process of the units and modules in the above-mentioned system can refer to the corresponding process in the aforementioned method embodiment, which will not be repeated here.
[0182] In the above embodiments, the description of each embodiment has its own emphasis. For parts that are not described or recorded in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.
[0183] Those skilled in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the present invention.
[0184] In the embodiments provided by the present invention, it should be understood that the disclosed devices / electronic devices and methods can be implemented in other ways. For example, the device / electronic device embodiments described above are only schematic. For example, the division of the modules or units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.
[0185] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
[0186] In addition, each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.
[0187] If the integrated module / unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the present invention implements all or part of the processes in the above-mentioned embodiment method, and can also be completed by instructing the relevant hardware through a computer program. The computer program can be stored in a computer-readable storage medium, and the computer program can implement the steps of the above-mentioned various method embodiments when executed by the processor. Among them, the computer program includes computer program code, and the computer program code can be in source code form, object code form, executable file or some intermediate form. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording medium, U disk, mobile hard disk, disk, optical disk, computer memory, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), electrical carrier signal, telecommunication signal and software distribution medium, etc.
[0188] The embodiments described above are only used to illustrate the technical solutions of the present invention, rather than to limit the same. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that the technical solutions described in the aforementioned embodiments may still be modified, or some of the technical features may be replaced by equivalents. Such modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention, and should all be included in the protection scope of the present invention.
Claims
1. A multi-robot path planning method, characterized in that: include: Obtaining the starting positions and target positions corresponding to the plurality of robots in the map, respectively, performing path planning based on the starting positions and target positions of the respective robots, and determining the optimal path of the respective robots; Detecting whether there is a path conflict between the optimal paths of the robots; if there is a path conflict between the optimal paths of any two robots, detecting the conflict type of the path conflict, and determining the conflict attribute of the path conflict according to the conflict type; the conflict attribute includes a conflict attribute that can avoid replanning and a conflict attribute that cannot avoid replanning; According to the conflict attribute, a corresponding path search algorithm is used to re-plan the path of the robot corresponding to the path conflict, and a new optimal path is obtained as the optimal path; The step of detecting whether there is a path conflict in the optimal path of each robot is re-executed until there is no path conflict in the optimal path of each robot, and the current optimal path of each robot is output.
2. The multi-robot path planning method according to claim 1, characterized in that: The conflict types include vertex conflicts and edge conflicts; The determining the conflict attribute of the path conflict according to the conflict type includes: If the path conflict is a vertex conflict, the vertex conflict type of the path conflict is determined according to the load conditions of the two robots and the driving directions at the last moment when the path conflict occurred, and the conflict attribute of the path conflict is determined according to the vertex conflict type; wherein the vertex conflict types include intersection vertex conflict, opposite vertex conflict, map vertex intersection vertex conflict and pursuit vertex conflict; If the path conflict is an edge conflict, then the conflict attribute of the path conflict is determined to be a conflict attribute of unavoidable replanning.
3. The multi-robot path planning method according to claim 2, characterized in that: The load condition includes a loaded state and a no-load state; Determining the vertex conflict type of the path conflict according to the load conditions of the two robots and the driving directions at the last moment when the path conflict occurred includes: Detecting the load conditions of the two robots; If the two robots were traveling sideways at the last moment when the path conflict occurred, and the vertex corresponding to the path conflict is not located at the vertex of the map, then the path conflict is determined to be a cross vertex conflict; If the two robots were traveling in opposite directions at the last moment when the path conflict occurred, then the path conflict is determined to be an opposite vertex conflict; If the two robots have different load conditions and are traveling in the same direction at the last moment when the path conflict occurs, and the robot in the unloaded state lags behind the robot in the loaded state at the last moment when the path conflict occurs, then the path conflict is determined to be a pursuit vertex conflict; If the two robots were traveling sideways at the last moment when the path conflict occurred, and the vertex corresponding to the path conflict is located at the vertex of the map, then it is determined that the path conflict is a map vertex intersection vertex conflict.
4. The multi-robot path planning method according to claim 2, characterized in that: The determining, according to the vertex conflict type, the conflict attribute of the path conflict comprises: If the vertex conflict type is a crossing vertex conflict, an opposing vertex conflict, or a pursuing vertex conflict, determining the conflict attribute of the path conflict to be a conflict attribute that can avoid replanning; If the vertex conflict type is a map vertex intersection vertex conflict, then the conflict attribute of the path conflict is determined to be a conflict attribute of unavoidable replanning.
5. The multi-robot path planning method according to any one of claims 1 to 4, characterized in that: The path search algorithm includes a first path search algorithm and a second path search algorithm; Before re-planning the optimal path corresponding to the path conflict by using a corresponding path search algorithm according to the conflict attribute to obtain a new optimal path as the optimal path, the method further includes: According to the load conditions of the two robots, setting constraint conditions; the constraint conditions include a first constraint condition and a second constraint condition; The method of re-planning the path of the robot corresponding to the path conflict by using a corresponding path search algorithm according to the conflict attribute to obtain a new optimal path as the optimal path includes: If the conflict attribute is a conflict attribute that can avoid re-planning, based on the first constraint condition, using a first path search algorithm to re-plan the path of the robot corresponding to the path conflict; If the conflict attribute is a conflict attribute that cannot be avoided by re-planning, then based on the second constraint condition, a second path search algorithm is used to re-plan the path of the robot corresponding to the path conflict.
6. The multi-robot path planning method according to claim 5, characterized in that: The setting of constraint conditions according to the load conditions of the two robots includes: If the load conditions of the two robots are the same, a first constraint condition prohibiting the two robots from occupying a target vertex or a target edge is set for each of the two robots; If the load conditions of the two robots are different, a second constraint condition is set to prohibit the robot in the unloaded state among the two robots from occupying the target vertex or the target edge; The target vertex is a vertex in a path conflict whose conflict type is vertex conflict, and the target edge is an edge in a path conflict whose conflict type is edge conflict.
7. The multi-robot path planning method according to claim 6, characterized in that: The first path search algorithm is a first improved A* search algorithm; The re-planning of the path of the robot corresponding to the path conflict by using a first path search algorithm based on the first constraint condition includes: According to the starting position and the target position of the two robots and the first constraint condition, the paths of the two robots are replanned using the first improved A* search algorithm; wherein the heuristic function h1 of the first improved A* search algorithm is In the formula, x(s) and x(g) are the x-coordinate of the robot's starting position and the x-coordinate of the target position, y(s) and y(g) are the y-coordinate of the robot's starting position and the y-coordinate of the target position, respectively, and k is a numeric value. dx is the absolute value of the difference between the x-coordinate of the robot's starting position and the x-coordinate of the target position, and dy is the absolute value of the difference between the y-coordinate of the robot's starting position and the y-coordinate of the target position.
8. The multi-robot path planning method according to claim 7, characterized in that: The second path search algorithm is a second improved A* search algorithm; The re-planning of the path of the robot corresponding to the path conflict by using a second path search algorithm based on the second constraint condition includes: According to the starting position and the target position of the robot in the unloaded state among the two robots and the second constraint condition, the path of the robot in the unloaded state is replanned using the second improved A* search algorithm; wherein the heuristic function h2 of the second improved A* search algorithm is In the formula, δ is the adaptive factor, cross is the cross influence factor, and d(s) is the diagonal distance from the robot's starting position to the target position.
9. A multi-robot path planning device, characterized in that: include: An acquisition module, used to acquire the starting position and target position corresponding to each of the multiple robots in the map, perform path planning based on the starting position and target position of each robot, and determine the optimal path of each robot; A determination module, used to detect whether there is a path conflict between the optimal paths of the robots, and if there is a path conflict between the optimal paths of any two robots, detect the conflict type of the path conflict, and determine the conflict attribute of the path conflict according to the conflict type; the conflict attribute includes a conflict attribute that can avoid replanning and a conflict attribute that cannot avoid replanning; An obtaining module is used to re-plan the path of the robot corresponding to the path conflict by using a corresponding path search algorithm according to the conflict attribute, and obtain a new optimal path as the optimal path; The output module is used to re-execute the step of detecting whether there is a path conflict in the optimal path of each robot until there is no path conflict in the optimal path of each robot, and output the current optimal path of each robot.
10. An electronic device comprising a memory and a processor, wherein the memory stores a computer program that can be run on the processor, characterized in that: When the processor executes the computer program, the multi-robot path planning method according to any one of claims 1 to 8 is implemented.
Citation Information
Cited By
Method and device for testing circuit board of multi-mechanical-arm automatic test system
CN119501926A
Multi-robot path searching method for optical communication scene
CN121898433A
