Acute ischemic stroke reperfusion treatment flow chart display method and device

Abstract

The invention provides an acute ischemic stroke reperfusion treatment flow chart display method and device, solves the problems of different posts, task allocation management and the like, and comprises the following steps: S1, flow node division; s2, segmenting different post role tasks; s3, taking patient arrival as a starting point, and setting target time for different tasks; s4, multi-task parallel connection is carried out; and S5, performing visual management on the tasks. The method has the advantages of being good in task management effect, high in visualization degree and the like.

Description

Technical Field

[0001] The present invention belongs to the technical field of task management, and in particular relates to a method and a device for displaying a flowchart of reperfusion treatment for acute ischemic stroke. Background Art

[0002] Intravenous thrombolysis and endovascular therapy are still considered to be the most effective treatments for improving the outcome of acute ischemic stroke. However, due to the limitation of the time window, in order to improve the treatment effect, it is necessary to finely manage the acute ischemic stroke reperfusion treatment process, ensure the time window management effect, and impose sufficient condition constraints on the treatment process. However, in the actual application management process, the existing treatment process management system lacks the overall allocation management of different positions and tasks, and it is easy to miss the time window for thrombolysis and thrombectomy of cerebral infarction during the treatment process. In addition, the existing management system lacks the means to adjust the treatment process.

[0003] In order to solve the shortcomings of the existing technology, people have conducted long-term exploration and proposed various solutions. For example, a Chinese patent document discloses a process mining method based on the treatment process of a single disease [201510508342.9], which includes the use of a series of logical optimization algorithms such as association rules, genetic algorithms, and maximum expectation algorithms to determine the core event items in the treatment process, and then use case samples to connect and draw the scattered points on the treatment path. Through the connection diagram drawn by the historical case samples, the treatment path diagram is obtained, and then the various event nodes on the treatment path diagram are expanded to form a complete set of treatment event items, and the cost range of each treatment event item set is estimated and the diagnosis and treatment event sequence of the entire treatment process is given; the rationality of the mined treatment event sequence is verified and evaluated to determine an effective disassembly path.

[0004] The above solution solves the problem of adjusting the treatment process to a certain extent, but the solution still has many shortcomings, such as the overall allocation and management of different positions and tasks. Summary of the invention

[0005] The purpose of the present invention is to provide a method for displaying a flowchart of acute ischemic stroke reperfusion treatment with a reasonable design and good task allocation management effect in view of the above problems.

[0006] Another object of the present invention is to provide an acute ischemic stroke reperfusion treatment flow chart display device that can effectively grasp the treatment time window in response to the above-mentioned problem.

[0007] To achieve the above object, the present invention adopts the following technical scheme: a method for displaying a flowchart of reperfusion treatment for acute ischemic stroke, comprising the following steps:

[0008] S1: process node division;

[0009] S2: Divide the tasks of different job roles;

[0010] S3: Taking the patient’s arrival at the hospital as the starting point, set target times for different tasks;

[0011] S4: Perform multiple tasks in parallel;

[0012] S5: Manage tasks visually.

[0013] In the above-mentioned acute ischemic stroke reperfusion treatment flow chart display method, step S1 includes the following steps:

[0014] S11: Flowchart template import;

[0015] S12: Import the process nodes into the flowchart template;

[0016] S13: Detect abnormal process nodes and make manual corrections;

[0017] S14: Optimize the process and delete unnecessary nodes.

[0018] In the above-mentioned acute ischemic stroke reperfusion treatment flow chart display method, step S12 includes the following steps:

[0019] S121: Setting a task flow network T, where T = (A, B; a, b), first determining node A and node B, then connecting node A and node B through line a and line b, where node A represents a position, node B represents a task, line a represents work, and line b represents a task transfer direction;

[0020] S122: Set the main process network D and the sub-process network C, the meanings of which are as follows:

[0021] C=(A1, B1; a1, b1);

[0022] D = (A2, B2; a2, b2);

[0023] S123: Set up a task flow system E, where E = (A, B; a, b; F, G, H, L), where F is the starting task, G is the task transfer condition, H is the set of groups of the task flow network T, and L is a repeatable task.

[0024] In the above-mentioned acute ischemic stroke reperfusion treatment flowchart display method, step S2 uses a graphic method to represent the tasks of different job roles, wherein the roles, tasks and task flow network are represented by circles, rectangles and cloud diagrams respectively, work and forwarding are represented by straight lines with arrows, starting tasks and task transfer conditions are represented by hollow arrows, repeatable tasks are represented by straight lines with circles, and the set of groups is represented by numbers.

[0025] In the above-mentioned acute ischemic stroke reperfusion treatment flow chart display method, step S3 includes the following steps:

[0026] S31: Setting a fixed time interval as a time period. Every time a time period passes, the management system collects the task requirements of the current time period, decomposes the task into multiple subtasks, and continuously distributes the subtasks to all executors.

[0027] S32: Each executor receives the subtask and determines whether it matches the task requirements based on his / her own position information. If it matches, the executor feeds back the real-time status to the management system;

[0028] S33: The executors exchange task information, determine the executors suitable for the subtask, update the task and feed back the task information to the management system;

[0029] S34: The management system detects the updated tasks based on a topological sorting algorithm, forwards the tasks with the lowest priority in the current time period to the next time period and increases their priority.

[0030] In the above-mentioned acute ischemic stroke reperfusion treatment flow chart display method, step S4 includes the following steps:

[0031] S41: task reception and input;

[0032] S42: Data preparation;

[0033] S43: treated subject analysis;

[0034] S44: Comprehensive risk assessment;

[0035] S45: Treatment procedure selection;

[0036] S46: Task allocation planning;

[0037] S47: Task simulation exercise to determine whether the task conditions are met. If so, proceed to step S48 to re-plan the task and return to step S45;

[0038] S48: Mission planning output.

[0039] In the above-mentioned acute ischemic stroke reperfusion treatment flow chart display method, step S45 includes the following steps:

[0040] S451: Determine the process starting point, task location, treatment conditions, and potential risks;

[0041] S452: Determine the constraints and model of treatment process planning based on task constraints and the executor's own conditions;

[0042] S453: Select a search algorithm and find a treatment process that satisfies the constraints;

[0043] S454: Evaluate the searched treatment process;

[0044] S455: Output the planned treatment process.

[0045] In the above-mentioned acute ischemic stroke reperfusion treatment flow chart display method, the search algorithm in step S453 uses the A* algorithm, and its expression is as follows:

[0046] fn) = gn + h(n);

[0047] Where f(n) is the overall cost estimation function of the current process n, g(n) is the distance cost function from the process starting point to the current process n, and h(n) is the heuristic evaluation cost function from the current process n to the target process.

[0048] In the above-mentioned acute ischemic stroke reperfusion treatment flow chart display method, step S46 includes the following steps:

[0049] S461: Determine the task allocation constraints and model them. The constraints include task balance, treatment time, treatment cost, and expected treatment effect. The task allocation objective function is as follows:

[0050]

[0051] in Ensure that each task is performed at most once, R ij The cost of performing the jth task for the i-th executor;

[0052] S462: Determine task allocation and classification criteria, wherein the tasks include allocating a single task to each executor and allocating multiple tasks to each executor;

[0053] S463: Establish a task allocation model and select a corresponding algorithm, match executors with tasks one by one, and select the best task path.

[0054] An acute ischemic stroke reperfusion treatment flow chart display device adopts the acute ischemic stroke reperfusion treatment flow chart display method.

[0055] Compared with the existing technology, the advantages of the present invention are: dividing the process nodes and managing the tasks in parallel, so as to optimize the treatment process and ensure its treatment time window; performing task allocation constraints during the task parallel management process, so as to select the best task path, taking into account the treatment cost and the expected treatment effect, etc.; introducing a search algorithm to find a treatment process that meets the constraint adjustment, which can adjust the constraint conditions in real time and can make adaptive adjustments to the executors and tasks. BRIEF DESCRIPTION OF THE DRAWINGS

[0056] Figure 1 is a flow chart of the method of the present invention;

[0057] Figure 2 It is a schematic diagram of the process node division of the present invention;

[0058] Figure 3 It is a schematic diagram of the multi-task parallel process of the present invention. DETAILED DESCRIPTION

[0059] The present invention is further described in detail below with reference to the accompanying drawings and specific embodiments.

[0060] like Figure 1-3 As shown, a method for displaying a flowchart of reperfusion therapy for acute ischemic stroke mainly selects the best combination of optimization goals according to the execution requirements of the task and the conditions of the executor, and satisfies the optimization goals as much as possible, including the following steps:

[0061] S1: process node division;

[0062] S2: Divide the tasks of different job roles;

[0063] S3: Taking the patient’s arrival at the hospital as the starting point, set target times for different tasks;

[0064] S4: Perform multiple tasks in parallel;

[0065] S5: Manage tasks visually.

[0066] Specifically, in step S1, in a multi-node situation, node failure may easily lead to task interruption, and a certain fault tolerance mechanism needs to be introduced to ensure the complete execution of the task. When the task fails to execute, it is rescheduled and executed, which includes the following steps:

[0067] S11: Flowchart template import;

[0068] S12: Import the process nodes into the flowchart template;

[0069] S13: Detect abnormal process nodes and make manual corrections;

[0070] S14: Optimize the process and delete unnecessary nodes.

[0071] In depth, the flowchart template in step S12 usually needs to be used repeatedly, which includes the following steps:

[0072] S121: Set up a task flow network T, where T = (A, B; a, b), first determine the A node and the B node, then connect the A node and the B node through the a line and the b line, where the A node represents the position, the B node represents the task, the a line represents the work, and the b line represents the task transfer direction. At the same time, different colored lines can be used to distinguish them according to actual needs.

[0073] S122: Set the main process network D and the sub-process network C, where the sub-process network C is transitive, and its meaning is as follows:

[0074] C=(A1, B1; a1, b1);

[0075] D = (A2, B2; a2, b2);

[0076] S123: Set up a task flow system E, where E = (A, B; a, b; F, G, H, L), where F is the starting task and work can be started without transfer, and G is the task transfer condition; H is the set of groups in the task flow network T. If the work of position A is related to the completed tasks, they will be concentrated into a single group; L is a repeatable task, and the path of the last group of execution tasks is retained in the entire task flow system E.

[0077] Furthermore, step S2 uses images to represent different job roles and tasks, which facilitates subsequent visual management. The roles, tasks and task flow network are represented by circles, rectangles and cloud diagrams respectively, work and forwarding are represented by straight lines with arrows, starting tasks and task transfer conditions are represented by hollow arrows, reproducible tasks are represented by straight lines with circles, and grouped sets are represented by numbers. In addition, solid lines and dotted lines are used to distinguish between ongoing and unfinished tasks, and different colors can also be used to distinguish them.

[0078] The above-mentioned job role task allocation can be dynamically adjusted during the execution process. When tasks are crossed or parallel, adjustments are made. If errors in task allocation are found, the task allocation is reversed and reprocessed.

[0079] Furthermore, step S3 sets target time for different tasks, where the types of tasks are relatively fixed, and there is a situation where a single executor has multiple tasks, which need to be operated in parallel. At the same time, the tasks will be adjusted in real time, and the objects will appear randomly, so the following steps are used to allocate time:

[0080] S31: Setting a fixed time interval as a time period. Every time a time period passes, the management system collects the task requirements of the current time period, decomposes the task into multiple subtasks, and continuously distributes the subtasks to all executors.

[0081] S32: Each executor receives the subtask and determines whether it matches the task requirements based on his / her own position information. If it matches, the executor feeds back the real-time status to the management system;

[0082] S33: The executors exchange task information, determine the executors suitable for the subtask, update the task and feed back the task information to the management system;

[0083] S34: The management system detects the updated tasks based on a topological sorting algorithm, forwards the tasks with the lowest priority in the current time period to the next time period and increases their priority.

[0084] In addition, step S4 includes the following steps:

[0085] S41: Task reception and input, the management system receives task information;

[0086] S42: Prepare and analyze data through information collection and management system, and establish corresponding constraints;

[0087] S43: treated subject analysis;

[0088] S44: Comprehensive risk assessment;

[0089] S45: Treatment procedure selection;

[0090] S46: Task allocation planning, re-planning and cyclic processing for tasks that do not meet planning requirements;

[0091] S47: Task simulation exercise to determine whether the task conditions are met. If so, proceed to step S48 to re-plan the task and return to step S45;

[0092] S48: Mission planning output.

[0093] Meanwhile, step S45 includes the following steps:

[0094] S451: Determine the process starting point, task location, treatment conditions, and potential risks;

[0095] S452: Determine the constraints and model of treatment process planning based on task constraints and the executor's own conditions;

[0096] S453: Select a search algorithm and find a treatment process that satisfies the constraints;

[0097] S454: Evaluate the searched treatment process;

[0098] S455: Output the planned treatment process.

[0099] It can be seen that the search algorithm in step S453 uses the A* algorithm, and its expression is as follows:

[0100] f(n)=g(n)+h(n);

[0101] Among them, f(n) is the overall cost estimation function of the current process n, g(n) is the distance cost function between the process starting point and the current process n, and h(n) is the heuristic evaluation cost function from the current process n to the target process. Compared with other algorithms, the A* algorithm is the best algorithm for global task planning. Its structure is more intuitive, the search efficiency is high, and the convergence is strong. It can find the optimal treatment process in a static environment.

[0102] Obviously, step S46 needs to set M tasks and N executors. Each executor can perform multiple tasks, but each task can only be assigned to a single executor. It includes the following steps:

[0103] S461: Determine the task allocation constraints and model them. The constraints include task balance, treatment time, treatment cost, and expected treatment effect. The task allocation objective function is as follows:

[0104]

[0105] in Ensure that each task is performed at most once, R ij The cost of performing the jth task for the i-th executor; the task balance mainly ensures that the burden of each executor is even, thereby reducing the fatigue of each executor.

[0106] S462: Determine task allocation and classification criteria, wherein the tasks include allocating a single task to each executor and allocating multiple tasks to each executor;

[0107] S463: Establish a task allocation model and select a corresponding algorithm, match the executor with the task one by one, and select the best task path. The algorithms used include genetic algorithm and K-value clustering algorithm, where the K-value clustering algorithm selects several of the multiple data as the initial clustering centers, and then clusters each task as a cluster. If the genetic algorithm is selected, it is necessary to estimate the fitness of the new individual through population individual variation, crossover and inheritance, and then select the best individual for the next cycle.

[0108] For tasks without time limits, the average completion time and the average number of task executions are used to evaluate the balance of task allocation. For tasks with time limits, the deadline miss rate is used for evaluation, where the deadline miss rate is the percentage of tasks that are not completed before the deadline to the total tasks.

[0109] An acute ischemic stroke reperfusion treatment flowchart display device adopts the above-mentioned acute ischemic stroke reperfusion treatment flowchart display method. It is usually interconnected with the corresponding management system, and the operator assigns tasks through the display interface. In addition, the management system can be interconnected with the existing intelligent terminal data to further improve the interaction efficiency, timely collect the corresponding data and adjust the tasks in real time.

[0110] To sum up, the principle of this embodiment is to divide different positions and roles, then set corresponding constraints to assign tasks to each executor, use a search algorithm to find the optimal treatment process, assign tasks to obtain the best task path, and visualize the task path for easy management.

[0111] The specific embodiments described herein are merely examples of the spirit of the present invention. Those skilled in the art may make various modifications or additions to the specific embodiments described or replace them in similar ways, but they will not deviate from the spirit of the present invention or exceed the scope defined by the appended claims.

[0112] Although this article uses more terms such as process node, position, and starting point, it does not exclude the possibility of using other terms. These terms are used only to more conveniently describe and explain the essence of the present invention; interpreting them as any additional restrictions is contrary to the spirit of the present invention.

Claims

1. A method for displaying a flowchart of reperfusion therapy for acute ischemic stroke, characterized in that: The steps include: S1: process node division; S2: Divide the tasks of different job roles; S3: Taking the patient’s arrival at the hospital as the starting point, set target times for different tasks; S4: Perform multiple tasks in parallel; S5: Manage tasks visually.

2. The method for displaying a flowchart of acute ischemic stroke reperfusion therapy according to claim 1, characterized in that: The step S1 comprises the following steps: S11: Flowchart template import; S12: Import the process nodes into the flowchart template; S13: Detect abnormal process nodes and make manual corrections; S14: Optimize the process and delete unnecessary nodes.

3. The method for displaying a flowchart of reperfusion therapy for acute ischemic stroke according to claim 2, characterized in that: The step S12 comprises the following steps: S121: Setting a task flow network T, where T = (A, B; a, b), first determining node A and node B, then connecting node A and node B through line a and line b, where node A represents a position, node B represents a task, line a represents work, and line b represents a task transfer direction; S122: Set the main process network D and the sub-process network C, the meanings of which are as follows: C=(A1, B1; a1, b1); D = (A2, B2; a2, b2); S123: Set up a task flow system E, where E = (A, B; a, b; F, G, H, L), where F is the starting task, G is the task transfer condition, H is the set of groups of the task flow network T, and L is a repeatable task.

4. The method for displaying a flowchart of reperfusion therapy for acute ischemic stroke according to claim 3, characterized in that: The step S2 uses a graphic method to represent the tasks of different job roles, wherein the roles, tasks and task flow network are represented by circles, rectangles and cloud diagrams respectively, work and forwarding are represented by straight lines with arrows, starting tasks and task transfer conditions are represented by hollow arrows, repeatable tasks are represented by straight lines with circles, and the set of groups is represented by numbers.

5. The method for displaying a flowchart of acute ischemic stroke reperfusion therapy according to claim 1, characterized in that: The step S3 comprises the following steps: S31: Setting a fixed time interval as a time period. Every time a time period passes, the management system collects the task requirements of the current time period, decomposes the task into multiple subtasks, and continuously distributes the subtasks to all executors. S32: Each executor receives the subtask and determines whether it matches the task requirements based on his / her own position information. If it matches, the executor feeds back the real-time status to the management system; S33: The executors exchange task information, determine the executors suitable for the subtask, update the task and feed back the task information to the management system; S34: The management system detects the updated tasks based on a topological sorting algorithm, forwards the tasks with the lowest priority in the current time period to the next time period and increases their priority.

6. The method for displaying a flowchart of reperfusion therapy for acute ischemic stroke according to claim 3, characterized in that: The step S4 comprises the following steps: S41: task reception and input; S42: Data preparation; S43: treated subject analysis; S44: Comprehensive risk assessment; S45: Treatment procedure selection; S46: Task allocation planning; S47: Task simulation exercise to determine whether the task conditions are met. If so, proceed to step S48 to re-plan the task and return to step S45; S48: Mission planning output.

7. The method for displaying a flowchart of reperfusion therapy for acute ischemic stroke according to claim 6, characterized in that: The step S45 comprises the following steps: S451: Determine the process starting point, task location, treatment conditions, and potential risks; S452: Determine the constraints and model of treatment process planning based on task constraints and the executor's own conditions; S453: Select a search algorithm and find a treatment process that satisfies the constraints; S454: Evaluate the searched treatment process; S455: Output the planned treatment process.

8. The method for displaying a flowchart of reperfusion therapy for acute ischemic stroke according to claim 7, characterized in that: The search algorithm in step S453 uses the A* algorithm, and its expression is as follows: f(n)=g(n)+h(n); Where f(n) is the overall cost estimation function of the current process n, g(n) is the distance cost function from the process starting point to the current process n, and h(n) is the heuristic evaluation cost function from the current process n to the target process.

9. The method for displaying a flowchart of reperfusion therapy for acute ischemic stroke according to claim 3, characterized in that: The step S46 comprises the following steps: S461: Determine the task allocation constraints and model them. The constraints include task balance, treatment time, treatment cost, and expected treatment effect. The task allocation objective function is as follows: in Ensure that each task is performed at most once, R ij The cost of performing the jth task for the i-th executor; S462: Determine task allocation and classification criteria, wherein the tasks include allocating a single task to each executor and allocating multiple tasks to each executor; S463: Establish a task allocation model and select a corresponding algorithm, match executors with tasks one by one, and select the best task path.

10. An acute ischemic stroke reperfusion treatment flow chart display device, characterized in that: The method for displaying a flowchart of reperfusion treatment for acute ischemic stroke as described in any one of claims 1 to 9 is adopted.

Images