What does this equation mean?

Singh and colleagues’ survey names the resulting engineering problem precisely: an agentic system’s retrieval behaviour is now controlled by a learned or prompted policy rather than by a fixed pipeline parameter, and their taxonomy organises the resulting architectures by how many agents are involved, how they are coordinated, how much autonomy each has, and how the underlying knowledge is represented and accessed [ 13 ] . The engineering consequence of policy-controlled retrieval is the one this family cannot avoid: the round count k from the iterative family’s cost model is, for an agentic system, a random variable whose distribution depends on the policy and the specific input, not a number fixed in advance by the architecture or bounded by a benchmark-tuned heuristic. Absent an operator-imposed budget — a maximum number of tool calls, a wall-clock timeout, a token cap — nothing in the architecture itself guarantees k terminates quickly, or terminates at all on a pathological input. This is the direct cost of the family’s chief advantage, which is real: retrieval effort is matched to the difficulty of the specific request rather than spent uniformly, so an easy question can be answered in one round at close to naive-RAG cost while a hard one draws on as many rounds as its policy judges necessary — but “as many as necessary” is a claim about the policy’s competence, not a guarantee, and the failure mode when the policy misjudges is an unpredictable latency and cost tail rather than the cleanly bounded worst case the other four families offer.