Participatory urban sensing leverages human mobility for large-scale urban data collection, yet existing methods typically rely on centralized optimization and assume homogeneous participants, resulting in rigid assignments that overlook personal preferences and heterogeneous urban contexts. We propose MAPUS, an LLM-based multi-agent framework for personalized and fair participatory urban sensing. In our framework, participants are modeled as autonomous agents with individual profiles and schedules, while a coordinator agent performs fairness-aware selection and refines sensing routes through language-based negotiation. Experiments on real-world datasets show that MAPUS achieves competitive sensing coverage while substantially improving participant satisfaction and fairness, promoting more human-centric and sustainable urban sensing systems.
Figures & tables
Figure 1: Comparison of paradigms for PUS problem. (a) Conventional centralized PUS relies on simplified assumptions about participants and sensing regions. (b) MAPUS models participants as autonomous agents with personalized preferences while incorporating heterogeneous urban context. (c) AgentSense ( Guo et al., 2025b ) uses LLM agents as workflow components to iteratively refine a baseline PUS solution under disturbances. (d) MAPUS adopts a coordinator-and-participants multi-agent paradigm, enabling decentralized, personalized, and fairness-aware planning.
Figure 2: Overview of proposed MAPUS. It operates in three stages: (a) task dispatch and preference-aware route generation, (b) fairness-aware participant selection, and (c) negotiation-based route refinement.
Dataset
Scale
# Regions
N
B
H (min)
T-Drive
Small
64 (8 ×8 )
20
40
120
Medium
256 (16 ×16 )
40
60
240
Large
1024 (32 ×32 )
60
100
360
Grab-Posisi
Small
32 (8 × 4)
15
40
40
Medium
128 (16 ×8 )
30
60
80
Large
512 (32 ×16 )
45
100
160
Table 1: Experimental configurations under different scales for the two datasets. #Regions denotes the number of spatial sensing regions, N the number of candidate participants, B the total budget, and H the temporal span horizon of the sensing task.
Method
Task Scales
Small
Medium
Large
Coverage
PSS
Coverage
PSS
Coverage
PSS
RN
4.557 ± 8.38e-3
0.632 ± 9.60e-5
4.626 ± 1.46e-2
0.605 ± 4.65e-5
4.974 ± 3.68e-2
0.594 ± 3.10e-4
TVPG
4.563 ± 1.34e-2
0.634 ± 9.68e-5
4.753 ± 2.27e-2
0.610 ± 6.62e-5
5.067 ± 1.34e-2
0.590 ± 2.14e-4
TCPG
4.594 ± 7.31e-3
0.631 ± 4.58e-5
5.084 ± 1.13e-2
0.621 ± 3.48e-5
5.043 ± 1.71e-2
0.602 ± 1.17e-4
MSA
4.662 ± 5.60e-3
0.630 ± 3.60e-5
5.065 ± 9.24e-3
0.622 ± 8.63e-5
5.131 ± 1.70e-2
0.598 ± 1.80e-4
Table 2: Overall performance comparison on the T-Drive dataset (20 task instances per scale). Values denote averages, with variances shown in small numbers. The largest variance per column is highlighted in red.
Method
Task Scales
Small
Medium
Large
Coverage
PSS
Coverage
PSS
Coverage
PSS
RN
4.236 ± 4.23e-3
0.727 ± 4.29e-5
4.710 ± 1.18e-2
0.696 ± 6.30e-5
5.399 ± 1.11e-2
0.648 ± 5.13e-5
TVPG
4.342 ± 4.10e-3
0.714 ± 4.59e-5
4.737 ± 1.32e-2
0.695 ± 2.04e-4
5.406 ± 2.62e-2
0.640 ± 5.74e-5
TCPG
4.232 ± 2.83e-3
0.730 ± 2.86e-5
4.806 ± 1.14e-2
0.703 ± 6.40e-5
5.587 ± 8.39e-3
0.658 ± 3.56e-5
MSA
4.372 ± 2.56e-3
0.744 ± 3.54e-5
4.900 ± 4.15e-3
0.699 ± 9.28e-5
5.586 ± 8.20e-3
0.655 ± 4.07e-5
Table 3: Overall performance comparison on the Grab-Posisi dataset (20 task instances per scale). Values denote averages, with variances shown in small numbers. The largest variance per column is highlighted in red.
Figure 3: Ablation study on the T-Drive dataset. We compare four variants of MAPUS across three different settings: w/o PRG, w/o FPS, w/o NRR, and the full model. Top: coverage utility. Bottom: path satisfaction score (PSS).
Metric
T-Drive
Grab-Posisi
Before Nego.
After Nego.
Before Nego.
After Nego.
Avg. Overlap (%)
3.482
1.267
5.418
3.843
Avg. Coverage
4.977
5.115
4.770
4.890
Avg. Entropy
2.377
2.477
2.498
2.584
Avg. Count
149.3
149.3
132.1
132.1
Avg. PSS
0.880
0.875
0.838
0.834
Table 4: Effect of negotiation-based route refinement under the Medium setting (20 tasks). We report overlap, coverage utility, entropy, covered count, and PSS before and after negotiation on T-Drive and Grab-Posisi.
Figure 4: Fairness-aware participant selection analysis on the T-Drive dataset under the Medium setting. (a) Per-worker selection counts over 60 tasks, (b) CDF of selection counts, (c) data coverage utility, and (d) path satisfaction score.
Figure 6: Prompt template used for LLM-based tie-breaking in fairness-aware participant selection..
Figure 7: Prompt for the coordinator agent in the negotiation process.
Figure 8: Prompt for the participant agent in the negotiation process.
Figure 9: Visualization of land-use and crime distribution in task regions. (a) Land-use distribution in the T-Drive task area derived from aggregated POI categories. (b) Spatial distribution of crime counts in the T-Drive task area aggregated over grid cells. (c) Land-use distribution in the Grab-Posisi task area.
Figure 10: Template used to construct synthetic participant profiles.
Figure 11: Performance trade-offs of different base LLMs under the Medium setting (20 tasks). The x-axis shows path satisfaction score (PSS) and the y-axis shows coverage utility. Bubble size indicates runtime. Results are shown for T-Drive (left) and Grab-Posisi (right).
Method
Avg. runtime on T-Drive (s)
Avg. runtime on Grab-Posisi (s)
Small
Medium
Large
Small
Medium
Large
RN
6.754e-4
4.453e-4
1.142e-3
2.999e-4
9.423e-4
1.568e-3
TVPG
0.010
0.048
0.472
0.0039
0.0212
0.266
TCPG
0.012
0.112
1.155
0.0044
0.0394
0.388
MSA
0.040
0.077
0.217
0.0319
0.0616
0.157
MSAGI
0.089
0.322
2.442
0.0509
0.168
1.502
Appendix
Table 5: Runtime comparison across datasets and task scales. The main values denote the average runtime (seconds), and the lower-right numbers indicate the variance across 20 task instances.
Figure 12: Case studies of route adaptation under dynamic disturbances. (a) A traffic accident causing grid [5, 2] blockage in the T-Drive dataset. (b) A high-priority data collection task in grid [14, 4] from the Grab-Posisi dataset. In each case, the coordinator agent (CA) broadcasts dynamic information to participant agents (PAs). PAs evaluate whether their routes are affected and adjust accordingly if necessary. We report the coverage utility and path satisfaction score for the initial and refined solutions, with the areas modified in response to the dynamic disturbances highlighted by red arrows.
The Hong Kong University of Science and Technology (Guangzhou) Guangzhou, China · University of Washington Seattle, USA · Chang’an University Xi’an, China +1