Event execution state configuration method, storage medium and electronic equipment
By generating reminder time and changing the delayed task status, the problem of delayed task delay affecting subsequent task execution is solved, and the smooth execution of the task chain and efficient completion of delayed tasks are achieved.
Patent Information
- Application Number
- CN202411925741.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-12-25
- Publication Date
- 2025-04-18
- Estimated Expiration
- 2044-12-25
AI Technical Summary
In the existing event progress management application, in task execution scenarios with execution time limits, the delayed subtasks have problems that cannot be completed in time, resulting in the subsequent timely tasks being unable to be started and completed, which in turn affects the smooth execution of the entire task chain.
Through delayed execution processing, the delayed execution reminder time is generated based on the actual executable time of the delayed metatask, and the execution status of the delayed metatask is changed to the completed state in time, thereby avoiding delayed tasks affecting the execution of subsequent tasks.
It effectively avoids the impact of delayed tasks on subsequent timely tasks, ensures that the entire task chain can be executed smoothly in preset order, improves the execution efficiency of events, and improves the completion quality of delayed tasks.
Smart Images

Figure CN119847695A_ABST
Abstract
Description
Background Art
[0002] Event progress management applications can help individuals, teams, and organizations more effectively manage and track the progress of tasks or projects. Not only are they applicable to specific industries, they can also be widely used in various situations in daily life where task progress needs to be tracked and managed. Its flexibility and ease of use benefit both individuals and large organizations. Using event progress management applications can improve work efficiency, enhance team collaboration, and ensure that tasks and projects are completed smoothly on schedule.
[0003] In existing event progress management applications, the execution order of the corresponding subtasks in the task chain to be completed is usually configured according to the execution order of each process node in the corresponding scenario. And in actual use, it is necessary to start the next node task after the previous node task is completed according to the preset execution order to reflect the execution progress of the event. However, in some task execution scenarios with execution time limits, there are some delayed subtasks in the task chain to be completed that cannot be completed in time within the execution time, and timely subtasks that can be completed within the execution time. As a result, due to the existence of delayed tasks, subsequent timely tasks cannot be started and completed, and the entire task chain to be completed cannot be executed smoothly according to the preset order, reducing the completion efficiency of the event. At the same time, there is no corresponding monitoring means for the execution of delayed tasks, and the completion quality of delayed tasks cannot be guaranteed, which makes the existing event progress management application unable to effectively manage the tasks in this scenario. Summary of the invention
[0004] In view of at least one of the above technical problems, the technical solution adopted by the present invention is:
[0005] According to one aspect of the present invention, a method for configuring an event execution state is provided, the method comprising the following steps:
[0006] Obtaining a to-be-completed task chain corresponding to a target event; the to-be-completed task chain includes a plurality of to-be-completed subtasks arranged in a preset execution order;
[0007] When all meta-tasks of any to-be-completed subtask are completed, the next to-be-completed subtask adjacent to the to-be-completed subtask is configured as executable;
[0008] During the execution of the to-be-completed subtask, if the to-be-completed subtask includes at least one delayed metatask, a delayed execution process is performed on each delayed metatask to change the execution state of each delayed metatask to a completed state;
[0009] Delayed execution processing includes:
[0010] According to the actual executable time of each delayed meta-task, a delayed execution reminder time corresponding to each delayed meta-task is generated, and the execution state of the delayed meta-task is changed to a completed state;
[0011] When the time reaches the delayed execution reminder time corresponding to any delayed meta-task, the execution reminder information corresponding to the delayed meta-task is sent to the user terminal corresponding to the target event.
[0012] Further, the execution reminder information includes pre-execution preparation information;
[0013] Before changing the execution state of the delayed meta-task to the completed state, the delayed execution process further includes:
[0014] According to the execution requirement information of each delayed meta-task, the pre-execution preparation information corresponding to each delayed meta-task is obtained.
[0015] Furthermore, the method also includes:
[0016] During the execution of the to-be-completed subtask, if the to-be-completed subtask includes at least one immediate meta-task, the execution state of the immediate meta-task is changed according to the currently acquired execution state information of the immediate meta-task.
[0017] Furthermore, the triggering condition for the executable state of the first to-be-completed subtask in the to-be-completed task chain includes that the current time belongs to the execution triggering period corresponding to the target event, and the current location information belongs to the execution triggering area corresponding to the target event.
[0018] Furthermore, the execution trigger period and execution trigger area are obtained according to the following steps:
[0019] Generate an execution trigger period of the target event according to the execution time of the target event;
[0020] According to the execution location of the target event, an execution trigger area of the target event is generated.
[0021] Furthermore, the first subtask to be completed includes an instant meta-task of obtaining a target image; the target image includes a generation timestamp and generation location information of the image;
[0022] After acquiring the target image, the method further includes:
[0023] If the time corresponding to the generated timestamp is within the execution trigger period, and the generated position information belongs to the execution trigger area, the execution state of the instant meta-task of acquiring the target image is changed to a completed state.
[0024] Furthermore, after acquiring the target image, the method further includes:
[0025] If the time corresponding to the generated timestamp is not within the execution trigger period, and / or the generated location information does not belong to the execution trigger area, the execution state of the instant meta-task of acquiring the target image is changed to an unfinished state.
[0026] Furthermore, the method also includes:
[0027] When all meta-tasks in the tail of the to-be-completed subtask in the to-be-completed task chain are completed, the target event is configured as the completed execution state.
[0028] According to a second aspect of the present invention, a non-transitory computer-readable storage medium is provided, wherein the non-transitory computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the above-mentioned method for configuring an event execution state is implemented.
[0029] According to a third aspect of the present invention, there is provided an electronic device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, wherein the processor implements the above-mentioned method for configuring an event execution state when executing the computer program.
[0030] The present invention has at least the following beneficial effects:
[0031] In the present invention, when encountering a delayed meta-task, a delayed execution reminder time corresponding to the delayed meta-task is generated according to the current time and the actual executable time of the delayed meta-task through delayed execution processing, and the execution status of the delayed meta-task is changed to a completed status in time, thereby avoiding the delay meta-task being in an unfinished state and affecting the start-up and execution of subsequent timely meta-tasks, thereby making it impossible for the entire task chain to be completed to be executed smoothly in the preset order, so as to improve the execution efficiency of the target event, and at the same time, each sub-task in the scene can also be effectively managed.
[0032] At the same time, the present invention can also generate a delayed execution reminder time corresponding to the delayed meta-task according to the actual executable time of the delayed meta-task, and remind the user to execute the delayed task according to the delayed execution reminder time. Therefore, not only can all timely tasks be completed in time within the task execution time limit, but also the user is reminded to execute the delayed task in addition to the task execution time, thereby ensuring the completion degree of the timely task and improving the completion quality of the delayed task. BRIEF DESCRIPTION OF THE DRAWINGS
[0033] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.
[0034] Figure 1 The present invention provides a flowchart of a method for configuring an event execution state. DETAILED DESCRIPTION
[0035] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of the present invention.
[0036] As a possible embodiment of the present invention, Figure 1 As shown, a method for configuring an event execution state is provided, the method comprising the following steps:
[0037] S100: Obtain a to-be-completed task chain corresponding to a target event, wherein the to-be-completed task chain includes a plurality of to-be-completed subtasks arranged in a preset execution order.
[0038] In this embodiment, there is a time limit for completing the task chain to be completed corresponding to the target event, such as requiring all tasks in the task chain to be completed within one day. The solution in this embodiment is suitable for scenarios where there is a time limit for completing the target event, such as in the scenario of accompanying a patient to a medical consultation, where the patient is usually not in the same place as the patient, so the entire consultation process needs to be completed in a shorter period of time.
[0039] In this embodiment, the subtask to be completed includes at least one metatask, and the metatask can be configured according to the various work items that need to be executed in the specific usage scenario. Metatasks are divided into two types, one is an immediate metatask, that is, a task that can be completed within the required execution time, and the other is a delayed metatask, that is, a task that can be completed within the required execution time. If the subtask to be completed contains only one immediate metatask or one delayed metatask, the corresponding subtask to be completed corresponds to an immediate type subtask or a delayed type subtask. If the subtask to be completed contains both an immediate metatask and a delayed metatask, the corresponding subtask to be completed corresponds to a mixed type subtask.
[0040] Of course, in actual use, not all applications are presented in a clear hierarchy of to-be-completed subtasks and corresponding metatasks. If a to-be-completed subtask contains only one immediate metatask or one delayed metatask, then the corresponding to-be-completed subtask can be directly an immediate metatask or delayed metatask, and the user can directly perform multiple corresponding execution operations on the metatask.
[0041] When all meta-tasks in a to-be-completed subtask are completed, it means that the current to-be-completed subtask has been completed, and the execution status of the current to-be-completed subtask can be configured as completed. When any meta-task in a to-be-completed subtask is not completed, it means that the current to-be-completed subtask is not completed, and the execution status of the corresponding current to-be-completed subtask will be configured as uncompleted, that is, it is always in an executable state.
[0042] In addition, when all the to-be-completed subtasks in the to-be-completed task chain are completed, the corresponding target event is also completed, which can be specifically achieved through the following step S101.
[0043] S101: When all meta-tasks in the tail of the to-be-completed subtask in the to-be-completed task chain are completed, the target event is configured as a completed execution state.
[0044] S200: When all meta-tasks in any to-be-completed subtask are completed, the next to-be-completed subtask adjacent to the to-be-completed subtask is configured to be in an executable state.
[0045] The multiple to-be-completed subtasks in the to-be-completed task chain in this embodiment are executed in a preset execution order. Specifically, in order to realize the above-mentioned sequential execution function, in S200, the execution state of the previous to-be-completed subtask is used as a trigger condition for whether the adjacent next to-be-completed subtask is started. Whenever the execution state of the previous to-be-completed subtask is monitored to be a completed state, the adjacent next to-be-completed subtask is configured to be executable.
[0046] The triggering method for starting the execution of the to-be-completed subtask in S200 is applicable to the to-be-completed subtasks other than the first to-be-completed subtask in the to-be-completed task chain. The triggering conditions for the row status of the first to-be-completed subtask in the to-be-completed task chain are as follows:
[0047] S201: The triggering condition for the executable state of the first to-be-completed subtask in the to-be-completed task chain includes that the current time belongs to the execution triggering period corresponding to the target event, and the current location information belongs to the execution triggering area corresponding to the target event.
[0048] The execution trigger period and execution trigger area are obtained according to the following steps:
[0049] S211: Generate an execution trigger period of the target event according to the execution time of the target event.
[0050] The execution trigger period is the period before the execution time. Specifically, the period size can be set according to the actual scenario.
[0051] S221: Generate an execution trigger area of the target event according to the execution location of the target event.
[0052] The execution trigger area may be an electronic fence corresponding to the corresponding task execution location. By judging whether the current location information is located within the corresponding electronic fence, it is determined that the current location information belongs to the execution trigger area corresponding to the target event.
[0053] Usually, the first subtask to be completed is the start of the execution of the target event. For the target event with a time limit in this scenario, whether to reach the specified area within the specified time period is a more important requirement parameter. Therefore, in this embodiment, the triggering condition of the first subtask to be completed is set in the two dimensions of time and location. In this way, the execution information of the target event can be further clarified to avoid the occurrence of erroneous execution. At the same time, the dual restrictions of time and location information can further avoid the use of false information to trigger the first subtask to be completed.
[0054] S300: During the execution of the to-be-completed subtask, if the to-be-completed subtask includes at least one delayed meta-task, a delayed execution process is performed on each delayed meta-task to change the execution state of each delayed meta-task to a completed state.
[0055] Delayed execution processing includes:
[0056] S301: Generate a delayed execution reminder time corresponding to each delayed meta-task according to the actual executable time of each delayed meta-task, and change the execution state of the delayed meta-task to a completed state.
[0057] For example, if the execution limit of the target event is the entire day, and the actual executable time of the delayed meta-task is two days later, the generated delayed execution reminder time can be a time point tomorrow.
[0058] In some usage scenarios, you may only be able to obtain the queue waiting number of the corresponding task, such as the current queue waiting number of a certain test. For these situations where only queue information is available, you can obtain the background information of the calling system in the corresponding scenario, and then obtain the actual waiting time corresponding to the current queue number through big data statistical analysis, and then obtain the actual executable time of the delayed meta-task. For example, you can calculate the average interval between two numbers based on the calling intervals in recent days, and then calculate the actual waiting time corresponding to the current queue number based on the number of intervals between the current calling number and the queue waiting number.
[0059] S302: When the time reaches the delayed execution reminder time corresponding to any delayed meta-task, the execution reminder information corresponding to the delayed meta-task is sent to the user terminal corresponding to the target event.
[0060] Specifically, the execution reminder information includes pre-execution preparation information.
[0061] Before changing the execution state of the delayed meta-task to the completed state, the delayed execution process further includes:
[0062] S303: Acquire the pre-execution preparation information corresponding to each delayed meta-task according to the execution requirement information of each delayed meta-task.
[0063] Specifically, in the use scenario of accompanying a patient to a disease consultation, the delayed meta-task may usually be a task corresponding to each examination, which cannot be completed within the execution limit due to the long waiting time for the examination, or it may be due to the patient's physical condition not meeting the examination conditions and needs to be completed with a delay. In addition, there are many pre-examination precautions in some examination items, so the pre-execution preparation information in this embodiment can be the pre-examination precautions information of the corresponding examination items to remind the patient.
[0064] The configuration method of the event execution status also includes:
[0065] S400: During the execution of the to-be-completed subtask, if the to-be-completed subtask includes at least one instantaneous meta-task, the execution state of the instantaneous meta-task is changed according to the currently acquired execution state information of the instantaneous meta-task.
[0066] In this step, for the instant meta-task, it is possible to determine whether the instant meta-task is completed based on the task execution information uploaded by the current user (such as diagnosis, medication information, payment receipt, etc.), and change the corresponding execution state. Specifically, in this embodiment, the key text information in various uploaded information can be identified by OCR (Optical Character Recognition) technology, and then the regular relationship is used to determine whether it meets the requirements and whether the instant meta-task is completed.
[0067] In this embodiment, when encountering a delayed meta-task, a delayed execution reminder time corresponding to the delayed meta-task is generated through delayed execution processing according to the current time and the actual executable time of the delayed meta-task, and the execution status of the delayed meta-task is promptly changed to a completed status. This can avoid the delayed meta-task being in an unfinished state and affecting the start-up and execution of subsequent timely meta-tasks, thereby preventing the entire task chain to be completed from being executed smoothly in the preset order, thereby improving the execution efficiency of the target event, and at the same time, each sub-task in the scenario can also be effectively managed.
[0068] At the same time, in this embodiment, the delayed execution reminder time corresponding to the delayed meta-task can be generated according to the actual executable time of the delayed meta-task, and the user can be reminded to execute the delayed task according to the delayed execution reminder time. Therefore, not only can all timely tasks be completed in time within the task execution time limit, but also the user can be reminded to execute the delayed task in addition to the task execution time, thereby ensuring the completion degree of the timely task and improving the completion quality of the delayed task.
[0069] As another possible embodiment of the present invention, the first to-be-completed subtask includes an instant meta-task of acquiring a target image. The target image includes a generation timestamp and generation location information of the image.
[0070] After acquiring the target image, the method further includes:
[0071] S231: If the time corresponding to the generated timestamp is within the execution trigger period, and the generated location information belongs to the execution trigger area, the execution state of the instant meta-task of acquiring the target image is changed to a completed state.
[0072] S241: If the time corresponding to the generated timestamp is not within the execution trigger period, and / or the generated location information does not belong to the execution trigger area, the execution state of the instant meta-task of acquiring the target image is changed to an unfinished state.
[0073] The terminals (such as smart phones) that execute the existing configuration method for the execution status of the event usually have positioning functions, and usually carry timestamps and location information when taking photos. Therefore, when completing the first subtask to be completed, it is only necessary to upload the corresponding photo. This method can use timestamps and location information to determine whether it meets the corresponding requirements, which is more convenient and faster. In addition, by executing the instant meta-task of the target image in the first subtask to be completed, it is possible to verify again whether the user currently meets the exhaustive triggering conditions of the first subtask to be completed, so as to prevent the user from using false information to trigger the execution of the target event, thereby improving the correspondence of the execution information.
[0074] As another possible embodiment of the present invention, S100 includes:
[0075] S110: According to the completion information corresponding to the to-be-completed subtask, a screening vector of the next adjacent to-be-completed subtask is obtained. The screening vector includes the level type label a of the currently completed to-be-completed subtask and the operation instruction information b of the next adjacent to-be-completed subtask.
[0076] In actual usage scenarios, you can configure corresponding hierarchical type labels for the types of subtasks that may be completed in the scenario. Taking the accompanying doctor scenario as an example, the types of subtasks to be completed include clocking in at the hospital, consulting in the clinic, picking up medicine, and examination. You can configure hierarchical type labels for each type of subtask to be completed.
[0077] In this embodiment, the operation instruction information b of the next adjacent to-be-completed subtask can be the operation instruction information for the next process generated by the currently completed to-be-completed subtask in the scenario in actual use scenarios. Taking the accompanying diagnosis scenario as an example, b can be the operation instruction information for the next process extracted from the doctor's order, the diagnosis certificate, or the examination form.
[0078] S120: According to a, a level type label a having a level relevance greater than a first threshold value Y1 is selected from the task level execution relationship library as the next level type label to be selected.
[0079] The task hierarchical execution relationship library contains the hierarchical correlation between each hierarchical type tag and other hierarchical type tags. The hierarchical correlation can be obtained by statistics based on the execution order of the completed to-be-completed task chain in a preset historical period.
[0080] Specifically, the hierarchical correlation between the i-th hierarchical type label and the n-th hierarchical type label Among them, N in is the number of cases where the nth level type label is located at the next adjacent position of the ith level type label in all completed to-be-completed task chains, P sum is the number of level-i type labels in all completed to-be-completed task chains.
[0081] S130: According to b, from the hierarchical meta-task execution relationship library, a meta-task tag whose task relevance under each next-level type tag to be selected is greater than a second threshold value Y2 is screened to generate a meta-task tag to be selected.
[0082] Among them, the hierarchical meta-task execution relationship library contains the task relevance between different meta-tasks at each level and different operation instruction information under each hierarchical type label. Because, in an actual application scenario, after the completion of the to-be-completed subtasks in each task level, the instruction information formed in the next operation process node is usually limited and relatively standard. Therefore, by obtaining the complete historical operation information between each node in the corresponding scenario, the task relevance obtained in this step can be statistically obtained.
[0083] Specifically, in the cth task level, the task relevance between the dth operation instruction information and the mth meta-task is Among them, Q dmis the number of times the mth meta-task is executed after the dth operation instruction appears in the cth task level, D sum is the number of occurrences of the d-th type of operation instruction information in the c-th task level.
[0084] S140: Sort the selection windows corresponding to each next-level type label to be selected according to the level relevance from large to small.
[0085] S150: sorting all the meta-task tags to be selected in the selection window according to the task relevance from large to small, so as to provide selection for the user.
[0086] In this embodiment, the most likely types of tasks to be completed in the next process node are screened and sorted by relevance, and the most likely meta-tasks to be executed under each type of task to be completed are screened and sorted. This can provide help when the user needs to create the next subtask to be completed, so as to speed up the user's creation of the subtask to be completed and improve operation efficiency.
[0087] In addition, although the steps of the method in the present disclosure are described in a specific order in the drawings, this does not require or imply that the steps must be performed in this specific order, or that all the steps shown must be performed to achieve the desired results. Additionally or alternatively, some steps may be omitted, multiple steps may be combined into one step, and / or one step may be decomposed into multiple steps, etc.
[0088] Through the description of the above implementation, it is easy for those skilled in the art to understand that the example implementation described here can be implemented by software, or by software combined with necessary hardware. Therefore, the technical solution according to the implementation of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, including several instructions to enable a computing device (which can be a personal computer, a server, a mobile terminal, or a network device, etc.) to execute the method according to the implementation of the present disclosure.
[0089] In an exemplary embodiment of the present disclosure, an electronic device capable of implementing the above method is also provided.
[0090] It will be appreciated by those skilled in the art that various aspects of the present invention may be implemented as a system, method or program product. Therefore, various aspects of the present invention may be specifically implemented in the following forms, namely: a complete hardware implementation, a complete software implementation (including firmware, microcode, etc.), or a combination of hardware and software, which may be collectively referred to herein as a "circuit", "module" or "system".
[0091] The electronic device according to this embodiment of the present invention is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present invention.
[0092] The electronic device is presented in the form of a general-purpose computing device. The components of the electronic device may include, but are not limited to: the at least one processor mentioned above, the at least one storage device mentioned above, and a bus connecting different system components (including storage devices and processors).
[0093] The storage stores program codes, which can be executed by the processor, so that the processor executes the steps according to various exemplary embodiments of the present invention described in the above “Exemplary Method” section of this specification.
[0094] The memory may include readable media in the form of volatile memory, such as random access memory (RAM) and / or cache memory, and may further include read only memory (ROM).
[0095] The storage may also include a program / utility having a set (at least one) of program modules, such program modules including but not limited to: an operating system, one or more application programs, other program modules and program data, each of which or some combination may include the implementation of a network environment.
[0096] The bus may represent one or more of several types of bus structures including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, a processor, or a local bus using any of a variety of bus architectures.
[0097] The electronic device may also communicate with one or more external devices (e.g., keyboards, pointing devices, Bluetooth devices, etc.), may communicate with one or more devices that enable a user to interact with the electronic device, and / or may communicate with any device (e.g., routers, modems, etc.) that enables the electronic device to communicate with one or more other computing devices. Such communication may be performed through an input / output (I / O) interface. Furthermore, the electronic device may also communicate with one or more networks (e.g., local area networks (LANs), wide area networks (WANs), and / or public networks, such as the Internet) through a network adapter. The network adapter communicates with other modules of the electronic device through a bus. It should be understood that, although not shown in the figure, other hardware and / or software modules may be used in conjunction with the electronic device, including but not limited to: microcode, device drivers, redundant processors, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, etc.
[0098] Through the description of the above implementation methods, it is easy for those skilled in the art to understand that the example implementation methods described here can be implemented by software or by combining software with necessary hardware. Therefore, the technical solution according to the implementation methods of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, including several instructions to enable a computing device (which can be a personal computer, a server, a terminal device, an AI terminal, an embodied intelligent robot or a network device, etc.) to execute the method according to the implementation methods of the present disclosure.
[0099] In an exemplary embodiment of the present disclosure, a computer-readable storage medium is also provided, on which a program product capable of implementing the above method of the present specification is stored. In some possible implementations, various aspects of the present invention may also be implemented in the form of a program product, which includes a program code, and when the program product is run on a terminal device, the program code is used to enable the terminal device to execute the steps according to various exemplary embodiments of the present invention described in the above "Exemplary Method" section of the present specification.
[0100] The program product may use any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of readable storage media (a non-exhaustive list) include: an electrical connection with one or more wires, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above.
[0101] Computer readable signal media may include data signals propagated in baseband or as part of a carrier wave, in which readable program code is carried. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Readable signal media may also be any readable medium other than a readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device.
[0102] The program code embodied on the readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wired, optical cable, RF, etc., or any suitable combination of the foregoing.
[0103] Program code for performing the operations of the present invention may be written in any combination of one or more programming languages, including object-oriented programming languages such as Java, C++, etc., and conventional procedural programming languages such as "C" or similar programming languages. The program code may be executed entirely on the user computing device, partially on the user device, as a separate software package, partially on the user computing device and partially on a remote computing device, or entirely on a remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computing device (e.g., through the Internet using an Internet service provider).
[0104] In addition, the above-mentioned figures are only schematic illustrations of the processes included in the method according to an exemplary embodiment of the present invention, and are not intended to be limiting. It is easy to understand that the processes shown in the above-mentioned figures do not indicate or limit the time sequence of these processes. In addition, it is also easy to understand that these processes can be performed synchronously or asynchronously, for example, in multiple modules.
[0105] It should be noted that, although several modules or units of the device for action execution are mentioned in the above detailed description, this division is not mandatory. In fact, according to the embodiments of the present disclosure, the features and functions of two or more modules or units described above can be embodied in one module or unit. On the contrary, the features and functions of one module or unit described above can be further divided into multiple modules or units to be embodied.
[0106] The above are only specific embodiments of the present invention, but the protection scope of the present invention is not limited thereto. Any changes or substitutions that can be easily thought of by a person skilled in the art within the technical scope disclosed by the present invention should be included in the protection scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims
1. A method for configuring an event execution state, characterized in that: The method comprises the following steps: Obtaining a to-be-completed task chain corresponding to a target event; the to-be-completed task chain includes a plurality of to-be-completed subtasks arranged in a preset execution order; the target event is an event with an execution time limit; When all meta-tasks in any to-be-completed sub-task are completed, the next to-be-completed sub-task adjacent to the to-be-completed sub-task is configured as executable; the meta-task is a delayed meta-task or an immediate meta-task; During the execution of the to-be-completed subtask, if the to-be-completed subtask includes at least one delayed metatask, delayed execution processing is performed on each delayed metatask to change the execution state of each delayed metatask to a completed state.
2. The method according to claim 1, characterized in that The delayed execution process includes: Generate a delayed execution reminder time corresponding to each delayed meta-task according to the actual executable time of each delayed meta-task, and change the execution state of the delayed meta-task to a completed state; When the time reaches the delayed execution reminder time corresponding to any delayed meta-task, the execution reminder information corresponding to the delayed meta-task is sent to the user terminal corresponding to the target event.
3. The method according to claim 2, characterized in that The execution reminder information includes pre-execution preparation information; Before changing the execution state of the delayed meta-task to a completed state, the delayed execution process further includes: According to the execution requirement information of each delayed meta-task, the pre-execution preparation information corresponding to each delayed meta-task is obtained.
4. The method according to claim 1, characterized in that The method further comprises: During the execution of the to-be-completed subtask, if the to-be-completed subtask includes at least one immediate meta-task, the execution state of the immediate meta-task is changed according to the currently acquired execution state information of the immediate meta-task.
5. The method according to claim 1, characterized in that The triggering condition for the executable state of the first to-be-completed subtask in the to-be-completed task chain includes that the current time belongs to the execution triggering time period corresponding to the target event, and the current location information belongs to the execution triggering area corresponding to the target event.
6. The method according to claim 5, characterized in that The first subtask to be completed includes an instant meta-task of acquiring a target image; the target image includes a generation timestamp and generation location information of the image; After acquiring the target image, the method further includes: If the time corresponding to the generation timestamp is within the execution trigger period, and the generation location information belongs to the execution trigger area, the execution state of the instant meta-task of acquiring the target image is changed to a completed state.
7. The method according to claim 6, characterized in that After acquiring the target image, the method further includes: If the time corresponding to the generated timestamp is not within the execution trigger period, and / or the generated location information does not belong to the execution trigger area, the execution state of the instant meta-task of acquiring the target image is changed to an unfinished state.
8. The method according to claim 1, characterized in that The method further comprises: When all meta-tasks in the tail of the to-be-completed subtask in the to-be-completed task chain are completed, the target event is configured as a completed execution state.
9. A non-transitory computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the method for configuring an event execution state as described in any one of claims 1 to 8 is implemented.
10. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, the method for configuring the event execution state according to any one of claims 1 to 8 is implemented.
Citation Information
Patent Citations
Scheduling and failure recovery method for task processing flow
CN106547613A
Task scheduling method, task scheduling system, storage medium and computer equipment
CN110134499A
Delay task processing method and device
CN111367629A
Task scheduling method, device and equipment and computer readable storage medium
CN114443237A
Task scheduling processing method and device, storage medium and electronic equipment
CN117472533A