Path Diffuser: Two-Stage Diffusion Simulator

• Path Diffuser is a map-conditioned, history-free two-stage diffusion simulator that generates realistic agent initializations and future trajectories using diffusion processes.
• It employs Differential Transformer and heterogeneous message passing to enhance agent-map interactions, reducing collisions and improving road compliance.
• By integrating a motion primitive-based Frenet prior, PD achieves diverse trajectory generation and increased robustness under out-of-distribution map conditions.

Searching arXiv for "Path Diffuser" and closely related diffusion planning/simulation papers to ground the article. Path Diffuser (PD) is a two-stage diffusion model for data-driven traffic simulation that generates agent pose initializations and their corresponding trajectories conditioned on the map, without requiring any historical context of agents’ trajectories (Lee et al., 29 Sep 2025). In the formulation given for autonomous-driving simulation, PD first samples an initial multi-agent scene—positions, headings, speeds, and types—and then generates future motion over a prediction horizon, while incorporating a motion primitive-based prior through Frenet-frame candidate trajectories to improve diversity and road compliance, particularly under out-of-distribution map geometries such as curved or perturbed roads (Lee et al., 29 Sep 2025). The method is presented as a response to a central limitation of prior learning-based simulators: many depend on logged trajectory histories or partially observed scene state, which constrains scalability, novelty, and robustness when only map information is available (Lee et al., 29 Sep 2025).

1. Definition and scope

In the usage established by the traffic-simulation paper, Path Diffuser refers specifically to a map-conditioned, history-free, two-stage diffusion simulator for autonomous-driving scenarios (Lee et al., 29 Sep 2025). Its stated objective is not merely trajectory forecasting or log replay, but generation of new traffic scenarios from map data alone, with the number of agents given as an input (Lee et al., 29 Sep 2025).

The first stage produces agent pose initialization. Each agent’s initial state is

$$\zeta_i = [x_i, y_i, \theta_i, v_i, c_i] \in \mathbb{R}^5,$$

where $x_i,y_i$ are position, $\theta_i\in[-\pi,\pi)$ is heading, $v_i\in\mathbb{R}_+$ is initial speed, and $c_i\in\mathbb{Z}_+$ is agent type (Lee et al., 29 Sep 2025). The full initialization is

$$x = \{\zeta_1,\dots,\zeta_N\} \in \mathbb{R}^{N\times 5}.$$

The second stage generates future trajectories

$T_i = \{(x,y)_{i,1},\dots,(x,y)_{i,H}\},$

with the joint trajectory

$$T = \{T_1,\dots,T_N\} \in \mathbb{R}^{N\times H\times 2}$$

over the prediction horizon $H$ (Lee et al., 29 Sep 2025).

This definition is narrower than several other arXiv usages of related terminology. “Diffuser” has also been used for multi-hop attention diffusion in efficient Transformers (Feng et al., 2022), and “path-dependent diffusion” appears in wave transport and localization theory (Yamilov et al., 2013). A plausible implication is that the term “Path Diffuser” is not intrinsically tied to a single research area; in the traffic-simulation context, however, it denotes the specific simulator introduced in “Path Diffuser: Diffusion Model for Data-Driven Traffic Simulator” (Lee et al., 29 Sep 2025).

2. Problem formulation and motivation

The paper frames PD around a practical bottleneck in learning-based traffic simulation: many existing systems require agents’ past trajectories and pose information in addition to map data, which may not be available for all agents on the road (Lee et al., 29 Sep 2025). The stated consequence is that history-dependent generators often struggle to create genuinely new scenarios and can produce unrealistic trajectories that deviate from drivable areas, especially in out-of-distribution map scenes such as curved roads (Lee et al., 29 Sep 2025).

PD addresses two coupled subproblems. The first is scene initialization: placing agents in realistic on-road configurations with plausible headings, speeds, and types. The second is motion generation: evolving those initialized agents into realistic multi-agent futures without access to their past tracks (Lee et al., 29 Sep 2025). The paper emphasizes that realistic simulation should not simply replay historical behavior, and that dependence on logged histories reduces both diversity and scalability (Lee et al., 29 Sep 2025).

The map $M$ is represented in vectorized form rather than as a raster image. The paper states that the map encoder follows prior vectorized forecasting methods and encodes point-level features such as normalized location, heading, lane curvature, and pairwise connections (Lee et al., 29 Sep 2025). Conditioning therefore operates directly on structured lane geometry.

This places PD within the broader diffusion-for-decision-making literature, but with a distinct emphasis. Trajectory-diffusion planners such as Diffuser generate horizon-level trajectories by denoising a full sequence jointly (Feng et al., 2022); PD adopts diffusion generation but targets traffic simulation from map-only conditioning rather than planning from agent history or returns (Lee et al., 29 Sep 2025). This suggests that PD can be interpreted as a generative simulator rather than a forecasting model in the usual motion-prediction sense.

3. Two-stage diffusion architecture

PD is explicitly organized as a two-stage framework (Lee et al., 29 Sep 2025). The stages are trained separately and connected sequentially at inference time.

In stage 1, the initialization denoiser is written as

$x_i,y_i$0

where $x_i,y_i$1 is the noisy scene initialization, $x_i,y_i$2 is the vectorized map, and $x_i,y_i$3 is the diffusion timestep (Lee et al., 29 Sep 2025). This model captures both map-agent interaction and agent-agent interaction. The paper studies architectural choices for these interactions, including Differential Transformer (DIFFT) for map-agent attention and centralized/decentralized behavior masking for agent-agent attention (Lee et al., 29 Sep 2025).

In stage 2, the trajectory generator operates in a low-dimensional latent trajectory space. The denoiser is

$x_i,y_i$4

where $x_i,y_i$5 is the noisy latent trajectory, $x_i,y_i$6 is the initialization, $x_i,y_i$7 is the latent representation of Frenet candidate trajectories, and $x_i,y_i$8 is the diffusion timestep (Lee et al., 29 Sep 2025). Rather than diffusing directly over Cartesian trajectories $x_i,y_i$9, the model uses Principal Component Analysis (PCA) in a local coordinate frame to reduce dimensionality and reduce variance due to map scale, position, and orientation (Lee et al., 29 Sep 2025).

The trajectory model includes a Heterogeneous Message Passing (HMP) module that handles agent-agent, agent-map, and candidate-agent interactions (Lee et al., 29 Sep 2025). In the paper’s description, the architecture alternates cross-attention between agents and map, self-attention among agents, and candidate-to-agent attention. This makes candidate trajectories part of the denoising process rather than a post hoc correction (Lee et al., 29 Sep 2025).

A notable design principle is that stage 2 consumes either generated or ground-truth initialization. The paper evaluates the trajectory model independently with ground-truth initial states and jointly in end-to-end mode where stage-1 samples condition stage 2 (Lee et al., 29 Sep 2025). This separation isolates the contributions of initialization realism and trajectory realism.

4. Diffusion formulation and inference

Both stages use DDPM-style Gaussian diffusion (Lee et al., 29 Sep 2025). For initialization, the forward process is

$\theta_i\in[-\pi,\pi)$0

and for trajectories,

$\theta_i\in[-\pi,\pi)$1

The corresponding closed-form noising distributions are

$\theta_i\in[-\pi,\pi)$2

$\theta_i\in[-\pi,\pi)$3

with

$\theta_i\in[-\pi,\pi)$4

Using reparameterization,

$\theta_i\in[-\pi,\pi)$5

where $\theta_i\in[-\pi,\pi)$6 (Lee et al., 29 Sep 2025).

The reverse models are Gaussian: $\theta_i\in[-\pi,\pi)$7

$\theta_i\in[-\pi,\pi)$8

with denoisers trained by standard noise-prediction losses: $\theta_i\in[-\pi,\pi)$9

$v_i\in\mathbb{R}_+$0

These objectives are explicitly given for the two stages (Lee et al., 29 Sep 2025).

Sampling is sequential. For initialization, the process starts from

$v_i\in\mathbb{R}_+$1

and iteratively denoises from $v_i\in\mathbb{R}_+$2 (Lee et al., 29 Sep 2025). Trajectory sampling follows the same general procedure with the trajectory denoiser. Under out-of-distribution map perturbations, the paper states that guided sampling is used to align predicted trajectories with Frenet candidates by selecting the closest candidate at each sampling step, although the exact guidance formula is not specified (Lee et al., 29 Sep 2025).

5. Motion primitive prior and Frenet candidates

One of PD’s defining features is its motion primitive-based prior through Frenet-frame candidate trajectories (Lee et al., 29 Sep 2025). The motivation is explicit: map-only latent trajectory diffusion tends to produce straight-line motion that ignores road curvature, whereas Frenet candidates remain lane-aligned even on curved roads or perturbed maps (Lee et al., 29 Sep 2025).

The Frenet representation uses arc-length $v_i\in\mathbb{R}_+$3 along a reference lane $v_i\in\mathbb{R}_+$4 and lateral offset $v_i\in\mathbb{R}_+$5. Candidate trajectories are parameterized as

$v_i\in\mathbb{R}_+$6

where $v_i\in\mathbb{R}_+$7 are initial Frenet coordinates, $v_i\in\mathbb{R}_+$8 is assumed constant longitudinal velocity, and $v_i\in\mathbb{R}_+$9 are quintic lateral coefficients (Lee et al., 29 Sep 2025). The paper states that constant longitudinal velocity is used to efficiently explore a grid of initial speeds and lateral offsets.

Candidate generation proceeds by identifying all lanes near or containing the initial position, converting the initial state to Frenet coordinates, enumerating a grid over initial velocities $c_i\in\mathbb{Z}_+$0 and lateral deviations $c_i\in\mathbb{Z}_+$1, generating trajectories in Frenet space, and converting them back to Cartesian coordinates with Fren2Cart (Lee et al., 29 Sep 2025). If an initial position is close to multiple lanes, all relevant lanes are included (Lee et al., 29 Sep 2025). This is significant at lane ambiguities and intersections.

The candidate set functions as a prior in three ways. First, it conditions the trajectory denoiser. Second, each noisy latent trajectory attends to its own candidate set during denoising. Third, under map perturbation, the candidates support guided sampling by aligning the trajectory to the closest road-consistent candidate (Lee et al., 29 Sep 2025). The paper does not define a hard projection or candidate-matching loss, so the role of the prior is conditioning rather than exact constraint enforcement.

A plausible implication is that PD trades hard kinematic guarantees for a strong geometric prior. The paper itself frames this as beneficial for diversity and road compliance, especially on out-of-distribution maps (Lee et al., 29 Sep 2025).

6. Interaction modeling and architectural ablations

The initialization stage introduces two prominent architectural mechanisms: Differential Transformer and centralized/decentralized behavior masking (Lee et al., 29 Sep 2025).

DIFFT replaces standard multi-head attention for map-agent interaction. The paper motivates this with an analysis of attention variance: standard attention on dense map tokens exhibits very low variance across diffusion steps, suggesting indiscriminate attention, whereas DIFFT suppresses attention noise and increases locality and semantic relevance (Lee et al., 29 Sep 2025). The reported consequence is better map compliance and fewer collisions in initialized scenes (Lee et al., 29 Sep 2025).

Agent-agent interaction is regularized through centralized and decentralized behavior (CDB). During training, a Bernoulli variable selects between a full attention mask $c_i\in\mathbb{Z}_+$2 and an identity mask $c_i\in\mathbb{Z}_+$3, encouraging a mixture of global coordination and decentralized behavior (Lee et al., 29 Sep 2025). Because the agent set is unordered, PD also enforces a canonical ordering—left-to-right, top-to-bottom—with sinusoidal positional embeddings to reduce permutation ambiguity (Lee et al., 29 Sep 2025).

For trajectory generation, the HMP module models heterogeneous interactions among agents, map elements, and candidate trajectories (Lee et al., 29 Sep 2025). The paper does not provide explicit message-passing equations, but its description makes clear that candidate-to-agent and map-to-agent interactions are structurally integrated into the denoiser.

The ablation results distinguish these contributions. On initialization, the baseline with standard multi-head attention reports collision rate $c_i\in\mathbb{Z}_+$4, while PD reports $c_i\in\mathbb{Z}_+$5; the paper attributes a substantial part of this reduction to DIFFT (Lee et al., 29 Sep 2025). On trajectory generation, PD without motion primitives performs similarly in-distribution but degrades more under perturbed maps, indicating that Frenet candidates matter mainly for robustness and road compliance rather than ordinary in-distribution forecasting similarity (Lee et al., 29 Sep 2025).

7. Evaluation, results, and limitations

PD is evaluated on the Argoverse 2 Motion Forecasting Dataset (Lee et al., 29 Sep 2025). The paper reports that it outperforms baseline methods by 1.92x on distribution metrics, 1.14x on common-sense metrics, and 1.62x on road compliance from adversarial benchmarks (Lee et al., 29 Sep 2025).

Initialization is evaluated using common-sense metrics—collision rate, nearest-edge distance, and off-road rate—and Jensen-Shannon divergence over nearest-agent distance, local density, lateral deviation, angular deviation, and speed (Lee et al., 29 Sep 2025). In the main initialization table, PD achieves collision rate $c_i\in\mathbb{Z}_+$6 compared with $c_i\in\mathbb{Z}_+$7 for the multi-head-attention baseline, with the same nearest-edge value $c_i\in\mathbb{Z}_+$8 m as the strongest ablated version (Lee et al., 29 Sep 2025). Qualitatively, the paper states that standard attention can place agents off-road or with headings misaligned from lanes, whereas PD produces better map compliance and fewer collisions (Lee et al., 29 Sep 2025).

Trajectory generation is evaluated with actor collision rate, off-road rate, average and final lateral deviation, and also forecasting-style metrics FDE, ADE, and miss rate (Lee et al., 29 Sep 2025). On perturbed maps, PD improves final lateral deviation relative to both vanilla diffusion and PD without primitives:

• vanilla diffusion: $c_i\in\mathbb{Z}_+$9 m,
• PD without primitives: $$x = \{\zeta_1,\dots,\zeta_N\} \in \mathbb{R}^{N\times 5}.$$0 m,
• PD: $$x = \{\zeta_1,\dots,\zeta_N\} \in \mathbb{R}^{N\times 5}.$$1 m (Lee et al., 29 Sep 2025).

The paper interprets this as evidence that the Frenet prior specifically improves road compliance under out-of-distribution geometry (Lee et al., 29 Sep 2025). By contrast, in forecasting-style ADE/FDE/MR tables, the version without primitives can be slightly closer to ground truth. The paper argues that this does not contradict the value of the full method, because generation quality is not identical to reconstruction accuracy and the primitives increase stochastic diversity (Lee et al., 29 Sep 2025).

PD’s limitations are also explicitly stated. The model is restricted to a fixed 6-second horizon because of PCA-based compression (Lee et al., 29 Sep 2025). It is evaluated only in open loop, so closed-loop traffic evolution and error accumulation are not studied (Lee et al., 29 Sep 2025). Training remains computationally intensive—approximately 10 hours—despite dimensionality reduction (Lee et al., 29 Sep 2025). End-to-end use requires two separate models, and Frenet candidates depend on a predefined grid (Lee et al., 29 Sep 2025). The paper also notes that richer context such as traffic lights, weather, and time of day is absent from the current conditioning scheme (Lee et al., 29 Sep 2025).

These limitations distinguish PD from broader diffusion decision-making frameworks that target latent adaptation or control under partial observability, such as Ada-Diffuser (Feng et al., 15 May 2026). That comparison should not be overstated: PD is a map-conditioned traffic simulator, whereas Ada-Diffuser addresses latent-variable decision-making. Still, the contrast suggests that PD’s contribution is strongest on history-free traffic scenario generation rather than general adaptive planning (Lee et al., 29 Sep 2025).

In summary, Path Diffuser designates a map-only, two-stage diffusion simulator in which initialization diffusion and trajectory diffusion are linked by a Frenet motion-prior mechanism (Lee et al., 29 Sep 2025). Its principal contribution is to show that traffic scenarios can be generated without past agent trajectories while improving realism, distributional fidelity, and robustness to perturbed road geometry.