Skip to content

UrbanDS: A Graph-Guided LLM Multi-Agent System for Data-Intensive Urban Tasks

Jul 2026 · arXiv.org · Vol abs/2607.26724 · 0 citations · 22 references
Computer Science

TL;DR

This work proposes UrbanDS, a graph-guided LLM multi-agent system for data-intensive urban tasks, and constructs UrbanDS-Bench, an urban data science benchmark covering representative data analysis and modeling tasks.

Abstract

Large language model (LLM) agents have been widely applied in automating data science tasks. However, existing methods typically rely on a limited set of provided datasets, and they face challenges in data-intensive scenarios that require discovering and leveraging relevant information from large-scale and heterogeneous data repositories. Urban tasks are representative examples of such scenarios, as urban data are not only large-scale and multi-sourced, but also exhibit complex spatial, temporal, and semantic relationships. To address these challenges, we propose UrbanDS, a graph-guided LLM multi-agent system for data-intensive urban tasks. We first construct a unified dataset graph to organize reusable dataset skills and the relationships among datasets. Specifically, we develop a Data Profiling Agent that constructs a skill for each dataset. Moreover, a Relation Agent identifies relationships among datasets and integrates these relationships into the dataset graph. At runtime, a Planner Agent retrieves task-relevant datasets from the graph and generates execution plans. Multiple Execution Agents then perform data processing and analysis, while their execution progress and intermediate results are shared through a common memory. Finally, a Report Agent synthesizes the experimental logs into a report, which can be further refined based on user feedback. To systematically evaluate the capability of agents in handling data-intensive urban scenarios, we further construct UrbanDS-Bench, an urban data science benchmark covering representative data analysis and modeling tasks. Experiments on both general and urban benchmarks demonstrate that UrbanDS consistently outperforms existing data science agents on data-intensive tasks. Furthermore, UrbanDS has been deployed on the urban operations platform of Dongxihu District, Wuhan, demonstrating its effectiveness in real-world urban applications.

View source

Similar papers

Preprint Aug 2026

ForestBench: A Unified Graph Framework for Evaluating Multi-Agent Collaboration

This work introduces a generalizable evaluation framework that maps native MAS traces into a shared space of unified collaboration graphs, enabling different methods to be evaluated under the same representation, reference set, and metric panel.

Guo Chen, Ziwen Li, Reed Li et al. · 0 citations
#machine learning Preprint Sep 2026

GraphMAS: A Systematic Benchmark of Multi-Agent Coordination for Graph Learning

LLM-based multi-agent systems coordinate specialized reasoning through aggregation, interaction, and adaptive control, yet their potential for graph learning remains unexplored. Graph learning is a natural setting for such systems because useful evidence may arise from heterogeneous local, long-range, global structural...

Jia-Yi Yang, Yi-Fang Chen, Yuan-Fu Sun et al. · 0 citations
#artificial intelligence Preprint Sep 2026

CityPlanner: A Sandbox Agent for Executable Urban Planning

CityPlanner is proposed, a sandbox-agent framework for executable urban planning that consistently outperforms heuristic, task-specific RL, and general LLM-agent baselines and is verified on a real-world benchmark.

Wen-Tao Zhang, Jing-Yuan Wang, Ze-Tong Zhou et al. · 0 citations
Preprint Aug 2026

LifePlanner: Evaluating LLM Agents for Geo-spatial Planning with Social Media Data

Results show that failures mainly stem from incomplete evidence acquisition from such a large multimodal database, imprecise tool use and weak constraint integration rather than model size or reasoning length, suggesting that future progress requires effective grounded planning instead of scaling alone.

Zhen Dong, Yuning Peng, Yu-Tao Shi et al. · 0 citations
Book Open access Aug 2026

G-STAR: Graph-based Scheduling with Trace-driven Adaptive Routing for Industrial LLM-based Multi-Agent Systems

G-STAR is a general graph-based scheduling framework that formalizes complex MAS pipelines as attributed Directed Acyclic Graphs (DAGs) and develops an industry-grade orchestration stack with asynchronous execution, resilient serving, and audit-friendly artifacts, offering a practical solution for optimizing web-scale...

Jia-Bao Song, Yun-Sheng Xia, Bei-Bei Kong et al. · 0 citations

Related blog posts

Hugging Face Blog Oct 20, 2026

MPS in PyTorch 2.15

We’re on a journey to advance and democratize artificial intelligence through open source and open science.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.