Methods, apparatus, equipment, media and procedures for performing tasks

Abstract

A method, apparatus, device, medium, and program product for performing a task are provided. The method includes: presenting a first interface displaying multiple nodes of a task, including a first node and a second node, the first and second nodes having a first connection indicating that the execution of the second node depends on the first node; presenting a first prompt on the first node, the first prompt indicating that the first node is in a completed state; and presenting a second prompt associated with the second node, the type of the second prompt being associated with the task's execution mode, the execution mode indicating how to switch the second node to an execution state. This method improves the efficiency of task node management and task scheduling.

Description

Technical Field

[0001] The examples in this article generally relate to the field of computers, and in particular to methods, apparatuses, devices, media, and program products for performing tasks. Background Technology

[0002] With the development of computer technology, intelligent systems are increasingly being applied to various task processing scenarios such as content generation, information processing, and data analysis. In some scenarios, a task can be broken down into multiple subtasks, which are then processed collaboratively by multiple intelligent systems and multiple users. Each subtask can correspond to different task content. These subtasks may also have dependencies such as sequential or parallel relationships; for example, the execution of one subtask may depend on the completion of one or more other subtasks. Some users hope to improve task management and execution efficiency. Summary of the Invention

[0003] In a first aspect of this document, a method for performing a task is provided. The method includes: presenting a first interface displaying multiple nodes of a task, including a first node and a second node, the first node and the second node having a first connection indicating that the execution of the second node depends on the first node; presenting a first prompt on the first node, the first prompt indicating that the first node is in a completed state; and, associated with the second node, presenting a second prompt, the type of the second prompt being related to an execution mode of the task, the execution mode indicating a method for switching the second node to an execution state.

[0004] In a second aspect of this document, an apparatus for performing a task is provided. The apparatus includes: a first presentation module configured to present a first interface displaying multiple nodes of a task, the multiple nodes including a first node and a second node, the first node and the second node having a first connection indicating that the execution of the second node depends on the first node; a second presentation module configured to present a first prompt at the first node, the first prompt indicating that the first node is in a completed state; and a third presentation module configured to be associated with the second node and present a second prompt, the type of the second prompt being associated with an execution mode of the task, the execution mode indicating a method for switching the second node to an execution state.

[0005] In a third aspect of this document, an electronic device is provided. The electronic device includes at least one processor; and at least one memory coupled to the at least one processor and storing instructions for execution by the at least one processor, the instructions causing the electronic device to perform the method of the first aspect when executed by the at least one processor.

[0006] In a fourth aspect of this document, a computer-readable storage medium is provided. The computer-readable storage medium stores computer-executable instructions that can be executed by a processor to implement the method of the first aspect.

[0007] In a fifth aspect of this document, a computer program product is provided. This computer program product is tangibly stored in a computer storage medium and includes computer-executable instructions that, when executed by a device, cause the device to perform the method of the first aspect.

[0008] In this way, users can intuitively understand the execution status and execution method of task nodes, improving the efficiency of task status information acquisition and interface interaction. Furthermore, it can also obtain the task nodes to be executed based on the status of task nodes and the dependencies between nodes, and present corresponding prompts according to the task execution mode, thereby improving the efficiency of task node management and task scheduling, and reducing computational overhead during task processing.

[0009] It should be understood that the content described in this section is not intended to limit the key or important features of the examples in this article, nor is it intended to restrict the scope of the solution. Other features will become readily apparent from the following description. Attached Figure Description

[0010] The above and other features, advantages, and aspects of the various examples herein will become more apparent when taken in conjunction with the accompanying drawings and the following detailed description. In the accompanying drawings, the same or similar reference numerals denote the same or similar elements, wherein: Figure 1 A schematic diagram of the example environment is shown; Figures 2A to 2I Example interfaces for some scenarios are shown; Figure 3 Flowcharts illustrating example processes for performing tasks in several scenarios are shown; Figure 4 Block diagrams of apparatuses for performing tasks in several scenarios are shown; and Figure 5 A block diagram of an electronic device capable of implementing several example scenarios is shown. Detailed Implementation

[0011] The examples in this document will now be described in more detail with reference to the accompanying drawings. While some examples are shown in the drawings, it should be understood that solutions can be implemented in various forms and should not be construed as limited to the examples presented herein. Rather, these examples are provided to provide a more thorough and complete understanding of the solutions. It should be understood that the drawings and examples in this document are for illustrative purposes only and are not intended to limit the scope of protection of the solutions.

[0012] It should be noted that the headings of any section / subsection provided herein are not restrictive. Various examples are described throughout this document, and examples of any type may be included under any section / subsection. Furthermore, examples described in any section / subsection may be combined in any way with any other examples described in the same section / subsection and / or different sections / subsections.

[0013] In the description of the examples in this document, the term "including" and similar terms should be understood as open inclusion, i.e., "including but not limited to". The term "based on" should be understood as "at least partially based on". The term "an example" or "the example" should be understood as "at least one example". The term "some examples" should be understood as "at least some examples". Other explicit and implicit definitions may also be included below. The terms "first", "second", etc., may refer to different or the same objects. Other explicit and implicit definitions may also be included below.

[0014] The examples in this document may involve user data, data acquisition, and / or use. All of these aspects comply with relevant laws, regulations, and provisions. In the examples, all data collection, acquisition, processing, manipulation, forwarding, and use are conducted with the user's knowledge and confirmation. Accordingly, when implementing each example, the type, scope of use, and usage scenarios of any data or information that may be involved should be communicated to the user and their authorization obtained through appropriate means, in accordance with relevant laws and regulations. The specific methods of notification and / or authorization can vary depending on the actual situation and application scenario; the scope of the solution is not limited in this regard.

[0015] In this manual and the sample solutions, any processing of personal information will be conducted only under legal grounds (such as obtaining the consent of the data subject or being necessary for the performance of a contract) and will only be carried out within the scope stipulated or agreed upon. A user's refusal to process personal information beyond what is necessary for basic functions will not affect the user's use of basic functions.

[0016] As used in this article, the term "task" can refer to an overall goal accomplished by one or more processing agents. A task can be broken down into multiple subtasks with execution dependencies.

[0017] The term "first interface" as used in this article can refer to a visual interactive platform used to present task nodes, node relationships, or node status. The first interface may include a task graph view, a list view, a timeline view, a node details view, or a combination thereof.

[0018] The term "task node" as used in this article refers to a work unit that can be individually determined, scheduled, or executed. Task nodes can correspond to analysis, clarification, design, implementation, verification, or other sub-tasks.

[0019] The term "first connection" as used in this article refers to an association that expresses the execution dependency between two task nodes. A first connection can be represented as a directed connection line, which indicates the directed dependency between the two connected task nodes.

[0020] The term "execution dependency" as used in this article refers to a prerequisite constraint that a downstream task node must satisfy before entering the execution state. Execution dependencies may include one or more explicitly required predecessors.

[0021] As used in this document, the term "hint" can refer to interface information used to characterize a node's status, execution method, or operational capabilities. Hints can include text, icons, styles, entry points, controls, progress information, timeline descriptions, or combinations thereof.

[0022] The term "completion status" as used in this article refers to the state in which a node has met the predetermined termination conditions. The completion status can be confirmed by the user or triggered by machine verification results under permitted circumstances.

[0023] As used in this document, the term "execution state" can refer to a set of execution-related states in which a node has been dispatched, started, or entered. This set of states can include at least one of the following: pending, executing, awaiting supplementation, awaiting confirmation, and completed.

[0024] The term "execution mode" as used in this article can refer to the configuration used to determine the path that a node is triggered. Execution modes can include manual execution mode, suggested execution mode, and automatic execution mode.

[0025] The term "execution plan" as used in this article can refer to a set of read-only decisions computed based on the current persistent facts. The execution plan can categorize nodes as dispatchable, blocked, or skipped, and provide the corresponding reasons.

[0026] The term "first entry point" as used in this article refers to an interactive element used to switch nodes that meet the switching conditions to the execution state. The first entry point can be used to trigger task execution for a single node or to trigger task execution in batches.

[0027] As used in this article, the term "descriptive item" can refer to structured event information presented in chronological order. A descriptive item can represent at least one of the following: triggering node, executed node, triggering source, processing result, and time.

[0028] The term "stage" as used in this article can refer to a configuration tag used to organize or present task nodes. Stages do not automatically constitute the execution order, nor do they replace explicit execution dependencies.

[0029] The term "rollback node" as used in this article can refer to a new node created based on the execution result of an existing node. Rollback nodes are used to execute subtasks related to correcting the execution result, while maintaining the state of the existing completed node.

[0030] The term "failure state" as used in this article refers to a state where the planned path corresponding to a node is no longer considered a valid path. Nodes in an failure state and their historical information can still be saved.

[0031] In one context, an intelligent system is an information processing system. This intelligent system uses at least one or more models to process one or more inputs. The intelligent system may include the one or more models as components, or it may use models external to the system for processing. Those skilled in the art will recognize that there are various implementations of intelligent systems in the industry, including but not limited to agents, artificial intelligence (AI) assistants, AI workers, copilot systems, and chatbots. The inputs include data in one or more modalities. The modal data includes, but is not limited to, text, audio, images, video, application-specific data, or scientific computing data. The models include, but are not limited to, one or more combinations of the following: large-scale parametric models, deep learning models, neural network models, machine learning models, statistical models, rule-based models, or other models capable of processing the inputs. The specific implementation of the models can employ various existing or improved models. The intelligent system may involve one or more of the following operations: receiving single-round or multi-round input; recognizing and / or understanding the input; generating answers, decisions, or processing results using one or more models; invoking one or more external tools, interfaces, knowledge bases, or other systems to obtain information or perform operations; processing in a self-decision-making or human-machine collaborative manner, or transferring tasks to human or other systems for processing. Self-decision-making refers to execution without human intervention. Human-machine collaboration refers to partial human participation or confirmation. The above explanation of "intelligent system" is illustrative, and each description is an example, not necessarily necessary, and does not constitute an exhaustive list.

[0032] The term "exempt node" as used in this article can refer to a transitive dependency node that does not need to perform the actual subtask. An exempt node can be determined to satisfy the dependency condition based on its predecessor state, so that downstream nodes can continue to receive readiness checks.

[0033] As mentioned above, with the development of computer technology, intelligent systems are increasingly being applied to various task processing scenarios such as content generation, information processing, and data analysis. In some scenarios, a task can be broken down into multiple subtasks, which are then processed collaboratively by multiple intelligent systems and multiple users. Each subtask can correspond to different task content. These subtasks may also have dependencies such as sequential or parallel relationships; for example, the execution of one subtask may depend on the completion of one or more other subtasks. Some users hope to improve task management and execution efficiency.

[0034] A scheme for executing a task is proposed. The scheme includes: presenting a first interface that displays multiple nodes of the task, including a first node and a second node, the first node and the second node having a first connection, the first connection indicating that the execution of the second node depends on the first node; presenting a first prompt on the first node, the first prompt indicating that the first node is in a completed state; and presenting a second prompt associated with the second node, the type of the second prompt being associated with the execution mode of the task, the execution mode indicating how to switch the second node to an execution state.

[0035] Through the above solution, users can intuitively understand the execution status and execution method of task nodes, improving the efficiency of task status information acquisition and interface interaction. Furthermore, it can obtain the task nodes to be executed based on the status of task nodes and the dependencies between nodes, and present corresponding prompts according to the task execution mode, thereby improving the efficiency of task node management and task scheduling, and reducing computational overhead during task processing.

[0036] Figure 1 A schematic diagram of example environment 100 is shown. Example environment 100 includes electronic device 110, application 120, server 130, user 140, and interface 150. Electronic device 110 runs application 120, which supports task execution. Application 120 is used to present task nodes, connections between nodes, status prompts, execution entry points, and node details. User 140 interacts with application 120 through electronic device 110. User 140 can perform node selection, execution, filtering, confirmation, or hiding operations.

[0037] Electronic device 110 presents interface 150 by running application 120. Figures 2A to 2IInterfaces 200A to 200I can be specific implementations of interface 150 at different interaction stages. Electronic device 110 can communicate with server 130. Server 130 reads node status and explicitly executes dependencies, and returns interface update data to electronic device 110. Electronic device 110 can be any type of mobile terminal, fixed terminal, or portable terminal, including mobile phones, desktop computers, laptop computers, notebook computers, netbook computers, tablet computers, media computers, multimedia tablets, handheld computers, portable gaming terminals, virtual reality (VR) or augmented reality (AR) devices, personal communication system (PCS) devices, personal navigation devices, personal digital assistants (PDAs), audio or video players, digital cameras or camcorders, positioning devices, television receivers, radio receivers, e-book devices, gaming devices, or any combination of the foregoing, including accessories and peripherals of these devices or any combination thereof. In some cases, electronic device 110 can also support any type of user-facing interface, such as wearable circuitry.

[0038] Server 130 can be a single physical server, a server cluster or distributed system composed of multiple physical servers, or a cloud server providing basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, content delivery networks, and intelligent platforms. Server 130 may include, for example, computing systems or servers, such as mainframes, edge computing nodes, or computing devices in a cloud environment. Server 130 can provide background services for applications 120 that support task execution in electronic device 110. A communication connection can be established between server 130 and electronic device 110. The communication connection can be established via wired or wireless means. The communication connection can include, but is not limited to, Bluetooth connections, mobile network connections, Universal Serial Bus (USB) connections, Wireless Fidelity (WiFi) connections, etc. In some cases, server 130 and electronic device 110 can achieve signaling interaction through their communication connection.

[0039] In one deployment configuration, node information, dependency information, and execution plans are all processed by server 130. Electronic device 110 receives interface data returned by server 130. Alternatively, the aforementioned information and calculations can be processed independently by electronic device 110. Additionally, electronic device 110 can handle interface presentation, while server 130 performs dependency calculations and task scheduling.

[0040] It should be understood that the structure and function of the various elements in environment 100 are described for illustrative purposes only and do not imply any limitation on the scope of the solution. The examples will continue to be described below with reference to the accompanying drawings. The examples described herein can be implemented at electronic device 110. It should be noted that the operations described with respect to electronic device 110 may be performed by a related application 120 running on electronic device 110. The interface described with respect to electronic device 110 may be provided by application 120; for example, electronic device 110 presents a corresponding interface by running application 120. Furthermore, some operations described with respect to electronic device 110 may require the assistance of server 130 to complete.

[0041] Figures 2A to 2I Example interfaces 200A to 200I are shown for performing tasks according to certain scenarios. Interfaces 200A to 200I can, for example, be provided by... Figure 1 The electronic device 110 shown is provided.

[0042] Figure 2A A schematic diagram of the interface 200A for performing tasks according to certain scenarios is shown. See below for reference. Figure 2A This describes the presentation process of task nodes, node connections, and stage areas. For ease of understanding, a feature development task will be used as a case study. This task can sequentially involve multiple stages such as requirements analysis, problem clarification, solution design, feature implementation, and result verification, and allows multiple independent subtasks to be executed in parallel.

[0043] As an example, such as Figure 2A As shown, node 202-1 corresponds to the requirements analysis subtask, and node 202-2 corresponds to the problem clarification subtask performed based on the analysis results. Node 202-6 corresponds to the solution design subtask that generates results to be corrected, and node 202-7 corresponds to the subsequent appended local correction subtask. This task type is only used to illustrate the interaction and processing relationship between nodes; in actual applications, it can be replaced with other tasks with explicit execution dependencies.

[0044] like Figure 2AAs shown, the electronic device 110 presents a first interface 200A. The first interface 200A displays multiple nodes 202-1 to 202-15 of the task. In some examples, each task node 202-1 to 202-15 may also present corresponding task content information 204-1 to 204-15. The task content information 204-1 to 204-15 is associated with its corresponding task node and is used to indicate the name, content summary, and / or task type of the subtask represented by the corresponding task node. For example, task content information 204-1 may indicate the requirements analysis subtask corresponding to node 202-1, and task content information 204-2 may indicate the problem clarification subtask corresponding to node 202-2. The electronic device 110 can present task content information 204-1 to 204-15 in the corresponding task nodes according to the node configuration information returned by the server 130, so that the user can identify the task content corresponding to different task nodes.

[0045] In some examples, task nodes can also present auxiliary information associated with that task node. For example, identifier 214-1 indicates that node 202-13 is in a pending planning state, which could indicate, for example, that the task corresponding to node 202-13 has not yet been planned or executed. Identifier 216-1 indicates that node 202-6 has a fallback attribute, which could indicate, for example, that a fallback node can be created to correct the execution result of node 202-6. Identifier 218-1 indicates that node 202-11 is an exempt node, which could indicate, for example, that node 202-11 does not need to execute the actual subtask and can pass the dependency fulfillment result after its required predecessors satisfy the dependency conditions. The above identifiers are used to present the state or attribute of the corresponding task nodes without changing the execution dependencies between task nodes.

[0046] In some examples, the first interface 200A may also present a view adjustment entry 230. The electronic device 110 may, in response to a user's triggering operation on the view adjustment entry 230, perform at least one of the following operations on the task graph in the first interface 200A: scaling, centering, adapting to the display area, or restoring a preset view. For example, the electronic device 110 may adjust the display scale and position of the task graph based on the boundaries of the task graph formed by multiple task nodes and their connections, so that more task nodes and their corresponding connections are presented within the visible area of ​​the first interface 200A. Triggering the view adjustment entry 230 may, for example, only change the display method of the task graph without changing the task nodes, node states, connections between nodes, or execution plans.

[0047] As an example, multiple nodes include a first node and a second node. Taking nodes 202-1 and 202-2 as examples, nodes 202-1 and 202-2 have a first connection. The first connection points from node 202-1 to node 202-2 and indicates that the execution of node 202-2 depends on node 202-1.

[0048] The first connection can be represented as a solid arrow, a dashed arrow, or a curve. Dependencies in the node details can also express the same execution dependencies. Other directed connections in the diagram not individually labeled have the same meaning. The first interface 200A displays the first prompt 208-1 at node 202-1. The first prompt 208-1 indicates that node 202-1 is in a completed state. The verification status prompt 210-1 further indicates that the execution result of this node has been verified by the machine.

[0049] Electronic device 110 is also associated with displaying a second prompt on node 202-2. The type of the second prompt is associated with the task's execution mode. The execution mode indicates how node 202-2 is switched to the execution state. In manual execution mode, the second prompt can be a triggerable execution entry point. In suggested execution mode, the second prompt can be a combination of a highlighted indicator and an execution entry point. In automatic execution mode, the second prompt can be a status indicator that the node has entered the execution state.

[0050] In this way, users can identify the completion status of nodes and downstream execution methods within the same task graph, reducing the need to repeatedly view multiple detail pages. Since the prompt data comes from the same node facts and execution plan, application 120 can reuse a single status read result to update the interface. This reduces repeated status queries and interface redraws. The first interface 200A includes at least a first group of nodes and a second group of nodes. Electronic device 110 presents the first group of nodes in the first area and the second group of nodes in the second area. The two node groups correspond to different stages of the task.

[0051] Taking phase areas 220-1 to 220-4 as an example, these phase areas correspond to the analysis phase, requirements clarification phase, design phase, and implementation phase, respectively. Electronic device 110 displays the corresponding phase identifier in each area and presents node creation entries 222-1 to 222-4. Phases can be configured by the user according to task type, or a shared skeleton can be provided by a template. Nodes can have type and phase labels when created, but nodes within the same phase do not need to be executed by the same intelligent system. Phases are only used for organization and layout. Phase order, creation order, list order, title, iteration number, or historical parent node relationship cannot individually make a node dispatchable.

[0052] As an example, the number of stages can be freely configured by the user according to task needs. The number of task nodes, node types, upstream and downstream relationships between nodes, and the number of branches in each stage can also be freely configured. Users can configure nodes of the same or different task types in the same stage, or they can configure nodes of the same or different task types in different stages.

[0053] In some examples, users can configure nodes using blueprints. As an example, a template can store one or more blueprints and generate corresponding stages, task nodes, and explicit execution dependencies upon instantiation, based on user selections. Blueprints can be used to describe multiple stages, multiple task nodes, and explicit execution dependencies between task nodes; the number of stages, nodes, and dependencies in a blueprint can all be customized by the user.

[0054] For example, a node can have a single downstream node or multiple parallel downstream nodes. Multiple upstream nodes can also connect to the same downstream node. Different blueprints can correspond to task structures such as serial, parallel, convergent, forking, partial rollback, or any combination thereof.

[0055] In some examples, node 202-1 corresponds to a first subtask executed by a first intelligent system. Node 202-2 corresponds to a second subtask executed by a second intelligent system. Intelligent system identifiers 206-1 and 206-2 are used to represent the corresponding execution relationship. The first and second intelligent systems can be different computing systems or different execution instances of the same computing system. Each node can independently store the executor identifier and the active execution instance identifier. The second execution result of node 202-6 can indicate that the second part needs to be corrected. Based on this second execution result, server 130 creates a third node 202-7 in design phase region 220-3. The third node 202-7 is connected to node 202-6 and is used to execute the subtask associated with correcting the second execution result.

[0056] As a specific example corresponding to the aforementioned node grouping, the first interface 200A may include a design phase area 220-3 as a first region and an implementation phase area 220-4 as a second region. As an example, the first group of nodes may include node 202-4 presented in the design phase area 220-3, and the first node may correspond to node 202-4, so that the first node belongs to the first group of nodes.

[0057] Additionally, the second group of nodes may include node 202-6 presented in implementation phase area 220-4, and the second node may correspond to node 202-6 such that the second node belongs to the second group of nodes. The second execution result of node 202-6 may indicate that at least part of the subtask executed by that node needs to be corrected.

[0058] As an example, server 130 can create node 202-7 as a third node in design phase region 220-3, which is the first region, based on the second execution result of node 202-6. Node 202-7 can be connected to node 202-6 as the second node, and node 202-7 can be used to execute subtasks associated with correcting the second execution result of node 202-6.

[0059] Alternatively or additionally, node 202-4, as the first node, can remain in a completed state, and the execution of node 202-7, as the third node, can remain in a completed state without affecting the completed state of node 202-4. Node 202-7 can express a partial rollback by adding new nodes and new connections, without causing node 202-4 or other completed nodes to roll back to their previous states.

[0060] The execution of the third node 202-7 does not affect the completion status of node 202-4. Node 202-4 continues to display completion and verification prompts, and other branches that have already been correctly executed based on node 202-4 do not need to be re-executed. Rollback nodes are created append-only, and existing nodes do not roll back from the completion status. New correction results can continue to propagate forward through nodes 202-9 and 202-10. In this way, electronic device 110 can more intuitively display the overall architecture of the nodes to the user.

[0061] Figure 2A Exemption node 202-11 is also shown. Exemption nodes do not execute actual subtasks and pass dependency satisfaction results after their required predecessors are satisfied. Using exemption nodes maintains a consistent dependency graph shape. The task scheduler does not need to set specific detour rules for cross-stage transitions, nor does it need to create execution instances for exemption nodes. Templates can provide the stage skeleton, node types, and valid shapes for explicit dependencies. Instantiation can first generate a non-stored preview, and then atomically create the process container, nodes, and connections after confirmation.

[0062] Templates only assist in creating explicit facts. The template phase sequence does not participate in runtime readiness determination, and template semantics are not written into the execution-side task payload. Figure 2A This established the basis for the node facts, connection facts, and interface that would be shared by subsequent interactions. Figure 2B and Figure 2C This will change the viewing scope of a node based on the same set of facts. Figures 2D to 2FThis section further explains the presentation of process-level execution and the reasons for execution. Figures 2G to 2I The state changes along node 202-12 indicate that a single node triggers task execution, result verification, and completion confirmation, thus forming a continuous link between interface-level interaction and background execution processing.

[0063] Figure 2B Interface 200B is shown, which presents only valid nodes depending on certain conditions. Interface 200B inherits... Figure 2A The complete history interface 200A is displayed. Electronic device 110 receives a fourth operation, which includes triggering a valid entry 226. In response to the fourth operation, electronic device 110 stops displaying the third node in an invalid state on the first interface. Taking nodes 202-13 to 202-15 as an example, electronic device 110 hides these nodes and their associated connections in interface 200B. Node information continues to be stored in server 130 and can be restored after re-triggered complete history entry 224. As an example, a user can configure the configuration information of some nodes to configure these nodes as invalid nodes.

[0064] Alternatively or additionally, users can trigger a hide operation to configure some nodes as inactive. To ensure node traceability, the hide operation can be used to mark the corresponding task node as inactive, rather than to delete the task node. After receiving a hide operation, the electronic device 110 can update the task node list, task graph, and executable information so that the hidden task node is no longer an operable node in the current view, but rather an inactive node. It should be understood that the task-related information corresponding to the inactive node is still retained in the project and is not deleted.

[0065] Figure 2C Interface 200C is shown under a dependency chain pattern based on certain scenarios. Interface 200C can be accessed from... Figure 2A or Figure 2B The switch is complete. In response to the user selecting to roll back node 202-7 and triggering dependency chain entry 228, electronic device 110 sends a dependency chain request, including the node identifier, to server 130. Server 130 performs upstream and downstream traversal based on the connection information. Server 130 returns the nodes and connections associated with node 202-7. Electronic device 110 highlights node 202-7, upstream node 202-6, downstream node 202-8, and their corresponding connections, while downplaying other nodes. As an example, dependency chain viewing only changes the interface style and display area. This process does not modify node states, connection facts, or execution plans.

[0066] In this way, users can filter the nodes presented in the current view through different modes, which can improve the readability of the interface and reduce the display complexity of interface elements, thereby reducing the resource consumption of displaying interface elements.

[0067] Figure 2D The interface 200D demonstrates task set attributes and batch task execution based on certain conditions. Interface 200D inherits... Figure 2A The task graph in the image, and the attribute panel 234 is displayed after attribute entry 232 is triggered. Figure 2B and Figure 2C The focus is on changing the viewing range. Figure 2D This section explains how users consume readiness information from the task graph and trigger actual execution. The attribute panel 234 displays the task set status, priority, due date, members, progress, and executable information. The task set status can be derived in real-time from the facts of member nodes and is not used as the basis for the task scheduler's execution.

[0068] When the task is executed in the first execution mode, electronic device 110 is associated with the second node and presents the first entry point. The first execution mode can be a manual execution mode. Figure 2D The one-click execution entry 236 is one implementation of the first entry. The electronic device 110 also presents a first number 235. The first number 235 is the number of nodes among multiple nodes that currently support being switched to the execution state at least once.

[0069] Electronic device 110 receives a first operation, which includes triggering a one-click execution entry 236. The first operation is used to switch at least one node corresponding to a first number 235 to the execution state. For example, in another interface update, nodes 202-3, 202-8, and 202-12 can be simultaneously determined as executable, and the first number 235 is updated accordingly. After the user triggers the one-click execution entry 236, electronic device 110 can carry the identifiers of the three nodes in the same request. If node 202-8 has already been started by another processing path before the request arrives, server 130 can recalculate and dispatch nodes 202-3 and 202-12, and mark node 202-12 as skipped. Electronic device 110 updates the prompts for the three nodes based on the node-by-node results, without requiring the user to re-initiate the entire batch.

[0070] After a node is started by the task scheduler, electronic device 110 displays a third prompt at that node. This third prompt indicates that the node is in an execution state and can be displayed as a pending status prompt 208-2 or a waiting-for-confirmation status prompt 208-3. In suggested execution mode, electronic device 110 highlights currently dispatchable nodes and retains the execution entry point. Server 130 does not create an execution instance due to the highlighting process. In automatic execution mode, server 130 can actively invoke a unified execution action. The interface may not display the one-click execution entry point 236, but instead directly display a status prompt indicating that the node has entered the execution state. As an example, server 130 can generate an execution plan. The execution plan provides a node identifier, decision, a list of unmet predecessor identifiers, and reasons for each node. As an example, for each member node, server 130 can first check whether the node is executable, whether it is marked as exempt or no-operation, whether it has been assigned an intelligent system, whether the current state allows the creation of an execution instance, and whether an active execution instance exists. If any of the aforementioned checks are not met, server 130 can classify the node as undispatchable. Other nodes are classified as dispatchable, so after the user triggers the one-click execution entry 236, the server 130 can execute the task corresponding to the dispatchable node.

[0071] As an example, the unified execution action does not directly modify node state, bypass dependency gates, or automatically create downstream nodes. The unified execution action returns node-by-node results for dispatched, skipped, and failed requests. A single request can be subject to a single-process dispatch limit; nodes exceeding the limit are carried over to subsequent requests.

[0072] Figure 2E A task node list interface 200E is shown, based on certain scenarios. In response to an operation on the R&D Task tab 238-1, the electronic device 110 switches a portion of the task graph to a list view. Each row in the list corresponds to a task node. Status information 240-1, 242-1, and 243-1 present the node status, and priority information 240-2, 242-2, and 243-2 present the node priority. Membership information 240-3, 242-3, and 243-3 present the processing entity corresponding to the node. Executable information 240-4, 242-4, and 243-4 present whether the node currently meets the switching conditions.

[0073] Alternatively or additionally, the first interface 200E may also display a member tab 238-2, a product tab 238-3, and a comment tab 238-5. In response to a trigger operation on the member tab 238-2, the electronic device 110 may display information about the members or processing entities associated with the current task. In response to a trigger operation on the product tab 238-3, the electronic device 110 may display product information generated during the execution of one or more task nodes of the current task. Alternatively or additionally, in response to a trigger operation on the comment tab 238-5, the electronic device 110 may display comments, discussions, or interactive information associated with the current task or task nodes.

[0074] In some examples, users can switch between the corresponding information views by triggering the R&D Task tab 238-1, Member tab 238-2, Product tab 238-3, Timeline tab 238-4, or Comments tab 238-5. The information presented on different tabs can be associated with the same task identifier or node identifier, thus avoiding changes to the state of task nodes, explicit execution of dependencies, or execution plans when switching tabs.

[0075] Single-node triggered task execution entry points 240-6, 242-6, and 243-6 are other implementations of the first entry point. Each entry point is interactive only when the executable information of the corresponding node is positive. When a user triggers a single-node triggered task execution entry point, the electronic device 110 sends the corresponding node identifier to the unified execution action. Single-node entry points and... Figure 2D The one-click execution entry point 236 reuses the same server-side access control and task scheduler. The list view and task graph view read the same nodes, dependencies, and execution instance facts. Switching between the two views does not change the node execution strategy, nor does it create new execution facts.

[0076] Alternate or additional land, Figure 2E Hidden entry 240-7 can correspond to the task node represented by task node information 240-1. Hidden entry 242-7 can correspond to the task node represented by task node information 242-1. Hidden entry 243-7 can correspond to the task node represented by task node information 243-1. As an example, triggering an operation on hidden entry 240-7, hidden entry 242-7, or hidden entry 243-7 can be considered a hiding operation. Therefore, electronic device 110 can configure the corresponding task node as a disabled node in response to the hiding operation.

[0077] Figure 2F A task execution timeline interface 200F is shown, based on various scenarios. In response to operations on the timeline tabs 238-4, the electronic device 110 presents multiple descriptive items in chronological order. Figure 2D and Figure 2EProvide the execution capabilities that can be triggered. Figure 2F Based on this, further causal information and its background implementation after execution are provided. When the task adopts the second execution mode, the electronic device 110 presents a second prompt at the second node. The second prompt indicates that the second node is in the execution state and can be presented simultaneously with timeline description item 244-1.

[0078] The second node is switched to the execution state based on the fact that at least one dependent node is in the completed state. This at least one dependent node includes the first node, and the execution of the second node depends on these nodes. Server 130 obtains the status information of multiple nodes. Based on the status information, server 130 determines whether at least one dependent node of the second node is in the execution state. In response to these dependent nodes being in this state, server 130 controls the task scheduler to execute the second node.

[0079] Taking the completion state as a specific example, server 130 checks whether all necessary predecessors of the second node are completed. Exempt nodes can also be considered to be in an executing state according to configuration. Electronic device 110 presents at least one descriptive item based on time sequence. The first descriptive item 244-1 represents the second node switching from the completion state of the first node to the executing state. For example, upon completion of node 202-1, a state change event including the node identifier and the node 202-1 identifier can be generated. Afterwards, server 130 rereads the explicit dependencies of node 202-2, confirming that all its necessary predecessors are completed and there are no active executing instances, and then creates an executing instance of node 202-2 through a unified execution action. The structured event generated by this process can simultaneously represent node 202-1, node 202-2, the trigger source, and the dispatch result; the first descriptive item 244-1 is thus presented as node 202-2 being automatically executed due to completion by node 202-1.

[0080] The first description item 244-1 may include the trigger source, the predecessor node, the node being executed, and the time. The other description item 244-2 may describe manual execution, node execution, or state change. As an example, automatic execution only processes nodes that already exist and are currently ready.

[0081] Figure 2G The interface 200G shows node details when a node is in a pending planning state under certain circumstances. Interface 200G can be configured by the user... Figures 2A to 2E This is obtained by selecting node 202-12 in any view. The aforementioned interface is used to determine which nodes can be executed from the overall process perspective. Figures 2G to 2IThe process continues along node 202-12, illustrating how a specific execution enters the node and completes the confirmation. Electronic device 110 displays status information 250-1, priority information 252, type information 254, and dependencies 256 in the node details panel 246. Dependency 256 indicates that the execution of node 202-12 depends on node 202-3.

[0082] In manual execution mode, electronic device 110 presents a single-node triggered task execution entry point 248. This entry point 248 can serve as the primary entry point and is interactive when node 202-12 meets the switching conditions. After the user triggers the single-node triggered task execution entry point 248, electronic device 110 sends the identifier of node 202-12 to server 130. Server 130 recalculates the execution plan and invokes the task scheduler through a unified execution action. After node 202-12 is started by the task scheduler, electronic device 110 switches the status indicator 250-1 from the pending planning state to an indication that the node has entered the execution state. See the detailed results interface below. Figure 2H .

[0083] In automatic execution mode, the completion event of the predecessor node can directly trigger the aforementioned server-side processing. Electronic device 110 may not display the single-node triggered task execution entry 248, but will instead display an execution status prompt after receiving a node status update. In recommended execution mode, the single-node triggered task execution entry 248 remains visible and is highlighted. Server 130 does not create an execution instance before the user-triggered entry. In this way, the node owner can execute their own tasks within the node, and the process owner can use... Figure 2D The system allows for batch entry points, and the backend can also trigger the same action based on the second execution mode. All three paths share the server-side recalculation and scheduling interface, thus reducing redundant access control logic and state discrepancies.

[0084] Once a node enters the execution state, the intelligent system can request additional information from the user through the interaction channel associated with the inquiry assistant entry 274. Both requests and responses can be associated with the node identifier and the execution instance identifier. The open chat entry 272 is used to display dialogue content related to the node. The share entry 276 is used to output a node reference, and the hide entry 278 is used to request hiding or invalidation processing.

[0085] Figure 2H This displays interface 200H showing node details in a pending confirmation state after execution, depending on certain circumstances. Interface 200H follows... Figure 2GThe status changes. Electronic device 110 displays status indicator 250-2 at node 202-12. Status indicator 250-2 indicates that the node has left the planning state and entered the execution state, which includes execution and result confirmation. Verification area 258 displays first-type verification information 260, cross-verification information 262, verification progress information 264-1, and status information 268 and 270. First-type verification can check output format, required fields, constraints, or test results.

[0086] Cross-verification can be performed by another intelligent system reading the node's execution results and generating a verification conclusion. If cross-verification is not applicable to the current node, status information 268 and 270 can indicate that no operation is required. Server 130 marks each verification item as passed, failed, no operation required, or pending processing. Server 130 can require all required verification items to pass, or it can determine whether the execution result meets the conditions according to a predetermined combination rule. Electronic device 110 receives a second operation, which includes a trigger operation on the first node. In response to the second operation, electronic device 110 presents a second entry 266-1, which is used to mark the first node as completed.

[0087] When the first execution result of the first node meets the conditions, the electronic device 110 presents the second entry 266-1 on the first interface. The verification progress information 264-1 and the prompt indicating that the current round of checks has passed can indicate that the presentation conditions have been met. If the required verification item fails, the electronic device 110 does not present the available second entry 266-1. The user can supplement information through the interactive channel, or have the intelligent system continue processing in the same execution instance.

[0088] Figure 2I The diagram shows the node details interface 200I after a node is completed, depending on certain scenarios. Interface 200I allows the user to... Figure 2H The second entry point 266-1 is triggered. Electronic device 110 sends a completion confirmation request to server 130. Server 130 re-checks the execution instance status, required verification items, and confirmation conditions, and marks the node as complete through the existing node state transition logic. After receiving the status update, electronic device 110 displays a completion status prompt 250-3, complete verification progress information 264, and verification passed prompt 266-2. The second entry point 266-1 is replaced with a result prompt that cannot be triggered.

[0089] Automatic execution only puts a node into the execution state; it does not automatically mark the node as complete. A node can remain in a pending confirmation state until the user provides completion confirmation. Alternatively, low-risk nodes can be configured with an auto-complete switch. When the auto-complete switch is active, server 130 only performs the completion transition if all machine verifications are successful and there are no pending manual queries. If either condition is not met, the node continues to remain in a pending confirmation or waiting-for-supplement state.

[0090] After the first node enters the completed state, server 130 publishes a node state change event. Afterwards, server 130 re-examines downstream nodes that depend on the first node and updates the execution entry point, suggested prompts, or execution status prompts according to the execution mode. This state change can... Figure 2D The first number 235 in the middle increases, making Figure 2E Update executable information in the middle, or make Figure 2F A new automatic execution description is generated. Therefore, Figures 2G to 2I Intra-node interaction and Figures 2D to 2F The process-level execution forms a closed loop. The control plane does not directly write the running status of R&D task nodes or execution instances. Retrieval, initiation, pending confirmation, and completion are all executed by existing execution logic, and the process container only recalculates the visible state and execution plan.

[0091] In this way, automated execution can shorten the waiting time from readiness to startup for downstream nodes, while humans still maintain control through verification and completion confirmation. The completion event submits only a single coordination request, and the unified execution action merges and processes multiple candidate nodes on the server side, thus reducing synchronous computation and communication blocking in event callbacks. (The aforementioned...) Figures 2A to 2I The node execution is explained from three aspects: interface changes, triggering operations, and status feedback. To summarize the same technical process from a workflow perspective, Figure 3 A flowchart of an example process 300 for performing a task is shown, depending on several scenarios. Process 300 can be implemented at electronic device 110, or it can be implemented collaboratively by electronic device 110 and server 130. See below for reference. Figure 1 To describe process 300.

[0092] like Figure 3 As shown, in box 310, electronic device 110 presents a first interface. The first interface displays multiple nodes of the task, including a first node and a second node. The first node and the second node have a first connection, indicating that the execution of the second node depends on the first node. For specific interactive presentation, please refer to the above. Figure 2A The example described. In box 320, electronic device 110 presents a first prompt at the first node. The first prompt indicates that the first node is in a completed state. For specific interactive presentation, please refer to the above. Figure 2A and Figure 2I The example described.

[0093] In box 330, electronic device 110 displays a second prompt associated with the second node. The type of the second prompt is associated with the task's execution mode, which indicates how to switch the second node to the execution state. For specific interaction details, please refer to the above. Figure 2D , Figure 2F and Figure 2H The example described above allows users to identify dependencies, completion status, and execution methods within a single interface, reducing cross-view checks. Since the second hint is generated jointly by the execution plan and node status, application 120 can reuse status data for presentation. This reduces redundant queries and scheduling calls that do not meet dependency conditions.

[0094] In some cases, the task execution mode is the first execution mode. Electronic device 110 can present a first entry point for switching the second node to the execution state. For specific interaction details, please refer to the above. Figure 2D , Figure 2E and Figure 2G The example described.

[0095] In some cases, electronic device 110 can receive a first operation including a trigger operation on the first entry point, and present a third prompt indicating the execution status at the second node. For specific interactive presentation details, please refer to the above. Figures 2G to 2H The example described.

[0096] In some scenarios, the electronic device 110 may present a first number. The first number is the number of nodes among a plurality of nodes that support being switched to an execution state, and the first operation is used to execute the at least one node. For specific interactive presentation, please refer to the above. Figure 2D The example described.

[0097] In this way, some examples in this paper can form an interactive process that connects task dependency display, node status identification, batch triggering execution, and execution feedback, enabling users to efficiently trigger currently ready task nodes. Server 130 can uniformly verify and dispatch corresponding nodes based on the same execution plan, thereby reducing duplicate queries, communication interactions, and ineffective scheduling.

[0098] In some cases, the task execution mode is the second execution mode. The electronic device 110 can display a second prompt at the second node indicating that the node is in an execution state. For specific interactive presentation details, please refer to the above. Figure 2F and Figure 2H The example described.

[0099] In some cases, a second node can be switched to the execution state based on the fact that at least one of its dependent nodes is in the completed state. This at least one dependent node includes the first node. See above for specific implementation details. Figure 2F The example described.

[0100] In some scenarios, the second node switches execution states based on the following process: obtaining status information from multiple nodes; determining, based on the status information, whether at least one node is in the execution state; and, in response to at least one node being in the execution state, controlling the execution of the second node. For specific implementation details, please refer to the above text. Figure 2D and Figure 2F The example described.

[0101] In this way, some examples in this paper can automatically trigger ready nodes based on the completion status of dependent nodes while displaying task dependencies and node status, allowing users to directly know the actual execution status of the task. Server 130 can implement a unified readiness determination based on the latest execution facts, thereby reducing premature execution, erroneous dispatch, and duplicate execution.

[0102] In some scenarios, electronic device 110 may present at least one descriptive item based on time sequence. The first descriptive item represents the transition of the second node from the completed state to the executed state of the first node. For specific interactive presentation details, please refer to the above. Figure 2F The example described.

[0103] In this way, some examples in this article can associate the automatic execution status of nodes with the corresponding triggering reasons, allowing users to intuitively understand the execution results of tasks and their triggering basis. The timeline can reuse the structured information generated during the execution process, thereby improving the traceability of the execution process and reducing duplicate queries.

[0104] In some cases, the electronic device 110 can receive a second operation including a trigger operation on the first node, and present a second entry for marking the first node as complete. For specific interaction details, please refer to the above. Figure 2G and Figure 2H The example described.

[0105] In some cases, electronic device 110 may present a second entry point in response to the first execution result of the first node satisfying a condition. For specific interactive presentation details, please refer to the above. Figure 2H The example described.

[0106] In this way, some examples in this paper can combine execution result verification with user completion confirmation, allowing users to mark a node as complete only when the execution result meets the conditions. Server 130 can implement completion gates before state transitions, thereby reducing erroneous completion states, invalid downstream executions, and rollback processes.

[0107] In some cases, multiple nodes may include a first group of nodes and a second group of nodes. The electronic device 110 may present the first group of nodes in a first area and the second group of nodes in a second area, with the two node groups corresponding to different stages of the task. For specific interactive presentation details, please refer to the above. Figure 2A The example described.

[0108] In some scenarios, the first node belongs to the first group of nodes, and the second node belongs to the second group of nodes. Server 130 can create a third node connected to the second node in the first region based on the second execution result of the second node. The third node is used to execute subtasks associated with correcting the second execution result. For specific interaction details, please refer to the above. Figure 2A and Figure 2C The example described.

[0109] In some cases, the execution of the third node may not affect the completion status of the first node. See the above for specific implementation details. Figure 2A and Figure 2C The example described.

[0110] In this way, some examples in this paper can limit rollback processing to the local task path that needs correction, allowing users to check the rollback relationship while confirming that other completed nodes are still valid. Server 130 can perform correction tasks without rolling back the completion state of the first node, thereby reducing cascading state updates and duplicate execution of irrelevant tasks.

[0111] In some cases, the first set of nodes can correspond to the first stage, and the second set of nodes can correspond to the second stage. Electronic device 110 can display the first identifier corresponding to the first stage in the first area and the second identifier corresponding to the second stage in the second area. For specific interactive presentation details, please refer to the above. Figure 2A The example described.

[0112] In this way, some examples in this paper can demonstrate cross-stage local rollback relationships while organizing task nodes by stage, allowing users to quickly locate relevant nodes and understand the correction path. Server 130 can complete local corrections by appending nodes and connections, thereby preserving existing task states and correct branches, and reducing large-scale state rollbacks and repeated executions.

[0113] In some cases, electronic device 110 can present a third node in a disabled state in the first style. For specific interactive presentation details, please refer to the above. Figure 2A The example described.

[0114] In some cases, electronic device 110 can receive a fourth operation and, in response to the fourth operation, stop displaying a third node on the first interface. For specific interaction details, please refer to the above. Figure 2BThe example described.

[0115] In this way, some examples in this article can support displaying only currently valid paths while retaining historical failed paths, allowing users to balance process traceability and task graph readability. Application 120 can filter the nodes and connections to be presented without hiding historical data, thereby reducing the consumption of interface layout, connection drawing, and display resources.

[0116] In some scenarios, the first node may correspond to the first sub-task executed by the first intelligent system, and the second node may correspond to the second sub-task executed by the second intelligent system. For specific interaction details, please refer to the above text. Figure 2A and Figure 2E The example described.

[0117] In this way, some examples in this paper can uniformly demonstrate the task nodes, execution dependencies, node states, and execution methods handled by different intelligent systems, allowing users to intuitively grasp the collaborative execution process between multiple intelligent systems. Each intelligent system can process corresponding subtasks according to explicit execution dependencies, thereby reducing manual coordination, serial waiting, invalid execution, and unnecessary context transfer.

[0118] In this way, different subtasks can be processed in parallel by different intelligent systems, reducing serial waiting. Node-level execution instances isolate their respective contexts, thus reducing the amount of data transferred to unrelated execution instances.

[0119] Apparatus for implementing the above methods or processes is also provided. The interface presentation, status prompts, and execution prompts in the aforementioned process 300 can be handled by corresponding functional modules. Figure 4 Based on this, the correspondence between modules is explained.

[0120] Figure 4 Block diagrams of apparatus 400 for performing tasks in various scenarios are shown. Apparatus 400 may be implemented as or included in electronic device 110. Various modules or components in apparatus 400 may be implemented by hardware, software, firmware, or any combination thereof.

[0121] like Figure 4 As shown, the device 400 includes: a first presentation module 410 configured to present a first interface displaying multiple nodes and a first connection; a second presentation module 420 configured to present a first prompt representing a completion status at a first node; and a third presentation module 430 configured to associate a second prompt with a presentation type and execution mode associated with a second node.

[0122] In some cases, the third presentation module 430 can also be configured to present a first entry point for executing the second node in the first execution mode.

[0123] In some cases, the first presentation module 410 can also be configured to receive a trigger operation on the first entry point. The third presentation module 430 can also be configured to present an execution status prompt at the second node.

[0124] In some cases, the third presentation module 430 may also be configured to present a first number of executable nodes and to execute an operation on the nodes corresponding to the first number.

[0125] In some cases, the third presentation module 430 can also be configured to present a prompt indicating that the second node is in an execution state in the second execution mode.

[0126] In some cases, a second node can be executed based on the fact that all its dependent nodes are in a completed state, and the dependent nodes include the first node.

[0127] In some cases, the second node switches execution states based on the following process: obtaining status information of multiple nodes; determining whether at least one node is in the execution state based on the status information; and controlling the execution of the second node in response to at least one node being in the execution state.

[0128] In some cases, the first presentation module 410 can also be configured to present description items in chronological order. The first description item represents the transition of the second node from the completed state of the first node to the execution state.

[0129] In some cases, the first presentation module 410 may also be configured to receive a trigger operation on the first node and present a second entry for marking the first node as complete.

[0130] In some cases, the first presentation module 410 can also be configured to present a second entry after the first execution result meets the conditions.

[0131] In some cases, the first presentation module 410 can also be configured to present a first group of nodes and a second group of nodes corresponding to different stages in different areas.

[0132] In some cases, the device 400 may also include a node creation component. The node creation component is configured to create a third node connected to the second node in the first region, based on the execution result of the second node, to perform a correction subtask.

[0133] In some cases, the execution of the third node may not affect the completion status of the first node.

[0134] In some cases, the first presentation module 410 may also be configured to present a first-stage identifier in a first area and a second-stage identifier in a second area.

[0135] In some cases, the first presentation module 410 can also be configured to present a third node in a failed state in a first style.

[0136] In some cases, the first presentation module 410 may also be configured to receive a fourth operation and stop presenting the third node in response to the fourth operation.

[0137] In some cases, the first node may correspond to the first sub-task executed by the first intelligent system, and the second node may correspond to the second sub-task executed by the second intelligent system.

[0138] The modules included in device 400 can be implemented in various ways, including software, hardware, firmware, or any combination thereof. In some cases, one or more modules can be implemented using software and / or firmware, such as machine-executable instructions stored on a storage medium. In addition to or as an alternative to machine-executable instructions, some or all of the units in device 400 can be implemented at least partially by one or more hardware logic components. By way of example, and not limitation, exemplary types of hardware logic components that can be used include field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), application-specific standard parts (ASSPs), systems on a chip (SOCs), complex programmable logic devices (CPLDs), and so on.

[0139] Figure 5 A block diagram of an electronic device 500 in which one or more examples may be implemented is shown. It should be understood that... Figure 5 The electronic device 500 shown is merely exemplary and should not be construed as limiting the functionality and scope of the examples described herein. Figure 5 The electronic device 500 shown can be used to implement the electronic device 110 discussed above.

[0140] like Figure 5As shown, electronic device 500 is in the form of a general-purpose electronic device. Components of electronic device 500 may include, but are not limited to, one or more processing units or processors 510, memory 520, storage devices 530, one or more communication units 540, one or more input devices 550, and one or more output devices 560. Processor 510 may be a physical or virtual processor and is capable of performing various processes according to programs stored in memory 520. In a multiprocessor system, multiple processors execute computer-executable instructions in parallel to improve the parallel processing capability of electronic device 500.

[0141] Electronic device 500 typically includes multiple computer storage media. Such media can be any accessible media that is accessible to electronic device 500, including but not limited to volatile and non-volatile media, removable and non-removable media. Memory 520 can be volatile memory (e.g., registers, cache, random access memory (RAM)), non-volatile memory (e.g., read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory), or some combination thereof. Storage device 530 can be removable or non-removable media and can include machine-readable media, such as flash drives, disks, or any other media that can be used to store information and / or data and can be accessed within electronic device 500.

[0142] Electronic device 500 may further include additional removable / non-removable, volatile / non-volatile storage media. Although not explicitly stated... Figure 5 As shown, disk drives for reading from or writing to removable, non-volatile disks (e.g., "floppy disks") and optical disk drives for reading from or writing to removable, non-volatile optical disks can be provided. In these cases, each drive can be connected to a bus (not shown) via one or more data media interfaces. Memory 520 may include computer program product 525 having one or more program modules configured to perform various methods or actions of various examples.

[0143] The communication unit 540 enables communication with other electronic devices via a communication medium. Additionally, the functionality of the components of the electronic device 500 can be implemented using a single computing cluster or multiple computing machines capable of communicating via communication connections. Therefore, the electronic device 500 can operate in a networked environment using logical connections to one or more other servers, networked personal computers, or another network node.

[0144] Input device 550 can be one or more input devices, such as a mouse, keyboard, trackball, etc. Output device 560 can be one or more output devices, such as a monitor, speaker, printer, etc. Electronic device 500 can also communicate with one or more external devices (not shown) via communication unit 540 as needed. These external devices include storage devices, display devices, etc., and can communicate with one or more devices that enable user interaction with electronic device 500, or with any device that enables electronic device 500 to communicate with one or more other electronic devices (e.g., network card, modem, etc.). Such communication can be performed via an input / output (I / O) interface (not shown).

[0145] A computer-readable storage medium is provided that stores computer-executable instructions thereon, wherein the computer-executable instructions are executed by a processor to implement the methods described above. A computer program product is also provided, which is tangibly stored on a non-transitory computer-readable medium and includes computer-executable instructions, which are executed by a processor to implement the methods described above.

[0146] The flowcharts and / or block diagrams of the methods, apparatus, devices, and computer program products referred to herein describe various aspects. It should be understood that each block of the flowcharts and / or block diagrams, as well as combinations of blocks in the flowcharts and / or block diagrams, can be implemented by computer-readable program instructions.

[0147] These computer-readable program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing apparatus to produce a machine such that, when executed by the processor of the computer or other programmable data processing apparatus, they create means for implementing the functions / actions specified in one or more blocks of the flowchart and / or block diagram. These computer-readable program instructions can also be stored in a computer-readable storage medium that causes a computer, programmable data processing apparatus, and / or other device to operate in a particular manner; thus, the computer-readable medium storing the instructions comprises an article of manufacture that includes instructions for implementing aspects of the functions / actions specified in one or more blocks of the flowchart and / or block diagram.

[0148] Computer-readable program instructions can be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable data processing apparatus, or other device to produce a computer-implemented process, thereby causing the instructions that execute on the computer, other programmable data processing apparatus, or other device to perform the functions / actions specified in one or more boxes of a flowchart and / or block diagram.

[0149] The flowcharts and block diagrams in the accompanying figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products under various scenarios. In this respect, each block in a flowchart or block diagram may represent a module, segment, or portion of an instruction, which contains one or more executable instructions for implementing the specified logical function. In some alternative implementations, the functions marked in the blocks may occur in a different order than those shown in the figures. For example, two consecutive blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, can be implemented using a dedicated hardware-based system that performs the specified function or action, or using a combination of dedicated hardware and computer instructions.

[0150] Various examples have been described above. The foregoing descriptions are exemplary and not exhaustive, nor are they limited to the disclosed implementations. Many modifications and variations will be apparent to those skilled in the art without departing from the scope and spirit of the described implementations. The terminology used herein is chosen to best explain the principles, practical applications, or improvements to technology in the market, or to enable others skilled in the art to understand the various implementations disclosed herein.

Claims

1. A method for performing a task, comprising: A first interface is presented, which displays multiple nodes of the task. The multiple nodes include a first node and a second node. The first node and the second node have a first connection, which indicates that the execution of the second node depends on the first node. A first prompt is displayed at the first node, indicating that the first node is in a completed state; as well as Associated with the second node, a second prompt is presented. The type of the second prompt is associated with the execution mode of the task, which indicates how to switch the second node to the execution state.

2. The method of claim 1, wherein the execution mode is a first execution mode, and the presentation of the second prompt includes: A first entry point is presented, which is used to switch the second node to the execution state.

3. The method according to claim 2, further comprising: Receive a first operation, the first operation including a trigger operation on the first entry point; as well as At the second node, a third prompt is presented, indicating that the second node is in the execution state.

4. The method according to claim 3, further comprising: A first number is presented, which is the number of at least one node among the plurality of nodes that supports switching to the execution state, and the first operation is used to switch the at least one node to the execution state.

5. The method of claim 1, wherein the execution mode is a second execution mode, and the presentation of the second prompt includes: At the second node, the second prompt is displayed, indicating that the second node is in the execution state.

6. The method of claim 5, wherein the second node switches to the execution state based on at least one node being in the completed state, the execution of the second node depends on the at least one node, and the at least one node includes the first node.

7. The method of claim 6, wherein the second node is switched to the execution state based on the following process: Obtain the status information of the multiple nodes; Based on the status information, determine whether the at least one node is in the execution state; and In response to the fact that at least one node is in the execution state, control the execution of the second node.

8. The method according to claim 5, further comprising: Based on chronological order, at least one descriptive item is presented, the at least one descriptive item including a first descriptive item, the first descriptive item representing that the second node switches from the completion state of the first node to the execution state.

9. The method according to claim 1, further comprising: Receive a second operation, the second operation including a trigger operation on the first node; as well as A second entry point is presented, which is used to mark the first node as the completed state.

10. The method of claim 9, wherein presenting the second entry comprises: In response to the first execution result of the first node satisfying the condition, the second entry point is presented on the first interface.

11. The method of claim 1, wherein the plurality of nodes includes at least a first group of nodes and a second group of nodes, the method further comprising: The first group of nodes is presented in the first area of ​​the first interface; as well as In the second area of ​​the first interface, the second group of nodes is presented, and the first group of nodes and the second group of nodes correspond to different stages of the task.

12. The method according to claim 11, wherein, The first node belongs to the first group of nodes, the second node belongs to the second group of nodes, and the method further includes: Based on the second execution result of the second node, a third node is created in the first region. The third node is connected to the second node and is used to execute subtasks that are associated with correcting the second execution result.

13. The method of claim 12, wherein the first group of nodes corresponds to a first stage of the task, and the second group of nodes corresponds to a second stage of the task, the method further comprising: In the first area, a first identifier is presented, and the first identifier corresponds to the first stage; as well as In the second area, a second identifier is presented, which corresponds to the second stage.

14. The method of claim 1, wherein the plurality of nodes further includes a third node, and the method further includes: The third node is presented in a first style, which indicates that the third node is in a failed state.

15. The method of claim 14, further comprising: Receive the fourth operation; as well as In response to the fourth operation, the presentation of the third node on the first interface is stopped.

16. The method of claim 1, wherein the first node corresponds to a first subtask executed by a first intelligent system, and the second node corresponds to a second subtask executed by a second intelligent system.

17. An apparatus for performing a task, comprising: A first presentation module is configured to present a first interface, which displays multiple nodes of a task, including a first node and a second node. The first node and the second node have a first connection, which indicates that the execution of the second node depends on the first node. The second presentation module is configured to present a first prompt at the first node, the first prompt indicating that the first node is in a completed state; as well as A third presentation module is configured to be associated with the second node and present a second prompt. The type of the second prompt is associated with the execution mode of the task, which indicates how to switch the second node to the execution state.

18. An electronic device comprising: At least one processor; as well as At least one memory coupled to the at least one processor and storing instructions for execution by the at least one processor, the instructions causing the electronic device to perform the method according to any one of claims 1 to 16 when executed by the at least one processor.

19. A computer-readable storage medium having stored thereon computer-executable instructions that can be executed by a processor to implement the method according to any one of claims 1 to 16.

20. A computer program product tangibly stored in a computer storage medium and comprising computer-executable instructions that, when executed by a device, cause the device to perform the method according to any one of claims 1 to 16.

Images