# US 2026/0094094 A1 · Agentic workflow programming with search over execution branches

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0094094 A1
- Document ID: US20260094094A1
- Status: Published application
- Kind: A1
- Application number: 19/346,151
- Filed: 2025-09-30
- Published: 2026-04-02
- Earliest claimed: 2024-10-01
- Assignees: Asari Ai Inc.
- Applicants: Asari Ai Inc.
- Inventors: Zhening LI; Stephan Tao ZHENG
- Web page: https://patentgrep.com/patent/US20260094094A1

## CPC

- G06Q 10/06316: {Sequencing of tasks or work}
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## Abstract

One embodiment of the present invention sets forth a technique for executing an agentic workflow. The technique includes upon determining that a first branchpoint is reached during execution of the agentic workflow, executing, based on one or more calls received over an interface associated with the first branchpoint, a first plurality of branches from the first branchpoint and a state of the agentic workflow at the first branchpoint to one or more subsequent branchpoints within the agentic workflow. The technique also includes executing, based on a first plurality of evaluation scores associated with executing the first plurality of branches, a second plurality of branches from at least a portion of the one or more subsequent branchpoints to one or more additional points within the agentic workflow.

## Claims

### Claim 1

A computer-implemented method for executing an agentic workflow, the method comprising:
upon determining that a first branchpoint is reached during execution of the agentic workflow, executing, based on one or more calls received over an interface associated with the first branchpoint, a first plurality of branches from the first branchpoint and a state of the agentic workflow at the first branchpoint to one or more subsequent branchpoints within the agentic workflow; and
executing, based on a first plurality of evaluation scores associated with executing the first plurality of branches, a second plurality of branches from at least a portion of the one or more subsequent branchpoints to one or more additional points within the agentic workflow.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, further comprising determining a final output of the agentic workflow based on a second plurality of evaluation scores associated with executing the second plurality of branches.

### Claim 3 (depends on 2)

The computer-implemented method of claim 2, wherein determining the final output comprises:
determining that a point at which a branch included in the second plurality of branches terminates corresponds to an endpoint in the agentic workflow; and
determining the final output based on a subsequent state of the agentic workflow at the point.

### Claim 4 (depends on 1)

The computer-implemented method of claim 1, further comprising compiling a program for the agentic workflow into a search space that includes the first branchpoint, the one or more subsequent branchpoints, and the one or more additional points, wherein the first plurality of branches and the second plurality of branches are executed based on a search of the search space.

### Claim 5 (depends on 4)

The computer-implemented method of claim 4, wherein the program for the agentic workflow specifies:
a first set of locations of the first branchpoint, the one or more subsequent branchpoints, and the one or more additional points; and
a second set of locations at which the first plurality of evaluation scores are recorded.

### Claim 6 (depends on 4)

The computer-implemented method of claim 4, wherein the search of the search space is performed based on a search policy associated with the agentic workflow.

### Claim 7 (depends on 1)

The computer-implemented method of claim 1, wherein the one or more calls are associated with at least one of:
searching over the first plurality of branches and the second plurality of branches;
a set of costs associated with the first plurality of branches and the second plurality of branches; and
a number of branches included in the first plurality of branches.

### Claim 8 (depends on 1)

The computer-implemented method of claim 1, further comprising storing, in a search tree associated with the agentic workflow:
a first node representing the first branchpoint and a first state of the agentic workflow at the first branchpoint; and
a plurality of nodes that are children of the first node, wherein each of the plurality of nodes represents (i) a branchpoint included in the one or more subsequent branchpoints and (ii) a state of the agentic workflow after a corresponding execution branch that is included in the first plurality of branches has terminated at the branchpoint.

### Claim 9 (depends on 1)

The computer-implemented method of claim 1, wherein the first plurality of branches is executed based on at least one of a branching factor associated with the first branchpoint or a beam width associated with the first branchpoint.

### Claim 10 (depends on 1)

The computer-implemented method of claim 1, wherein the state of the agentic workflow comprises at least one of a set of variables, a set of values for the set of variables, or a final output of the agentic workflow.

### Claim 11

One or more non-transitory computer-readable media storing instructions that, when executed by one or more processors, cause the one or more processors to perform the steps of:
upon determining that a first branchpoint is reached during execution of an agentic workflow, executing, based on one or more calls received over an interface associated with the first branchpoint, a first plurality of branches from the first branchpoint and a state of the agentic workflow at the first branchpoint to one or more subsequent branchpoints within the agentic workflow; and
executing, based on a first plurality of evaluation scores associated with executing the first plurality of branches, a second plurality of branches from at least a portion of the one or more subsequent branchpoints to one or more additional points within the agentic workflow.

### Claim 12 (depends on 11)

The one or more non-transitory computer-readable media of claim 11, wherein the instructions further cause the one or more processors to perform the step of determining a final output of the agentic workflow based on a second plurality of evaluation scores associated with executing the second plurality of branches.

### Claim 13 (depends on 12)

The one or more non-transitory computer-readable media of claim 12, wherein determining the final output comprises:
determining that a second branchpoint at which an execution branch included in the second plurality of branches terminates (i) corresponds to an endpoint in the agentic workflow and (ii) is associated with a highest score included in the second plurality of evaluation scores; and
determining the final output based on a third state of the agentic workflow at the second branchpoint.

### Claim 14 (depends on 11)

The one or more non-transitory computer-readable media of claim 11, wherein executing the first plurality of branches comprises:
generating, based on the state of the agentic workflow at the first branchpoint, a plurality of execution threads corresponding to the first plurality of branches; and
executing each execution thread in the plurality of execution threads until a corresponding branchpoint included in the one or more subsequent branchpoints is reached.

### Claim 15 (depends on 11)

The one or more non-transitory computer-readable media of claim 11, wherein executing the first plurality of branches comprises performing a search of a search space that includes the first branchpoint and the one or more subsequent branchpoints based on one or more search parameters associated with the first branchpoint.

### Claim 16 (depends on 15)

The one or more non-transitory computer-readable media of claim 15, wherein the one or more search parameters comprise at least one of a branching factor or a beam width.

### Claim 17 (depends on 11)

The one or more non-transitory computer-readable media of claim 11, wherein each execution branch included in the first plurality of branches comprises an invocation of a language model.

### Claim 18 (depends on 11)

The one or more non-transitory computer-readable media of claim 11, wherein the one or more calls are associated with at least one of:
executing one or more branches included in the first plurality of branches;
determining the state of the agentic workflow at the first branchpoint; or
searching over the first plurality of branches.

### Claim 19 (depends on 11)

The one or more non-transitory computer-readable media of claim 11, wherein the first plurality of evaluation scores is computed based on at least one of an objective associated with the agentic workflow, a reinforcement learning reward, or a final output of the agentic workflow.

### Claim 20

A system, comprising:
one or more memories that store instructions, and
one or more processors that are coupled to the one or more memories and, when executing the instructions, are configured to perform the steps of:
upon determining that a first branchpoint is reached during execution of an agentic workflow, executing, based on one or more calls received over an interface associated with the first branchpoint, a first plurality of branches from the first branchpoint and a state of the agentic workflow at the first branchpoint to one or more subsequent branchpoints within the agentic workflow; and
executing, based on a first plurality of evaluation scores associated with executing the first plurality of branches, a second plurality of branches from at least a portion of the one or more subsequent branchpoints to one or more additional points within the agentic workflow.
