WO2024093928A1 - 自动化流程的管理方法、装置、电子设备及存储介质 - Google Patents

自动化流程的管理方法、装置、电子设备及存储介质 Download PDF

Info

Publication number
WO2024093928A1
WO2024093928A1 PCT/CN2023/127813 CN2023127813W WO2024093928A1 WO 2024093928 A1 WO2024093928 A1 WO 2024093928A1 CN 2023127813 W CN2023127813 W CN 2023127813W WO 2024093928 A1 WO2024093928 A1 WO 2024093928A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
time
information
adjacent nodes
constraint information
Prior art date
Application number
PCT/CN2023/127813
Other languages
English (en)
French (fr)
Inventor
孙飞
Original Assignee
深圳镁伽科技有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 深圳镁伽科技有限公司 filed Critical 深圳镁伽科技有限公司
Publication of WO2024093928A1 publication Critical patent/WO2024093928A1/zh

Links

Classifications

    • G—PHYSICS
    • G05—CONTROLLING; REGULATING
    • G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B19/00—Programme-control systems
    • G05B19/02—Programme-control systems electric
    • G05B19/418—Total factory control, i.e. centrally controlling a plurality of machines, e.g. direct or distributed numerical control [DNC], flexible manufacturing systems [FMS], integrated manufacturing systems [IMS] or computer integrated manufacturing [CIM]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/02—Total factory control, e.g. smart factories, flexible manufacturing systems [FMS] or integrated manufacturing systems [IMS]

Definitions

  • the present application belongs to the field of automation, and more specifically, particularly relates to a management method, device, electronic device and storage medium for an automation process.
  • the automation system can plan the operations in the automation process according to time. For example, a transfer device in the automation process will take a certain amount of time to perform the corresponding transfer operation.
  • the automation system can plan the execution operation of the subsequent equipment located after the transfer device in the automation process accordingly, so that the subsequent equipment performs the corresponding operation according to the plan.
  • the problem of too long transfer operation time for sample transfer is usually ignored, which leads to too long exposure time of the sample, which in turn may cause damage to the sample.
  • the damage to the sample is very likely to make the automation process unable to execute normally, thereby obtaining wrong results.
  • a method for managing an automated process comprises: obtaining 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; determining the total time of the transfer operation based on the node information of the two adjacent nodes; and verifying whether the time constraint information is reasonable based on the total time.
  • the node information includes the node type, the node type includes the device node, and the node information of the device node also includes: the duration information of the operations supported by the device corresponding to the device node; based on the node information of two adjacent nodes, the total time of the transfer operation is determined, including: based on the node type and the duration information of the operations supported by the device corresponding to the device node, the total time is determined.
  • the node type also includes a starting node; based on the node type and the duration information of the operations supported by the device corresponding to the device node, the total time is determined, including: when the upstream node among the two adjacent nodes is the starting node, determining the first execution time of the previous operation corresponding to the downstream node among the two adjacent nodes, wherein the previous operation is an operation completed before the device corresponding to the downstream node executes its own operation; and determining the first execution time as the total time.
  • 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 two adjacent nodes are both device nodes, determining the second execution time of the subsequent operation corresponding to the upstream node of the two adjacent nodes, and determining the third execution time of the previous operation corresponding to the downstream node of the two adjacent nodes, wherein the subsequent operation is an operation completed after the device corresponding to the upstream node executes its own operation, and the previous operation is an operation completed before the device corresponding to the downstream node executes its own operation; and adding the second execution time and the third execution time to obtain the total time.
  • the node type also includes an end node; based on the node type and the duration information of the operations supported by the device corresponding to the device node, the total time is determined, including: when the downstream node among the two adjacent nodes is the end node, determining the fourth execution time of the subsequent operation corresponding to the upstream node among the two adjacent nodes, wherein the subsequent operation is an operation completed after the device corresponding to the upstream node performs its own operation; and determining the fourth execution time as the total time.
  • 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 in the case where the downstream node is a device node or an end node, obtaining the node information of the downstream node.
  • the device nodes in two adjacent nodes correspond to multiple targets
  • the time constraint information is used to respectively constrain the execution time of the transfer operation of each target in the multiple targets between the two adjacent nodes, and determine the total time of the transfer operation, including: determining the total time of the transfer operation for each target in the multiple targets; verifying whether the time constraint information is reasonable, including: based on the total time of the transfer operation for each target, separately verifying whether the time constraint information of each target is reasonable.
  • the time constraint information includes expiration time information
  • verifying whether the time constraint information is reasonable includes: when the expiration time shown in the expiration time information is greater than or equal to the total time, determining that the time constraint information is reasonable; and when the expiration time shown in the expiration time information is less than the total time, determining that the time constraint information is incorrect.
  • the method further includes: displaying a graphical user interface including operable controls; and receiving time constraint information from a user in response to a first operation of the user using the operable controls.
  • the time constraint information includes expiration time information.
  • the method further includes: after determining that the time constraint information is reasonable, in response to a second operation of the user, running an automated process; wherein, in the process of running the automated process, determining whether the execution time of the transfer operation of the target between two adjacent nodes exceeds the expiration time shown in the expiration time information, and, if exceeded, marking the target as expired.
  • the method further includes: determining the execution order of the minimum sub-operations between two adjacent nodes based on the connection relationship between the two adjacent nodes in the automation process; re-determining the total time based on at least the execution order and the preset execution time of each minimum sub-operation; and re-verifying whether the time constraint information is reasonable based on the re-determined total time.
  • a management device for an automated process comprising: an acquisition module for acquiring time constraint information and node information between two adjacent nodes in the automated process, the time constraint information being used to constrain the execution time of a transfer operation of a target between 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.
  • an electronic device comprising a processor and a memory, wherein the memory stores computer program instructions, and the computer program instructions are used to execute the above-mentioned automated process management method when the processor is running.
  • a storage medium is also provided, on which program instructions are stored, and the program instructions are used to execute the above-mentioned automation process management method when running.
  • the node information of two adjacent nodes in the automation process is used to determine the total time of the transfer operation of the target between the two nodes, and then the pre-set time constraint information for constraining the execution time of the transfer operation is verified based on the total time.
  • FIG1 is a schematic flow chart showing a method for managing an automated process according to an embodiment of the present application
  • FIG2 is a schematic diagram showing a portion of an automation process according to an embodiment of the present application.
  • FIG3 a shows a schematic flow chart of the first part of a method for managing an automated process according to another embodiment of the present application
  • FIG3 b shows a schematic flow chart of the second part of the method for managing an automated process according to another embodiment of the present application
  • FIG3 c shows a schematic flow chart of the third part of the method for managing an automated process according to another embodiment of the present application.
  • FIG4 shows a schematic block diagram of an automated process management device according to an embodiment of the present application.
  • Figure 5 shows a schematic block diagram of an electronic device according to an embodiment of the present application.
  • a management method for an automated process is provided.
  • the management method according to the embodiment of the present application can be applied to automated processes for various suitable targets in various fields.
  • the following is an example of an automated process in an automated system in the field of biochemistry for explanation.
  • Fig. 1 shows a schematic flow chart of a method 1000 for managing an automated process according to an embodiment of the present application.
  • the management method 1000 may include the following steps.
  • Step S1200 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 the transfer operation of the target between two adjacent nodes.
  • the automated process may be pre-designed according to actual experimental/test requirements.
  • step S1200 may be executed in response to any trigger operation of the user after the automated process design is completed.
  • the trigger operation may be any suitable operation, for example, it may be triggered by the user clicking the "Save Process" control after the automated process design.
  • the automated process may include a series of various related operations required to perform experiments/tests on the target.
  • Various process information may be included, such as the execution subject and execution object of each operation, the content of the execution operation, the execution condition, the execution time, the execution logic, etc.
  • the target may be the object operated in the automated process, which may be any suitable target.
  • the target may be consumables for experiments such as test tubes, glass slides, orifice plates, etc., which carry samples such as bacterial liquid.
  • the target may also be other forms of operated objects.
  • the automation process can be a process formed by connecting multiple nodes according to a certain connection order.
  • the node information of each node can include any information related to the various operations to be completed at the node, such as information related to the operation type, operation time, operation instruction, the relevant execution subject of the operation and/or the sub-operation involved in the operation, etc.
  • the operation to be completed at the node can be any suitable operation. These operations are for example: the corresponding processing operation performed by the execution device to the target, such as the centrifugal processing operation performed by the centrifuge to the target.
  • the node information corresponding to the transportation operation can include the information of the position of the target, such as the information about the starting position of the target, the end position of the target and the wrong position of the target when the process is wrong.
  • some nodes can be used for process control, such as for judging and looping in the execution process.
  • the node information between two adjacent nodes in step S1200 can be the node information set when the automation process is established, or it can be the node information configured in advance to the node before the automation process is established.
  • the node information may include the node name, node type, estimated time consumption of the node operation, etc.
  • the node name is an identifier used to distinguish from other nodes, which may be named by the user or directly adopt the name of the device corresponding to the main operation of the node, such as a centrifuge.
  • the node type is divided based on the function corresponding to the node, such as a device node, a start node, an end node, a process control node, etc.
  • the estimated time consumption of the node operation may indicate the estimated time consumption of each operation performed by the node on the target.
  • Two adjacent nodes can be any two nodes in the automation process that are directly connected in the order of execution, and time constraint information can be obtained between the two nodes.
  • Two adjacent nodes include, for example, an upstream node A and a downstream node B. It is easy to understand that the upstream node A is closer to the starting end of the automation process than the downstream node B.
  • the execution of the main operation corresponding to the downstream node B starts after the execution of the main operation corresponding to the upstream node is completed, and there is a logical relationship of sequential execution between the two.
  • the operations related to each node can include the main operation, the front operation and the back operation.
  • the actual execution time of the operation may often exceed its theoretical execution time.
  • some specific targets such as experimental consumables such as bacterial liquid
  • it may become expired and invalid if it exceeds a certain time in a specific device or during the transportation process.
  • the execution time of some related operations can be reasonably fault-tolerant.
  • the actual execution time of related operations can be constrained by setting reasonable time constraints in the time constraint information.
  • the target can be marked as expired or to be discarded when it exceeds the safety time or effective time of the constraint, and it can also be further transported to the discarding location after it is marked as to be discarded.
  • time constraint information can be set between two adjacent nodes according to actual time constraint requirements.
  • the time constraint information is used to constrain the execution time of the transfer operation of the target between two adjacent nodes.
  • the transfer operation can be an operation performed by the transfer equipment on the target.
  • the time constraint information can be set between the two nodes during the design process of the automated process.
  • the constraint content of the time constraint information between the two adjacent nodes can also be arbitrarily set according to the constraint requirements of the process.
  • the time constraint information can include expiration time information and maximum waiting time information.
  • the expiration time information can be the maximum safe duration of the transfer operation of the target preset, so that the corresponding expiration processing is performed on the target when the duration is exceeded, such as marking it as expired.
  • the maximum waiting time information can be the maximum effective duration of the transfer operation of the target preset, so that the corresponding invalidation and/or discard processing is performed on the target when the duration is exceeded, such as marking it as invalid and discarding.
  • the time constraint information can also be other suitable information for constraining the duration of the transfer operation of the target.
  • the corresponding duration constrained in the time constraint information may be obtained by, for example, reading the time constraint information between two adjacent nodes.
  • Step S1400 determining the total time of the transfer operation based on the node information of two adjacent nodes.
  • the node information of two adjacent nodes may include any information related to various operations performed at each node.
  • the node information may include an operation list of various operations corresponding to the node and an estimated execution time of each operation.
  • the node information may include a sub-operation list of the transfer operation performed at the node and an estimated execution time of each sub-operation. In this step, the total time of the transfer operation to the target performed between the two nodes can be determined based on the estimated execution time of the sub-operations of the transfer operation performed at the two nodes respectively.
  • the estimated time information of the transfer operation performed between the two nodes contained therein can be determined based on the node information of each node in the two adjacent nodes, and the total time can be determined based on the estimated time information.
  • the 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 the nodes can be first screened out 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 screened out sub-operation according to a suitable statistical method.
  • Step S1600 based on the total time, verify whether the time constraint information is reasonable.
  • each node in the entire automation process can be traversed to verify the rationality of the time constraint information between each adjacent node.
  • the total time determined in step S1400 can be the estimated execution time or theoretical execution time of all sub-operations of the transfer operation between two adjacent nodes, which is statistically calculated using any appropriate 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.
  • the purpose of setting the time constraint information between the two nodes is to make reasonable fault tolerance for the execution time of the transfer operation, that is, to allow the actual execution time of the transfer operation to properly exceed the theoretical execution time within the safety or effectiveness range of the target.
  • 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.
  • step S1600 based on the total time of the transfer operation determined in step S1400, it can be verified whether the time constraint information between the two adjacent nodes is reasonable. Any appropriate verification logic can be used to verify the rationality of the time constraint information. For example, the total time can be compared with the size of the constraint time indicated in the time constraint information for verification.
  • the node information of two adjacent nodes in the automation process is used to determine the total time of the transfer operation of the target between the two nodes, and then the pre-set time constraint information for constraining the execution time of the transfer operation is verified based on the total time.
  • method 1000 before acquiring the time constraint information between two adjacent nodes in the automation process in step S1200 , method 1000 further includes steps S1110 and S1120 .
  • a graphical user interface is displayed, and the graphical user interface includes operable controls.
  • the time constraint information between two adjacent nodes can be set in the design stage of the automation process.
  • the two adjacent nodes can be upstream node A and downstream node B.
  • a graphical user interface for setting the time constraint information can be displayed in response to the user's selection operation of the time constraint information of the upstream node.
  • the time constraint information between the two nodes can include one or more, so one or more operable controls can also be included in the graphical user interface. Each operable control can be used to operate and set each time constraint information.
  • the time constraint information between the two nodes can include expiration time information and maximum waiting time information.
  • the graphical user interface can include a "time constraint information setting between nodes" list. Under this list, two operable controls for setting the time constraint information between the currently selected node and its adjacent downstream node can be included. 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 control can be any suitable control, such as an input control or a drop-down list selection control.
  • the time constraint information for multiple targets is included between the two adjacent nodes, the time constraint information for each target can also be set using the graphical user interface. Also in the above example, under the "Inter-node time constraint information setting" list in the graphical user interface, there can also be multiple rows of operability controls, which can be used to set the time constraint information for the transfer operation constraining each target.
  • step S1120 in response to the first operation of the user using the operable control, time constraint information is received from the user.
  • the first operation of the user using the operable control can be any suitable operation.
  • the first operation can be, for example, an operation in which the user inputs the desired time number through the input control, or an operation in which the user selects the desired time number through the drop-down list control.
  • the time constraint information input or selected by the user can be received and displayed on the graphical user interface. For example, 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 in step S1120, and the constraint time "55" can be displayed on the interface accordingly.
  • the execution time constraint of the transfer operation of, for example, "consumable material 1" executed between two nodes can be completed.
  • the expiration time of the target can be obtained at the node in step S1200, and the expiration time "55" seconds in the time constraint information can be verified based on the determined total time in step S1600.
  • the above solution of providing a visual human-computer interaction interface and operable controls for users to freely set time constraint information can facilitate users to set more accurate time constraint information and provide better user experience.
  • the node information includes the node type.
  • the node type is divided based on the function corresponding to the node, such as a device node, a start node, an end node, a process control node, etc.
  • the node type of the node may include a 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 a main operation on the target.
  • the device corresponding to the device node may also include a transfer device for performing a 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 target by the main execution device, and may also include the estimated duration information of the transfer operation of the target by the transfer device. 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 performed.
  • the transfer device may also include a main execution device and peripheral devices of the main execution device, such as an opening and closing cover device.
  • the transfer device may also be other devices such as a robotic arm.
  • the devices corresponding to the device node may include a centrifuge and a robotic arm, etc. Therefore, the node information of the device node corresponding to the centrifuge may include the estimated duration of the centrifugation operation performed by the centrifuge, the estimated duration of the cover closing operation performed by the centrifuge or the centrifuge's cover closing device, and the estimated duration of the robotic arm moving the well plate carrying the bacterial solution from the centrifuge to the next node.
  • the main execution devices of the device node may also include a pipetting workstation, an incubator, an ELISA reader, etc.
  • the transport equipment may include the above-mentioned main execution devices themselves, or may only include a robotic arm.
  • Step S1400 determines the total time of the transfer operation based on the node information of two adjacent nodes, including step S1410.
  • 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. That is, at least one of the two adjacent nodes is a device node.
  • the total time can be determined based on the node type of the two nodes and the duration information of the operation supported by the device corresponding to each device node in the two 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 respectively, and then the total time is determined.
  • the relevant operation is, for example, a transfer operation on a target.
  • the duration information of the relevant operations supported by the device corresponding to the device node can be counted based on the node type of the other node to determine the total time.
  • the relevant operation is, for example, a partial transfer operation performed on a target.
  • the total time can be determined based on the node types of two adjacent nodes in the automation process and the duration information of the operations supported by the device corresponding to the device node.
  • the total time determined by this scheme is more accurate, so the verification of the time constraint information is also more accurate.
  • the scheme is simpler and has a smaller amount of calculation.
  • the node type also includes a start node.
  • the start node may be a node located at the start end of the automation process.
  • determining the total time includes steps S1411 and S1412.
  • step S1411 when the upstream node among the two adjacent nodes is the starting node, the first execution time of the previous operation corresponding to the downstream node among the two adjacent nodes is determined, wherein the previous operation is an operation completed before the device corresponding to the downstream node executes its own operation.
  • the transport operation of the target may include a pre-operation involved in the device node and completed before the main execution device performs the main operation.
  • the pre-operation may be a transport operation performed by a transport device involved in the device node and a cover opening operation, a cover closing operation, etc. performed by the main execution device or peripheral devices of the main execution device, such as a cover opening device.
  • the pre-operation may be understood as a preparatory operation before the main execution device performs the main operation.
  • the upstream node of two adjacent nodes may be a starting node, and the downstream node may be a device node.
  • the upstream node is the starting node of consumables 1
  • the downstream node is a device node representing a pipetting workstation.
  • the first execution time of the previous operation completed before the pipetting workstation performs the pipetting operation can be determined.
  • the previous operation may be a preparatory work done to facilitate the pipetting workstation to perform the pipetting operation.
  • the first execution time of the previous operation can be found based on the previous operation list in the node information of the device node.
  • the previous operation may include a handling operation in which a robotic arm carries consumables 1 from its starting position to the pipetting workstation.
  • the preset handling operation time of the robotic arm carrying consumables 1 can be used as the first execution time.
  • the first execution time is equal to 20 seconds. It is easy to understand that when the previous operation involved in the device node includes multiple operations, the first execution time may be the sum of the expected execution times of the multiple operations. That is, the sum of the expected execution times of all the previous operations involved in the device node can be counted.
  • the first execution time can be determined as the total time.
  • the estimated transport time of 20 seconds used to transport the consumable 1 from the starting position to the pipetting workstation can be determined as the total time of the transfer operation between nodes.
  • the sum of the estimated execution times of multiple previous 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 the total time, it can be verified whether the time constraint information between the starting node and the device node is reasonable. Those of ordinary skill in the art can easily understand this solution and will not be repeated here.
  • the first execution time of the previous operation involved in the device node can be determined as the estimated total time of the transfer operation between the two nodes.
  • This scheme has simple execution logic, small calculation amount, and the determined total time is more accurate, thereby improving the efficiency and accuracy of verification.
  • step S1410 determines the total time based on the node type and the duration information of the operation supported by the device corresponding to the device node, and includes step S1413 and step S1414.
  • step S1413 when both adjacent nodes are device nodes, the second execution time of the subsequent operation corresponding to the upstream node of the two adjacent nodes is determined, and the third execution time of the previous operation corresponding to the downstream node of the two adjacent nodes is determined, wherein the subsequent operation is an operation completed after the device corresponding to the upstream node executes its own operation, and the previous operation is an operation completed before the device corresponding to the downstream node executes its own operation.
  • the transfer operation of the target may include the pre-operation involved in the device node and completed before the main execution device executes the main operation, and may also include the post-operation completed after the main execution device executes the main operation.
  • Both adjacent nodes may be device nodes.
  • Each device node may involve pre-operation and post-operation.
  • For the transfer operation between two device nodes it may be the post-operation performed on the target by the transfer device involved in the upstream device node of the two device nodes and the pre-operation performed on the target by the transfer device involved in the downstream device node.
  • the node information of each device may include a pre-operation list and a post-operation list.
  • the estimated execution time of the post-operation on the target can be found from the post-operation list of the upstream device node as the second execution time. And the estimated execution time of the pre-operation on the target can be found from the pre-operation list of the downstream device node as the third execution time.
  • the pre-operation and post-operation involved in each device node may be various suitable operations set according to actual needs in the process design stage.
  • the post-operation of the upstream device node can be regarded as the transfer operation of transferring the target from the main execution device of the upstream device node to the main execution device of the downstream device node.
  • the upstream device node may be a device node whose main execution device is a centrifuge
  • the downstream device node may be a device node whose main execution device is an incubator.
  • the post-operation involved in the upstream device node of the centrifuge may be an operation completed after the centrifugal operation of the centrifuge.
  • the device node of the centrifuge may include the operation of the centrifuge rotating the consumables to the outlet, the operation of the centrifuge opening the door, the operation of the robot taking out the consumables, and the operation of the centrifuge closing the door.
  • the sum of the expected execution times of all the above post-operations can be determined as the second execution time.
  • the front operation involved in the downstream device node whose main execution device is an incubator may include the operation of placing a plate in the incubator.
  • the expected execution time of the plate placing operation can be used as the third execution time.
  • step S1414 the second execution time and the third execution time are added to obtain the total time.
  • the sum of the expected execution time of the subsequent operation involved in the upstream device node determined in the above step and the expected execution time of the previous operation involved in the downstream device node can be calculated, and the two execution times are determined as the expected total time of the transfer operation of the target between the two device nodes.
  • the estimated total time of the target transfer operation between the two adjacent nodes is determined by taking the sum of the estimated execution time of the subsequent operation involved in the upstream device node and the estimated execution time of the previous operation involved in the downstream device node, and then verifying whether the time constraint information is reasonable based on the total time.
  • This scheme has simple execution logic, small calculation amount, and more accurate total time determination, thereby improving the efficiency and accuracy of verification.
  • the node type also includes an end node.
  • the end node can be an end position point indicating the end of the process. It is easy to understand that the end position point is not a device node, so the end node does not include a transfer operation on the target.
  • 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.
  • step S1415 when the downstream node of the two adjacent nodes is an end node, the fourth execution time of the subsequent operation corresponding to the upstream node of the two adjacent nodes is determined, wherein the subsequent operation is an operation completed after the device corresponding to the upstream node performs its own operation.
  • the determined fourth execution time can be determined as the total time.
  • the estimated execution time of all post-operations involved in the upstream node can be determined based on the node information of the upstream node as the fourth execution time.
  • the post-operation involved in the device node directly connected to the end node can also be any suitable transfer operation.
  • the fourth execution time can be the sum of the estimated execution times of the above-mentioned post-operations.
  • the fourth execution time can be used as the estimated total time of the transfer operation between the device node and the end node, and the time constraint information can be verified based on the total time to see if it is reasonable.
  • the estimated execution time of the post-operation involved in the device node can be determined as the estimated total time of the transfer operation between the two nodes, and then the rationality of the time constraint information can be verified based on the total time.
  • This scheme has simple execution logic, small calculation amount, and the determined total time is more accurate, thereby improving the efficiency and accuracy of the verification.
  • step S1200 acquires time constraint information and node information between two adjacent nodes in the automation process, including step S1210.
  • step S1210 for each starting node or device node in the automation process, the node information of the starting node or device node is obtained, the downstream nodes directly connected to the starting node or device node are traversed, and for the case where the downstream node is a device node or an end node, the node information of the downstream node is obtained.
  • the flowchart of the entire automation process can be used as a guide to traverse the entire automation process to obtain the time constraint information and node information between each adjacent two nodes. And the time constraint information between each adjacent two nodes is verified.
  • the node information of the device node directly connected to the starting node of the consumable and the time constraint information between the two can be obtained first, and each time constraint information can be verified whether it is reasonable.
  • the device node and the downstream node directly connected thereto can be obtained.
  • the downstream node is a device node or an end node
  • the node information of the two nodes and the time constraint information between the two can be obtained, and the verification is performed.
  • the downstream node is a device node
  • the time constraint information between the device node or the end node directly connected to the device node can be continued to be obtained, and the rationality of the time constraint information can be verified.
  • the time constraint information of the subsequent two adjacent nodes can be continuously obtained and its rationality can be verified.
  • the node information and time constraint information of the last device node and the end node in the automation process can be obtained, and their time constraint information can be verified.
  • the node information and time constraint information of any two adjacent nodes in the process can be obtained by traversing the entire automation process, and the rationality of the time constraint information can be verified respectively. It can ensure that each time constraint information is effectively verified, thereby ensuring the smooth execution of the automation process. It can also improve the efficiency of verification.
  • the device nodes in two adjacent nodes correspond to multiple targets.
  • any device node in the two adjacent nodes includes a main execution device for the operation of multiple consumables.
  • the device node also involves the transfer operation performed on the multiple consumables.
  • the time constraint information is used to respectively constrain the execution time of the transfer operation of each target in the multiple targets between the two adjacent nodes.
  • 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 whether the time constraint information is reasonable, including: based on the total time of the transfer operation for each target, respectively verifying whether the time constraint information of each target is reasonable. For example, in the examples of the aforementioned steps S1110 and S1120, the time constraint information input by the user using the operable controls of the graphical user interface is received, such as the expiration time of "consumable 1" "55" seconds, and the expiration time of "consumable 2" "50" seconds.
  • step S1400 It is necessary to determine the total time of the preset execution time of the transfer operation of "consumable 1" involved in the device nodes of the two nodes in step S1400. And in step S1600, the expiration time “55" seconds of the constraint “consumable 1” is verified, and it is determined whether the expiration time "55” seconds is set reasonably. And in step S1400, the total time of the preset execution time of the transfer operation of "consumable 2" involved in the device nodes of the two nodes is determined. In step S1600, the expiration time "50" seconds of the constraint “consumable 2" is verified to determine whether the expiration time "50" seconds is set reasonably.
  • Fig. 2 shows a schematic diagram of a part of the automation process according to an embodiment of the present application. As shown in the figure, there are three device nodes in the automation process. The upstream node “liquid transfer workstation” and the downstream node “centrifuge” are adjacent device nodes. The time constraint information for constraining the execution time of the transport operation of "consumable 3" can be included between the two device nodes.
  • the estimated execution time of the post-operation of "consumable 3" involved in the device node of "liquid transfer workstation” and the estimated execution time of the pre-operation of "consumable 3” involved in the device node of "centrifuge” can be determined in step S1400 as the total time of the transport operation of "consumable 3" performed between the two nodes.
  • the time constraint information for constraining the execution time of the transport operation of "consumable 3” can be verified based on the determined total time in step S1600.
  • the upstream node "pipetting workstation” and the downstream node “incubator” are also adjacent device nodes.
  • Time constraint information for constraining the transport operations of "consumable 4" and “consumable 5" may be included between the two device nodes.
  • the sum of the expected execution time of the post-operation of "consumable 4" involved in the device node of the "pipetting workstation” and the expected execution time of the pre-operation of "consumable 4" involved in the device node of the "incubator” can be determined as the total time of the transport operation of "consumable 4" performed between the two nodes, such as "the total transport time of consumable 4".
  • step S1600 the time constraint information for constraining 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 for constraining the execution time of the transfer operation of "consumable 5" can be verified based on the "total transfer time of consumable 5".
  • the time constraint information for each target can be verified respectively, so as to ensure the accuracy and effectiveness of the verification, thereby ensuring the accurate execution of the automation process.
  • the time constraint information includes expiration time information.
  • 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.
  • step S1610 when the expiration time shown in the expiration time information is greater than or equal to the total time, it is determined that the time constraint information is reasonable. If the expiration time is greater than or equal to the preset time of the transfer operation for the target performed between the two nodes determined in step S1400, it can be said that the expiration time is set reasonably. In step S1620, when 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. That is, the expiration time should not be less than the estimated total time of the transfer operation. Otherwise, it means that the time constraint information is set unreasonably, which may affect the smooth progress of the automation process.
  • a corresponding prompt message can be issued to remind the user to modify it.
  • a prompt box of "Verification Failed” can be popped up on the verification interface, and the node information of the failed verification can also be prompted. This makes it convenient for the user to modify the time constraint information between the corresponding nodes based on the prompt information.
  • whether the time constraint information is reasonable can be determined by comparing the expiration time shown in the expiration time information between two adjacent nodes with the preset total time of the transfer operation between the two nodes.
  • the verification logic is simpler and the calculation amount is also small.
  • method 1000 further includes steps S1710, S1720, and S1730.
  • steps S1710, S1720, and S1730 After the above-mentioned initial verification of the time constraint information between two adjacent nodes, the time constraint information may be verified again. For example, after the user modifies the time constraint information in the process, in response to the user's pre-running operation of the process, the time constraint information may be verified again by executing steps S1710, S1720, and S1730.
  • the execution order of the minimum sub-operations of the two adjacent nodes is determined according to the connection relationship between the two adjacent nodes in the automation process.
  • the various minimum sub-operations involved in the two adjacent nodes can be parsed according to the node information of the two adjacent nodes in the automation process.
  • These minimum sub-operations can be, for example, the minimum operation units of various operations performed on the target by each device involved in the device node, which can include the minimum operation unit of the main operation performed by the main execution device, and can also include the minimum operation unit of the front operation and the rear operation performed by the transfer device.
  • the minimum sub-operation is such as the door opening operation, the door closing operation, the handling operation of the robot arm, the rotation operation of the centrifuge, etc.
  • the execution order can, for example, include a serial execution order, and can also include a parallel execution order.
  • step S1720 the total time is determined again based on at least the execution order and the preset execution time of each minimum sub-operation. For example, a group of serial sub-operations executed in a serial order can be determined based on the determined execution order of each parsed minimum sub-operation. The preset execution time of each minimum sub-operation in the 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 minimum sub-operation of the transfer operation involving the target in the serial sub-operation.
  • the sum of the first preset execution time of each minimum sub-operation involved in the previous operation corresponding to the device node can be calculated as the total time of the transfer operation; in the case where two adjacent nodes are both device nodes, the sum of the second preset execution time of each minimum sub-operation involved in the subsequent operation corresponding to the upstream device node and the sum of the third preset execution time of each minimum sub-operation involved in the previous operation corresponding to the downstream device node can be calculated, and the sum of the second preset execution time and the sum of the third preset execution time can be added together to serve as the total time of the transfer operation; in the case where two adjacent nodes are a device node and an end node, respectively, the sum of the fourth preset execution time of each minimum sub-operation involved in the subsequent operation corresponding to the device node can be calculated as the total time of the transfer operation.
  • the minimum sub-operation of the transfer operation involving the target in the serial sub-operation includes the centrifuge door opening operation, the door closing operation, and the robot arm handling operation, so the sum of the preset execution times of the centrifuge door opening operation, the door closing operation, and the robot arm handling operation can be determined as the total time.
  • step S1730 the time constraint information is checked again based on the re-determined total time to see if it is reasonable.
  • This step is similar to step S1600, and a person skilled in the art can easily understand various implementation schemes thereof, which will not be described in detail here.
  • the time constraint information between the two nodes is initially verified to be correct, the time constraint information can be verified again before the automation process is run.
  • This scheme can ensure the rationality of the time constraint information, thereby ensuring the effectiveness and availability of the target, and further ensuring the smooth and effective execution of the automation process.
  • the time constraint information includes expiration time information. After checking whether the time constraint information is reasonable in step S1600, method 1000 further includes step S1800.
  • step S1800 after determining that the time constraint information is reasonable, in response to the second operation of the user, the automated process is run.
  • the execution time of the transfer operation of the target between two adjacent nodes exceeds the expiration time shown in the expiration time information, and, if exceeded, the target is marked as expired.
  • the second operation can be any suitable operation.
  • the user interface can include a control of "running the process", and the second operation can be an operation of the user clicking the control.
  • the automated process after verifying that the time constraint information between two adjacent nodes is correct, the automated process can be run.
  • the time constraint information includes expiration time information
  • the process runs to the transfer operation associated with the expiration time information
  • the actual execution time of the transfer operation of the target between the two nodes can be monitored, and when its actual execution time exceeds the expiration time, the target can be marked as expired.
  • the user can be prompted that the target has expired, so as to facilitate the corresponding processing of the expired target.
  • the above solution can monitor the actual execution time of the target's transfer operation based on the verified correct time constraint information during the operation phase of the automated process, and mark the target as expired if it is determined that the target is expired. This can remind users to pay special attention to expired targets to ensure the validity and availability of the targets, and further ensure the smooth and effective execution of the automated process.
  • Figures 3a to 3c respectively show schematic flow charts of three different parts of the management method of the automated process according to another embodiment of the present application.
  • Figure 3a shows a schematic flow chart of the first part of the management method of the automated process according to another embodiment of the present application.
  • the time constraint information includes, for example, expiration time information.
  • the previous operation time involved in the device node can be calculated as the estimated total time of the transfer operation between the two nodes.
  • FIG 3b shows a schematic flow chart of the second part of the management method of the automated process according to another embodiment of the present application. As shown in Figure 3b, for each device node in the automated process, each line starting from the node is traversed. In the case where the other node connected to the line is a device node, the node information of the two device nodes and the time constraint information between the two device nodes can be obtained.
  • the time constraint information includes, for example, expiration time information.
  • Figure 3c shows a schematic flow chart of the third part of the management method of the automated process according to another embodiment of the present application. As shown in Figure 3c, for each device node in the automated process, each line starting from the node is traversed. In the case where the other node connected to the line is an end node, the node information of the two nodes and the time constraint information between the two nodes can be obtained.
  • the time constraint information includes, for example, expiration time information.
  • the post-operation time involved in the upstream device node can be calculated as the estimated total time of the transfer operation between the two nodes. Then, by comparing the size of the expiration time and the total time shown in the expiration time information, it can be verified whether the time constraint information is reasonable.
  • FIG4 shows a schematic block diagram of a management device 400 for an automated process according to an embodiment of the present application.
  • the device 400 includes:
  • the acquisition module 410 is used to acquire 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 the transfer operation of the target between two adjacent nodes.
  • the determination module 420 is used to determine the total time of the transfer operation based on the node information of two adjacent nodes.
  • Verification module 430 is used to verify whether the time constraint information is reasonable based on the total time.
  • FIG. 5 shows a schematic block diagram of an electronic device 500 according to an embodiment of the present application.
  • the electronic device 500 includes a processor 510 and a memory 520.
  • the memory stores computer program instructions, which are used by the processor to execute the above-mentioned management method 1000 of the automated process when the computer program instructions are executed.
  • a storage medium is also provided.
  • Program instructions are stored on the storage medium, and the program instructions are used to execute the management method of the above-mentioned automated process when running.
  • the storage medium may include, for example, 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.
  • the disclosed devices and methods can be implemented in other ways.
  • the device embodiments described above are only schematic, for example, the division of the units is only a logical function division, and there may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another device, or some features can be ignored or not executed.
  • the various component embodiments of the present application can be implemented in hardware, or in software modules running on one or more processors, or in a combination thereof. It should be understood by those skilled in the art that a microprocessor or digital signal processor (DSP) can be used in practice to implement some or all functions of some modules in the management device of the automated process according to the embodiment of the present application.
  • DSP digital signal processor
  • the application can also be implemented as a device program (e.g., computer program and computer program product) for executing a part or all of the methods described herein.
  • Such a program implementing the present application can be stored on a computer-readable medium, or can have the form of one or more signals. Such a signal can be downloaded from an Internet website, or provided on a carrier signal, or provided in any other form.

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Human Resources & Organizations (AREA)
  • Quality & Reliability (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Educational Administration (AREA)
  • Development Economics (AREA)
  • Automation & Control Theory (AREA)
  • Game Theory and Decision Science (AREA)
  • Manufacturing & Machinery (AREA)
  • General Engineering & Computer Science (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Tourism & Hospitality (AREA)
  • General Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • General Factory Administration (AREA)

Abstract

提供了一种自动化流程的管理方法（1000）、装置（400）、电子设备（500）及存储介质。管理方法（1000）包括：获取自动化流程中相邻两个节点之间的时间约束信息和节点信息，其中，时间约束信息用于约束目标在相邻两个节点之间的转运操作的执行时间（S1200）；基于相邻两个节点的节点信息，确定转运操作的总时间（S1400）；以及基于总时间，校验时间约束信息是否合理（S1600）。由此可以确保目标在自动化流程中的有效性，从而可以保证自动化流程的准确、顺利进行。

Description

自动化流程的管理方法、装置、电子设备及存储介质
本申请要求于2022年11月04日提交中国专利局、申请号为202211376143.3、发明名称为“自动化流程的管理方法、装置、电子设备及存储介质”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请属于自动化领域，更具体的说，尤其涉及一种自动化流程的管理方法、装置、电子设备及存储介质。
背景技术
目前，很多的领域都在不断地实现自动化改造，从而达到解放人力、提高效率的目的。不论是自动化制造、自动化检测还是自动化试验/实验等，都会大量使用自动化系统。在自动化系统中，将整个自动化流程拆解为各个设备执行的多个操作。该操作不仅包括执行设备对目标如进行处理的主操作，还包括转运设备对目标在不同的执行设备间进行转运的转运操作。
以实验室自动化系统为例，可以通过集成不同厂商的执行设备如培养箱、离心机、移液工作站、去盖器、酶标仪等对对应的样本执行不同的实验操作。此外，在不同的执行设备间往往还需要通过诸如机械臂的转运设备来对样本进行转运操作，以保证实验流程的顺利执行。在自动化流程的运行过程中，每个转运设备完成每个转运操作都需要一定的执行时间，但会因为设备故障或者通信问题导致超时的发生。此外，由于某些样本本身对暴露时间有特殊要求。例如在对孔板所载的菌液进行转运时，超过一定时间就可能导致菌液毁坏。
现有技术中，自动化系统可以按时间规划自动化流程中的操作。例如，自动化流程中的一个转运设备会花费一定的时间执行对应的转运操作。自动化系统可以据此对自动化流程中的、位于该转运设备之后的后续设备的执行操作进行规划，以使后续设备按照规划执行对应的操作。但通常忽视了对样本转运的转运操作时间过长从而导致样本的暴露时间过长的问题，这进而可能会导致样本的损坏。而样本的损坏极有可能使得自动化流程无法正常执行，从而得出错误的结果。
发明内容
考虑到上述问题而提出了本申请。根据本申请的第一方面，提供了一种自动化流程的管理方法。包括：获取自动化流程中相邻两个节点之间的时间约束信息和节点信息，其中，时间约束信息用于约束目标在相邻两个节点之间的转运操作的执行时间；基于相邻两个节点的节点信息，确定转运操作的总时间；以及基于总时间，校验时间约束信息是否合理。
示例性地，节点信息包括节点类型，节点类型包拈设备节点，设备节点的节点信息还包括：设备节点对应的设备所支持的操作的时长信息；基于相邻两个节点的节点信息，确定转运操作的总时间，包括：基于节点类型以及设备节点对应的设备所支持的操作的时长信息，确定总时间。
示例性地，节点类型还包括起始节点；基于节点类型以及设备节点对应的设备所支持的操作的时长信息，确定总时间，包括：在相邻两个节点中的上游节点是起始节点的情况下，确定相邻两个节点中的下游节点对应的前操作的第一执行时间，其中，前操作为在该下游节点对应的设备执行自身操作之前完成的操作；以及将第一执行时间确定为总时间。
示例性地，基于节点类型以及设备节点对应的设备所支持的操作的时长信息，确定总时间，包括：在相邻两个节点均是设备节点的情况下，确定相邻两个节点中的上游节点对应的后操作的第二执行时间，并确定相邻两个节点中的下游节点对应的前操作的第三执行时间，其中，后操作为在该上游节点对应的设备执行自身操作之后完成的操作，前操作为在该下游节点对应的设备执行自身操作之前完成的操作；以及将第二执行时间和第三执行时间加和，以获得总时间。
示例性地，节点类型还包括结束节点；基于节点类型以及设备节点对应的设备所支持的操作的时长信息，确定总时间，包括：在相邻两个节点中的下游节点是结束节点的情况下，确定相邻两个节点中的上游节点对应的后操作的第四执行时间，其中后操作为在该上游节点对应的设备执行自身操作之后完成的操作；以及将第四执行时间确定为总时间。
示例性地，获取自动化流程中相邻两个节点之间的时间约束信息和节点信息，包括：对于自动化流程中的每个起始节点或设备节点，获取该起始节点或设备节点的节点信息，遍历与该起始节点或设备节点直接连接的下游节点，并且对于该下游节点是设备节点或结束节点的情况，获取该下游节点的节点信息。
示例性地，相邻两个节点中的设备节点对应多个目标，时间约束信息用于分别约束多个目标中的每个目标在相邻两个节点之间的转运操作的执行时间，确定转运操作的总时间，包括：确定对多个目标中的每个目标的转运操作的总时间；校验时间约束信息是否合理，包括：基于对每个目标的转运操作的总时间，分别校验每个目标的时间约束信息是否合理。
示例性地，时间约束信息包括过期时间信息，校验时间约束信息是否合理，包括：在过期时间信息所示的过期时间大于或等于总时间的情况下，确定时间约束信息合理；以及在过期时间信息所示的过期时间小于总时间的情况下，确定时间约束信息有误。
示例性地，在获取自动化流程中相邻两个节点之间的时间约束信息之前，方法还包括：显示图形用户界面，图形用户界面包括可操作控件；响应于用户利用可操作控件的第一操作，自用户接收时间约束信息。
示例性地，时间约束信息包括过期时间信息，在校验时间约束信息是否合理之后，方法还包括：在确定时间约束信息合理之后，响应于用户的第二操作，运行自动化流程；其中，在运行自动化流程的过程中，确定目标在相邻两个节点之间的转运操作的执行时间是否超出过期时间信息所示的过期时间，并且，在超出的情况下，将目标标记为过期状态。
示例性地，在校验时间约束信息是否合理之后，方法还包括：根据相邻两个节点在自动化流程中的连接关系，确定相邻两个节点之间的最小子操作的执行次序；至少根据执行次序以及每个最小子操作的预设执行时间，再次确定总时间；以及根据所再次确定的总时间，再次校验时间约束信息是否合理。
根据本申请的第二方面，还提供一种自动化流程的管理装置，包括：获取模块，用于获取自动化流程中相邻两个节点之间的时间约束信息和节点信息，时间约束信息用于约束目标在相邻两个节点之间的转运操作的执行时间；确定模块，用于基于相邻两个节点的节点信息，确定转运操作的总时间；以及校验模块，用于基于总时间，校验时间约束信息是否合理。
根据本申请的第三方面，还提供一种电子设备，包括处理器和存储器，其中，存储器中存储有计算机程序指令，计算机程序指令被处理器运行时用于执行上述自动化流程的管理方法。
根据本申请的第四方面，还提供一种存储介质，在存储介质上存储了程序指令，程序指令在运行时用于执行上述自动化流程的管理方法。
在上述技术方案中，利用自动化流程中的相邻两个节点的节点信息，确定在两个节点之间对目标的转运操作的总时间，进而基于该总时间对预先设置的、用于约束该转运操作的执行时间的时间约束信息进行校验。这种方案可以确保目标在自动化流程中的有效性，从而可以保证自动化流程的准确、顺利进行。
上述说明仅是本申请技术方案的概述，为了能够更清楚了解本申请的技术手段，而可依照说明书的内容予以实施，并且为了让本申请的上述和其它目的、特征和优点能够更明显易懂，以下特举本申请的具体实施方式。
附图说明
通过结合附图对本申请实施例进行更详细的描述，本申请的上述以及其它目的、特征和优势将变得更加明显。附图用来提供对本申请实施例的进一步理解，并且构成说明书的一部分，与本申请实施例一起用于解释本申请，并不构成对本申请的限制。在附图中，相同的参考标号通常代表相同部件或步骤。
图1示出根据本申请一个实施例的自动化流程的管理方法的示意性流程图；
图2示出根据本申请一个实施例的自动化流程的局部的示意图；
图3a示出根据本申请另一个实施例的自动化流程的管理方法的第一部分的示意性流程图；
图3b示出根据本申请另一个实施例的自动化流程的管理方法的第二部分的示意性流程图；
图3c示出根据本申请另一个实施例的自动化流程的管理方法的第三部分的示意性流程图；
图4示出根据本申请一个实施例的自动化流程的管理装置的示意性框图；以及
图5示出根据本申请一个实施例的电子设备的示意性框图。
具体实施方式
为了使得本申请的目的、技术方案和优点更为明显，下面将参照附图详细描述根据本申请的示例实施例。显然，所描述的实施例仅仅是本申请的一部分实施例，而不是本申请的全部实施例，应理解，本申请不受这里描述的示例实施例的限制。基于本申请中描述的本申请实施例，本领域技术人员在没有付出创造性劳动的情况下所得到的所有其它实施例都应落入本申请的保护范围之内。
为了至少部分地解决上述技术问题，根据本申请的第一方面，提供了一种自动化流程的管理方法。根据本申请实施例的管理方法可以应用于各种领域中针对各种合适的目标的自动化流程。为了简便，下文以生物化学领域的自动化系统中的自动化流程为例进行展开阐释。
图1示出了根据本申请一个实施例的自动化流程的管理方法1000的示意性流程图。如图1所示，该管理方法1000可以包括以下步骤。
步骤S1200，获取自动化流程中相邻两个节点之间的时间约束信息和节点信息，其中，时间约束信息用于约束目标在相邻两个节点之间的转运操作的执行时间。
自动化流程可以是根据实际的实验/试验需求预先设计好的。示例性而非限制性地，步骤S1200可以是在自动化流程设计完成之后，响应于用户的任一触发操作执行的。该触发操作可以是任何合适的操作，例如其可以是在自动化流程设计后，用户点击“保存流程”的控件所触发的。根据本申请实施例，自动化流程可以包含一系列对目标执行实验/试验所需的各种相关操作。其中可以包含各种流程信息，例如各个操作的执行主体和执行对象、执行操作的内容、执行条件、执行时间、执行逻辑等。目标可以是在该自动化流程中被操作的对象，其可以是任何合适的目标。示例性而非限制性地，目标可以是诸如承载菌液等样本的试管、玻璃片、孔板等实验用的耗材。当然，对于其他领域的自动化流程，目标也可以是其他形式的被操作对象。
自动化流程可以是由多个节点按照一定的连接顺序连接而成的流程。每个节点的节点信息可以包括在该节点要完成的各种操作相关的任何信息，例如与操作类型、操作时间、操作指令、操作的相关执行主体和/或操作中所涉及的子操作相关的信息等等。在节点要完成的操作可以是任何合适的操作。这些操作例如：执行设备对目标执行的对应的处理操作，具体例如离心机对目标执行的诸如离心处理操作。这些操作又例如转运设备对目标执行的不同设备间的转运操作，转运操作对应的节点信息可以包括目标的位置的信息，例如关于目标的起始位置、目标的结束位置以及流程发生错误时目标的错误位置的信息。此外，有些节点可以用于流程控制，例如用于执行流程中的判断和循环。另外，在步骤S1200中相邻两个节点之间的节点信息既可以是建立自动化流程时设置的节点信息，也可以是在建立自动化流程之前，预先对节点进行配置的节点信息。
示例性而非限制性地，节点信息可以包括节点名称、节点类型、节点操作的预估耗时等。具体地，节点名称是用于与其他节点进行区分的标识，可以是用户自命名的，也可以直接采用节点的主要操作对应的设备的名称，例如离心机，节点类型是基于节点对应的功能进行划分的，例如设备节点、起始节点、结束节点、流程控制节点等，节点操作的预估耗时可以表示该节点对目标执行的各个操作的预估耗时。
相邻两个节点可以是自动化流程中的任意两个按照执行先后顺序直接连接的节点，在该两个节点之间可以获取到时间约束信息。相邻两个节点例如包括上游节点A和下游节点B。容易理解，上游节点A比下游节点B距离自动化流程的起始端更近。下游节点B对应的主操作的执行是在上游节点对应的主操作执行结束之后才开始执行，两者之间具有顺次执行的逻辑关系。需要说明的是，每个节点相关的操作可以包括主操作，前操作和后操作。
如前所述，在自动化流程的实际运行过程中，由于设备故障或者通信问题等各种各样的因素影响，往往导致操作的实际执行时间可能超出其理论执行时间。同时对于一些特定的目标，例如菌液等实验耗材，其在特定的设备中或转运过程中超出一定时间可能导致过期而无效。综合这两方面因素的考虑，为保证自动化流程的顺利进行同时保证目标的有效性，可以对一些相关操作的执行时间进行合理的容错。可以通过在时间约束信息中设置合理的时间约束条件约束相关操作的实际执行时间。这样既可以在其超过理论执行时间时仍允许其继续正常执行，又可以在其超出约束的安全时间或有效时间时对目标进行诸如过期或待丢弃的标记，还可以在将其标记为待丢弃之后，进一步将其搬运至丢弃位置。
根据本申请实施例，可以根据实际的时间约束需求，在相邻两个节点之间设置时间约束信息。该时间约束信息用于约束目标在相邻两个节点之间的转运操作的执行时间。如前所述，转运操作可以是转运设备对目标执行的操作。对于上游节点A和下游节点B中的任意一个节点涉及转运操作的情况，可以在自动化流程的设计过程中，在两个节点之间设置时间约束信息。相邻两个节点之间的时间约束信息的约束内容也可以根据流程的约束需求进行任意设置。示例性而非限制性地，时间约束信息可以包括过期时间信息和最大等待时间信息。过期时间信息可以是预设的对目标的转运操作的最大安全时长，以在超出该时长时对目标执行相应的过期处理，例如标记为过期。最大等待时间信息可以是预设的对目标的转运操作的最大有效时长，以在超出该时长时对目标执行相应的无效和/或丢弃处理，例如标记为无效并丢弃。当然，时间约束信息也可以是其他合适的用于约束对目标的转运操作的时长的信息。在步骤S1200可以通过例如读取相邻两个节点之间的时间约束信息的方式得到时间约束信息中所约束的相应时长。
步骤S1400，基于相邻两个节点的节点信息，确定转运操作的总时间。
如前所述，相邻两个节点的节点信息可以包括在每个节点执行的各种操作相关的任何信息。示例性地，节点信息可以包括与节点对应的各种操作的操作列表和每种操作的预计执行时间。例如，在节点涉及对目标的转运操作的情况下，节点信息可以包括在该节点执行的转运操作的子操作列表和各个子操作的预计执行时间。在此步骤中，即可根据在两个节点分别执行的转运操作的子操作的预计执行时间，确定在两个节点之间执行的对目标的转运操作的总时间。即，可以基于相邻两个节点中的每个节点的节点信息，确定其中所包含的在该两个节点间执行的转运操作的预估时间信息，并可以基于该预估时间信息确定总时间。该总时间可以是预计的、在相邻两个节点间执行的转运操作的所有子操作的总执行时间。此步骤可以采用任何合适的方式实现，例如可以首先从每个节点的节点信息中筛选出涉及节点间的转运操作的各个子操作，然后可以按照合适的统计方法基于筛选出的各个子操作的预计执行时间，确定两个节点间的转运操作的总时间。
步骤S1600，基于总时间，校验时间约束信息是否合理。
在自动化流程的设计阶段，可能由于用户在预估时间时预估不当等各种原因导致当时所设置的流程中的部分相邻两个节点间的时间约束信息不合理。而在此步骤中，则可以遍历整个自动化流程中的各个节点，对每相邻两个节点之间的时间约束信息的合理性进行校验。
如前所述，在步骤S1400中所确定的总时间，可以是采用任何合适的方法统计的、在相邻两个节点间的转运操作的所有子操作的预计执行时间或说理论执行时间。而步骤S1200中所获取的该两个节点间的时间约束信息用于约束该转运操作的实际执行时间。并且两个节点之间的时间约束信息的设置目的是为了对例如转运操作的执行时间进行合理的容错，即允许转运操作的实际执行时间在保证目标的安全或有效范围内适当超出理论执行时间。换言之，时间约束信息中所约束的实际执行时间是立足于其理论时间进行设置的，两者之间存在相关关系。因此，可以在步骤S1600，基于步骤S1400所确定的转运操作的总时间，校验该相邻两个节点间的时间约束信息是否合理。可以采用任何合适的校验逻辑，校验时间约束信息的合理性。例如可以通过对比总时间和时间约束信息中所指示的约束时间的大小进行校验等。
在上述技术方案中，利用自动化流程中的相邻两个节点的节点信息，确定在两个节点之间对目标的转运操作的总时间，进而基于该总时间对预先设置的、用于约束该转运操作的执行时间的时间约束信息进行校验。这种方案可以确保目标在自动化流程中的有效性，从而可以保证自动化流程的准确、顺利进行。
示例性地，在步骤S1200获取自动化流程中相邻两个节点之间的时间约束信息之前，方法1000还包括步骤S1110和步骤S1120。
在步骤S1110，显示图形用户界面，图形用户界面包括可操作控件。如前所述，可以在自动化流程的设计阶段，对相邻两个节点间的时间约束信息进行设置。相邻两个节点可以是上游节点A和下游节点B。示例性而非限制性地，可以响应于用户对上游节点的时间约束信息的选中操作，显示用于设置时间约束信息的图形用户界面。根据本申请实施例，两个节点间的时间约束信息可以包括一种或多种，因此，在图形用户界面中，也可以包括一个或多个可操作控件。每个可操作控件可以用于操作设置每一种时间约束信息。例如，两个节点间的时间约束信息可以包括过期时间信息和最大等待时间信息。在图形用户界面中可以包括“节点间时间约束信息设置”列表。在该列表下可以包括两个用于设置在当前选中的节点和其相邻的下游节点之间的时间约束信息的可操作控件。其中一个可以是用于设置该两个节点间的转运操作的“过期时间”的可操作控件，另一个可以是用于设置“最大等待时间”的可操作控件。可操作控件可以是任何合适的控件，例如输入控件或下拉列表选择控件。此外，对于该相邻两个节点之间包括对多个目标的时间约束信息的情况下，还可以利用该图形用户界面对每个目标的时间约束信息进行设置。同样在上述示例中，在图形用户界面中的“节点间时间约束信息设置”列表下还可以包括多行排布的可操作性控件，可以分别用于设置用于约束每个目标的转运操作的时间约束信息。
在步骤S1120，响应于用户利用可操作控件的第一操作，自用户接收时间约束信息。用户利用可操作控件的第一操作可以是任何合适的操作。第一操作例如可以是用户通过输入控件输入期望的时间数字的操作，也可以是用户通过下拉列表控件选择期望的时间数字的操作。在用户输入完成或选定其期望的约束时间时，可以接收用户输入的或选定的时间约束信息，并可以显示在图形用户界面上。例如，可以在步骤S1120接收用户利用图形用户界面中的“过期时间”列表下的可输入控件输入的时间数字“55”，并可以在该界面上对应显示该约束时间“55”。由此可以完成对在两个节点间执行的对例如“耗材1”的转运操作的执行时间的约束。在该设置完成后，在步骤S1200可以在该节点获取目标的该过期时间，并可以在步骤S1600基于确定的总时间，对该时间约束信息中的过期时间“55”秒进行校验。
上述提供可视化的人机交互界面和可操作控件供用户自由设置时间约束信息的方案，可以方便用户设置更准确的时间约束信息。用户体验也较好。
示例性地，节点信息包括节点类型。如前所述，节点类型是基于节点对应的功能进行划分的，例如设备节点、起始节点、结束节点、流程控制节点等。根据本申请实施例，节点的节点类型可以包括设备节点。设备节点的节点信息还包括：设备节点对应的设备所支持的操作的时长信息。设备节点对应的设备可以包括一个或多个设备。设备节点对应的设备可以至少包括用于对目标执行主操作的主要执行设备。此外，对于在设备节点要完成目标的转运操作的情况，该设备节点对应的设备还可以包括对目标执行转运操作的转运设备。设备节点对应的设备所支持的操作的时长信息可以包括主要执行设备对目标的主操作的预计时长信息，还可以包括转运设备对目标的转运操作的预计时长信息。容易理解，设备节点对应的设备所支持的操作是否属于转运操作并不以执行主体本身进行区分，而是以执行的操作的目的进行区分。该转运设备也可以包括主要执行设备和主要执行设备的周边设备，例如开盖和关盖设备。该转运设备也可以是其他设备例如机械臂。
在一个具体的示例中，对于主要执行设备为离心机的设备节点，该设备节点对应的设备可以包括离心机和机械臂等。因此，该离心机对应的设备节点的节点信息可以包括离心机执行的离心操作的预计时长、离心机或离心机的关盖设备执行的关盖操作的预计时长以及机械臂将承载菌液的孔板从离心机移动至下一节点的预计时长。在实验室的自动化流程中，设备节点的主要执行设备还可以包括移液工作站、培养箱、酶标仪等。转运设备可以包括上述主要执行设备本身，也可以仅包括机械臂。
步骤S1400基于相邻两个节点的节点信息，确定转运操作的总时间，包括步骤S1410。在步骤S1410，基于节点类型以及设备节点对应的设备所支持的操作的时长信息，确定总时间。即，相邻两个节点中的至少一个是设备节点。可以根据该两个节点的节点类型，以及两个节点中的每个设备节点对应的设备所支持的操作的时长信息，确定总时间。在一个示例中，对于相邻两个节点均为设备节点的情况，可以分别统计其中的上游节点对应的设备所支持的相关操作的时长信息和下游节点对应的设备所支持的相关操作的时长信息，进而确定总时间。相关操作例如是对目标的转运操作。在另一示例中，对于相邻两个节点中仅包括一个设备节点的情况，可以基于另一节点的节点类型，统计设备节点对应的设备所支持的相关操作的时长信息，确定总时间。该相关操作例如对目标执行的部分转运操作。
根据上述方案，可以基于自动化流程中相邻两个节点的节点类型以及设备节点对应的设备所支持的操作的时长信息，确定总时间。该方案确定的总时间较准确，从而所对时间约束信息的校验也较准确。并且，该方案实较简单，计算量也较小。
示例性地，节点类型还包括起始节点。起始节点可以是位于自动化流程的起始端的节点。对于步骤S1410基于节点类型以及设备节点对应的设备所支持的操作的时长信息，确定总时间包括步骤S1411和步骤S1412。
在步骤S1411，在相邻两个节点中的上游节点是起始节点的情况下，确定相邻两个节点中的下游节点对应的前操作的第一执行时间，其中，前操作为在该下游节点对应的设备执行自身操作之前完成的操作。
根据本申请实施例，对目标的转运操作可以包括设备节点所涉及的、在主要执行设备执行主操作之前完成的前操作。示例性地，前操作可以是由设备节点涉及的搬运设备执行的搬运操作和主要执行设备或主要执行设备的周边设备如开盖设备执行的开盖操作、关盖操作等。该前操作可以理解为在主要执行设备执行主操作之前的准备操作。
相邻两个节点中的上游节点可以是起始节点，下游节点可以是设备节点。例如上游节点是耗材1的起始节点，下游节点是表示移液工作站的设备节点。则可以基于移液工作站的设备节点的节点信息，确定在移液工作站执行移液操作之前完成的前操作的第一执行时间。该前操作可以是为了方便移液工作站执行移液操作而做的准备工作。可以基于该设备节点的节点信息中的前操作列表找到其前操作的第一执行时间。例如，前操作可以包括机械臂将耗材1从其起始位置搬运至移液工作站的搬运操作。此时，可以将预设的机械臂搬运耗材1的搬运操作时间作为第一执行时间。例如，在该搬运时间为20秒的情况下，第一执行时间即等于20秒。容易理解，对于设备节点所涉及的前操作包括多个操作的情况下，该第一执行时间可以是该多个操作的预计执行时间之和。即可以统计该设备节点所涉及的所有前操作的预计执行时间的和。
进而，可以在步骤S1412，将第一执行时间确定为总时间。例如，可以将耗材1从起始位置搬运至移液工作站所用的预计搬运时间20秒确定为节点间的转运操作的总时间。或者也可以将起始节点直接连接的设备节点所涉及的多个前操作的预计执行时间之和确定为转运操作的预计总时间。进而可以基于该总时间，校验起始节点和设备节点之间的时间约束信息是否合理。本领域普通技术人员容易理解该方案，在此不再赘述。
根据上述方案，可以在相邻两个节点为起始节点和设备节点的情况下，将该设备节点所涉及的前操作的第一执行时间，确定在为该两个节点之间的转运操作的预计总时间。这种方案执行逻辑简单，计算量小，且确定的总时间较准确，从而可以提高校验的效率和准确性。
示例性地，步骤S1410基于节点类型以及设备节点对应的设备所支持的操作的时长信息，确定总时间，包括步骤S1413和步骤S1414。
在步骤S1413，在相邻两个节点均是设备节点的情况下，确定相邻两个节点中的上游节点对应的后操作的第二执行时间，并确定相邻两个节点中的下游节点对应的前操作的第三执行时间，其中，后操作为在该上游节点对应的设备执行自身操作之后完成的操作，前操作为在该下游节点对应的设备执行自身操作之前完成的操作。
根据本申请实施例，对目标的转运操作可以包括设备节点所涉及的、在主要执行设备执行主操作之前完成的前操作，也可以包括在主要执行设备执行主操作之后完成的后操作。相邻两个节点均可以是设备节点。每个设备节点均可以涉及前操作和后操作。对于两个设备节点间的转运操作可以是两个设备节点中的上游设备节点所涉及的转运设备对目标执行的后操作和下游设备节点所涉及的转运设备对该目标执行的前操作。每个设备的节点信息均可以包括前操作列表和后操作列表。可以从上游设备节点的后操作列表中找到其中对目标的后操作的预计执行时间作为第二执行时间。并可以从下游设备节点的前操作列表中找到其中对目标的前操作的预计执行时间作为第三执行时间。每个设备节点所涉及的前操作和后操作可以是在流程设计阶段根据实际需求进行设置的各种合适的操作。上游设备节点的后操作可以视作将目标从该上游设备节点主要执行设备中转运至下游设备节点的主要执行设备的转运操作。在一个具体的示例中，上游设备节点可以是主要执行设备为离心机的设备节点，下游设备节点可以是主要执行设备为培养箱的设备节点。该离心机的上游设备节点所涉及的后操作可以是在离心机离心操作之后完成的操作。例如在该离心机的设备节点可以包括离心机将耗材旋转至出口处的旋转操作、离心机开门操作、机械臂将耗材取出的操作、离心机关门操作。因此，可以基于该离心机设备节点的前后操作列表，确定上述所有后操作的预计执行时间之和，作为第二执行时间。主要执行设备为培养箱的下游设备节点所涉及的前操作可以包括培养箱的放板操作。可以将该放板操作的预计执行时间作为第三执行时间。
在步骤S1414，将第二执行时间和第三执行时间加和，以获得总时间。可以计算上述步骤所确定的上游设备节点所涉及的后操作的预计执行时间和下游设备节点所涉及的前操作的预计执行时间的和，并将两个执行时间的确定为目标在该两个设备节点之间的转运操作的预计总时间。
根据上述方案，对于相邻两个节点均为设备节点的情况，通过将上游设备节点所涉及的后操作的预计执行时间和下游设备节点所涉及的前操作的预计执行时间的和确定为目标在相邻两个节点间的转运操作的预计总时间，进而基于总时间验证时间约束信息是否合理。这种方案执行逻辑简单，计算量小，且确定的总时间较准确，从而可以提高校验的效率和准确性。
示例性地，节点类型还包括结束节点。结束节点可以是表示流程结束的结束位置点。容易理解，结束位置点并非设备节点，因此在结束节点不包括对目标的转运操作。步骤S1410基于节点类型以及设备节点对应的设备所支持的操作的时长信息，确定总时间，包括步骤S1415和步骤S1416。在步骤S1415，在相邻两个节点中的下游节点是结束节点的情况下，确定相邻两个节点中的上游节点对应的后操作的第四执行时间，其中后操作为在该上游节点对应的设备执行自身操作之后完成的操作。在步骤S1416，可以将确定的第四执行时间确定为总时间。
对于相邻两个节点的上游节点是设备节点、下游节点是结束节点的情况，可以基于上游节点的节点信息，确定上游节点所涉及的所有后操作的预计执行时间，作为第四执行时间。与结束节点直接连接的设备节点所涉及的后操作也可以是任何合适的转运操作。如对主要执行设备的开门操作或关门操作等，或者也可以包括机械臂将目标从设备节点的主要执行设备搬运至结束位置点的搬运操作等。该第四执行时间可以是上述后操作的预计执行时间之和。可以将该第四执行时间作为在该设备节点和结束节点之间的转运操作的预计总时间，并可以基于该总时间校验时间约束信息是否合理。
根据上述方案，对于相邻两个节点为设备节点和结束节点的情况，可以将设备节点所涉及的后操作的预计执行时间确定为该两个节点之间的转运操作的预计总时间，进而可以基于该总时间校验时间约束信息的合理性。这种方案执行逻辑简单，计算量小，且确定的总时间较准确，从而可以提高校验的效率和准确性。
示例性地，步骤S1200获取自动化流程中相邻两个节点之间的时间约束信息和节点信息，包括步骤S1210。
在步骤S1210，对于自动化流程中的每个起始节点或设备节点，获取该起始节点或设备节点的节点信息，遍历与该起始节点或设备节点直接连接的下游节点，并且对于该下游节点是设备节点或结束节点的情况，获取该下游节点的节点信息。根据本申请实施例，可以以整个自动化流程的流程图为导向，遍历整个自动化流程获取每相邻两个节点之间的时间约束信息和节点信息。并且对每相邻两个节点之间的时间约束信息进行校验。具体地，可以按照自动化流程的执行方向，首先获取与耗材的起始节点直接连接的设备节点的节点信息和两者之间的时间约束信息，并校验每个时间约束信息是否合理。其次，可以获取该设备节点和与其直接连接的下游节点，在该下游节点为设备节点或结束节点时，获取该两个节点的节点信息和两者之间的时间约束信息，并进行校验。接着，在该下游节点是设备节点的情况下，可以继续获取与该设备节点直接连接的设备节点或结束节点之间的时间约束信息，并校验时间约束信息的合理性。以此类推，可以持续获取后续的相邻两个节点的时间约束信息并校验其合理性……最终，可以获取自动化流程中的最后一个设备节点和结束节点的节点信息和时间约束信息，并对其时间约束信息进行校验。当然，也可以首先遍历自动化流程中，找到相邻两个节点分别为起始节点和设备节点、设备节点和设备节点、设备节点和结束节点的情况下的、每两个节点的节点信息和时间约束信息。之后再对每两个节点之间的时间约束信息进行分别校验。
根据上述方案，可以遍历整个自动化流程中获取流程中的任意相邻两个节点的节点信息和时间约束信息，并分别校验时间约束信息的合理性。既可以保证对每个时间约束信息均进行有效地校验，从而保证自动化流程的顺利执行。还可以提高校验的效率。
示例性地，相邻两个节点中的设备节点对应多个目标。例如，相邻两个节点中的任一个设备节点包含主要执行设备对多个耗材的操作。该设备节点也涉及对多个耗材执行的转运操作。时间约束信息用于分别约束多个目标中的每个目标在相邻两个节点之间的转运操作的执行时间。
步骤S1400确定转运操作的总时间，包括：确定对多个目标中的每个目标的转运操作的总时间。骤S1600校验时间约束信息是否合理，包括：基于对每个目标的转运操作的总时间，分别校验每个目标的时间约束信息是否合理。例如，在前述步骤S1110和步骤S1120的示例中，接收用户利用图形用户界面的可操作控件输入的时间约束信息，例如“耗材1”的过期时间“55”秒、“耗材2”的过期时间“50”秒。则需要在步骤S1400确定该两个节点的设备节点所涉及的对“耗材1”的转运操作的预设执行时间的总时间。并在步骤S1600对约束“耗材1”的过期时间“55”秒进行校验，并确定过期时间“55”秒设置的是否合理。并且在步骤S1400确定该两个节点的设备节点所涉及的对“耗材2”的转运操作的预设执行时间的总时间。并在步骤S1600对约束“耗材2”的过期时间“50”秒进行校验，并确定其过期时间“50”秒设置的是否合理。
图2示出根据本申请一个实施例的自动化流程的局部的示意图。如图所示，该图中为自动化流程中的三个设备节点。其中上游节点“移液工作站”和下游节点“离心机”为相邻的设备节点。该两个设备节点之间可以包括用于约束对“耗材3”的转运操作的执行时间的时间约束信息。对于该两个设备节点，可以在步骤S1400确定“移液工作站”的设备节点涉及的对“耗材3”的后操作的预计执行时间和“离心机”的设备节点所涉及的对“耗材3”的前操作的预计执行时间的和，作为在该两个节点之间执行的对“耗材3”的转运操作的总时间。并可以在步骤S1600基于确定的总时间，对用于约束对“耗材3”的转运操作的执行时间的时间约束信息进行校验。
在该图中，上游节点“移液工作站”和下游节点“培养箱”也为相邻的设备节点。在该两个设备节点之间可以包括分别用于约束对“耗材4”和“耗材5”的转运操作的时间约束信息。可以在步骤S1400确定“移液工作站”的设备节点涉及的对“耗材4”的后操作的预计执行时间和“培养箱”的设备节点所涉及的对“耗材4”的前操作的预计执行时间的和，作为在该两个节点之间执行的对“耗材4”的转运操作的总时间，如称作“耗材4的总转运时间”。 并确定“移液工作站”的设备节点涉及的对“耗材5”的后操作的预计执行时间和“培养箱”的设备节点所涉及的对“耗材5”的前操作的预计执行时间的和，作为在该两个节点之间执行的对“耗材5”的转运操作的总时间，如称作“耗材5的总转运时间”。在步骤S1600可以基于“耗材4的总转运时间”，对用于约束对“耗材4”的转运操作的执行时间的时间约束信息进行校验；并可以基于“耗材5的总转运时间”，对用于约束对“耗材5”的转运操作的执行时间的时间约束信息进行校验。
根据上述方案，可以在设备节点包括对多个目标的时间约束信息的情况下，分别对每个目标的时间约束信息进行校验。这样可以保证校验的准确性和有效性。从而可以保证自动化流程的准确执行。
示例性地，时间约束信息包括过期时间信息。如前所述，过期时间信息可以用于指示目标的过期时间的信息。预设的过期时间可以等于转运操作的执行时间与容错时间的和。步骤S1600校验时间约束信息是否合理，包括步骤S1610和步骤S1620。
在步骤S1610，在过期时间信息所示的过期时间大于或等于总时间的情况下，确定时间约束信息合理。若过期时间大于或等于在步骤S1400确定的在该两个节点之间执行的对目标的转运操作的预设时间，则可以说明该过期时间设置的较合理。在步骤S1620，在过期时间信息所示的过期时间小于总时间的情况下，确定时间约束信息有误。即过期时间应不小于转运操作的预计总时间。否则，说明时间约束信息设置的不合理，从而可能影响自动化流程的顺利进行。
在确定时间约束信息不合理的情况下还可以发出相应的提示信息以提醒用户进行修改。例如，可以在校验的界面弹出“校验失败”的提示框，还可以提示校验失败的节点信息。从而可以方便用户基于提示信息对相应的节点之间的时间约束信息进行修改。
根据上述方案，可以通过比较相邻两个节点间的过期时间信息所示的过期时间与该两个节点间的转运操作的预设总时间的大小，确定时间约束信息是否合理。该校验逻辑更简单，计算量也较小。
示例性地，在步骤S1600校验时间约束信息是否合理之后，方法1000还包括步骤S1710、步骤S1720和步骤S1730。在上述对相邻两个节点间的时间约束信息进行初次校验之后，还可以对该时间约束信息进行再次校验。例如，可以在用户对流程中的时间约束信息进行修改之后，响应于用户对流程的预运行操作，通过执行步骤S1710、步骤S1720和步骤S1730对时间约束信息进行再次校验。
在步骤S1710，根据相邻两个节点在自动化流程中的连接关系，确定相邻两个节点的最小子操作的执行次序。例如，可以根据自动化流程中的相邻两个节点的节点信息，解析相邻两个节点所涉及的各个最小子操作。这些最小子操作例如可以是设备节点所涉及的各个设备对目标执行的各种操作的最小操作单元，其可以包括主要执行设备执行的主操作的最小操作单元，也可以包括转运设备所执行的前操作和后操作的最小操作单元。例如，最小子操作例如离心机的开门操作、关门操作、机械臂的搬运操作、离心机的旋转操作等等。然后可以基于两个节点的连接关系，确定解析出的各个最小子操作的执行次序。该执行次序例如可以包括串行执行次序，也可以包括并行执行次序。
在步骤S1720，至少根据执行次序以及每个最小子操作的预设执行时间，再次确定总时间。例如，可以根据确定的解析出的各个最小子操作的执行次序，确定一组按照串行次序执行的串行子操作。可以对应得到将该串行子操作中的每个最小子操作的预设执行时间。并可以基于串行子操作中涉及目标的转运操作的各个最小子操作的执行时间，再次确定转运操作的总时间。例如，对于相邻两个节点是起始节点和设备节点的情况，可以计算该设备节点对应的前操作所涉及的每个最小子操作的第一预设执行时间之和，以作为转运操作的总时间；对于相邻两个节点均为设备节点的情况，可以计算上游设备节点对应的后操作所涉及的每个最小子操作的第二预设执行时间之和以及下游设备节点对应的前操作所涉及的每个最小子操作的第三预设执行时间之和，以及将第二预设执行时间之和和第三预设执行时间之和相加，以作为转运操作的总时间；对于相邻两个节点分别为设备节点和结束节点的情况，可以计算该设备节点对应的后操作所涉及的每个最小子操作的第四预设执行时间之和，以作为转运操作的总时间。在一个具体的示例中，例如串行子操作中涉及目标的转运操作的最小子操作包括离心机的开门操作、关门操作、机械臂的搬运操作，因此可以将离心机的开门操作、关门操作、机械臂的搬运操作的预设执行时间之和，确定为总时间。
在步骤S1730，根据所再次确定的总时间，再次校验时间约束信息是否合理。该步骤与步骤S1600类似，本领域普通技术人员容易理解其各种实现方案，在此不再赘述。
根据上述方案，可以在初次校验两个节点间的时间约束信息正确之后，在自动化流程的运行之前，对该时间约束信息进行再次校验。这种方案可以保证时间约束信息的合理性，从而可以确保目标的有效性和可用性，进而可以保证自动化流程的顺利有效执行。
示例性地，时间约束信息包括过期时间信息，在步骤S1600校验时间约束信息是否合理之后，方法1000还包括步骤S1800。
在步骤S1800，在确定时间约束信息合理之后，响应于用户的第二操作，运行自动化流程。其中，在运行自动化流程的过程中，确定目标在相邻两个节点之间的转运操作的执行时间是否超出过期时间信息所示的过期时间，并且，在超出的情况下，将目标标记为过期状态。第二操作可以是任何合适的操作。示例性而非限制性地，在用户界面可以包括“运行流程”的控件，第二操作可以是用户点击该控件的操作。根据本申请实施例，在校验相邻两个节点之间的时间约束信息正确之后，可以运行该自动化流程。并且，在时间约束信息包括过期时间信息的情况下，可以在流程运行至与该过期时间信息关联的转运操作时，可以对目标在该两个节点之间的转运操作的实际执行时间进行监控，并可以在其实际执行时间超过过期时间时，将该目标标记为过期状态。从而可以提示用户该目标已过期，以方便对该过期目标进行相应的处理。
上述方案，可以在自动化流程的运行阶段，基于校验正确的时间约束信息对目标的转运操作的实际执行时间进行过期监控，并在确定目标过期的情况下对目标进行过期标记。从而可以提醒用户对过期的目标进行特别关注，以保证目标的有效性和可用性，进而可以保证自动化流程的顺利有效执行。
图3a至图3c分别示出根据本申请另一个实施例的自动化流程的管理方法的三个不同部分的示意性流程图。其中，图3a示出根据本申请另一个实施例的自动化流程的管理方法的第一部分的示意性流程图。如图3a所示，对于自动化流程中的每个起始节点，遍历从该节点出发的每个线条。若与该线条连接的另一节点是设备节点，则可以获取该两个节点的节点信息和两个节点间的时间约束信息。时间约束信息例如包括过期时间信息。并可以计算设备节点所涉及的前操作时间，作为该两个节点间的转运操作的预计总时间。然后，可以通过对比过期时间信息所示的过期时间和总时间的大小，校验时间约束信息是否合理。其中若过期时间小于总时间，则确定校验失败，否则确定校验成功。图3b示出根据本申请另一个实施例的自动化流程的管理方法的第二部分的示意性流程图。如图3b所示，对于自动化流程中的每个设备节点，遍历从该节点出发的每个线条。对于与该线条连接的另一节点是设备节点的情况，可以获取该两个设备节点的节点信息和两个设备节点之间的时间约束信息。时间约束信息例如包括过期时间信息。并可以计算上游设备节点所涉及的后操作时间和下游设备节点所涉及的前操作时间之和，作为该两个节点间的转运操作的预计总时间。然后，可以通过对比过期时间信息所示的过期时间和总时间的大小，校验时间约束信息是否合理。图3c示出根据本申请另一个实施例的自动化流程的管理方法的第三部分的示意性流程图。如图3c所示，对于自动化流程中的每个设备节点，遍历从该节点出发的每个线条。对于与该线条连接的另一节点是结束节点的情况，可以获取两个节点的节点信息和两个节点之间的时间约束信息。时间约束信息例如包括过期时间信息。并可以计算上游设备节点所涉及的后操作时间，作为该两个节点间的转运操作的预计总时间。然后，可以通过对比过期时间信息所示的过期时间和总时间的大小，校验时间约束信息是否合理。
根据本申请第二方面，还提供一种自动化流程的管理装置。图4示出根据本申请一个实施例的自动化流程的管理装置400的示意性框图。如图所示，该装置400包括：
获取模块410，用于获取自动化流程中相邻两个节点之间的时间约束信息和节点信息，其中，时间约束信息用于约束目标在相邻两个节点之间的转运操作的执行时间。
确定模块420，用于基于相邻两个节点的节点信息，确定转运操作的总时间。
校验模块430，用于基于总时间，校验时间约束信息是否合理。
根据本申请第三方面，还提供一种电子设备。图5示出根据本申请一个实施例的电子设备500的示意性框图。如图所示，该电子设备500包括处理器510和存储器520。其中，存储器中存储有计算机程序指令，计算机程序指令被处理器运行时用于执行上述自动化流程的管理方法1000。
根据本申请的第四方面，还提供了一种存储介质。在存储介质上存储了程序指令，程序指令在运行时用于执行上述自动化流程的管理方法。存储介质例如可以包括平板电脑的存储部件、个人计算机的硬盘、只读存储器(ROM)、可擦除可编程只读存储器(EPROM)、便携式只读存储器(CD-ROM)、USB存储器、或者上述存储介质的任意组合。所述计算机可读存储介质可以是一个或多个计算机可读存储介质的任意组合。
本领域普通技术人员通过阅读上述有关自动化流程的管理方法的相关描述，可以理解上述自动化流程的管理装置、电子设备和存储介质的具体实现方案及其有益效果，为了简洁，在此不再赘述。
尽管这里已经参考附图描述了示例实施例，应理解上述示例实施例仅仅是示例性的，并且不意图将本申请的范围限制于此。本领域普通技术人员可以在其中进行各种改变和修改，而不偏离本申请的范围和精神。所有这些改变和修改意在被包括在所附权利要求所要求的本申请的范围之内。
本领域普通技术人员可以意识到，结合本文中所公开的实施例描述的各示例的单元及算法步骤，能够以电子硬件、或者计算机软件和电子硬件的结合来实现。这些功能究竟以硬件还是软件方式来执行，取决于技术方案的特定应用和设计约束条件。专业技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能，但是这种实现不应认为超出本申请的范围。
在本申请所提供的几个实施例中，应该理解到，所揭露的设备和方法，可以通过其它的方式实现。例如，以上所描述的设备实施例仅仅是示意性的，例如，所述单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如多个单元或组件可以结合或者可以集成到另一个设备，或一些特征可以忽略，或不执行。
在此处所提供的说明书中，说明了大量具体细节。然而，能够理解，本申请的实施例可以在没有这些具体细节的情况下实践。在一些实例中，并未详细示出公知的方法、结构和技术，以便不模糊对本说明书的理解。
类似地，应当理解，为了精简本申请并帮助理解各个发明方面中的一个或多个，在对本申请的示例性实施例的描述中，本申请的各个特征有时被一起分组到单个实施例、图、或者对其的描述中。然而，并不应将该本申请的方法解释成反映如下意图：即所要求保护的本申请要求比在每个权利要求中所明确记载的特征更多的特征。更确切地说，如相应的权利要求书所反映的那样，其发明点在于可以用少于某个公开的单个实施例的所有特征的特征来解决相应的技术问题。因此，遵循具体实施方式的权利要求书由此明确地并入该具体实施方式，其中每个权利要求本身都作为本申请的单独实施例。
本领域的技术人员可以理解，除了特征之间相互排斥之外，可以采用任何组合对本说明书(包括伴随的权利要求、摘要和附图)中公开的所有特征以及如此公开的任何方法或者设备的所有过程或单元进行组合。除非另外明确陈述，本说明书(包括伴随的权利要求、摘要和附图)中公开的每个特征可以由提供相同、等同或相似目的的替代特征来代替。
此外，本领域的技术人员能够理解，尽管在此所述的一些实施例包括其它实施例中所包括的某些特征而不是其它特征，但是不同实施例的特征的组合意味着处于本申请的范围之内并且形成不同的实施例。例如，在权利要求书中，所要求保护的实施例的任意之一都可以以任意的组合方式来使用。
本申请的各个部件实施例可以以硬件实现，或者以在一个或者多个处理器上运行的软件模块实现，或者以它们的组合实现。本领域的技术人员应当理解，可以在实践中使用微处理器或者数字信号处理器(DSP)来实现根据本申请实施例的自动化流程的管理装置中的一些模块的一些或者全部功能。本申请还可以实现为用于执行这里所描述的方法的一部分或者全部的装置程序(例如，计算机程序和计算机程序产品)。这样的实现本申请的程序可以存储在计算机可读介质上，或者可以具有一个或者多个信号的形式。这样的信号可以从因特网网站上下载得到，或者在载体信号上提供，或者以任何其他形式提供。
应该注意的是上述实施例对本申请进行说明而不是对本申请进行限制，并且本领域技术人员在不脱离所附权利要求的范围的情况下可设计出替换实施例。在权利要求中，不应将位于括号之间的任何参考符号构造成对权利要求的限制。单词“包含”不排除存在未列在权利要求中的元件或步骤。位于元件之前的单词“一”或“一个”不排除存在多个这样的元件。本申请可以借助于包括有若干不同元件的硬件以及借助于适当编程的计算机来实现。在列举了若干装置的单元权利要求中，这些装置中的若干个可以是通过同一个硬件项来具体体现。单词第一、第二、以及第三等的使用不表示任何顺序。可将这些单词解释为名称。
以上所述，仅为本申请的具体实施方式或对具体实施方式的说明，本申请的保护范围并不局限于此，任何熟悉本技术领域的技术人员在本申请揭露的技术范围内，可轻易想到变化或替换，都应涵盖在本申请的保护范围之内。本申请的保护范围应以权利要求的保护范围为准。

Claims (14)

  1. 一种自动化流程的管理方法，其特征在于，包括：
    获取所述自动化流程中相邻两个节点之间的时间约束信息和节点信息，其中，所述时间约束信息用于约束目标在所述相邻两个节点之间的转运操作的执行时间；
    基于所述相邻两个节点的所述节点信息，确定所述转运操作的总时间；以及基于所述总时间，校验所述时间约束信息是否合理。
  2. 根据权利要求1所述的自动化流程的管理方法，其特征在于，所述节点信息包括节点类型，所述节点类型包括设备节点，所述设备节点的节点信息还包括：所述设备节点对应的设备所支持的操作的时长信息；
    所述基于所述相邻两个节点的所述节点信息，确定所述转运操作的总时间，包括：
    基于所述节点类型以及所述设备节点对应的设备所支持的操作的时长信息，确定所述总时间。
  3. 根据权利要求2所述的自动化流程的管理方法，其特征在于，所述节点类型还包括起始节点；
    所述基于所述节点类型以及所述设备节点对应的设备所支持的操作的时长信息，确定所述总时间，包括：
    在所述相邻两个节点中的上游节点是起始节点的情况下，确定所述相邻两个节点中的下游节点对应的前操作的第一执行时间，其中，所述前操作为在该下游节点对应的设备执行自身操作之前完成的操作；以及将所述第一执行时间确定为所述总时间。
  4. 根据权利要求2所述的自动化流程的管理方法，其特征在于，所述基于所述节点类型以及所述设备节点对应的设备所支持的操作的时长信息，确定所述总时间，包括：
    在所述相邻两个节点均是设备节点的情况下，确定所述相邻两个节点中的上游节点对应的后操作的第二执行时间，并确定所述相邻两个节点中的下游节点对应的前操作的第三执行时间，其中，所述后操作为在该上游节点对应的设备执行自身操作之后完成的操作，所述前操作为在该下游节点对应的设备执行自身操作之前完成的操作；以及将所述第二执行时间和所述第三执行时间加和，以获得所述总时间。
  5. 根据权利要求2所述的自动化流程的管理方法，其特征在于，所述节点类型还包括结束节点；
    所述基于所述节点类型以及所述设备节点对应的设备所支持的操作的时长信息，确定所述总时间，包括：
    在所述相邻两个节点中的下游节点是结束节点的情况下，确定所述相邻两个节点中的上游节点对应的后操作的第四执行时间，其中所述后操作为在该上游节点对应的设备执行自身操作之后完成的操作；以及将所述第四执行时间确定为所述总时间。
  6. 根据权利要求3至5任一项所述的自动化流程的管理方法，其特征在于，
    所述获取所述自动化流程中相邻两个节点之间的时间约束信息和节点信息，包括：
    对于所述自动化流程中的每个起始节点或设备节点，获取该起始节点或设备节点的节点信息，遍历与该起始节点或设备节点直接连接的下游节点，并且对于该下游节点是设备节点或结束节点的情况，获取该下游节点的节点信息。
  7. 根据权利要求1至5任一项所述的自动化流程的管理方法，其特征在于，所述相邻两个节点中的设备节点对应多个目标，所述时间约束信息用于分别约束所述多个目标中的每个目标在所述相邻两个节点之间的转运操作的执行时间，
    所述确定所述转运操作的总时间，包括：确定对所述多个目标中的每个目标的转运操作的总时间；
    所述校验所述时间约束信息是否合理，包括：基于对每个目标的转运操作的总时间，分别校验每个目标的时间约束信息是否合理。
  8. 根据权利要求1至5任一项所述的自动化流程的管理方法，其特征在于，所述时间约束信息包括过期时间信息，所述校验所述时间约束信息是否合理，包括：
    在所述过期时间信息所示的过期时间大于或等于所述总时间的情况下，确定所述时间约束信息合理；以及在所述过期时间信息所示的过期时间小于所述总时间的情况下，确定所述时间约束信息有误。
  9. 根据权利要求1至5任一项所述的自动化流程的管理方法，其特征在于，在所述获取所述自动化流程中相邻两个节点之间的时间约束信息之前，所述方法还包括：
    显示图形用户界面，所述图形用户界面包括可操作控件；
    响应于用户利用所述可操作控件的第一操作，自所述用户接收所述时间约束信息。
  10. 根据权利要求1至5任一项所述的自动化流程的管理方法，其特征在于，所述时间约束信息包括过期时间信息，在所述校验所述时间约束信息是否合理之后，所述方法还包括：
    在确定所述时间约束信息合理之后，响应于用户的第二操作，运行所述自动化流程；
    其中，在运行所述自动化流程的过程中，确定所述目标在所述相邻两个节点之间的转运操作的执行时间是否超出所述过期时间信息所示的过期时间，并且，在超出的情况下，将所述目标标记为过期状态。
  11. 根据权利要求1至5任一项所述的自动化流程的管理方法，其特征在于，在所述校验所述时间约束信息是否合理之后，所述方法还包括：
    根据所述相邻两个节点在所述自动化流程中的连接关系，确定所述相邻两个节点之间的最小子操作的执行次序；
    至少根据所述执行次序以及每个所述最小子操作的预设执行时间，再次确定所述总时间；以及
    根据所再次确定的总时间，再次校验所述时间约束信息是否合理。
  12. 一种自动化流程的管理装置，其特征在于，包括：
    获取模块，用于获取所述自动化流程中相邻两个节点之间的时间约束信息和节点信息，其中所述时间约束信息用于约束目标在所述相邻两个节点之间的转运操作的执行时间；
    确定模块，用于基于所述相邻两个节点的所述节点信息，确定所述转运操作的总时间；以及
    校验模块，用于基于所述总时间，校验所述时间约束信息是否合理。
  13. 一种电子设备，包括处理器和存储器，其中，所述存储器中存储有计算机程序指令，所述计算机程序指令被所述处理器运行时用于执行如权利要求1至11任一项所述的自动化流程的管理方法。
  14. 一种存储介质，在所述存储介质上存储了程序指令，所述程序指令在运行时用于执行如权利要求1至11任一项所述的自动化流程的管理方法。
PCT/CN2023/127813 2022-11-04 2023-10-30 自动化流程的管理方法、装置、电子设备及存储介质 WO2024093928A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202211376143.3 2022-11-04
CN202211376143.3A CN115903689A (zh) 2022-11-04 2022-11-04 自动化流程的管理方法、装置、电子设备及存储介质

Publications (1)

Publication Number Publication Date
WO2024093928A1 true WO2024093928A1 (zh) 2024-05-10

Family

ID=86484944

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/127813 WO2024093928A1 (zh) 2022-11-04 2023-10-30 自动化流程的管理方法、装置、电子设备及存储介质

Country Status (2)

Country Link
CN (1) CN115903689A (zh)
WO (1) WO2024093928A1 (zh)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115903689A (zh) * 2022-11-04 2023-04-04 深圳镁伽科技有限公司 自动化流程的管理方法、装置、电子设备及存储介质
CN115755790A (zh) * 2022-11-04 2023-03-07 深圳镁伽科技有限公司 自动化流程的管理方法、装置、电子设备及存储介质

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180080949A1 (en) * 2016-09-21 2018-03-22 Roche Diagnostics Operations, Inc. Automated scheduler for laboratory equipment
CN109377063A (zh) * 2018-10-31 2019-02-22 广船国际有限公司 一种任务调度方法、装置、设备和存储介质
CN113126583A (zh) * 2021-04-23 2021-07-16 北自所（北京）科技发展有限公司 一种数字孪生纺织成套装备实时交互控制方法及系统
CN113919728A (zh) * 2021-10-22 2022-01-11 长鑫存储技术有限公司 工艺流程管理方法及设备
CN114282845A (zh) * 2021-12-31 2022-04-05 胜斗士(上海)科技技术发展有限公司 用于运输工具调度规划的方法、电子设备和存储介质
CN115755790A (zh) * 2022-11-04 2023-03-07 深圳镁伽科技有限公司 自动化流程的管理方法、装置、电子设备及存储介质
CN115903689A (zh) * 2022-11-04 2023-04-04 深圳镁伽科技有限公司 自动化流程的管理方法、装置、电子设备及存储介质

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180080949A1 (en) * 2016-09-21 2018-03-22 Roche Diagnostics Operations, Inc. Automated scheduler for laboratory equipment
CN109377063A (zh) * 2018-10-31 2019-02-22 广船国际有限公司 一种任务调度方法、装置、设备和存储介质
CN113126583A (zh) * 2021-04-23 2021-07-16 北自所（北京）科技发展有限公司 一种数字孪生纺织成套装备实时交互控制方法及系统
CN113919728A (zh) * 2021-10-22 2022-01-11 长鑫存储技术有限公司 工艺流程管理方法及设备
CN114282845A (zh) * 2021-12-31 2022-04-05 胜斗士(上海)科技技术发展有限公司 用于运输工具调度规划的方法、电子设备和存储介质
CN115755790A (zh) * 2022-11-04 2023-03-07 深圳镁伽科技有限公司 自动化流程的管理方法、装置、电子设备及存储介质
CN115903689A (zh) * 2022-11-04 2023-04-04 深圳镁伽科技有限公司 自动化流程的管理方法、装置、电子设备及存储介质

Also Published As

Publication number Publication date
CN115903689A (zh) 2023-04-04

Similar Documents

Publication Publication Date Title
WO2024093928A1 (zh) 自动化流程的管理方法、装置、电子设备及存储介质
WO2024093909A1 (zh) 自动化流程的管理方法、装置、电子设备及存储介质
JP6117310B2 (ja) 自動分析装置
JP6307446B2 (ja) 遠心分離システム、検体前処理システム、制御方法
WO2018176609A1 (zh) 用于工程中对bim模型中构件扣减检查的方法及其装置
TWI833716B (zh) 用於分析生物樣品之系統
JP2008249442A (ja) 自動分析装置
WO2024093925A1 (zh) 自动化流程的管理方法、装置、电子设备及存储介质
JP2011185628A (ja) 検体分析装置、検体識別情報取得方法および検体識別情報取得装置
WO2024093920A1 (zh) 自动化流程的管理方法、装置、电子设备及存储介质
CN109857583B (zh) 一种处理方法及装置
GB2561299A (en) Control path verification of hardware design for pipelined process
WO2014103858A1 (ja) 遺伝子検査装置、遺伝子検査方法及びプログラム
WO2024092898A1 (zh) 试验流程解析方法、装置、电子设备及存储介质
RU2757204C1 (ru) Устройство для автоматического анализа
CN114155930A (zh) 报告发布方法、装置、设备及存储介质
CN110456089B (zh) 全自动样本分析仪及其加试剂方法、计算装置
CN109375953A (zh) 一种操作系统启动方法及装置
CN112946304B (zh) 样本检测的插入方法、样本检测设备以及存储介质
JP2014055907A (ja) 検体前処理システム、及び検体検査前処理システムの制御装置
US20230056397A1 (en) Automatic analysis device, display system of automatic analysis device, and display method in automatic analysis device
WO2024092900A1 (zh) 试验流程解析方法、装置、电子设备及存储介质
CN101206592A (zh) 电源管理表格的诊断方法
US10261925B2 (en) Enhanced techniques for detecting programming errors in device drivers
TWI847796B (zh) 基因檢查方法及基因檢查裝置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 23884858

Country of ref document: EP

Kind code of ref document: A1