Method and device for managing automation process, electronic equipment and storage medium

Abstract

Embodiments of the present application provide a management method and device of an automation process, electronic equipment and a storage medium. The method comprises: obtaining time constraint information and node information between two adjacent nodes in the automation process, wherein the time constraint information is used to constrain the execution time of a transfer operation of a target between the two adjacent nodes; determining the total time of the transfer operation based on the node information of the two adjacent nodes; and checking whether the time constraint information is reasonable based on the total time. The scheme can ensure the effectiveness of the target in the automation process, thereby ensuring the accuracy and smooth progress of the automation process.

Description

Technical Field

[0001] This application relates to the field of automation, and more specifically to a method for managing automated processes, a device for managing automated processes, an electronic device, and a storage medium. Background Technology

[0002] Currently, many fields are continuously undergoing automation transformation to achieve the goals of freeing up manpower and improving efficiency. Whether it's automated manufacturing, automated testing, or automated experimentation, automated systems are used extensively. Within an automated system, the entire automated process is broken down into multiple operations performed by various devices. These operations include not only the main operations of the executing devices processing the target, but also the transfer operations of the transfer devices moving the target between different executing devices.

[0003] Taking laboratory automation systems as an example, different manufacturers' execution devices, such as incubators, centrifuges, pipetting workstations, cappers, and microplate readers, can be integrated to perform different experimental operations on corresponding samples. Furthermore, transfer devices, such as robotic arms, are often needed between different execution devices to transfer samples and ensure the smooth execution of the experimental process. During the operation of the automated process, each transfer device requires a certain execution time to complete each transfer operation, but timeouts can occur due to equipment failure or communication problems. In addition, some samples have specific requirements regarding exposure time. For example, when transferring bacterial cultures loaded in well plates, exceeding a certain time may lead to the spoilage of the bacterial culture.

[0004] In existing technologies, automated systems can schedule operations within an automated process according to time. For example, a transfer device in an automated process will spend a certain amount of time performing its corresponding transfer operation. The automated system can then plan the operations of subsequent devices following this transfer device, ensuring that they perform their planned operations accordingly. However, this often overlooks the problem of excessively long transfer times for samples, leading to prolonged sample exposure and potential sample damage. Damaged samples can easily prevent the automated process from executing correctly, resulting in erroneous results. Summary of the Invention

[0005] This application is made in consideration of the above-mentioned problems. According to a first aspect of this application, a method for managing an automated process is provided. It includes: acquiring time constraint information and node information between two adjacent nodes in the automated process, wherein the time constraint information is used to constrain the execution time of a transfer operation between the two adjacent nodes; determining the total time of the transfer operation based on the node information of the two adjacent nodes; and verifying the reasonableness of the time constraint information based on the total time.

[0006] For example, the node information includes node type, the node type includes device node, and the node information of the device node also includes: the duration information of the operation supported by the device corresponding to the device node; the total time of the transfer operation is determined based on the node information of two adjacent nodes, including: determining the total time based on the node type and the duration information of the operation supported by the device corresponding to the device node.

[0007] For example, the node type also includes a starting node; the total time is determined based on the node type and the duration information of the operation supported by the device corresponding to the device node, including: when the upstream node in two adjacent nodes is the starting node, determining the first execution time of the previous operation corresponding to the downstream node in the two adjacent nodes, wherein the previous operation is the operation completed before the device corresponding to the downstream node performs its own operation; and determining the first execution time as the total time.

[0008] For example, the total time is determined based on the node type and the duration information of the operations supported by the device corresponding to the device node, including: when both adjacent nodes are device nodes, determining the second execution time of the subsequent operation corresponding to the upstream node in the two adjacent nodes, and determining the third execution time of the preceding operation corresponding to the downstream node in the two adjacent nodes, wherein the subsequent operation is the operation completed after the device corresponding to the upstream node performs its own operation, and the preceding operation is the operation completed before the device corresponding to the downstream node performs its own operation; and the second and third execution times are summed to obtain the total time.

[0009] For example, the node type also includes an end node; the total time is determined based on the node type and the duration information of the operation supported by the device corresponding to the device node, including: when the downstream node in two adjacent nodes is an end node, determining the fourth execution time of the subsequent operation corresponding to the upstream node in two adjacent nodes, wherein the subsequent operation is the operation completed after the device corresponding to the upstream node performs its own operation; and determining the fourth execution time as the total time.

[0010] For example, obtaining time constraint information and node information between two adjacent nodes in an automated process includes: for each starting node or device node in the automated process, obtaining the node information of the starting node or device node, traversing the downstream nodes directly connected to the starting node or device node, and obtaining the node information of the downstream node if the downstream node is a device node or an ending node.

[0011] For example, device nodes in two adjacent nodes correspond to multiple targets. Time constraint information is used to constrain the execution time of the transfer operation between the two adjacent nodes for each of the multiple targets. The total time of the transfer operation is determined, including: determining the total time of the transfer operation for each of the multiple targets; and verifying whether the time constraint information is reasonable, including: verifying whether the time constraint information for each target is reasonable based on the total time of the transfer operation for each target.

[0012] For example, the time constraint information includes expiration time information. Verifying whether the time constraint information is reasonable includes: determining that the time constraint information is reasonable if the expiration time shown in the expiration time information is greater than or equal to the total time; and determining that the time constraint information is incorrect if the expiration time shown in the expiration time information is less than the total time.

[0013] For example, before obtaining time constraint information between two adjacent nodes in an automated process, the method further includes: displaying a graphical user interface, the graphical user interface including operable controls; and receiving time constraint information from the user in response to a first operation by the user using the operable controls.

[0014] For example, the time constraint information includes expiration time information. After verifying whether the time constraint information is reasonable, the method further includes: after determining that the time constraint information is reasonable, responding to the user's second operation, running an automated process; wherein, during the running of the automated process, it is determined whether the execution time of the transfer operation of the target between two adjacent nodes exceeds the expiration time indicated by the expiration time information, and if it does, the target is marked as expired.

[0015] For example, after verifying whether the time constraint information is reasonable, the method further includes: determining the execution order of the smallest sub-operations between two adjacent nodes based on the connection relationship between the two adjacent nodes in the automated process; determining the total time again based at least on the execution order and the preset execution time of each smallest sub-operation; and verifying whether the time constraint information is reasonable again based on the re-determined total time.

[0016] According to a second aspect of this application, an automated process management device is also provided, comprising: an acquisition module for acquiring time constraint information and node information between two adjacent nodes in the automated process, wherein the time constraint information is used to constrain the execution time of the transfer operation of the target between the two adjacent nodes; a determination module for determining the total time of the transfer operation based on the node information of the two adjacent nodes; and a verification module for verifying whether the time constraint information is reasonable based on the total time.

[0017] According to a third aspect of this application, an electronic device is also provided, including a processor and a memory, wherein the memory stores computer program instructions, which are executed by the processor to perform the management method of the aforementioned automated process.

[0018] According to a fourth aspect of this application, a storage medium is also provided, on which program instructions are stored, which are used to execute the management method of the above-described automated process when the program instructions are run.

[0019] In the above technical solution, the total time for the transfer operation of the target between two adjacent nodes in the automated process is determined by utilizing the node information of two adjacent nodes. Then, based on this total time, the pre-set time constraint information used to constrain the execution time of the transfer operation is verified. This solution ensures the validity of the target in the automated process, thereby guaranteeing the accuracy and smooth operation of the automated process.

[0020] The above description is only an overview of the technical solution of this application. In order to better understand the technical means of this application and to implement it in accordance with the contents of the specification, and to make the above and other objects, features and advantages of this application more obvious and understandable, the following are specific embodiments of this application. Attached Figure Description

[0021] The above and other objects, features, and advantages of this application will become more apparent from the more detailed description of the embodiments of this application in conjunction with the accompanying drawings. The accompanying drawings are used to provide a further understanding of the embodiments of this application and form part of the specification. They are used together with the embodiments of this application to explain this application and do not constitute a limitation thereof. In the accompanying drawings, the same reference numerals generally represent the same components or steps.

[0022] Figure 1 A schematic flowchart illustrating a method for managing an automated process according to an embodiment of this application is shown.

[0023] Figure 2 A schematic diagram showing a portion of an automated process according to an embodiment of this application is provided.

[0024] Figure 3a A schematic flowchart illustrating the first part of an automated process management method according to another embodiment of this application;

[0025] Figure 3b A schematic flowchart illustrating the second part of a method for managing an automated process according to another embodiment of this application;

[0026] Figure 3c A schematic flowchart illustrating a third part of an automated process management method according to another embodiment of this application;

[0027] Figure 4 A schematic block diagram showing a management device for an automated process according to an embodiment of this application; and

[0028] Figure 5 A schematic block diagram of an electronic device according to an embodiment of this application is shown. Detailed Implementation

[0029] To make the objectives, technical solutions, and advantages of this application more apparent, exemplary embodiments according to this application will be described in detail below with reference to the accompanying drawings. Obviously, the described embodiments are merely some embodiments of this application, and not all embodiments of this application. It should be understood that this application is not limited to the exemplary embodiments described herein. Based on the embodiments of this application described herein, all other embodiments obtained by those skilled in the art without inventive effort should fall within the protection scope of this application.

[0030] To at least partially address the aforementioned technical problems, according to a first aspect of this application, a method for managing automated processes is provided. The management method according to embodiments of this application can be applied to automated processes in various fields for various suitable objectives. For simplicity, the following explanation will use an automated process in an automated system in the field of biochemistry as an example.

[0031] Figure 1 A schematic flowchart of an automated process management method 1000 according to an embodiment of this application is shown. Figure 1 As shown, the management method 1000 may include the following steps.

[0032] Step S1200: Obtain time constraint information and node information between two adjacent nodes in the automated process. The time constraint information is used to constrain the execution time of the transfer operation of the target between two adjacent nodes.

[0033] The automated process can be pre-designed according to actual experimental / experimental needs. Exemplarily, but not limitingly, step S1200 can be executed in response to any user trigger operation after the automated process design is completed. This trigger operation can be any suitable operation, such as being triggered by the user clicking the "Save Process" control after the automated process design is completed. According to embodiments of this application, the automated process can include a series of various related operations required to perform experiments / experiments on a target. It can include various process information, such as the executing subject and object of each operation, the content of the operation, execution conditions, execution time, execution logic, etc. The target can be the object operated on in the automated process, and it can be any suitable target. Exemplarily, but not limitingly, the target can be experimental consumables such as test tubes, glass slides, or well plates holding samples like bacterial cultures. Of course, for automated processes in other fields, the target can also be other forms of operated objects.

[0034] An automated process can be a process composed of multiple nodes connected in a certain order. The node information of each node can include any information related to the various operations to be performed at that node, such as the operation type, operation time, operation instructions, the relevant execution entity of the operation, and / or information related to the sub-operations involved in the operation. The operation to be performed at a node can be any suitable operation. These operations include, for example, the corresponding processing operation performed by the execution device on the target, specifically, a centrifuge performing a centrifuge processing operation on the target. These operations are also examples of inter-device transfer operations performed by the transfer device on the target; the node information corresponding to the transfer operation can include information about the target's location, such as the target's starting position, ending position, and the error position of the target when an error occurs in the process. Furthermore, some nodes can be used for process control, such as for executing judgments and loops in the process. Additionally, the node information between two adjacent nodes in step S1200 can be either the node information set when establishing the automated process or the node information pre-configured before establishing the automated process.

[0035] By way of example, but not limitation, node information may include node name, node type, estimated time of node operations, etc. Specifically, the node name is an identifier used to distinguish it from other nodes. It can be user-defined or it can directly use the name of the device corresponding to the main operation of the node, such as centrifuge. The node type is divided based on the function corresponding to the node, such as device node, start node, end node, process control node, etc. The estimated time of node operations can represent the estimated time of each operation performed by the node on the target.

[0036] Two adjacent nodes can be any two nodes in an automated process that are directly connected in execution order, and time constraint information can be obtained between these two nodes. Examples of adjacent nodes include upstream node A and downstream node B. It's easy to understand that upstream node A is closer to the start of the automated process than downstream node B. The execution of the main operation corresponding to downstream node B begins only after the main operation corresponding to upstream node B has finished executing; there is a sequential execution logical relationship between the two. It should be noted that the operations associated with each node can include a main operation, a preceding operation, and a following operation.

[0037] As mentioned earlier, in the actual operation of automated processes, various factors such as equipment failure or communication problems often cause the actual execution time of operations to exceed their theoretical execution time. Furthermore, for certain specific targets, such as experimental consumables like bacterial solutions, exceeding a certain time in specific equipment or during transport may lead to expiration and invalidation. Considering both of these factors, to ensure the smooth operation of automated processes and the validity of targets, reasonable tolerance can be imposed on the execution time of some related operations. This can be achieved by setting reasonable time constraints in the time constraint information to constrain the actual execution time of related operations. This allows operations to continue normally even when they exceed the theoretical execution time, and allows them to be marked as expired or to be discarded when they exceed the constrained safe or valid time. After being marked for discard, they can then be moved to a disposal location.

[0038] According to embodiments of this application, time constraint information can be set between two adjacent nodes based on actual time constraint requirements. This time constraint information is used to constrain the execution time of the transfer operation of the target between the two adjacent nodes. As mentioned earlier, the transfer operation can be an operation performed by the transfer device on the target. If either upstream node A or downstream node B is involved in a transfer operation, time constraint information can be set between the two nodes during the design of the automated process. The constraint content of the time constraint information between two adjacent nodes can also be arbitrarily set according to the constraint requirements of the process. Exemplarily, but not limitingly, the time constraint information may include expiration time information and maximum waiting time information. The expiration time information can be a preset maximum safe duration for the transfer operation of the target, so that if this duration is exceeded, the target will be subject to corresponding expiration processing, such as being marked as expired. The maximum waiting time information can be a preset maximum valid duration for the transfer operation of the target, so that if this duration is exceeded, the target will be subject to corresponding invalidation and / or discarding processing, such as being marked as invalid and discarded. Of course, the time constraint information can also be other suitable information used to constrain the duration of the transfer operation of the target. In step S1200, the corresponding duration constrained in the time constraint information can be obtained, for example, by reading the time constraint information between two adjacent nodes.

[0039] Step S1400: Determine the total time for the transfer operation based on the node information of two adjacent nodes.

[0040] As previously mentioned, the node information of two adjacent nodes can include any information related to the various operations performed at each node. For example, the node information can include a list of operations corresponding to the node and the estimated execution time for each operation. For instance, if a node involves a transfer operation to a target, the node information can include a list of sub-operations of the transfer operation performed at that node and the estimated execution time for each sub-operation. In this step, the total time for the transfer operation to the target performed between the two nodes can be determined based on the estimated execution times of the sub-operations of the transfer operation performed at each of the two nodes. That is, the estimated time information of the transfer operation performed between the two nodes can be determined based on the node information of each of the two adjacent nodes, and the total time can be determined based on this estimated time information. This total time can be the estimated total execution time of all sub-operations of the transfer operation performed between the two adjacent nodes. This step can be implemented in any suitable manner; for example, each sub-operation involving the transfer operation between nodes can be first filtered from the node information of each node, and then the total time of the transfer operation between the two nodes can be determined based on the estimated execution time of each filtered sub-operation using a suitable statistical method.

[0041] Step S1600: Based on the total time, verify whether the time constraint information is reasonable.

[0042] During the design phase of an automated workflow, various factors, such as inaccurate time estimates by the user, may lead to unreasonable time constraints between adjacent nodes in the initially set workflow. This next step involves iterating through each node in the entire automated workflow and verifying the reasonableness of the time constraints between each pair of adjacent nodes.

[0043] As mentioned earlier, the total time determined in step S1400 can be the estimated or theoretical execution time of all sub-operations of the transfer operation between two adjacent nodes, calculated using any suitable method. The time constraint information between the two nodes obtained in step S1200 is used to constrain the actual execution time of the transfer operation. Furthermore, the purpose of setting the time constraint information between the two nodes is to provide reasonable fault tolerance for, for example, the execution time of the transfer operation, that is, to allow the actual execution time of the transfer operation to appropriately exceed the theoretical execution time within a range that ensures the safety or effectiveness of the target. In other words, the actual execution time constrained in the time constraint information is set based on its theoretical time, and there is a correlation between the two. Therefore, in step S1600, based on the total time of the transfer operation determined in step S1400, the reasonableness of the time constraint information between the two adjacent nodes can be verified. Any suitable verification logic can be used to verify the reasonableness of the time constraint information. For example, verification can be performed by comparing the total time with the constraint time indicated in the time constraint information.

[0044] In the above technical solution, the total time for the transfer operation of the target between two adjacent nodes in the automated process is determined by utilizing the node information of two adjacent nodes. Then, based on this total time, the pre-set time constraint information used to constrain the execution time of the transfer operation is verified. This solution ensures the validity of the target in the automated process, thereby guaranteeing the accuracy and smooth operation of the automated process.

[0045] For example, before obtaining the time constraint information between two adjacent nodes in the automated process in step S1200, method 1000 further includes steps S1110 and S1120.

[0046] In step S1110, a graphical user interface (GUI) is displayed, which includes operable controls. As previously described, time constraint information between two adjacent nodes can be set during the design phase of the automated process. The two adjacent nodes can be upstream node A and downstream node B. Exemplarily, and not limitingly, a GUI for setting time constraint information can be displayed in response to a user's selection of time constraint information for an upstream node. According to embodiments of this application, the time constraint information between two nodes can include one or more types; therefore, the GUI can also include one or more operable controls. Each operable control can be used to set each type of time constraint information. For example, the time constraint information between two nodes can include expiration time information and maximum waiting time information. The GUI can include a "Node Inter-Constraint Information Setting" list. Under this list, two operable controls can be included for setting time constraint information between the currently selected node and its adjacent downstream node. One of them can be an operable control for setting the "expiration time" of the transfer operation between the two nodes, and the other can be an operable control for setting the "maximum waiting time". The operable controls can be any suitable controls, such as input controls or drop-down list selection controls. Furthermore, when there are time constraints for multiple targets between two adjacent nodes, the graphical user interface can be used to set the time constraints for each target. Similarly, in the example above, the "Inter-node Time Constraint Information Settings" list in the graphical user interface can also include multiple rows of operable controls, which can be used to set the time constraints for the transfer operations of each target.

[0047] In step S1120, in response to the user's first operation using the operable control, time constraint information is received from the user. The user's first operation using the operable control can be any suitable operation. For example, the first operation can be the user inputting a desired time number through an input control, or the user selecting a desired time number through a drop-down list control. When the user completes input or selects their desired constraint time, the time constraint information input or selected by the user can be received and displayed on the graphical user interface. For example, in step S1120, the time number "55" input by the user using the input control under the "Expiration Time" list in the graphical user interface can be received, and the constraint time "55" can be displayed on the interface accordingly. This completes the constraint on the execution time of a transfer operation for, for example, "Consumable 1" performed between two nodes. After this setting is completed, in step S1200, the target expiration time can be obtained at the node, and in step S1600, the expiration time "55" seconds in the time constraint information can be verified based on the determined total time.

[0048] The above-described solution, which provides a visual human-computer interaction interface and operable controls for users to freely set time constraint information, allows users to easily set more accurate time constraint information. The user experience is also better.

[0049] For example, node information includes node type. As mentioned above, node type is categorized based on the function corresponding to the node, such as device node, start node, end node, process control node, etc. According to embodiments of this application, the node type may include device node. The node information of the device node also includes: the duration information of the operation supported by the device corresponding to the device node. The device corresponding to the device node may include one or more devices. The device corresponding to the device node may at least include a main execution device for performing the main operation on the target. In addition, for the case where the transfer operation of the target is to be completed at the device node, the device corresponding to the device node may also include a transfer device for performing the transfer operation on the target. The duration information of the operation supported by the device corresponding to the device node may include the estimated duration information of the main operation of the main execution device on the target, and may also include the estimated duration information of the transfer operation of the transfer device on the target. It is easy to understand that whether the operation supported by the device corresponding to the device node belongs to the transfer operation is not distinguished by the execution subject itself, but by the purpose of the operation being performed. The transfer device may also include the main execution device and peripheral devices of the main execution device, such as opening and closing devices. The transfer device may also be other devices, such as a robotic arm.

[0050] In a specific example, for a device node whose primary execution device is a centrifuge, the corresponding equipment may include a centrifuge and a robotic arm. Therefore, the node information for this centrifuge-corresponding device node may include the estimated duration of the centrifugation operation performed by the centrifuge, the estimated duration of the cap-closing operation performed by the centrifuge or its cap-closing device, and the estimated duration for the robotic arm to move the well plate carrying the bacterial solution from the centrifuge to the next node. In laboratory automation workflows, the primary execution devices of a device node may also include pipetting workstations, incubators, and microplate readers. The transport equipment may include the aforementioned primary execution devices themselves, or it may only include a robotic arm.

[0051] Step S1400 determines the total time of the transfer operation based on the node information of two adjacent nodes, including step S1410. In step S1410, the total time is determined based on the node type and the duration information of the operations supported by the device corresponding to the device node. That is, at least one of the two adjacent nodes is a device node. The total time can be determined according to the node type of the two nodes and the duration information of the operations supported by the device corresponding to each of the two device nodes. In one example, when both adjacent nodes are device nodes, the duration information of the relevant operations supported by the device corresponding to the upstream node and the duration information of the relevant operations supported by the device corresponding to the downstream node can be counted separately to determine the total time. The relevant operation is, for example, a transfer operation to the target. In another example, when only one of the two adjacent nodes is a device node, the total time can be determined based on the node type of the other node and the duration information of the relevant operations supported by the device corresponding to the device node. This relevant operation is, for example, a partial transfer operation performed on the target.

[0052] According to the above scheme, the total time can be determined based on the node types of two adjacent nodes in the automated process and the duration of operations supported by the devices corresponding to those nodes. This scheme determines a relatively accurate total time, thus ensuring accurate verification of the time constraints. Furthermore, the scheme is relatively simple and computationally intensive.

[0053] For example, the node type also includes a starting node. The starting node can be a node located at the beginning of the automated process. For step S1410, determining the total time based on the node type and the duration information of the operations supported by the device corresponding to the device node includes steps S1411 and S1412.

[0054] In step S1411, if the upstream node in two adjacent nodes is the starting node, the first execution time of the pre-operation corresponding to the downstream node in the two adjacent nodes is determined, wherein the pre-operation is the operation completed before the device corresponding to the downstream node performs its own operation.

[0055] According to embodiments of this application, the transfer operation of the target may include pre-operations involving the device node, completed before the main execution device performs the main operation. For example, the pre-operations may be handling operations performed by the handling equipment involving the device node, and opening / closing operations performed by the main execution device or its peripheral equipment, such as a lid-opening device. These pre-operations can be understood as preparatory operations performed before the main execution device performs the main operation.

[0056] In a pair of adjacent nodes, the upstream node can be the starting node, and the downstream node can be a device node. For example, the upstream node might be the starting node for consumable 1, and the downstream node might be a device node representing a pipetting workstation. Based on the node information of the device node, the first execution time of the pre-operation to be completed before the pipetting operation is performed by the pipetting workstation can be determined. This pre-operation can be preparatory work done to facilitate the pipetting operation. The first execution time of the pre-operation can be found based on the list of pre-operations in the node information of the device node. For example, the pre-operation might include a transport operation where a robotic arm moves consumable 1 from its starting position to the pipetting workstation. In this case, the preset transport time for the robotic arm to move consumable 1 can be used as the first execution time. For example, if the transport time is 20 seconds, the first execution time is equal to 20 seconds. It is easy to understand that if the pre-operations involved in a device node include multiple operations, the first execution time can be the sum of the estimated execution times of these multiple operations. That is, the sum of the estimated execution times of all pre-operations involved in the device node can be calculated.

[0057] Therefore, in step S1412, the first execution time can be determined as the total time. For example, the estimated handling time of 20 seconds required to move consumable 1 from the starting position to the pipetting workstation can be determined as the total time of the transfer operation between nodes. Alternatively, the sum of the estimated execution times of multiple preceding operations involved in the device nodes directly connected to the starting node can be determined as the estimated total time of the transfer operation. Based on this total time, the reasonableness of the time constraint information between the starting node and the device nodes can be verified. This solution is readily understood by those skilled in the art and will not be elaborated further here.

[0058] According to the above scheme, when two adjacent nodes are the starting node and the device node, the first execution time of the preceding operations involved in the device node can be used to determine the estimated total time for the transfer operation between the two nodes. This scheme has simple execution logic, low computational load, and a relatively accurate total time determination, thereby improving the efficiency and accuracy of verification.

[0059] For example, step S1410 determines the total time based on the node type and the duration information of the operations supported by the device corresponding to the device node, including steps S1413 and S1414.

[0060] In step S1413, when both adjacent nodes are device nodes, the second execution time of the subsequent operation corresponding to the upstream node in the two adjacent nodes is determined, and the third execution time of the preceding operation corresponding to the downstream node in the two adjacent nodes is determined. The subsequent operation is the operation completed after the device corresponding to the upstream node performs its own operation, and the preceding operation is the operation completed before the device corresponding to the downstream node performs its own operation.

[0061] According to embodiments of this application, the transfer operation of a target may include pre-operations involving a device node, completed before the main execution device performs the main operation, or post-operations completed after the main execution device performs the main operation. Both adjacent nodes can be device nodes. Each device node can involve both pre-operations and post-operations. The transfer operation between two device nodes can be a post-operation performed on the target by the transfer device involved in the upstream device node and a pre-operation performed on the target by the transfer device involved in the downstream device node. The node information for each device can include a pre-operation list and a post-operation list. The estimated execution time of the post-operation on the target can be found in the post-operation list of the upstream device node as a second execution time. The estimated execution time of the pre-operation on the target can be found in the pre-operation list of the downstream device node as a third execution time. The pre-operations and post-operations involved in each device node can be various suitable operations set according to actual needs during the process design phase. The post-operation of the upstream device node can be considered as a transfer operation that transfers the target from the main execution device of the upstream device node to the main execution device of the downstream device node. In a specific example, the upstream device node could be a centrifuge as the primary execution device, and the downstream device node could be an incubator as the primary execution device. The subsequent operations involved in the upstream device node of the centrifuge can be operations performed after the centrifugation operation. For example, the centrifuge device node could include the centrifuge's rotation operation to move consumables to the outlet, the centrifuge door opening operation, the robotic arm removing consumables, and the centrifuge door closing operation. Therefore, based on the list of preceding and following operations for the centrifuge device node, the sum of the estimated execution times of all the above subsequent operations can be determined as the second execution time. The preceding operations involved in the downstream device node, where the primary execution device is an incubator, could include the incubator's plate-dispensing operation. The estimated execution time of this plate-dispensing operation can be used as the third execution time.

[0062] In step S1414, the second execution time and the third execution time are summed to obtain the total time. The sum of the estimated execution time of the subsequent operation involved in the upstream device node and the estimated execution time of the preceding operation involved in the downstream device node, as determined in the above steps, can be calculated, and the two execution times are determined as the estimated total time of the transfer operation of the target between the two device nodes.

[0063] According to the above scheme, when both adjacent nodes are device nodes, the estimated total time for the transfer operation of the target between the two adjacent nodes is determined by summing the estimated execution time of the subsequent operation involved in the upstream device node and the estimated execution time of the preceding operation involved in the downstream device node. The rationality of the time constraint information is then verified based on this total time. This scheme has simple execution logic, low computational load, and a relatively accurate total time, thereby improving the efficiency and accuracy of the verification.

[0064] For example, the node type also includes an end node. An end node can be an end point indicating the end of a process. It is easy to understand that an end point is not a device node, therefore, the transfer operation to the target is not included in the end node. Step S1410 determines the total time based on the node type and the duration information of the operations supported by the device corresponding to the device node, including steps S1415 and S1416. In step S1415, if the downstream node in two adjacent nodes is an end node, the fourth execution time of the subsequent operation corresponding to the upstream node in the two adjacent nodes is determined, where the subsequent operation is the operation completed after the device corresponding to the upstream node performs its own operation. In step S1416, the determined fourth execution time can be used as the total time.

[0065] When the upstream node of two adjacent nodes is a device node and the downstream node is an end node, the estimated execution time of all subsequent operations involving the upstream node can be determined based on the node information of the upstream node, serving as the fourth execution time. The subsequent operations involving the device node directly connected to the end node can also be any suitable transfer operation, such as opening or closing a door on the main execution equipment, or a transfer operation where a robotic arm moves a target from the main execution equipment of the device node to the end position. This fourth execution time can be the sum of the estimated execution times of the aforementioned subsequent operations. This fourth execution time can be used as the estimated total time for the transfer operation between the device node and the end node, and the reasonableness of the time constraint information can be verified based on this total time.

[0066] According to the above scheme, when two adjacent nodes are a device node and an end node, the estimated execution time of the subsequent operations involved in the device node can be determined as the estimated total time of the transfer operation between the two nodes. This total time can then be used to verify the rationality of the time constraint information. This scheme has simple execution logic, low computational load, and a relatively accurate total time, thereby improving the efficiency and accuracy of the verification.

[0067] For example, step S1200 obtains time constraint information and node information between two adjacent nodes in the automated process, including step S1210.

[0068] In step S1210, for each starting node or device node in the automated process, the node information of the starting node or device node is obtained, and the downstream nodes directly connected to the starting node or device node are traversed. If the downstream node is a device node or an ending node, its node information is obtained. According to the embodiments of this application, the entire automated process can be traversed using the flowchart as a guide to obtain the time constraint information and node information between each pair of adjacent nodes. The time constraint information between each pair of adjacent nodes is then verified. Specifically, following the execution direction of the automated process, firstly, the node information of the device node directly connected to the starting node of the consumable and the time constraint information between them are obtained, and the rationality of each time constraint information is verified. Secondly, the device node and its directly connected downstream nodes are obtained. If the downstream node is a device node or an ending node, the node information of these two nodes and the time constraint information between them are obtained and verified. Then, if the downstream node is a device node, the time constraint information between the device node directly connected to it or the ending node can be obtained, and the rationality of the time constraint information is verified. By analogy, the time constraint information of subsequent adjacent nodes can be continuously obtained and their rationality verified... Ultimately, the node information and time constraint information of the last device node and the end node in the automated process can be obtained, and their time constraint information can be verified. Alternatively, one can first traverse the automated process to find the node information and time constraint information of every two nodes in the cases where adjacent nodes are the start node and device node, device node and device node, or device node and end node. Then, the time constraint information between each pair of nodes can be verified separately.

[0069] According to the above scheme, the node information and time constraint information of any two adjacent nodes in the entire automated process can be obtained, and the rationality of the time constraint information can be verified respectively. This ensures that each time constraint information is effectively verified, thereby guaranteeing the smooth execution of the automated process, and also improves the efficiency of verification.

[0070] For example, device nodes in two adjacent nodes correspond to multiple targets. For instance, either device node in two adjacent nodes may contain a primary execution device that performs operations on multiple consumables. This device node is also involved in transfer operations performed on the multiple consumables. Time constraint information is used to constrain the execution time of the transfer operation between the two adjacent nodes for each of the multiple targets.

[0071] Step S1400 determines the total time of the transfer operation, including determining the total time of the transfer operation for each of the multiple targets. Step S1600 verifies the reasonableness of the time constraint information, including verifying the reasonableness of the time constraint information for each target based on the total time of the transfer operation for each target. For example, in the example of steps S1110 and S1120 above, time constraint information input by the user using operable controls of the graphical user interface is received, such as the expiration time of "consumable 1" being "55" seconds and the expiration time of "consumable 2" being "50" seconds. Then, in step S1400, it is necessary to determine the total preset execution time of the transfer operation for "consumable 1" involving the device nodes of the two nodes. And in step S1600, the expiration time of "consumable 1" being constrained by "55" seconds is verified, and it is determined whether the expiration time of "55" seconds is set reasonably. And in step S1400, the total preset execution time of the transfer operation for "consumable 2" involving the device nodes of the two nodes is determined. In step S1600, the expiration time "50" seconds of the constraint "consumable 2" is verified, and it is determined whether the expiration time "50" seconds is set reasonably.

[0072] Figure 2 A partial schematic diagram of an automated process according to an embodiment of this application is shown. As shown, the figure illustrates three device nodes in the automated process. The upstream node "pipette workstation" and the downstream node "centrifuge" are adjacent device nodes. Time constraint information can be included between these two device nodes to constrain the execution time of the transfer operation of "consumable 3". For these two device nodes, in step S1400, the estimated execution time of the subsequent operation involving "consumable 3" at the "pipette workstation" device node and the estimated execution time of the preceding operation involving "consumable 3" at the "centrifuge" device node can be determined as the total time for the transfer operation of "consumable 3" performed between these two nodes. In step S1600, the time constraint information constraining the execution time of the transfer operation of "consumable 3" can be verified based on the determined total time.

[0073] In this diagram, the upstream node "pipettes workstation" and the downstream node "incubator" are also adjacent device nodes. Time constraint information can be included between these two device nodes to constrain the transfer operations of "consumable 4" and "consumable 5," respectively. In step S1400, the estimated execution time of the subsequent operation involving "consumable 4" at the "pipettes workstation" device node and the estimated execution time of the preceding operation involving "consumable 4" at the "incubator" device node can be determined as the total time for the transfer operation of "consumable 4" performed between these two nodes, referred to as the "total transfer time of consumable 4." Similarly, the estimated execution time of the subsequent operation involving "consumable 5" at the "pipettes workstation" device node and the estimated execution time of the preceding operation involving "consumable 5" at the "incubator" device node can also be determined as the total time for the transfer operation of "consumable 5" performed between these two nodes, referred to as the "total transfer time of consumable 5." In step S1600, the time constraint information used to constrain the execution time of the transfer operation of "consumable 4" can be verified based on the "total transfer time of consumable 4"; and the time constraint information used to constrain the execution time of the transfer operation of "consumable 5" can be verified based on the "total transfer time of consumable 5".

[0074] According to the above scheme, when a device node includes time constraint information for multiple targets, the time constraint information for each target can be verified separately. This ensures the accuracy and effectiveness of the verification, thereby guaranteeing the accurate execution of the automated process.

[0075] For example, the time constraint information includes expiration time information. As mentioned above, the expiration time information can be used to indicate the expiration time of the target. The preset expiration time can be equal to the sum of the execution time of the transfer operation and the fault tolerance time. Step S1600 verifies whether the time constraint information is reasonable, including steps S1610 and S1620.

[0076] In step S1610, if the expiration time shown in the expiration time information is greater than or equal to the total time, the time constraint information is determined to be reasonable. If the expiration time is greater than or equal to the preset time for the transfer operation of the target between the two nodes as determined in step S1400, then the expiration time setting is considered reasonable. In step S1620, if the expiration time shown in the expiration time information is less than the total time, the time constraint information is determined to be incorrect. That is, the expiration time should not be less than the estimated total time of the transfer operation. Otherwise, it indicates that the time constraint information setting is unreasonable, which may affect the smooth progress of the automated process.

[0077] If the time constraint information is determined to be unreasonable, corresponding prompts can be issued to remind the user to make modifications. For example, a "Verification failed" prompt box can pop up on the verification interface, along with information about the nodes where the verification failed. This allows users to easily modify the time constraint information between the corresponding nodes based on the prompts.

[0078] According to the above scheme, the reasonableness of the time constraint information can be determined by comparing the expiration time shown in the expiration time information of two adjacent nodes with the preset total time of the transfer operation between the two nodes. This verification logic is simpler and requires less computation.

[0079] For example, after verifying the reasonableness of the time constraint information in step S1600, method 1000 further includes steps S1710, S1720, and S1730. After the initial verification of the time constraint information between two adjacent nodes, the time constraint information can be verified again. For instance, after the user modifies the time constraint information in the process, in response to the user's pre-run operation of the process, steps S1710, S1720, and S1730 can be executed to re-verify the time constraint information.

[0080] In step S1710, the execution order of the smallest sub-operations of two adjacent nodes is determined based on their connection relationship in the automated process. For example, the smallest sub-operations involved in the two adjacent nodes can be parsed based on their node information. These smallest sub-operations can be, for example, the smallest operation units of various operations performed by various devices on a target by the device node. This can include the smallest operation unit of the main operation performed by the main executing device, or the smallest operation units of the preceding and following operations performed by the transfer device. For example, the smallest sub-operations include the opening and closing of a centrifuge door, the handling operation of a robotic arm, the rotation operation of a centrifuge, etc. Then, the execution order of the parsed smallest sub-operations can be determined based on the connection relationship between the two nodes. This execution order can include, for example, a serial execution order or a parallel execution order.

[0081] In step S1720, the total time is determined again based at least on the execution order and the preset execution time of each smallest sub-operation. For example, a set of serial sub-operations executed in a sequential order can be determined based on the determined execution order of each parsed smallest sub-operation. The preset execution time of each smallest sub-operation in this serial sub-operation can be obtained accordingly. And the total time of the transfer operation can be determined again based on the execution time of each smallest sub-operation of the transfer operation involving the target in the serial sub-operation. For example, when two adjacent nodes are a start node and a device node, the sum of the first preset execution times of each smallest sub-operation involved in the preceding operation corresponding to the device node can be calculated as the total time of the transfer operation. When two adjacent nodes are both device nodes, the sum of the second preset execution times of each smallest sub-operation involved in the following operation corresponding to the upstream device node and the sum of the third preset execution times of each smallest sub-operation involved in the preceding operation corresponding to the downstream device node can be calculated, and the sum of the second and third preset execution times can be added together as the total time of the transfer operation. When two adjacent nodes are a device node and an end node, the sum of the fourth preset execution times of each smallest sub-operation involved in the following operation corresponding to the device node can be calculated as the total time of the transfer operation. In a specific example, for instance, the smallest sub-operations of the transfer operation involving the target in the serial sub-operation include the centrifuge opening operation, the centrifuge closing operation, and the robotic arm handling operation. Therefore, the sum of the preset execution times of the centrifuge opening operation, the centrifuge closing operation, and the robotic arm handling operation can be determined as the total time.

[0082] In step S1730, the time constraint information is checked again for reasonableness based on the re-determined total time. This step is similar to step S1600, and its various implementation schemes are readily understood by those skilled in the art, so they will not be described in detail here.

[0083] According to the above scheme, after the initial verification that the time constraint information between the two nodes is correct, the time constraint information can be verified again before the automated process runs. This scheme can ensure the rationality of the time constraint information, thereby ensuring the effectiveness and availability of the objective, and thus ensuring the smooth and effective execution of the automated process.

[0084] For example, the time constraint information includes expiration time information. After verifying whether the time constraint information is reasonable in step S1600, method 1000 further includes step S1800.

[0085] In step S1800, after determining that the time constraint information is reasonable, an automated process is run in response to the user's second operation. During the execution of the automated process, it is determined whether the execution time of the transfer operation between two adjacent nodes exceeds the expiration time indicated by the expiration time information. If it does, the target is marked as expired. The second operation can be any suitable operation. Exemplarily, but not limitingly, the user interface may include a "Run Process" control, and the second operation may be the user clicking this control. According to embodiments of this application, the automated process can be run after verifying that the time constraint information between two adjacent nodes is correct. Furthermore, when the time constraint information includes expiration time information, when the process reaches the transfer operation associated with the expiration time information, the actual execution time of the transfer operation between the two nodes can be monitored, and if the actual execution time exceeds the expiration time, the target can be marked as expired. This prompts the user that the target has expired, facilitating appropriate processing of the expired target.

[0086] The above solution can monitor the actual execution time of target transfer operations during the automated process phase, based on verified time constraint information, and mark the target as expired if it is determined to be expired. This reminds users to pay special attention to expired targets, ensuring their validity and availability, and thus guaranteeing the smooth and effective execution of the automated process.

[0087] Figures 3a to 3c Schematic flowcharts are shown for three different parts of an automated process management method according to another embodiment of this application. Among them, Figure 3a A schematic flowchart illustrating the first part of a method for managing an automated process according to another embodiment of this application is shown. Figure 3a As shown, for each starting node in the automated process, each line originating from that node is traversed. If another node connected to that line is a device node, the node information of both nodes and the time constraint information between them can be obtained. The time constraint information includes, for example, expiration time information. The pre-operation time involved in the device node can be calculated as the estimated total time for the transfer operation between the two nodes. Then, the reasonableness of the time constraint information can be verified by comparing the expiration time shown in the expiration time information with the total time. If the expiration time is less than the total time, the verification fails; otherwise, the verification succeeds. Figure 3b A schematic flowchart illustrating the second part of a method for managing an automated process according to another embodiment of this application is shown. Figure 3bAs shown, for each device node in the automated process, each line originating from that node is traversed. If another node connected to that line is also a device node, the node information of both device nodes and the time constraint information between them can be obtained. The time constraint information includes, for example, expiration time information. The sum of the subsequent operation time involved in the upstream device node and the preceding operation time involved in the downstream device node can be calculated as the estimated total time for the transfer operation between the two nodes. Then, the reasonableness of the time constraint information can be verified by comparing the expiration time and the total time shown in the expiration time information. Figure 3c A schematic flowchart illustrating a third part of a method for managing an automated process according to another embodiment of this application is shown. Figure 3c As shown, for each device node in the automated process, each line originating from that node is traversed. If the other node connected to that line is an end node, node information for both nodes and time constraint information between them can be obtained. Time constraint information includes, for example, expiration time information. The subsequent operation time involved in the upstream device node can be calculated as the estimated total time for the transfer operation between the two nodes. Then, the reasonableness of the time constraint information can be verified by comparing the expiration time and total time shown in the expiration time information.

[0088] According to a second aspect of this application, an automated process management device is also provided. Figure 4 A schematic block diagram of an automated process management device 400 according to an embodiment of this application is shown. As shown, the device 400 includes:

[0089] The acquisition module 410 is used to acquire time constraint information and node information between two adjacent nodes in the automated process. The time constraint information is used to constrain the execution time of the transfer operation of the target between two adjacent nodes.

[0090] The determination module 420 is used to determine the total time of the transfer operation based on the node information of two adjacent nodes.

[0091] The verification module 430 is used to verify whether the time constraint information is reasonable based on the total time.

[0092] According to a third aspect of this application, an electronic device is also provided. Figure 5 A schematic block diagram of an electronic device 500 according to an embodiment of this application is shown. As shown, the electronic device 500 includes a processor 510 and a memory 520. The memory stores computer program instructions, which, when executed by the processor, are used to perform the management method 1000 of the aforementioned automated process.

[0093] According to a fourth aspect of this application, a storage medium is also provided. Program instructions are stored on the storage medium, which, when executed, are used to perform the management method for the aforementioned automated process. The storage medium may, for example, include a storage component of a tablet computer, a hard disk of a personal computer, a read-only memory (ROM), an erasable programmable read-only memory (EPROM), a portable read-only memory (CD-ROM), a USB memory, or any combination of the above storage media. The computer-readable storage medium may be any combination of one or more computer-readable storage media.

[0094] Those skilled in the art can understand the specific implementation schemes and beneficial effects of the above-mentioned automated process management devices, electronic devices and storage media by reading the relevant descriptions of the automated process management methods. For the sake of brevity, they will not be described in detail here.

[0095] Although exemplary embodiments have been described herein with reference to the accompanying drawings, it should be understood that the above exemplary embodiments are merely illustrative and are not intended to limit the scope of this application. Various changes and modifications can be made therein by those skilled in the art without departing from the scope and spirit of this application. All such changes and modifications are intended to be included within the scope of this application as claimed in the appended claims.

[0096] Those skilled in the art will recognize that the units and algorithm steps of the various examples 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 implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0097] In the several embodiments provided in this application, it should be understood that the disclosed devices and methods can be implemented in other ways. For example, the device embodiments described above are merely illustrative. For instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another device, or some features may be ignored or not executed.

[0098] Numerous specific details are set forth in the specification provided herein. However, it will be understood that embodiments of this application may be practiced without these specific details. In some instances, well-known methods, structures, and techniques have not been shown in detail so as not to obscure the understanding of this specification.

[0099] Similarly, it should be understood that, in order to streamline this application and aid in understanding one or more of the various inventive aspects, features of this application may sometimes be grouped together in a single embodiment, figure, or description thereof in the description of exemplary embodiments of this application. However, this approach should not be construed as reflecting an intention that the claimed application requires more features than are expressly recited in each claim. Rather, as reflected in the corresponding claims, its inventive point lies in solving the corresponding technical problem with features fewer than all features of a single disclosed embodiment. Therefore, the claims following the detailed description are hereby expressly incorporated into that detailed description, wherein each claim itself is a separate embodiment of this application.

[0100] Those skilled in the art will understand that, apart from the mutual exclusion of features, all features disclosed in this specification (including the accompanying claims, abstract, and drawings) and all processes or units of any method or apparatus so disclosed can be combined in any combination. Unless otherwise expressly stated, each feature disclosed in this specification (including the accompanying claims, abstract, and drawings) may be replaced by an alternative feature that serves the same, equivalent, or similar purpose.

[0101] Furthermore, those skilled in the art will understand that although some embodiments described herein include certain features but not others included in other embodiments, combinations of features from different embodiments are intended to be within the scope of this application and form different embodiments. For example, in the claims, any one of the claimed embodiments can be used in any combination.

[0102] The various component embodiments of this application can be implemented in hardware, or as software modules running on one or more processors, or a combination thereof. Those skilled in the art will understand that microprocessors or digital signal processors (DSPs) can be used in practice to implement some or all of the functions of some modules in the automated process management device according to the embodiments of this application. This application can also be implemented as a device program (e.g., a computer program and computer program product) for performing part or all of the methods described herein. Such an implementation of this application can be stored on a computer-readable medium, or can be in the form of one or more signals. Such signals can be downloaded from an Internet website, provided on a carrier signal, or provided in any other form.

[0103] It should be noted that the above embodiments are illustrative of this application and not restrictive, and that those skilled in the art can devise alternative embodiments without departing from the scope of the appended claims. In the claims, any reference signs placed between parentheses should not be construed as limiting the claims. The word "comprising" does not exclude the presence of elements or steps not listed in the claims. The word "a" or "an" preceding an element does not exclude the presence of a plurality of such elements. This application can be implemented by means of hardware comprising several different elements and by means of a suitably programmed computer. In the unit claims enumerating several means, several of these means may be embodied by the same item of hardware. The use of the words first, second, and third, etc., does not indicate any order. These words can be interpreted as names.

[0104] The above description is merely a specific embodiment or illustration of the embodiments of this application. The scope of protection of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this application should be included within the scope of protection of this application. The scope of protection of this application shall be determined by the scope of the claims.

Claims

1. A method for managing automated processes, characterized in that, include: The time constraint information and node information between two adjacent nodes in the automated process are obtained. The time constraint information is used to constrain the execution time of the transfer operation of the target between the two adjacent nodes. The automated process is a process composed of multiple nodes connected in a connection order. The transfer operation is an operation performed by the transfer device on the target. The target is the object operated on in the automated process. The node information includes node type, which includes device node. The node information of the device node also includes: the duration information of the operation supported by at least one device corresponding to the device node. Based on the node information of the two adjacent nodes, the total time of the transfer operation is determined, including: based on the node type and the duration information of operations supported by at least one device corresponding to the device node, calculating the execution time of the transfer operation between the two adjacent nodes to determine the total time; and Based on the total time, verify whether the time constraint information is reasonable.

2. The method for managing automated processes as described in claim 1, characterized in that, The node type also includes the start node; The method of determining the total time by calculating the execution time of the transfer operation between two adjacent nodes based on the node type and the duration information of the operation supported by at least one device corresponding to the device node, including: When the upstream node in one of the two adjacent nodes is the starting node, the first execution time of the preceding operation corresponding to the downstream node in the two adjacent nodes is determined, wherein the preceding operation is the operation completed before the device corresponding to the downstream node performs its own operation; and The first execution time is determined as the total time.

3. The method for managing automated processes as described in claim 1, characterized in that, The method of determining the total time by calculating the execution time of the transfer operation between two adjacent nodes based on the node type and the duration information of the operation supported by at least one device corresponding to the device node, including: When both adjacent nodes are device nodes, determine the second execution time of the subsequent operation corresponding to the upstream node and the third execution time of the preceding operation corresponding to the downstream node, wherein the subsequent operation is the operation completed after the device corresponding to the upstream node performs its own operation, and the preceding operation is the operation completed before the device corresponding to the downstream node performs its own operation; and The second execution time and the third execution time are summed to obtain the total time.

4. The method for managing automated processes as described in claim 1, characterized in that, The node type also includes end nodes; The method of determining the total time by calculating the execution time of the transfer operation between two adjacent nodes based on the node type and the duration information of the operation supported by at least one device corresponding to the device node, including: If the downstream node in one of the two adjacent nodes is the end node, determine the fourth execution time of the subsequent operation corresponding to the upstream node in the two adjacent nodes, wherein the subsequent operation is the operation completed after the device corresponding to the upstream node performs its own operation; and The fourth execution time is determined as the total time.

5. The method for managing automated processes as described in any one of claims 2 to 4, characterized in that, The acquisition of time constraint information and node information between two adjacent nodes in the automated process includes: For each starting node or device node in the automated process, obtain the node information of the starting node or device node, traverse the downstream nodes directly connected to the starting node or device node, and if the downstream node is a device node or an ending node, obtain the node information of the downstream node.

6. The method for managing automated processes as described in any one of claims 1 to 4, characterized in that, The device nodes in two adjacent nodes correspond to multiple targets, and the time constraint information is used to constrain the execution time of the transfer operation between the two adjacent nodes for each of the multiple targets. Determining the total time of the transfer operation includes: determining the total time of the transfer operation for each of the plurality of targets; The verification of whether the time constraint information is reasonable includes: verifying whether the time constraint information of each target is reasonable based on the total time of the transfer operation for each target.

7. The method for managing automated processes as described in any one of claims 1 to 4, characterized in that, The time constraint information includes expiration time information, and the verification of whether the time constraint information is reasonable includes: If the expiration time shown in the expiration time information is greater than or equal to the total time, the time constraint information is determined to be reasonable; and If the expiration time shown in the expiration time information is less than the total time, it is determined that the time constraint information is incorrect.

8. The method for managing automated processes as described in any one of claims 1 to 4, characterized in that, Before obtaining the time constraint information between two adjacent nodes in the automated process, the method further includes: Display a graphical user interface, which includes operable controls; In response to a first operation by the user using the operable control, the time constraint information is received from the user.

9. The method for managing automated processes as described in any one of claims 1 to 4, characterized in that, The time constraint information includes expiration time information. After verifying whether the time constraint information is reasonable, the method further includes: After determining that the time constraint information is reasonable, the automated process is executed in response to the user's second operation. During the execution of the automated process, it is determined whether the execution time of the transfer operation of the target between the two adjacent nodes exceeds the expiration time indicated by the expiration time information, and if it does, the target is marked as expired.

10. The method for managing automated processes as described in any one of claims 1 to 4, characterized in that, After verifying whether the time constraint information is reasonable, the method further includes: Based on the connection relationship between the two adjacent nodes in the automated process, determine the execution order of the smallest sub-operations between the two adjacent nodes; The total time is determined again, at least based on the execution order and the preset execution time of each of the smallest sub-operations; and Based on the re-determined total time, the time constraint information is verified again to determine whether it is reasonable.

11. A management device for an automated process, characterized in that, include: The acquisition module is used to acquire time constraint information and node information between two adjacent nodes in the automated process. The time constraint information is used to constrain the execution time of the transfer operation of the target between the two adjacent nodes. The automated process is a process composed of multiple nodes connected in a connection order. The transfer operation is an operation performed by the transfer device on the target. The target is the object operated on in the automated process. The node information includes node type, which includes device node. The node information of the device node also includes the duration information of the operation supported by at least one device corresponding to the device node. The determining module is configured to determine the total time of the transfer operation based on the node information of the two adjacent nodes, wherein the determination includes: calculating the execution time of the transfer operation between the two adjacent nodes based on the node type and the duration information of operations supported by at least one device corresponding to the device node, to determine the total time; and The verification module is used to verify whether the time constraint information is reasonable based on the total time.

12. An electronic device comprising a processor and a memory, wherein, The memory stores computer program instructions, which, when executed by the processor, are used to perform the management method for the automated process as described in any one of claims 1 to 10.

13. A storage medium storing program instructions that, when executed, perform a management method for an automated process as described in any one of claims 1 to 10.

Images