SPIN: Structural LLM Planning via Iterative Navigation for Industrial Tasks
Yusuke Ozaki, Dhaval Patel

TL;DR
SPIN is a novel planning wrapper that improves industrial LLM agent workflows by enforcing DAG constraints and incrementally evaluating plan prefixes, reducing task execution and tool calls.
Contribution
It introduces a structured planning method combining DAG validation and prefix evaluation to enhance robustness and efficiency in industrial LLM tasks.
Findings
SPIN reduces executed tasks from 1061 to 623 on AssetOpsBench.
SPIN improves Accomplished score from 0.638 to 0.706.
SPIN decreases tool calls from 11.81 to 6.82 per run.
Abstract
Industrial LLM agent systems often separate planning from execution, yet LLM planners frequently produce structurally invalid or unnecessarily long workflows, leading to brittle failures and avoidable tool and API cost. We propose \texttt{SPIN}, a planning wrapper that combines validated Directed Acyclic Graph (DAG) planning with prefix based execution control. \texttt{SPIN} enforces a strict DAG contract through \texttt{\_validate\_plan\_text} and repair prompting, producing executable plans before downstream execution, and then evaluates DAG prefixes incrementally to stop when the current prefix is sufficient to answer the query. On AssetOpsBench, across 261 scenarios, \texttt{SPIN} reduces executed tasks from 1061 to 623 and improves \emph{Accomplished} from 0.638 to 0.706, while reducing tool calls from 11.81 to 6.82 per run. On MCP Bench, the same wrapper improves planning,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
