Transfer robot motion planning method and apparatus, device, and storage medium

By dynamically managing the resources of the transport robots in the bioautomation laboratory, allocating exclusive resources and splitting tasks, the resource conflict between transport tasks is solved, the handling efficiency and resource utilization are improved, and the system stability is ensured.

WO2024259634A1PCT designated stage expired Publication Date: 2024-12-26SHENZHEN INST OF ADVANCED TECH

Patent Information

Application Number
PCT/CN2023/101724
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Filing Date
2023-06-21
Publication Date
2024-12-26

AI Technical Summary

Technical Problem

There may be conflicts between robot tasks in bioautomation laboratories due to the competition for the same resource, resulting in inefficiency and waste of resources.

Method used

By receiving the creation request for the transfer task, confirm whether there are available resources in the system, allocate exclusive resources, split the task into a subtask sequence, and update the waiting queue when the resource is released, detect and unlock the deadlock loop to ensure dynamic management and efficient resources. use.

Benefits of technology

It effectively reduces conflicts between handling tasks, improves resource utilization and handling efficiency, and ensures system stability and reliability.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN2023101724_26122024_PF_FP_ABST
    Figure CN2023101724_26122024_PF_FP_ABST
Patent Text Reader

Abstract

The present description relates to the technical field of robots, and provides a transfer robot motion planning method and apparatus, a device, and a storage medium. The method comprises: receiving a creation request for a transfer task; in response to the creation request, determining whether a transfer system currently has available transfer resources meeting the transfer task; if there are available transfer resources meeting the transfer task, allocating an exclusive target transfer resource to the transfer task, the target transfer resource comprising a position point and a transfer robot; planning a transfer path according to the position point; splitting the transfer task into a sequence of transfer sub-tasks according to the transfer path; and providing the sequence of transfer sub-tasks to the transfer robot for execution. Embodiments of the present description can reduce or avoid conflicts among a plurality of transfer tasks.
Need to check novelty before this filing date? Find Prior Art

Description

Handling robot motion planning method, device, equipment and storage medium Technical Field

[0001] This specification relates to the field of robotics, and in particular to a method, device, equipment, and storage medium for motion planning of a handling robot. Background Art

[0002] In automated biological laboratories, robotic transfers are often used to move materials between biological laboratory equipment, and many of these transfer tasks can be performed in parallel. Due to the wide variety of biological laboratory equipment and the diverse materials required, conflicts can arise between multiple transfer tasks, such as competition for the same resources. Therefore, reducing or avoiding conflicts between multiple transfer tasks has become a pressing technical challenge.

[0003] Summary of the Invention

[0004] The purpose of the embodiments of this specification is to provide a method, device, equipment and storage medium for motion planning of a handling robot to reduce or avoid conflicts between multiple handling tasks.

[0005] To achieve the above objectives, on the one hand, an embodiment of this specification provides a method for motion planning of a handling robot, comprising:

[0006] Receive a request to create a transport task;

[0007] In response to the creation request, confirming whether the transport system currently has available transport resources that meet the transport task;

[0008] When there are available transport resources that meet the transport task, an exclusive target transport resource is allocated to the transport task; the target transport resource includes a location point and a transport robot;

[0009] Planning a transport path according to the location points;

[0010] Splitting the transport task into a sequence of transport subtasks according to the transport path;

[0011] The transport subtask sequence is provided to the transport robot for execution.

[0012] In the transport robot motion planning method of the embodiment of this specification, after confirming whether the transport system currently has available transport resources that meet the transport task, the method further includes:

[0013] When there are no available transport resources that meet the transport task, the transport task is added to a waiting queue;

[0014] When a transport resource release operation occurs, determining whether the transport system currently has available transport resources that can satisfy the transport tasks in the waiting queue;

[0015] If so, the corresponding transport task is allocated exclusive target transport resources, and the waiting queue is updated.

[0016] In the transport robot motion planning method of the embodiment of this specification, after providing the transport subtask sequence to the transport robot for execution, the method further includes:

[0017] Determining whether there is a completed transport subtask in the transport subtask sequence according to the task execution status information fed back by the transport robot;

[0018] After each transport subtask in the transport subtask sequence is completed, determining whether the transport resources occupied by the transport subtask are reused in a subsequent transport subtask;

[0019] If it is no longer used, release the transportation resources occupied by the transportation subtask.

[0020] The transport robot motion planning method of the embodiment of this specification further includes:

[0021] Detect whether there is a deadlock loop in the unfinished transport path;

[0022] When a deadlock loop exists, the preset deadlock loop release logic is executed.

[0023] In the transport robot motion planning method of the embodiment of this specification, the detecting whether there is a deadlock loop in the unfinished transport path includes:

[0024] Create a first array for storing the traversal path;

[0025] For any unfinished transport path, its starting point is placed into the first array as the first traversal starting point;

[0026] Determine whether there is a deadlock loop in the traversal path segment from the first traversal starting point to the next position point;

[0027] If there is a deadlock closed loop, output the closed loop path;

[0028] If there is no deadlock loop, the next position point is sequentially placed in the first array, and it is determined whether there is a deadlock loop in the traversal path segment from the first traversal starting point to the next position point of the next position point, until the traversal of all position points in the transport path is completed.

[0029] In the transport robot motion planning method of the embodiment of this specification, the detecting whether there is a deadlock loop in the unfinished transport path further includes:

[0030] While creating a first array for storing the traversal path, creating another second array for storing the traversal path;

[0031] Putting the destination point in the transport path as the second traversal starting point into the second array;

[0032] Determine whether there is a deadlock loop in the path segment from the starting point of the second traversal to the next position point;

[0033] If there is a deadlock closed loop, output the closed loop path;

[0034] If there is no deadlock loop, the next position point is sequentially placed in the second array, and it is determined whether there is a deadlock loop in the path segment from the second traversal starting point to the next position point of the next position point, until the traversal of all position points in the transport path is completed.

[0035] In the transport robot motion planning method of the embodiment of this specification, the execution of the preset deadlock closed loop release logic includes:

[0036] The transport robot is instructed to transport materials at any position on the closed-loop path to a cache position to release the occupation of the position by the corresponding transport task.

[0037] In the transport robot motion planning method of the embodiment of this specification, allocating exclusive target transport resources to the transport task includes:

[0038] An exclusive target transport resource is allocated according to the number of available transport resources and the task attributes of the transport task.

[0039] On the other hand, the embodiments of this specification further provide a transport robot motion planning device, comprising:

[0040] The receiving module is used to receive the creation request of the transport task;

[0041] a confirmation module, configured to confirm, in response to the creation request, whether the transport system currently has available transport resources that meet the transport task;

[0042] an allocation module, configured to allocate exclusive target transport resources to the transport task when there are available transport resources that meet the transport task; the target transport resources include location points and transport robots;

[0043] A planning module, configured to plan a transport path according to the location points;

[0044] A splitting module, configured to split the transport task into a sequence of transport subtasks according to the transport path;

[0045] A module is provided, for providing the transport subtask sequence to the transport robot for execution.

[0046] On the other hand, an embodiment of this specification further provides a computer device, including a memory, a processor, and a computer program stored in the memory, wherein the computer program executes instructions of the above method when executed by the processor.

[0047] On the other hand, an embodiment of this specification further provides a computer storage medium having a computer program stored thereon, wherein the computer program executes the instructions of the above method when executed by a processor of a computer device.

[0048] On the other hand, an embodiment of this specification further provides a computer program product, which includes a computer program. When the computer program is executed by a processor of a computer device, the computer program executes the instructions of the above method.

[0049] It can be seen from the technical solutions provided in the above embodiments of this specification that the transport resources of the transport system can be dynamically maintained and managed in the embodiments of this specification. Whenever a user has a transport task requirement, he can first query the transport system whether there are available transport resources that meet the transport task. When there are available transport resources that meet the transport task, exclusive target transport resources are allocated to the transport task, thereby effectively reducing the possibility of conflicts between different transport tasks due to competition for transport resources; not only that, because in the embodiments of this specification, the entire transport task is split into multiple transport sub-tasks for separate execution, it is easier to implement, and when there is no dependency between the transport sub-tasks, the transport sub-tasks can also be executed in parallel, thereby improving the transport efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0050] In order to more clearly illustrate the embodiments of this specification or the technical solutions in the prior art, the following briefly introduces the drawings required for the embodiments or the description of the prior art. Obviously, the drawings described below are only some of the embodiments described in this specification. For those skilled in the art, other drawings can be obtained based on these drawings without inventive work. In the drawings:

[0051] FIG1 shows a schematic structural diagram of a transport robot motion planning system according to some embodiments of this specification;

[0052] FIG2 shows a flow chart of a method for motion planning of a handling robot in some embodiments of this specification;

[0053] FIG3 shows an application scenario of motion planning for a handling robot in some embodiments of this specification;

[0054] FIG4 shows an application scenario intention of the motion planning of the handling robot in other embodiments of this specification;

[0055] FIG5 shows an application scenario intention of the motion planning of the handling robot in other embodiments of this specification;

[0056] FIG6 shows an application scenario intention of motion planning of a handling robot in other embodiments of this specification;

[0057] FIG7 a shows a schematic diagram of a check path for a forward traversal check deadlock closed loop in an exemplary embodiment of this specification;

[0058] FIG7 b shows a schematic diagram of a check path for reverse traversal checking of a deadlock closed loop in an exemplary embodiment of this specification;

[0059] FIG8 a shows a schematic diagram of a deadlock closed loop in an exemplary embodiment of this specification;

[0060] 8b to 8e are schematic diagrams showing the process of releasing the deadlock closed loop shown in FIG8a;

[0061] FIG9 shows a block diagram of a motion planning device for a transport robot in some embodiments of this specification;

[0062] FIG10 shows a structural block diagram of a computer device in some embodiments of this specification.

[0063] [Description of Reference Numerals]

[0064] 10. Client;

[0065] 20. Transport robot server;

[0066] 30. Transport robot;

[0067] 40. Biological experimental equipment;

[0068] 50. Conveyor rail;

[0069] 91. Receiving module;

[0070] 92. Confirmation module;

[0071] 93. Allocation module;

[0072] 94. Planning module;

[0073] 95. Split module;

[0074] 96. Provide modules;

[0075] 1002. Computer equipment;

[0076] 1004, processor;

[0077] 1006. Memory;

[0078] 1008, driving mechanism;

[0079] 1010, input / output interface;

[0080] 1012. Input device;

[0081] 1014. Output device;

[0082] 1016. Presentation equipment;

[0083] 1018. Graphical user interface;

[0084] 1020, network interface;

[0085] 1022, communication link;

[0086] 1024. Communication bus. DETAILED DESCRIPTION

[0087] To help those skilled in the art better understand the technical solutions in this specification, the following will provide a clear and complete description of the technical solutions in the embodiments of this specification, in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of this specification, not all of them. All other embodiments derived by those skilled in the art based on the embodiments in this specification without creative effort shall fall within the scope of protection of this specification.

[0088] The embodiments of this specification relate to motion planning techniques for handling robots, which are used to reduce or avoid conflicts between multiple handling tasks. These techniques are applicable to any application scenario where a handling robot is required to handle materials. Therefore, in the following embodiments, the application scenario of material handling between biological laboratory equipment is used as an example only and should not be construed as the sole limitation on the application scenarios of the embodiments of this specification.

[0089] FIG1 shows a schematic diagram of a transport robot motion planning system (hereinafter referred to as the transport system) in accordance with some embodiments of the present specification. The application scenario includes a client 10, a transport robot server 20, and a transport robot 30. The transport robot server 20 may be configured to: receive a request for creating a transport task sent by the client 10; in response to the creation request, confirm whether there are currently available transport resources in the transport system that meet the transport task; when there are available transport resources that meet the transport task, allocate an exclusive target transport resource to the transport task; the target transport resource includes a location point and a transport robot 30; plan a transport path based on the location point; split the transport task into a sequence of transport subtasks according to the transport path; and provide the sequence of transport subtasks to the transport robot 30 for execution.

[0090] In some embodiments of this specification, the client 10 may be a mobile terminal (i.e., a smartphone), a display, a desktop computer, a tablet computer, a laptop computer, a digital assistant, or a smart wearable device. Among these, smart wearable devices may include smart bracelets, smart watches, smart glasses, or smart helmets. Of course, the client 10 is not limited to the aforementioned electronic devices with a certain physical form; it may also be software running on the aforementioned electronic devices.

[0091] In some embodiments of the present specification, the transport robot server 20 may be an electronic device with computing and network interaction functions; or it may be software running in the electronic device and providing business logic for data processing and network interaction.

[0092] In some embodiments of this specification, the handling robot 30 may be any industrial robot capable of automated handling operations. The term "handling" refers to the ability of the handling robot 30 to carry and move materials from one location to another. It is understood that "handling" in the embodiments of this specification may refer to translation, rotation, or a combination thereof.

[0093] In addition, what is shown in FIG1 is only an application environment provided by this specification. In actual application, in addition to the fact that there can be multiple transport robots 30, there can also be multiple clients 10 and multiple transport robot servers 20. This specification does not impose any restrictions.

[0094] The embodiments of this specification provide a method for motion planning of a transport robot, which can be applied to the above-mentioned transport robot server side. Referring to FIG2 , in some embodiments of this specification, the method for motion planning of a transport robot can include the following steps:

[0095] Step 201: Receive a request to create a transport task.

[0096] Step 202: In response to the creation request, confirm whether the transportation system currently has available transportation resources that meet the transportation task.

[0097] Step 203: When there are available transport resources that meet the transport task, allocate exclusive target transport resources for the transport task; the target transport resources include location points and transport robots.

[0098] Step 204: Plan a transport path based on the location points.

[0099] Step 205: Split the transport task into a sequence of transport subtasks according to the transport path.

[0100] Step 206: Provide the transport subtask sequence to the transport robot for execution.

[0101] In the embodiments of the present specification, the transport resources of the transport system can be dynamically maintained and managed. Whenever a user has a transport task requirement, the user can first query the transport system whether there are available transport resources that meet the transport task. When there are available transport resources that meet the transport task, exclusive target transport resources are allocated to the transport task, thereby effectively reducing the possibility of conflicts between different transport tasks due to competition for transport resources. Moreover, in the embodiments of the present specification, by splitting the entire transport task into multiple transport sub-tasks for separate execution, it is easier to implement, and when there is no dependency between the transport sub-tasks, the transport sub-tasks can also be executed in parallel, thereby improving the transport efficiency.

[0102] A transport task can be initiated on demand by the client. For example, in some embodiments of this specification, when a user conducts a certain automated biological experiment, they can initiate a biological experiment request through the client. If the corresponding experimental process of the biological experiment request requires the execution of a material transport action, this is equivalent to initiating a request to create a transport task. A transport task can include a starting location (i.e., the initial location of the material), a target location (i.e., the location where the material is expected to be placed), etc.

[0103] The handling robot server can dynamically manage and allocate the handling resources of the handling system. Among them, handling resources refer to the resources needed to achieve material handling. In some embodiments of this specification, handling resources may include but are not limited to handling robots, locations for placing materials (such as fixed or movable material carriers), etc. Materials are objects to be transported. In some embodiments of this specification, taking automated biological experiments as an example, materials may include but are not limited to multi-well plates, polymerase chain reaction (PCR) plates, gun tip boxes, etc.

[0104] In order to reduce or prevent task conflicts between different transport tasks, when receiving a request to create a transport task, the transport robot server will not directly allocate exclusive target transport resources for the transport task, but will first confirm whether the transport system currently has available transport resources that meet the transport task. Only when the transport system currently has available transport resources that meet the transport task will it allocate exclusive target transport resources for the transport task.

[0105] In some embodiments of this specification, confirming whether the transport system currently has available transport resources that meet the transport task may include: first determining whether the transport system currently has an idle transport robot; when the transport system currently has no idle transport robots, confirming that the transport system currently has no available transport resources that meet the transport task; when the transport system currently has an idle transport robot, pre-planning all feasible paths from the starting position point to the target position point based on the starting position point and the target position point in the creation request; wherein a feasible path means that all position points on the path are unoccupied. When a feasible path exists, it can be confirmed that the transport system currently has available transport resources that meet the transport task; otherwise, it can be confirmed that the transport system currently has no available transport resources that meet the transport task.

[0106] In other embodiments of this specification, when determining whether the transport system currently has available transport resources that meet the transport task, a feasible path may be pre-planned before determining whether there are idle transport robots. If no feasible path exists, it may be determined that the transport system currently has no available transport resources that meet the transport task. If a feasible path exists, the determination of whether there are idle transport robots may be continued. If there are idle transport robots, it may be determined that the transport system currently has available transport resources that meet the transport task. Otherwise, it may be determined that the transport system currently has no available transport resources that meet the transport task.

[0107] In some embodiments of the present specification, when the transport system currently has available transport resources that meet the transport task, exclusive target transport resources can be allocated based on the number of available transport resources and the task attributes of the transport task. For example, in an exemplary embodiment, when a transport task can be completed by multiple transport robots in parallel and collaboratively, and the transport system currently has a sufficient number of idle transport robots and available location points, multiple transport robots can be allocated to the transport task, and each of the transport robots can be allocated an available location point to perform parallel collaborative transport. For example, in another exemplary embodiment, when a transport task can be completed by multiple transport robots in serial collaboration, and the transport system currently has a sufficient number of idle transport robots and available location points, multiple transport robots can be allocated to the transport task, and each of the transport robots can be allocated an available location point to perform serial collaborative transport. For example, in another exemplary embodiment, when a transport task can be completed by multiple transport robots in parallel and collaboratively, but the transport system currently has only one transport robot left, that transport robot can be allocated to the transport task.

[0108] In the embodiments of this specification, the transport robot server can realize the exclusive use of the transport resources allocated to the transport tasks through a locking mechanism, etc., so as to avoid the problem of transport resource conflicts between various transport tasks.

[0109] In some embodiments of the present specification, after confirming whether the transport system currently has available transport resources that meet the transport task, if no available transport resources meet the transport task, the transport task can be added to a waiting queue; then, when a transport resource release operation occurs, it is determined whether the transport system currently has available transport resources that meet the transport task in the waiting queue; if so, the corresponding transport task is allocated an exclusive target transport resource, and the waiting queue is updated. Wherein, when the waiting queue is traversed each time for judgment, the judgment can be made in order from the head to the tail to comply with the first-in-first-out order. For example, after confirming that the transport system currently does not have available transport resources that meet the transport task at the head (i.e., the first priority) in the waiting queue, it is determined whether the transport system currently has available transport resources that meet the transport task at the second priority in the waiting queue; after confirming that the transport system currently does not have available transport resources that meet the transport task at the second priority in the waiting queue, it is determined whether the transport system currently has available transport resources that meet the transport task at the third priority in the waiting queue; and so on.

[0110] In the embodiments of the present specification, planning a transport path according to the position points refers to planning a transport path of a transport robot assigned thereto according to the position points assigned thereto.

[0111] In some embodiments of this specification, a single material handling robot can be used to transport materials. For example, in the embodiment shown in Figure 3 , starting point A is located on the left side of the biological experiment equipment 40, and target point B is located on the right side of the biological experiment equipment 40. The planned transport path can be A→B, meaning that a single transport robot 30 will transport the material from starting point A to target point B.

[0112] In some embodiments of this specification, materials can be handled collaboratively by multiple handling robots. For example, in the embodiment shown in Figure 4 , the starting point A is located on the left side of the biological experiment equipment 40, and the target point B is located on the right side of the biological experiment equipment 40. The materials are handled serially by two handling robots 30 in a collaborative manner; a transition point P exists between the two handling robots 30. The planned handling path can then be A→P→B. A transition point refers to a point used to transfer materials during handling. In the embodiment shown in Figure 4 , transition point P can be located outside the biological experiment equipment 40.

[0113] In other embodiments of the present specification, the transition point can also be located inside the biological experiment equipment. Some biological experiment equipment has its own movable clamping parts, which can transfer materials from one position point inside it to another position point for internal use or for external handling robots to carry. For example, in the embodiment shown in Figure 5, the starting position point A is located at the biological experiment equipment 40 on the left, the target position point B is located at the biological experiment equipment 40 on the right, the biological experiment equipment 40 on the left is provided with a transition point P1, and the biological experiment equipment 40 on the right is provided with a transition point P2. The material is completed by a single handling robot 30; the planned handling path can be A→P1→P2→B.

[0114] In other embodiments of this specification, the transport resources may also include other resources such as transfer equipment (e.g., conveyor rails). For example, in the embodiment shown in FIG6 , the starting position A is located at the biological experiment equipment 40 on the left, the target position B is located at the biological experiment equipment 40 on the right, and the materials are transported by two transport robots 30 in serial collaboration; a conveyor rail 50 is provided between the two transport robots 30, a transition point P1 is provided between the conveyor rail 50 and the upper transport robot 30, and a transition point P2 is provided between the conveyor rail 50 and the lower transport robot 30; the planned transport path can be A→P1→P2→B.

[0115] In some embodiments of the present specification, splitting the transport task into a sequence of transport subtasks according to the transport path means: splitting the entire transport task into multiple transport subtasks according to the transport path, and each transport subtask may have a dependency relationship. In this way, the implementation of the transport task can be easier and the transport efficiency can be improved. For example, in the embodiment shown in Figure 4, the transport task can be split into two transport subtasks A→P and P→B, and the resulting transport subtask sequence can be expressed as {A→P, P→B}. Among them, the transport subtask A→P can be performed by the upper transport robot 30, and the transport subtask P→B can be performed by the lower transport robot 30. For another example, in the embodiment shown in Figure 6, the transport task can be split into three transport subtasks A→P1, P1→P2 and P2→B, and the resulting transport subtask sequence can be expressed as {A→P1, P1→P2, P2→B}. The transport subtask A→P1 can be performed by the upper transport robot 30 , the transport subtask P1→P2 can be performed by the conveying rail 50 , and the transport subtask P→B can be performed by the lower transport robot 30 .

[0116] In some embodiments of this specification, after providing the transport subtask sequence to the transport robot for execution, the following steps may also be included:

[0117] (1) Determine whether there is a completed transport subtask in the transport subtask sequence based on the task execution status information fed back by the transport robot.

[0118] (2) After each transport subtask in the transport subtask sequence is completed, it is determined whether the transport resources occupied by the transport subtask are reused in a subsequent transport subtask.

[0119] (3) If no longer in use, release the transport resources occupied by the transport subtask.

[0120] For example, in the embodiment {A→P1, P1→P2, P2→B} shown in Figure 6 above, if the transport subtask A→P1 has been completed, and the upper transport robot 30 and the starting position point A are no longer used in the subsequent transport subtasks P1→P2 and P2→B, the transport robot 30 and the starting position point A can be released in time, that is, the occupation of the transport robot 30 and the starting position point A by the transport task is released without waiting until the entire transport task is completed; this can help reduce the waste of transport resources and improve the utilization rate of transport resources.

[0121] In rare cases, due to anomalies or failures (for example, the system displays a released position point but it is actually still occupied), the handling system may experience a deadlock loop, causing the thread of the handling task to be blocked and unable to continue. In some embodiments of this specification, the handling robot motion planning method may further include the following steps:

[0122] (1) Check whether there is a deadlock loop in the unfinished transport path.

[0123] (2) When a deadlock loop exists, execute the preset deadlock loop release logic.

[0124] In this way, the possibility of the transport system falling into a deadlock and causing a system crash or downtime can be reduced or avoided, thereby improving the stability and reliability of the transport system operation.

[0125] In some embodiments of the present specification, detecting whether a deadlock loop exists in an unfinished transport path may include: first creating a first array for storing traversal paths; for any unfinished transport path, placing its starting position point as the first traversal starting point into the first array; determining whether a deadlock loop exists in the traversal path segment from the first traversal starting point to its next position point; if a deadlock loop exists, outputting the closed-loop path (and possibly throwing a fault to inform the user); if no deadlock loop exists, placing the next position point into the first array in sequence, and determining whether a deadlock loop exists in the traversal path segment from the first traversal starting point to the next position point of the next position point, and so on, until the traversal of all positions in the transport path is completed, thereby completing the forward traversal check for deadlock loops.

[0126] For example, if an unfinished transport task is P1→P2→P3, where P1 is the starting point and P3 is the target point, a tree-like first array can be created (such as tree A in Figure 7a). Set P1 as the starting point and start traversing. Put P1 into the first array and check whether there is a deadlock loop from P1→P2. If there is no deadlock loop, put P2 into the first array and continue traversing. Check whether there is a deadlock loop from P1→P2→P3. If there is no deadlock loop, put P3 into the first array and continue traversing. Check whether there is a deadlock loop from P1→P2→P3→P1. If there is no deadlock loop, end the traversal. If there is a deadlock loop, output P1→P2→P3→P1 as a closed loop.

[0127] In other embodiments of the present specification, detecting whether a deadlock loop exists in an unfinished transport path may also include: while creating a first array for storing the traversal path, creating another second array for storing the traversal path; placing the destination position point in the transport path as the second traversal starting point into the second array; determining whether a deadlock loop exists in the path segment from the second traversal starting point to its next position point; if a deadlock loop exists, outputting a closed-loop path; if no deadlock loop exists, placing the next position point into the second array in sequence, and determining whether a deadlock loop exists in the path segment from the second traversal starting point to the next position point of the next position point, until the traversal of all position points in the transport path is completed. In this way, the deadlock loop can be quickly and accurately identified through bidirectional synchronous checking.

[0128] For example, if an unfinished transport task is P1→P2→P3, where P1 is the starting point and P3 is the target point, a second tree-like array (such as tree B in Figure 7b) can be created synchronously based on the creation of the first array. Synchronously, set P3 as the starting point to start traversing, put P3 into the first array, check whether there is a deadlock loop from P3→P2, if there is no deadlock loop, put P2 into the first array and continue traversing, check whether there is a deadlock loop from P3→P2→P1, if there is no deadlock loop, put P3 into the first array and continue traversing, check whether there is a deadlock loop from P3→P2→P1→P3, if there is no deadlock loop, end; if there is a deadlock loop, output P3→P2→P1→P3 as a closed loop path.

[0129] In some embodiments of the present specification, executing a preset deadlock loop release logic may include instructing the transport robot to transport material from any location on the closed-loop path to a cache location, thereby releasing the location occupied by the corresponding transport task. In this way, the deadlock loop solution can be released by using the cache location, allowing the unfinished transport task to continue. The cache location may be a specific location reserved in the transport system, or an unoccupied location in the transport system temporarily used as a cache location.

[0130] For example, in some embodiments of the present specification, a transport task forms a deadlock loop as shown in FIG8a. In FIG8a, the material at position A needs to be transported to position B, but other materials have already been placed at position B; the material at position B needs to be transported to position C, but other materials have already been placed at position C; the material at position C needs to be transported to position A, but other materials have already been placed at position A. As a result, all material transport operations are blocked, forming a deadlock loop.

[0131] 8b to 8e, based on the above-mentioned deadlock loop release logic, the material at position point C can be first transported to the cache position point (as shown in FIG8b), and then the material at position point B can be transported to position point C (as shown in FIG8c), and then the material at position point A can be transported to position point B (as shown in FIG8d), and finally the material at the cache position point can be transported to position point A (as shown in FIG8e); in this way, the deadlock loop can be released and the expected material transportation can be completed.

[0132] Although the process flows described above include multiple operations occurring in a particular order, it should be understood that these processes may include more or fewer operations, which may be performed sequentially or in parallel (eg, using parallel processors or a multi-threaded environment).

[0133] Corresponding to the above-mentioned transport robot motion planning method, embodiments of this specification further provide a transport robot motion planning device, which can be configured on the above-mentioned transport robot server. Referring to FIG9 , in some embodiments of this specification, the transport robot motion planning device may include:

[0134] Receiving module 91, used for receiving a request to create a transport task;

[0135] A confirmation module 92 is configured to confirm, in response to the creation request, whether the transport system currently has available transport resources that can meet the transport task;

[0136] An allocation module 93 is configured to allocate exclusive target transport resources to the transport task when there are available transport resources that meet the transport task; the target transport resources include location points and transport robots;

[0137] A planning module 94 is used to plan a transport path according to the location points;

[0138] A splitting module 95 is used to split the transport task into a sequence of transport subtasks according to the transport path;

[0139] A providing module 96 is configured to provide the transport subtask sequence to the transport robot for execution.

[0140] For the convenience of description, the above devices are described as being divided into various units according to their functions. Of course, when implementing this specification, the functions of each unit can be implemented in the same or multiple software and / or hardware.

[0141] It should be noted that in the embodiments of this specification, the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved are all information and data authorized by the user and fully authorized by all parties.

[0142] The embodiments of this specification also provide a computer device. As shown in Figure 10, in some embodiments of this specification, the computer device 1002 may include one or more processors 1004, such as one or more central processing units (CPUs) or graphics processing units (GPUs), and each processing unit may implement one or more hardware threads. The computer device 1002 may also include any memory 1006, which is used to store any type of information such as code, settings, data, etc. In a specific embodiment, the computer program on the memory 1006 and that can run on the processor 1004, when the computer program is run by the processor 1004, can execute the instructions of the handling robot motion planning method described in any of the above embodiments. Non-limiting, for example, the memory 1006 may include any one or more combinations of the following: any type of RAM, any type of ROM, a flash memory device, a hard disk, an optical disk, etc. More generally, any memory can use any technology to store information. Further, any memory can provide volatile or non-volatile retention of information. Further, any memory can represent a fixed or removable component of the computer device 1002. In one embodiment, when the processor 1004 executes the associated instructions stored in any memory or combination of memories, the computer device 1002 can perform any operation of the associated instructions. The computer device 1002 also includes one or more drive mechanisms 1008 for interacting with any memory, such as a hard disk drive mechanism, an optical disk drive mechanism, etc.

[0143] The computer device 1002 may also include an input / output interface 1010 (I / O) for receiving various inputs (via input devices 1012) and for providing various outputs (via output devices 1014). A specific output mechanism may include a presentation device 1016 and an associated graphical user interface 1018 (GUI). In other embodiments, the input / output interface 1010 (I / O), input devices 1012, and output devices 1014 may not be included, and the computer device 1002 may simply be a computer device in a network. The computer device 1002 may also include one or more network interfaces 1020 for exchanging data with other devices via one or more communication links 1022. One or more communication buses 1024 couple the components described above together.

[0144] The communication link 1022 may be implemented in any manner, for example, via a local area network, a wide area network (e.g., the Internet), a point-to-point connection, etc., or any combination thereof. The communication link 1022 may include any combination of hardwired links, wireless links, routers, gateway functions, name servers, etc., governed by any protocol or combination of protocols.

[0145] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), computer-readable storage media, and computer program products of some embodiments of this specification. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processor to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processor produce a device for implementing the functions specified in one or more processes in the flowchart and / or one or more boxes in the block diagram.

[0146] These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processor to operate in a specific manner, so that the instructions stored in the computer-readable memory produce a product including an instruction device that implements the functions specified in one or more processes in the flowchart and / or one or more boxes in the block diagram.

[0147] These computer program instructions can also be loaded onto a computer or other programmable data processor so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, whereby the instructions executed on the computer or other programmable device provide steps for implementing the functions specified in one or more processes in the flowchart and / or one or more boxes in the block diagram.

[0148] In a typical configuration, a computer device includes one or more processors (CPUs), input / output interfaces, network interfaces, and memory.

[0149] Memory may include non-permanent storage in a computer-readable medium, random access memory (RAM) and / or non-volatile memory in the form of read-only memory (ROM) or flash RAM. Memory is an example of a computer-readable medium.

[0150] Computer-readable media include permanent and non-permanent, removable and non-removable media that can be used to store information by any method or technology. The information can be computer-readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical storage, magnetic cassettes, magnetic disk storage or other magnetic storage devices or any other non-transmission media that can be used to store information that can be accessed by a computer device. As defined in this specification, computer-readable media does not include temporary computer-readable media (transitory media), such as modulated data signals and carrier waves.

[0151] Those skilled in the art will appreciate that the embodiments of this specification may be provided as methods, systems, or computer program products. Therefore, the embodiments of this specification may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Furthermore, the embodiments of this specification may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to magnetic disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0152] Embodiments of this specification may be described in the general context of computer-executable instructions executed by a computer, such as program modules. Generally, program modules include routines, programs, objects, components, data structures, and the like that perform specific tasks or implement specific abstract data types. Embodiments of this specification may also be practiced in distributed computing environments where tasks are performed by remote processors connected via a communications network. In distributed computing environments, program modules may be located in local and remote computer storage media, including storage devices.

[0153] It should also be understood that in the embodiments of this specification, the term "and / or" is merely a description of the association relationship between associated objects, indicating that three possible relationships exist. For example, "A and / or B" can represent three situations: A exists alone, A and B exist simultaneously, and B exists alone. Furthermore, the character " / " in this document generally indicates that the associated objects are in an "or" relationship.

[0154] The various embodiments in this specification are described in a progressive manner. Similar parts between the various embodiments can be referred to in conjunction with each other. Each embodiment focuses on the differences between the other embodiments. In particular, the system embodiments are generally similar to the method embodiments, so the description is relatively simple. For relevant parts, refer to the description of the method embodiments.

[0155] In the description of this specification, the reference terms "one embodiment", "some embodiments", "example", "specific example", or "some examples" mean that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the embodiments of this specification. In this specification, the schematic representations of the above terms do not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described can be combined in any one or more embodiments or examples in a suitable manner. In addition, those skilled in the art can combine and combine different embodiments or examples described in this specification and features of different embodiments or examples without contradiction.

[0156] The foregoing is merely an embodiment of the present application and is not intended to limit the present application. For those skilled in the art, the present application may have various changes and variations. Any modifications, equivalent replacements, improvements, etc. made within the spirit and principles of the present application should all be included within the scope of the claims of the present application.

Claims

1. A method for motion planning of a handling robot, characterized in that: include: Receive a request to create a transport task; In response to the creation request, confirming whether the transport system currently has available transport resources that meet the transport task; When there are available transport resources that meet the transport task, allocating exclusive target transport resources to the transport task; The target transport resources include location points and transport robots; Planning a transport path according to the location points; Splitting the transport task into a transport subtask sequence according to the transport path; The transport subtask sequence is provided to the transport robot for execution.

2. The method for motion planning of a handling robot according to claim 1, characterized in that: After confirming whether the transport system currently has available transport resources that meet the transport task, the method further includes: When there are no available transport resources that meet the transport task, adding the transport task to a waiting queue; When a release operation of transport resources occurs, determining whether the transport system currently has available transport resources that can satisfy the transport tasks in the waiting queue; If so, the corresponding transport task is allocated an exclusive target transport resource, and the waiting queue is updated.

3. The method for motion planning of a handling robot according to claim 1, characterized in that: After providing the transport subtask sequence to the transport robot for execution, the method further includes: Determining whether there is a completed transport subtask in the transport subtask sequence according to the task execution status information fed back by the transport robot; After each transport subtask in the transport subtask sequence is completed, determining whether the transport resources occupied by the transport subtask are reused in a subsequent transport subtask; If it is no longer used, release the transport resources occupied by the transport subtask.

4. The method for motion planning of a handling robot according to claim 1, wherein: Also includes: Detect whether there is a deadlock loop in the unfinished transport path; When a deadlock loop exists, the preset deadlock loop release logic is executed.

5. The method for motion planning of a handling robot according to claim 4, characterized in that: The detecting whether there is a deadlock loop in the unfinished transport path comprises: Create a first array for storing the traversal path; For any unfinished transport path, its starting point is placed in the First array; Determine whether there is a deadlock loop in the traversal path segment from the first traversal starting point to the next position point; If there is a deadlocked closed loop, output the closed loop path; If there is no deadlock loop, the next position point is sequentially placed in the first array, and it is determined whether there is a deadlock loop in the traversal path segment from the first traversal starting point to the next position point of the next position point, until the traversal of all position points in the transport path is completed.

6. The method for motion planning of a handling robot according to claim 5, characterized in that: The detecting whether there is a deadlock loop in the unfinished transport path also includes: While creating a first array for storing the traversal path, creating another second array for storing the traversal path; Putting the destination point in the transport path into the second array as the second traversal starting point; Determine whether there is a deadlock loop in the path segment from the starting point of the second traversal to the next position point; If there is a deadlocked closed loop, output the closed loop path; If there is no deadlock loop, the next position point is sequentially placed in the second array, and it is determined whether there is a deadlock loop in the path segment from the second traversal starting point to the next position point of the next position point, until the traversal of all position points in the transport path is completed.

7. The method for motion planning of a handling robot according to claim 5 or 6, characterized in that: The executing of the preset deadlock closed loop release logic includes: The transport robot is instructed to transport materials at any position point on the closed-loop path to a cache position point to release the occupation of the position point by the corresponding transport task.

8. The method for motion planning of a handling robot according to claim 1, characterized in that: The allocating exclusive target transport resources to the transport task includes: An exclusive target transport resource is allocated according to the number of available transport resources and the task attributes of the transport task.

9. A transport robot motion planning device, characterized in that: include: A receiving module, used for receiving a request to create a transport task; A confirmation module, configured to confirm, in response to the creation request, whether there are currently available transport resources in the transport system that meet the transport task; an allocation module, configured to allocate an exclusive target transport resource to the transport task when there are available transport resources that meet the transport task; The target transport resources include location points and transport robots; A planning module, used for planning a transport path according to the location points; A splitting module, used for splitting the transport task into a sequence of transport subtasks according to the transport path; A module is provided, for providing the transport subtask sequence to the transport robot for execution.

10. A computer device comprising a memory, a processor, and a computer program stored in the memory, characterized in that: When the computer program is executed by the processor, the computer program executes the instructions of the method according to any one of claims 1 to 8.

11. A computer storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor of a computer device, the computer program executes the instructions of the method according to any one of claims 1 to 8.

12. A computer program product, characterized in that The computer program product comprises a computer program, and when the computer program is executed by a processor of a computer device, the computer program executes instructions of the method according to any one of claims 1 to 8.

Citation Information

Patent Citations

  • Swarm robot management server and method implemented by same

    CN104199428A

  • Task assignment method and device and computer-readable storage medium

    CN109426560A

  • Distribution scheme determination method and device and computer-readable storage medium

    CN109426884A

  • Article conveying system and method

    CN114202281A

  • Truss robot and track planning method and device thereof

    CN115431276A

Cited By

  • Carrying robot motion planning method, device and equipment and storage medium

    CN116652957A

  • Transport robot motion planning method, device, equipment and storage medium

    CN116652957B