DAG-Based Task Planner Overview

• The DAG-based task planner is a framework that models complex tasks as directed acyclic graphs, enabling systematic decomposition and parallel scheduling.
• It employs schema-aware validation to ensure structural and semantic correctness, facilitating explainable execution traces and reliable task orchestration.
• The system integrates rapid plan generation, caching, and DataOps feedback for error diagnosis and auto-repair, resulting in improved accuracy and reduced latency.

A directed acyclic graph (DAG)-based task planner is a computational or agentic system that models complex, multi-stage reasoning, scheduling, or resource orchestration as the progressive construction, validation, and execution of a DAG. In this architecture, vertices represent atomic tasks, sub-queries, or sub-goals, while edges encode explicit precedence, data, and execution dependencies. The DAG-based model guarantees acyclicity, enabling systematic decomposition of task objectives, scalable parallel scheduling, explainable execution traces, and composable validation logic. These properties are leveraged across multi-modal retrieval, hard real-time scheduling, automated planning, and reinforcement-learning-based orchestration frameworks (B et al., 15 Mar 2026).

1. Formal DAG Plan Definition and Architecture

A DAG-based planner encodes a workflow as a finite directed acyclic graph $\mathcal{P} = (V, E)$, where:

• $V = \{v_1, ..., v_n\}$: Nodes, each representing an atomic sub-task or query, annotated with
  • sub-task description,
  • tool type (e.g., $\texttt{sql}$ or $\texttt{vector}$),
  • output label (e.g., $\$var_i$$),</li> <li>exposure status (whether to expose intermediate results).</li> </ul></li> <li>$$E \subseteq V \times V$: Directed edges encoding dependency;$(v_i \to v_j)$means$v_j$requires completion and outputs of$v_i$(can refer to output fields via$\$var_i.\text{column_name}$).</li> </ul> <p>By maintaining acyclicity,$\mathcal{P}$$can be topologically sorted, enabling algebraic plan validation: plan generation, acyclic check, and variable-scope verification are all$$O(|V|+|E|)$$. The system supports maximal concurrency, with the wall-clock makespan governed by the DAG’s critical path length in the infinite-worker model.</p> <h2 class='paper-heading' id='query-decomposition-and-plan-generation'>2. Query Decomposition and Plan Generation</h2> <p>The planner decomposes user input, such as a natural language query$$Q$$, into a structured DAG, using schema-informed prompting and LLMs. The decomposition process includes:</p> <ul> <li>Extraction of atomic sub-tasks (‘hops’) based on schema, data type, and dependency patterns,</li> <li>Assignment of each task to the correct tool (e.g., identification of SQL sub-queries for named-entity or filter patterns, vector-search for semantic link-resolution),</li> <li>Generation of parallelizable sub-queries by identifying independent sub-tasks.</li> </ul> <p>Pseudocode for plan generation:$$

    def GeneratePlan(Q, σ(S), γ): prompt = Plan-Generation-Template(Q, σ(S), γ) raw_plan = LLM(prompt) P = ParseJSON(raw_plan) return P # (V, E) with annotations

    Heuristics in prompt design maximize parallel hops when cross-node references are absent.</p> <h2 class='paper-heading' id='schema-aware-validation-structural-and-semantic'>3. Schema-Aware Validation: Structural and Semantic</h2> <p>The post-generation plan is subjected to a validator V(\mathcal{P}, \mathcal{S}, Q)$$, ensuring executable and semantically-sound task plans:</p> <ul> <li><strong>Structural validation</strong>: Every node must have all required fields, well-formed labels, proper tool annotation, and valid references. DAG must remain acyclic, verifiable in$$O(|V| + |E|)$$.</li> <li><strong>Semantic validation</strong>: Type checking ensures that joins and data passing across nodes use schema-sanctioned keys. Intent-drift is detected via audit prompts to <a href="https://www.emergentmind.com/topics/lightweight-open-source-llms" title="" rel="nofollow" data-turbo="false" class="assistant-link" x-data x-tooltip.raw="">lightweight open-source LLMs</a>. The validator enforces</li> </ul> <p>$$\forall (v_i \to v_j) \in E: \mathrm{schema}(v_i) \cap \mathrm{schema}(v_j) \neq \varnothing$$</p> <p>so every data dependency is well-defined.</p> <h2 class='paper-heading' id='execution-engine-parallel-orchestration-and-evidence'>4. Execution Engine: Parallel Orchestration and Evidence</h2> <p>Upon validation, the DAG executor launches sub-tasks in topological order, exploiting parallelism among independent nodes. Key features:</p> <ul> <li>Parallel invocation of NL2SQL or NL2Vector agents with minimal data passing (pointer-only ‘slimming’),</li> <li>Thread-pool concurrency, with latency determined by the DAG’s critical path,</li> <li>Comprehensive evidence logging: complete provenance trails recording input keys, query text, intermediate outputs, and timestamps for regulatory and user trust.</li> </ul> <p>Simplified pseudocode:$$

    def ExecutePlan(P): binding = {} # label -> handle ready_set = {v for v in V if indegree(v) == 0} while ready_set: batch = ready_set ready_set = set() results = ParallelMap(batch, ExecuteNode, binding) for v_i, out_i in results: binding[label_i] = Slim(out_i) for v_j in children of v_i: if all parents of v_j in binding: ready_set.add(v_j) final_out = binding[label_last_expose=True node] return final_out

    All intermediate and final outputs follow the explicit path of dependencies declared in the DAG.</p> <h2 class='paper-heading' id='caching-reuse-and-paraphrase-awareness'>5. Caching, Reuse, and Paraphrase-Awareness</h2> <p>To achieve high throughput and rapid response, the DAG-based planner integrates a multi-tiered caching and plan-reuse system mapping (Q, \sigma(\mathcal{S}), \gamma)$to$\mathcal{P}$$:</p> <ul> <li><strong>Exact caching</strong>: Reuse when the normalized query and schema context match exactly, with$$O(\log N)$$lookup.</li> <li><strong>Template caching</strong>: Embedding-similarity combined with slot-based pattern extraction, enabling slot-filling for paraphrased queries.</li> <li><strong>Semantic caching</strong>: <a href="https://www.emergentmind.com/topics/jetson-nano-r-retrieve" title="" rel="nofollow" data-turbo="false" class="assistant-link" x-data x-tooltip.raw="">Retrieve</a> top-$$k$$semantically similar queries, and confirm plan reusability through structural validation; incurs only an extra LLM call on each template hit.</li> <li>Employs <a href="https://www.emergentmind.com/topics/linear-recurrent-units-lru" title="" rel="nofollow" data-turbo="false" class="assistant-link" x-data x-tooltip.raw="">LRU</a> cache eviction to maintain bounded memory.</li> </ul> <h2 class='paper-heading' id='dataops-feedback-loop-error-diagnosis-and-auto-repair'>6. DataOps Feedback Loop: Error Diagnosis and Auto-Repair</h2> <p>When errors or schema changes arise, a DataOps subsystem is invoked with$$(\mathcal{P}, \mathcal{S}, H, F)$, where$H$is the plan history and$F$$is failure metadata. Roles include:</p> <ul> <li>Diagnoser: Identifies root causes (tool mismatch, variable-scoping).</li> <li>Fixer: Performs local modifications (filter, field name edits).</li> <li>Recommender: Suggests manual intervention (e.g., external server issues).</li> <li>Replanner: Triggers a full or partial DAG regeneration for deep structure changes.</li> </ul> <p>Feedback latency is$$O(1)$ for minor repairs, with fallbacks to regeneration for non-local failures.

    7. Empirical Results and System Impact

    Benchmarked on HybridQA (3,466 questions), the DAG-based planner yields substantial gains over naive retrieval-augmented generation (RAG) and sequential ReAct protocols:

    Metric	A.DOT	Baseline RAG	Absolute Gain
    Correctness	71.0%	56.2%	+14.8%
    Completeness	73.0%	62.3%	+10.7%

    Latency is decreased by up to 30%, exploiting full parallel plan evaluation. The system produces an auditable evidence trail, enabling explicit content verification and lineage tracing. Example: for a multi-hop invoice query, all sub-query results (row IDs, aggregate values, retrieved documents) are versioned and time-stamped, satisfying compliance and trust requirements.

    8. Synthesis and Applicability

    The DAG-based planner paradigm, as instantiated by A.DOT, demonstrates a unified mechanism for:

    • Explicit multi-hop, multi-modal question decomposition,
    • Schema-informed structural and semantic plan validation,
    • Maximal parallelization through isolated sub-query orchestration,
    • Rapid, cache-enabled plan regeneration and reuse,
    • Robust error containment through DataOps-mediated feedback and auto-repair,
    • Auditable, enterprise-grade evidence trails.

    This framework is directly applicable to hybrid data lake QA, but the methodology generalizes to any enterprise or agentic context requiring compositional orchestration over networks of interdependent, concurrent tasks (B et al., 15 Mar 2026).