Build reliable multi-agent applications with ADK Go 2.0. Discover our new graph-based workflow engine, built-in human-in-the-loop, and dynamic orchestration

Summary

ADK for Go 2.0 introduces a graph-based workflow engine for composing multi-agent applications whose execution can classify, branch, fan out, gather results, pause for human input, retry, and loop. Graphs consist of typed nodes and routed edges, with constructors for functions, emitting functions, agents, tools, joins, parallel workers, state-bound nodes, dynamic orchestration, and nested workflows; a scheduler handles concurrency, persistence, backpressure, cancellation, and resumption. Its built-in human-in-the-loop primitive validates responses, supports handoff or re-entry, and can resume durably after process restarts, while agent modes and a unified node runtime align single agents with full graphs. The release is highly additive for ADK 1.0 users, though context and event APIs require mechanical migrations, and it provides workflow examples for basic, routing, dynamic, HITL, and complex graphs.

Takeaways

1. 1

   A graph is an agent and runs through the existing runner, launcher, and console; no special harness or new server is required.

2. 2

   Human-in-the-loop requests can use handoff or re-entry, validate responses against a schema, and resume idempotently after process restarts or across runtimes.

3. 3

   ADK 1.0 migrations include changing node and node-function parameters to agent.Context, updating session.NewEvent calls, and accounting for richer event fields.