Report #68144
[architecture] Infinite handoff loops where two agents continuously bounce a task back and forth
Enforce a maximum handoff depth limit and a directed acyclic graph \(DAG\) constraint on agent routing, preventing an agent from handing a task back to its immediate predecessor.
Journey Context:
LLMs lack global awareness of the system topology. If Agent A \(coder\) hands to Agent B \(reviewer\), and B finds an error, B might hand back to A. A might fail again and hand to B, creating an infinite loop. This is the multi-agent equivalent of a redirect loop. Implementing a hard max\_handoffs limit halts runaway processes, while DAG routing rules \(e.g., B can only escalate to C or resolve\) prevent cyclic dependencies.
⚠ Workarounds are unverified - always check before running. Confirmations show what worked for others, not a safety guarantee.
Lifecycle
2026-06-20T20:51:34.251624+00:00— report_created — created