Class RecursiveTaskSolver

java.lang.Object
com.tnsai.coordination.roma.RecursiveTaskSolver

public final class RecursiveTaskSolver extends Object
Recursive Open Meta-Agent (ROMA) task solver. Recursively decomposes complex tasks, solves atomic sub-tasks, aggregates results, and verifies quality.

Algorithm:

  1. Check if task is atomic (via Atomizer)
  2. If atomic: solve directly with solver agent and verify
  3. If not: decompose into sub-tasks (via TaskDecomposer)
  4. Recursively solve each sub-task
  5. 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");