Planning starts with when feedback arrives, then asks whether to branch¶
简体中文 · English
Updated 2026-10-27 · 16 topic entries / 6 representative comparisons
ReAct and ReWOO change when a plan receives observations. ToT and LATS organize candidate search differently. Jev Lookahead delegates successor simulation to code, while DRAGO checks formal-plan fidelity. They address distinct uncertainties: unknown steps, route choice, reachability, and specification errors. Do not rank them all by search count or perfect local scores.
Mechanisms · Trade-offs · Cross-paper questions · Updates
How to read this card
The table compares representative methods. It is not a shared-benchmark leaderboard. Teaching examples are not measured results.
Mechanism comparison¶
Axes: Whether plans are generated before or after intermediate tool observations · Whether the search unit is a thought, environment action, or complete plan · Whether value comes from model judgment, actual execution, or symbolic probes · Whether recoverable branches and simulated states are reliably isolated
| Paper and source | Mechanism | Benefits and trade-offs |
|---|---|---|
| ReAct · Original source Sections in the Chinese source: 背景与主要改动, 核心公式, 复现边界 |
Alternates reasoning, actions, and actual observations, choosing the next action from the latest result. | Adapts to changes mid-task, but history and repeated reasoning raise cost. The local classic mini-suite has deterministic observations, not the paper's real-environment results. |
| ReWOO · Original source Sections in the Chinese source: 背景与主要改动, 核心公式, 复现边界 |
The Planner drafts dependencies with evidence variables, the Worker fills tool results, and the Solver synthesizes at the end. | The Planner rereads fewer observations, but exceptions can invalidate the plan. Variable dependencies still limit parallelism; local work checks decoupled control flow only. |
| Tree of Thoughts · Original source Sections in the Chinese source: 背景与主要改动, 核心公式, 复现边界 |
Organizes scorable intermediate states into a thought tree, maintaining the frontier through BFS or DFS with backtracking. | Can undo early choices but relies on intermediate evaluation. Local workflow coherence stands in for LM value and does not establish open-ended reasoning. |
| LATS · Original source Sections in the Chinese source: 背景与主要改动, 核心公式, 复现边界 |
Uses MCTS for actions, rollouts, and value backup. UCT balances observed reward against underexplored nodes, and failures generate reflection. | Actual rollouts add external constraints and cost. Local leaves are complete plans, without the paper's LM value or WebShop. |
| Code Owns the Simulation, Jev Owns the Evaluation · Original source Sections in the Chinese source: 背景与主要改动, 核心公式, 本地复现 |
Clones a simulated successor per action and gives the decision-maker its observation and new available actions to compare progress. | Needs trusted, isolated simulation. Separate objects do not guarantee isolation of RNG or external resources. The local lexical provider is a stand-in. |
| Repairing LLM-Generated Specifications with Deterministic Diagnosis · Original source Sections in the Chinese source: 背景与主要改动, 核心公式, 本地复现与边界 |
Repairs formal specifications using type, contract, reachability, and intent diagnostics, strictly reducing blockers and guarding against deleting goals. | Solvers check a given formalization; it can be solvable while misrepresenting the task. Local work covers positive-precondition STRIPS, not the expensive full multi-model experiments. |
Trade-off analysis¶
Plan all dependencies first, or wait for observations?¶
ReWOO uses variables not to ignore evidence, but to avoid regenerating all Planner reasoning after each observation. Later arguments are still filled from earlier evidence. ReAct directly uses actual returns for the next decision and fits tasks whose paths change with outcomes. Stable tool sequences favor preplanning to reduce repeated inputs. Exceptions changing goals or available actions require a replanning path. Compare total delivery cost, not Planner calls alone.
Search creates opportunities; validation defines the evidence¶
ToT and LATS expand alternatives, but ToT emphasizes intermediate evaluation and frontier management while LATS also backs up execution and visitation feedback. Jev Lookahead requires code to supply observable successors, and DRAGO uses symbolic specification probes. External computation is not an infallible oracle: simulators can leak state, and solvers can solve the wrong specification. Fix what search can observe and what failures mean before comparing width, depth, and budget.
Sources: Tree of Thoughts · LATS · Code Owns the Simulation, Jev Owns the Evaluation · Repairing LLM-Generated Specifications with Deterministic Diagnosis
Cross-paper questions¶
Try answering before expanding the explanation. Each question relates at least two papers.
Can ReWOO preplan an order lookup that needs the user's identity first? What differs from ReAct?¶
Show answer and example
Answer: Yes. The second step can reference the first step's evidence variable, filled by the Worker when the result arrives. Preplanning does not predict the result. The Planner is not interrupted for every observation, while ReAct chooses again from each return. An identity lookup exception can force another route, requiring failure handling and replanning beyond a prewritten graph.
Illustrative example: Look up customer_id, then orders. If the response says the customer was merged and needs human confirmation, substituting a variable value is not enough.
Why might LATS still roll out a thought that ToT currently values poorly?¶
Show answer and example
Answer: A layer-wise frontier can prune by current value. MCTS UCT also considers visit count, giving underexplored branches a chance. External rollout may add reward evidence but is not a free fix for all value mistakes. Control budget and evaluator; deterministic local coherence is not LM value or actual environment evidence.
Illustrative example: An apparent detour may unlock an essential resource. UCT can preserve it while untried even after a fixed frontier would prune it.
Sources: Tree of Thoughts · LATS
Why verify user intent even if a Jev simulation reaches the goal and a DRAGO solver says it is solvable?¶
Show answer and example
Answer: Both verify consequences in an encoded environment or specification. Jev Lookahead needs faithful simulation without reward or gold leakage. DRAGO needs a faithful formalization, not solvability obtained by dropping goals. Code and solvers rule out some errors but cannot ensure every natural-language requirement became state, constraints, and objectives.
Illustrative example: A user requests delivery to A while keeping the item cold, but the specification only says deliver to A. Successful simulation and solving still do not verify temperature.
Sources: Code Owns the Simulation, Jev Owns the Evaluation · Repairing LLM-Generated Specifications with Deterministic Diagnosis
Update log¶
Updates record new approaches, changed trade-offs, and follow-up evidence.
2026-10-27 · Initial version: compared feedback timing, thought and MCTS search, code-based successor simulation, and formal specification diagnosis, separating planning efficiency from validation evidence.
Covers 16 topic entries; see the full list below.
All 16 topic entries
The full catalog follows. The main comparison covers the representative papers listed above.
- Repairing LLM-Generated Specifications with Deterministic Diagnosis
- Janus: Enhancing Long-Horizon Autonomous Research with Co-Evolving World Models
- Code Owns the Simulation, Jev Owns the Evaluation
- JevSpawn: Adaptive Agentic Inference through Compositional Action Spaces
- Thinking Before Thinking: Scaling Agentic Inference Through Meta-Reasoning
- SAGE: Symbolic Action-Gating and Editing for LLM Task Planners
- SearchAtlas: Analyzing Agentic Search Strategies via Evidential Query Graphs
- DeepRepro: State-Aware Subplanning for Paper-to-Code Reproduction in Evolving Repositories
- LoongReflect: Boosting Long-Horizon Reflection in Search Agents via Global Perspective Distillation
- ToolLIFT: Lifting Tool-Specific Trajectories into Function-Level Graphs for Generalizable Tool Planning
- HyperAgent: Planning and Acting over Tool-Schema Hypergraphs for Tool-Use LLM Agents
- Superintelligent Retrieval Agent: The Next Frontier of Agentic Retrieval
- LATS
- ReWOO
- Tree of Thoughts
- ReAct