STRATEGIC MULTI-AGENT SIMULATION

StarCraft Motion:
A Dataset for Agent Simulation in Adversarial and Partially Observable Scenarios

Yi-Chung Chen1, Mingyu Kim1, Ruqi Bai1, James Zachary Hare2, Jing Gao1, David I. Inouye1
1Purdue University
2DEVCOM Army Research Laboratory

NeurIPS 2026 · Evaluations & Datasets Track

Human strategies. Competing objectives. Incomplete information.

Ground truth, constant velocity, SMART, and HMART trajectories on StarCraft II terrain.
Simulating motion beyond local interactions. Observer units (blue–cyan) and opponents (red–orange) over 145 frames. Gray indicates traversable terrain; green crosses show initial intent targets. Color saturation decreases over time.
469,187simulation scenarios
64,327source human replays
1 s → 8 scontext → future rollout
3 viewsomniscient + both players

Abstract

Agent simulation aims to model the future behavior of interacting agents, but existing benchmarks have largely focused on structured domains such as autonomous driving. Adversarial and partially observable settings remain less explored, despite their importance for modeling strategic multi-agent behavior. To address this gap, we introduce StarCraft Motion, a large-scale dataset for agent simulation built from human StarCraft II replays. Our processing pipeline converts raw replays into standardized simulation scenarios by extracting continuous unit trajectories, deriving command-based unit-level intent labels, and aligning game states with player-specific fog-of-war observations. This enables direct study of behavior, intent, and opponent responses under competitive partial observability. As an initial study, we evaluate autoregressive simulation methods on StarCraft Motion and introduce HMART, a hierarchical baseline that extends SMART with learnable player-level query aggregation for efficient global-context modeling in large-agent-count scenarios. Experiments show that global context improves observer-unit simulation and intent prediction, while closed-loop fine-tuning further improves rollout quality. However, accurately capturing intent initiation and transitions remains difficult. We also find that opponent modeling from partial observations is substantially more challenging, and that additional global information can be misleading when it does not match the opponent's perspective. These results highlight StarCraft Motion as a useful dataset for studying scalable agent simulation in adversarial, partially observable environments.

A benchmark for competitive partial observability

StarCraft II combines coordinated armies, conflicting goals, and fog of war. StarCraft Motion turns human matches into standardized scenarios for studying how agents move, act, and respond to one another.

Aligned perspectives

Each replay is processed from an omniscient view and both player views, aligning complete trajectories with player-specific visibility and fog-of-war masks.

Behavior and intent

Continuous unit trajectories are paired with command-derived action labels, target information, map layers, unit attributes, and game context.

Interaction-focused sampling

Windows emphasize battles, scouting, retreats, and repositioning. Replay-level splits prevent overlap between windows from the same match; held-out maps support OOD evaluation.

362,075 train45,121 validation61,991 test
Distribution of player-controlled unit counts across scenarios.
Large, dynamic populations of player-controlled units.
Distribution of peak mutually visible unit counts.
Over 22% of scenarios contain more than 50 mutually visible units at their peak.

Two tasks, one observer's perspective

01 / OBSERVER-UNIT SIMULATION

How will our units react?

Generate future trajectories for the observer's own units from the observer's view. Opponent and neutral trajectories are supplied from logged ground truth.

02 / OPPONENT MODELING

What will the opponent do?

Generate opponent trajectories using the observer's partial information. The observer's own trajectories are supplied from the log; the opponent's hidden intent is unavailable.

These evaluations roll out the selected side under logged context; they do not simulate an entire game with both players acting freely.

HMART: efficient global context for many agents

Local interactions do not tell the whole story. HMART extends SMART with Global Query Aggregation, letting each unit access scene-level information through a small set of learnable tokens.

HMART architecture with temporal attention, map-agent attention, agent interaction, and Global Query Aggregation.
Global tokens attend to all observed units, then return the aggregated context to each unit. The global aggregation costs O(NK), with K much smaller than the number of units N.
Vocabulary of 2,048 motion tokens, colored by speed.
Motion vocabulary, colored by speed.

Motion as next-token prediction

A vocabulary of 2,048 motion tokens represents half-second trajectory clips. An autoregressive model samples tokens and feeds the decoded motion back into its context.

An auxiliary intent head predicts actions and targets for observer-owned units. CAT-K fine-tuning addresses covariate shift during closed-loop rollout.

Global context helps—but perspective matters

We evaluate 32 sampled rollouts per scenario. The realism meta-score combines kinematic, interaction, and map-alignment scores; minADE measures the best sampled trajectory's displacement error.

Observer-unit simulation

Observer-unit simulation results
MethodMeta ↑Kinematic ↑Interactive ↑Map ↑minADE ↓
Constant Velocity0.0170 ± 0.00000.0378 ± 0.00000.0000 ± 0.00000.0133 ± 0.00004.8443 ± 0.0000
Constant Velocity + Gaussian0.0190 ± 0.00000.0378 ± 0.00000.0000 ± 0.00000.0191 ± 0.00004.5272 ± 0.0000
SMART0.4677 ± 0.01710.1551 ± 0.00190.6022 ± 0.01960.6459 ± 0.03020.8460 ± 0.0057
HMART0.4690 ± 0.02190.1552 ± 0.00100.6077 ± 0.01780.6442 ± 0.04690.8439 ± 0.0211
SMART + CAT-K0.4802 ± 0.02270.1599 ± 0.00300.6189 ± 0.02090.6618 ± 0.04440.7967 ± 0.0101
HMART + CAT-K0.5000 ± 0.00370.1628 ± 0.00030.6357 ± 0.00380.7014 ± 0.00810.7731 ± 0.0119

HMART + CAT-K achieves the strongest results across all five metrics. Before CAT-K fine-tuning, SMART and HMART have similar closed-loop performance.

Opponent modeling

Opponent modeling results
MethodMeta ↑Kinematic ↑Interactive ↑Map ↑minADE ↓
Constant Velocity0.0175 ± 0.00000.0432 ± 0.00000.0000 ± 0.00000.0092 ± 0.00005.6727 ± 0.0000
Constant Velocity + Gaussian0.0215 ± 0.00000.0459 ± 0.00000.0000 ± 0.00000.0187 ± 0.00005.2354 ± 0.0000
SMART0.2344 ± 0.00330.1162 ± 0.00030.3298 ± 0.00360.2572 ± 0.00622.4441 ± 0.0265
HMART0.2392 ± 0.00760.1167 ± 0.00050.3521 ± 0.00890.2486 ± 0.01372.4804 ± 0.0430
SMART + CAT-K0.2726 ± 0.00450.1125 ± 0.00060.3803 ± 0.00570.3250 ± 0.00722.1966 ± 0.0306
HMART + CAT-K0.2577 ± 0.00900.1145 ± 0.00070.3865 ± 0.01150.2721 ± 0.01542.3168 ± 0.0505

More context is not always better. SMART + CAT-K leads on meta-score, map alignment, and minADE. Global information from the observer's view may not match what the opponent knows, suggesting a need for perspective-aligned representations.

Values and ± terms are reported as in the paper. Bold marks the best mean per metric within each task.

Intent remains a challenge

HMART reaches 0.847 average intent precision versus SMART's 0.811. CAT-K raises HMART's average recall from 0.393 to 0.405, while precision falls to 0.689—better rollout realism does not guarantee better intent prediction.

What changes when the scene changes?

The simulator can also roll out modified scenarios. Removing a pursued opponent or inserting a squad changes the generated response.

Observer trajectories before and after removing pursued opponents, marked with red crosses.
Removing the pursued opponent units causes the observer units to stop advancing.
Rollouts for the original scenario, an inserted opponent squad, and an inserted friendly squad.
The same initial scenario with no intervention, an inserted opponent squad, and an inserted friendly squad.

These are qualitative interventions, not measured counterfactual accuracy: the corresponding alternative outcomes are not observed in the replay data.

Resources

The full dataset is available on Hugging Face.

Citation

If you find our work useful, please consider citing:

@inproceedings{chen2026starcraftmotion,
  title = {{StarCraft Motion}: A Dataset for Agent Simulation in Adversarial and Partially Observable Scenarios},
  author = {Yi-Chung Chen and Mingyu Kim and Ruqi Bai and James Zachary Hare and Jing Gao and David I. Inouye},
  booktitle = {Advances in Neural Information Processing Systems},
  year = {2026},
  url = {https://inouye-lab.github.io/StarCraftMotion/}
}