A configuration method for event execution status, storage medium and electronic device
By configuring the delayed execution processing and reminder mechanism, the problem of delayed tasks affecting the sequential execution of the task chain is solved, and the task execution efficiency and the completion quality of delayed tasks are improved.
Patent Information
- Application Number
- CN202411925741.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-12-25
- Publication Date
- 2025-09-23
- Estimated Expiration
- 2044-12-25
AI Technical Summary
Existing event progress management applications are used in task execution scenarios with execution time limits. The existence of delayed tasks causes subsequent timely tasks to be unable to start in a timely manner, reducing the efficiency of event completion and lacking effective monitoring and management of delayed tasks.
By obtaining the task chain to be completed, configuring the delayed execution processing of the delayed meta-task, generating the delayed execution reminder time, and sending the execution reminder information at the reminder time, and at the same time adjusting the execution status of the immediate meta-task according to the current time and location information, ensure that the task chain is executed in the preset order.
It improves the efficiency of task execution, ensures that timely tasks are completed within the time limit, and reminds delayed tasks outside the time limit, thereby improving the completion quality of delayed tasks.
Smart Images

Figure CN119847695B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of task status determination, and in particular to a configuration method, storage medium and electronic device for event execution status. Background Art
[0002] Event progress management apps can help individuals, teams, and organizations more effectively manage and track the progress of tasks and projects. While suitable for specific industries, they can also be widely applied in everyday situations where tracking and managing task progress is necessary. Their flexibility and ease of use benefit both individuals and large organizations. Using event progress management apps can improve work efficiency, enhance team collaboration, and ensure that tasks and projects are completed smoothly and on schedule.
[0003] In existing event progress management applications, the execution order of the corresponding subtasks in the pending task chain is usually configured according to the execution order of each process node in the corresponding scenario. 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 pending task chain that cannot be completed in time within the execution time, as well as timely subtasks that can be completed within the execution time. Therefore, due to the existence of delayed tasks, subsequent timely tasks cannot be started and completed, and the entire pending task chain cannot be executed smoothly according to the preset order, reducing the efficiency of event completion. At the same time, there is no corresponding monitoring method for the execution of delayed tasks, and the completion quality of delayed tasks cannot be guaranteed, which makes it impossible for existing event progress management applications to effectively manage tasks in this scenario. Summary of the Invention
[0004] In order to solve at least one of the above technical problems, the present invention adopts the following technical solution:
[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 multiple 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, performing delayed execution processing on each delayed metatask to change the execution state of each delayed metatask to a completed state;
[0009] Delayed execution processing includes:
[0010] 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;
[0011] When the time reaches the delayed execution reminder time corresponding to any delayed meta-task, execution reminder information corresponding to the delayed meta-task is sent to the user terminal corresponding to the target event.
[0012] Furthermore, 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 further comprises:
[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 status of the immediate meta-task is changed according to the currently acquired execution status 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 the execution trigger period of the target event according to the execution time of the target event;
[0020] Generate an execution trigger area for the target event based on the execution location of the target event.
[0021] Furthermore, the first subtask to be completed includes an immediate meta-task of obtaining a target image; the target image includes the image generation timestamp and generation location information;
[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 further comprises:
[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. The non-transitory computer-readable storage medium stores a computer program. 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, an electronic device is provided, 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 promptly changed to a completed state. 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.
[0032] At the same time, the present invention can also generate a delayed execution reminder time corresponding to the delayed meta-task based on the actual executable time of the delayed meta-task, and use the delayed execution reminder time to remind the user to execute the delayed task. As a result, not only can all timely tasks be completed within the task execution time limit, but the user is also reminded to execute the delayed task in addition to the task execution time. This can improve the completion quality of delayed tasks while ensuring the completion of timely tasks. 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 the event execution status. DETAILED DESCRIPTION
[0035] The following will clearly and completely describe the technical solutions in the embodiments of the present invention in conjunction with the accompanying drawings. 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 making any creative efforts shall fall 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 the event execution status is provided, which includes 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] This embodiment places a time limit on the completion of the pending task chain corresponding to the target event, such as requiring all tasks in the pending task chain to be completed within one day. This solution is suitable for scenarios where the target event has a time limit, such as accompanying a patient to a medical consultation, where the patient is often in a different location and the entire consultation process needs to be completed within a short 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 practice, not all applications have a clear hierarchy of pending subtasks and corresponding metatasks. If a pending subtask contains only one immediate metatask or one delayed metatask, the corresponding pending subtask can be the immediate metatask or delayed metatask, and the user can directly perform multiple corresponding operations on the metatask.
[0041] When all meta-tasks in a pending subtask are completed, the current pending subtask is completed, and the execution status of the current pending subtask can be configured as completed. If any meta-task in a pending subtask is not completed, the current pending subtask is not completed, and the execution status of the corresponding current pending subtask will be configured as uncompleted, which means it remains executable.
[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] In this embodiment, the multiple to-be-completed subtasks in the to-be-completed task chain are executed in a preset execution order. Specifically, to achieve the aforementioned sequential execution function, in S200, the execution status of the previous to-be-completed subtask is used as a trigger condition for whether the next to-be-completed subtask is started. Whenever the execution status of the previous to-be-completed subtask is monitored to be completed, the 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 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 by following the steps below:
[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 determining whether the current location information is within the corresponding electronic fence, it is determined that the current location information is within the execution trigger area corresponding to the target event.
[0053] Typically, the first subtask to be completed marks the start of the target event's execution. For target events with a time limit in this scenario, reaching the designated area within the specified time period is a more important requirement. Therefore, in this embodiment, trigger conditions for the first subtask to be completed are set in both time and location dimensions. This further clarifies the target event's execution information and avoids erroneous execution. Furthermore, the dual constraints of time and location information can further prevent 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 metatask, performing delayed execution processing on each delayed metatask to change the execution state of each delayed metatask 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 time 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 use cases, you may only be able to obtain the queue waiting number for a corresponding task, such as the current queue number for a test. For these situations where only queue information is available, you can obtain the background information of the call number system in the corresponding scenario. Then, through big data statistical analysis, you can determine the actual waiting time corresponding to the current queue number, and thus the actual executable time of the delayed meta-task. For example, you can calculate the average interval between two numbers based on the call intervals over the past few days. Then, based on the intervals between the current call number and the queue waiting number, you can calculate the actual waiting time corresponding to the current queue number.
[0059] S302: When the time reaches the delayed execution reminder time corresponding to any delayed meta-task, 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: According to the execution requirement information of each delayed meta-task, obtain the pre-execution preparation information corresponding to each delayed meta-task.
[0063] Specifically, in the use case of accompanying a patient to a medical consultation, the delayed meta-task may typically be a task corresponding to various examinations that cannot be completed within the execution time limit due to a long waiting time for the examination, or the patient's physical condition may not meet the examination requirements and need to be delayed. In addition, some examination items have many pre-examination precautions, so the pre-execution preparation information in this embodiment can be pre-examination precautions information for 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 immediate meta-task, the execution status of the immediate meta-task is changed according to the currently acquired execution status information of the immediate meta-task.
[0066] In this step, the completion of the real-time meta-task can be determined based on the task execution information uploaded by the current user (such as a diagnosis, medication collection information, payment receipt, etc.), and the corresponding execution status can be changed. Specifically, in this embodiment, OCR (Optical Character Recognition) technology can be used to identify key text information in the various uploaded information, and then a regular expression can be used to determine whether the requirements are met and whether the real-time 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 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 promptly changed to a completed state. 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 also effectively managing each sub-task in the scenario.
[0068] At the same time, this embodiment can also generate a delayed execution reminder time for the delayed meta-task based on the actual executable time of the delayed meta-task, and use the delayed execution reminder time to remind the user to execute the delayed task. This not only allows all timely tasks to be completed within the task execution time limit, but also provides the user with a delayed task execution reminder in addition to the task execution time limit. This can improve the completion quality of delayed tasks while ensuring the completion of timely tasks.
[0069] As another possible embodiment of the present invention, the first subtask to be completed includes an immediate meta-task of acquiring a target image, wherein 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] Existing terminals (such as smartphones) that execute this method for configuring the execution status of this event typically have positioning capabilities, and when taking photos, they usually carry timestamps and location information. Therefore, when completing the first uncompleted subtask, only the corresponding photo needs to be uploaded. This method can use timestamps and location information to determine whether the corresponding requirements are met, making it more convenient and faster. In addition, by executing the real-time meta-task of the target image in the first uncompleted subtask, it is possible to re-verify whether the user currently meets the exhaustive triggering conditions of the first uncompleted subtask, thereby preventing 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: Obtain a filter vector for the next adjacent subtask to be completed based on the completion information corresponding to the subtask to be completed. The filter vector includes the level type label a of the currently completed subtask to be completed and the operation instruction information b of the next adjacent subtask to be completed.
[0076] In actual use cases, you can configure corresponding hierarchical type labels for the types of subtasks that may be completed in the scenario. For example, in the accompanying patient scenario, the types of subtasks to be completed include clocking in, consulting in the clinic, picking up medication, and examinations. You can then configure hierarchical type labels for each type of subtask to be completed.
[0077] In this embodiment, the operation instruction information b for the next adjacent to-be-completed subtask can, in actual use scenarios, generate the operation instruction information for the next process in the currently completed to-be-completed subtask in the scenario. For example, in the accompanying medical consultation scenario, b can be the operation instruction information for the next process extracted from information such as a doctor's order, a diagnosis certificate, or a checklist.
[0078] S120: According to a, a hierarchical type label a having a hierarchical relevance greater than a first threshold value Y1 is filtered from the task hierarchical execution relationship library as the next hierarchical 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 statistically analyzing 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 in 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 having a task relevance greater than a second threshold value Y2 under each next-level type tag to be selected is screened to generate a meta-task tag to be selected.
[0082] The hierarchical meta-task execution relationship library contains the task relevance between different meta-tasks at each level and the different operation instructions under each hierarchical type label. In a practical application scenario, after the completion of the pending subtasks at each task level, the instruction information formed for 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 calculated.
[0083] Specifically, in the cth task level, the task relevance between the dth type of operation instruction information and the mth type of meta-task is Among them, Q dm D is the number of times the mth meta-task is executed after the dth operation instruction appears in the cth task level. 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 to-be-completed tasks in the next process node are screened and sorted by relevance, and the most likely meta-tasks to be executed under each to-be-completed task type are screened and sorted. This can help users create the next to-be-completed subtask, speeding up the creation of the subtask and improving operational efficiency.
[0087] Furthermore, although the steps of the method of the present disclosure are described in a particular order in the accompanying drawings, this does not require or imply that the steps must be performed in this particular order, or that all 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.
[0088] Through the description of the above embodiments, it is easy for those skilled in the art to understand that the example embodiments described herein can be implemented by software or by combining software with necessary hardware. Therefore, the technical solution according to the embodiments 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, and includes 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 embodiments 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] Those skilled in the art will appreciate that various aspects of the present invention may be implemented as systems, methods, or program products. Therefore, various aspects of the present invention may be implemented in the following forms: a complete hardware implementation, a complete software implementation (including firmware, microcode, etc.), or a combination of hardware and software implementations, which may be collectively referred to herein as "circuits," "modules," or "systems."
[0091] The electronic device according to this embodiment of the present invention is merely an example and should not limit the functions and scope of use of the embodiments of the present invention.
[0092] The electronic device is implemented as a general-purpose computing device. Components of the electronic device may include, but are not limited to, the aforementioned at least one processor, the aforementioned at least one storage, and a bus connecting different system components (including the storage and the processor).
[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 an 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.), one or more devices that enable a user to interact with the electronic device, and / or any device that enables the electronic device to communicate with one or more other computing devices (e.g., routers, modems, etc.). Such communication may be performed via 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) via a network adapter. The network adapter communicates with other modules of the electronic device via a bus. It should be understood that, although not shown in the figures, 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.
[0098] Through the description of the above embodiments, it is easy for those skilled in the art to understand that the example embodiments described herein can be implemented by software or by combining software with necessary hardware. Therefore, the technical solution according to the embodiments 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, and includes 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 embodiments of the present disclosure.
[0099] In exemplary embodiments of the present disclosure, a computer-readable storage medium is also provided, on which is stored a program product capable of implementing the methods described above. In some possible implementations, various aspects of the present invention may also be implemented in the form of a program product comprising program code that, when executed on a terminal device, causes the terminal device to execute the steps according to various exemplary embodiments of the present invention described in the "Exemplary Methods" section above.
[0100] The program product may employ 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 component, or any combination thereof. More specific examples (a non-exhaustive list) of readable storage media 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 thereof.
[0101] A computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, which carries readable program code. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A readable signal medium may also be any readable medium other than a readable storage medium that can transmit, propagate, or transfer 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, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
[0103] The 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++, and the like, as well as 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 stand-alone 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 cases involving a remote computing device, the remote computing device may be connected to the user computing device via 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., via the Internet using an Internet service provider).
[0104] Furthermore, the figures above are merely illustrative of the processes included in the method according to exemplary embodiments of the present invention and are not intended to be limiting. It is readily understood that the processes illustrated in the figures above do not indicate or limit the temporal order of these processes. Furthermore, it is readily understood that these processes may be executed 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 detailed description above, 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 concretized in one module or unit. Conversely, the features and functions of one module or unit described above can be further divided into multiple modules or units to be concretized.
[0106] The above are merely specific embodiments of the present invention, but the scope of protection of the present invention is not limited thereto. Any changes or substitutions that can be easily conceived by a person skilled in the art within the technical scope disclosed in the present invention should be included in the scope of protection of the present invention. Therefore, the scope of protection of the present invention should be based on the scope of protection of the claims.
Claims
1. A method for configuring event execution status, 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 a time limit for execution; When all meta-tasks of 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, performing delayed execution processing on each delayed metatask to change the execution state of each delayed metatask to a completed state; Obtaining the to-be-completed task chain corresponding to the target event includes: According to the completion information corresponding to the to-be-completed subtask, a filter vector of the next adjacent to-be-completed subtask is obtained; the filter 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; According to a, the hierarchical type label a with a hierarchical correlation greater than the first threshold Y1 is screened from the task hierarchical execution relationship library as the next hierarchical type label to be selected; the task hierarchical execution relationship library contains the hierarchical correlation between each hierarchical type label and other hierarchical type labels; among them, the hierarchical correlation between the i-th hierarchical type label and the n-th hierarchical type label is ; Among them, N in is the number of cases where the nth level type label is located in 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; According to b, the meta-task labels with task relevance greater than the second threshold value Y2 under each next-level type label to be selected are screened from the hierarchical meta-task execution relationship library to generate the meta-task labels to be selected; wherein, the hierarchical meta-task execution relationship library contains the task relevance between different operation instruction information under each level type label and different meta-tasks under each level; wherein, in the c-th task level, the task relevance between the d-th type of operation instruction information and the m-th type of meta-task is Among them, Q dm D is the number of times the mth meta-task is executed after the dth operation instruction appears in the cth task level. sum is the number of occurrences of the d-th type of operation instruction information in the c-th task level; Sort the selection windows corresponding to each next-level type label to be selected according to the hierarchical relevance from large to small; All the candidate meta-task tags in the selection window are sorted from large to small according to task relevance for the user to select.
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, 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 the 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, wherein 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 status of the immediate meta-task is changed according to the currently acquired execution status information of the immediate meta-task.
5. The method according to claim 1, wherein 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.
6. The method according to claim 5, characterized in that The first subtask to be completed includes an immediate meta-task of obtaining 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 status 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 the 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 according to 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, wherein: 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
Delay task processing method and device
CN111367629A
Task scheduling processing method and device, storage medium and electronic equipment
CN117472533A