Re-Planning Architecture Comparison
Elesium Bounded Deterministic Re-Planner
DAG-constrained state reflection refines plans via grammar decoding in sub-1.8s, eliminating circular prompt deadlocks with 99.4% task convergence.
Re-planning Latency: 1,750ms | Convergence: 99.4% | Deadlock Risk: 0.0%
Static Counter Circuit Breaker (Max N Retries)
Hard aborts after fixed attempts; avoids infinite loops but prematurely terminates 26.5% of recoverable enterprise tasks, causing heavy manual triage.
Re-planning Latency: 3,600ms | Convergence: 73.5% | False Abort Rate: 26.5%
Unbounded Self-Correction Loop (Naive Reflexion)
Unconstrained prompt reflection loops oscillate between conflicting hypotheses, driving 14s+ latency spikes, runaway token bills, and 14.2% deadlocks.
Re-planning Latency: 14,400ms | Convergence: 78.5% | Deadlock Risk: 14.2%