Package com.tnsai.coordination.roma
Class RecursiveTaskSolver
java.lang.Object
com.tnsai.coordination.roma.RecursiveTaskSolver
Recursive Open Meta-Agent (ROMA) task solver.
Recursively decomposes complex tasks, solves atomic sub-tasks,
aggregates results, and verifies quality.
Algorithm:
- Check if task is atomic (via
Atomizer) - If atomic: solve directly with solver agent and verify
- If not: decompose into sub-tasks (via
TaskDecomposer) - Recursively solve each sub-task
- Aggregate sub-results and verify
Example usage:
RecursiveTaskSolver solver = RecursiveTaskSolver.builder()
.solver(solverAgent)
.decomposer(TaskDecomposer.llmBased(plannerAgent))
.atomizer(Atomizer.depthBased(3))
.verifier(Verifier.llmBased(reviewerAgent))
.build();
SolveResult result = solver.solve("Build a REST API for user management");
-
Nested Class Summary
Nested ClassesModifier and TypeClassDescriptionstatic classstatic final recordResult of a recursive solve operation.static final recordTrace entry recording a step in the recursive solve process. -
Method Summary
Modifier and TypeMethodDescriptionstatic RecursiveTaskSolver.Builderbuilder()Solves a task recursively.
-
Method Details
-
solve
Solves a task recursively.- Parameters:
task- the task to solve- Returns:
- the solve result with output and trace
-
builder
-