REVIEW 5 cited by
DART-LLM: Dependency-Aware Multi-Robot Task Decomposition and Execution using Large Language Models
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Large Language Models (LLMs) have demonstrated promising reasoning capabilities in robotics; however, their application in multi-robot systems remains limited, particularly in handling task dependencies. This paper introduces DART-LLM, a novel framework that employs Directed Acyclic Graphs (DAGs) to model task dependencies, enabling the decomposition of natural language instructions into well-coordinated subtasks for multi-robot execution. DART-LLM comprises four key components: a Question-Answering (QA) LLM module for dependency-aware task decomposition, a Breakdown Function module for robot assignment, an Actuation module for execution, and a Vision-Language Model (VLM)-based object detector for environmental perception, achieving end-to-end task execution. Experimental results across three task complexity levels demonstrate that DART-LLM achieves state-of-the-art performance, significantly outperforming the baseline across all evaluation metrics. Among the tested models, DeepSeek-r1-671B achieves the highest success rate, whereas Llama-3.1-8B exhibits superior response time reliability. Ablation studies further confirm that explicit dependency modeling notably enhances the performance of smaller models, facilitating efficient deployment on resource-constrained platforms. Please refer to the project website https://wyd0817.github.io/project-dart-llm/ for videos and code.
Forward citations
Cited by 5 Pith papers
-
CADENZA: Compiling Natural-Language Intent into Task-Specific Operator DAGs for Semantic Query Processing
CADENZA introduces TxRA and dual planners to compile semantic operator intents into optimized task DAGs, claiming large gains in quality, latency, and cost on SemBench.
-
LLM-Based Generalizable Hierarchical Task Planning and Execution for Heterogeneous Robot Teams with Event-Driven Replanning
An LLM-based hierarchical system lets heterogeneous robot teams plan, execute, and autonomously replan in response to unexpected events, demonstrated on physical robots and in simulation.
-
AIGB-R1: Self-Evolving Generative Auto-Bidding via Hierarchical Planner-Executor Optimization
AIGB-R1 couples an LLM strategy planner with a prompt-conditioned Decision Transformer executor and trains both end-to-end with a decoupled-GRPO self-evolving loop, reporting the highest Score on the AuctionNet benchmark.
-
Dynamic Task Adaptation for Multi-Robot Manufacturing Systems with Large Language Models
An LLM-based central controller successfully reassigned tasks to a surviving robot in 20 of 20 failure trials, with 60% valid on the first attempt.
-
Get Experience from Practice: LLM Agents with Record & Replay
AgentRR is a proposed paradigm that records agent traces, generalizes them into multi-level experiences, and replays them under safety checks to make LLM agents cheaper, faster, and more reliable.
Discussion (0). Continue with ORCID to comment.