SRefiner: Soft-Braid Trajectory Refinement

• SRefiner is a topology-aware, multi-iteration refinement framework that improves multi-agent trajectory predictions by modeling continuous soft intersections.
• It employs soft-braid attention by augmenting cross-attention with motion dynamics and lane features to capture nuanced spatio-temporal interactions.
• Empirical evaluations show state-of-the-art performance with reduced endpoint errors and efficient convergence over iterative updates on autonomous driving benchmarks.

to=arxiv_search.search ุ้นบาท json {"^^^^^^^^2query2 OR \2^^^^^^^^"SRefiner: Soft-Braid Attention for Multi-Agent Trajectory Refinement\"", "max_results": 5, "sort_by": "submittedDate", "sort_order": "descending"} to=arxiv_search.search 】【。】【”】【json {"^^^^^^^^2query2 trajectory prediction braid topology arXiv QCNet SmartRefine DCMS R-Pred MTR++", "max_results": ^^^^2(Xiao et al., 6 Jul 2025) OR \2query2^^^^, "sort_by": "relevance", "sort_order": "descending"} Soft-Braid Refiner, or SRefiner, is a topology-aware, multi-iteration refinement framework for multi-agent trajectory prediction in autonomous driving. It takes initially predicted multi-agent futures and refines them into more accurate joint trajectories by explicitly modeling spatio-temporal relationships among agents and between agents and lanes. The method is inspired by braid theory, but replaces hard crossings with continuous, state-conditioned “soft intersections,” and uses these structures to guide attention through Soft-Braid Attention. In the reported formulation, SRefiner operates as a residual refiner,

PRESERVED_PLACEHOLDER_^^^^2query2^^^^

where PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^ denotes baseline multi-modal futures and $L$ denotes vectorized HD map lanes (&&&^^^^2query2^^^^&&&).

^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^. Problem setting and motivation

SRefiner is defined in the setting of multi-agent trajectory prediction and refinement. Historical agent states are given as $X \in \mathbb{R}^{N \times T_- \times 2}$ together with vectorized HD map lanes $L$. A baseline predictor first produces $K$-mode futures $$Y_0 \in \mathbb{R}^{K \times N \times T_+ \times 2}$$, and the refinement stage then seeks a more accurate joint prediction by exploiting structured interactions among agents and between agents and lanes (&&&^^^^2query2^^^^&&&).

The stated motivation is that purely latent feature interactions often fail to respect structured traffic constraints such as yielding and lane-keeping, and can fail to distinguish logically correlated but non-crossing motions. Prior refinement approaches listed in the formulation—DCMS, QCNet, R-Pred, SmartRefine, and MTR++—primarily learn implicit interactions, while braid-inspired methods such as BeTop are described as focusing only on hard crossings and ignoring temporal dynamics and non-crossing interactions (&&&^^^^2query2^^^^&&&).

Within that framing, SRefiner makes three explicit contributions. It introduces soft-braid topology, which encodes spatio-temporal relationships at “soft intersection points” derived from proximity over time and motion states. It designs Soft-Braid Attention for both trajectory–trajectory and trajectory–lane interactions by injecting topology features into cross-attention keys and values while restricting neighborhoods by distance. It also builds a multi-iteration refiner that progressively updates topology from refined trajectories and reports state-of-the-art improvements across baselines and datasets with favorable latency (&&&^^^^2query2^^^^&&&).

A common misconception is that topology-aware refinement in traffic must be tied to binary intersection logic. In SRefiner, topology is continuous rather than binary, and it remains operative in non-crossing but logically coupled cases such as yielding without geometric intersection. This suggests that the method treats topology less as a combinatorial crossing label and more as a state-conditioned relational descriptor over future motion.

2. Soft-braid topology

The method draws inspiration from braid theory. A braid is given as a tuple $f=(f_1,\dots,f_n)$ with strands $f_i: I \to \mathbb{R}^2 \times I$, $I=[0,1]$, embedded in PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2query2^^^^ and monotonically increasing in PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2(Xiao et al., 6 Jul 2025) OR \2^^^^. In the traffic interpretation, trajectories PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \22^^^^ become strands over PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^3 (&&&^^^^2query2^^^^&&&).

For context, the paper presents a hard-crossing indicator,

PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^4

where PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^5 is a vehicle-width threshold. This binary relation permits attention only between crossing agents, but, as described in the source, ignores how they interact and any non-crossing yet correlated behaviors (&&&^^^^2query2^^^^&&&).

SRefiner replaces this with a soft-braid topological structure. For trajectories PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^6 and PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^7, the soft intersection is defined by the closest points at the same time:

PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^8

From these points it derives spatial features

PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^9

The construction is then expressed in per-agent local frames. For agent $L$^^^^2query2^^^^, the origin $L$^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^ is the end of its history in the global frame and heading $L$2 is its orientation there. A global trajectory $L$3 is transformed to the local frame of $L$4 as

$L$5

The resulting trajectory–trajectory soft-braid topology features are

$L$6

with the symmetric counterpart

$L$7

SRefiner extends the same logic to trajectory–lane interactions. For a lane centerline polyline $L$8, the closest waypoint on $L$9 to $X \in \mathbb{R}^{N \times T_- \times 2}$^^^^2query2^^^^ occurs at

$X \in \mathbb{R}^{N \times T_- \times 2}$^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^

with

$X \in \mathbb{R}^{N \times T_- \times 2}$2

and the soft-braid lane feature

$X \in \mathbb{R}^{N \times T_- \times 2}$3

Interactions are restricted to local neighborhoods:

$X \in \mathbb{R}^{N \times T_- \times 2}$4

and

$X \in \mathbb{R}^{N \times T_- \times 2}$5

The source characterizes these soft-braid features as capturing “how” agents relate through relative positions, headings, and motion states, including non-crossing but logically coupled scenarios such as yielding without intersection (&&&^^^^2query2^^^^&&&).

3. Soft-Braid Attention

Soft-Braid Attention is the core mechanism that injects topology into attention. Let $X \in \mathbb{R}^{N \times T_- \times 2}$6 denote per-agent embeddings for each mode, with $X \in \mathbb{R}^{N \times T_- \times 2}$7 for agent $X \in \mathbb{R}^{N \times T_- \times 2}$8. Trajectory–trajectory Soft-Braid Attention uses multi-head cross-attention with topology-aware keys and values:

$X \in \mathbb{R}^{N \times T_- \times 2}$9

where $L$^^^^2query2^^^^ is a 3-layer MLP mapping topology features to $L$^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^-dimensional embeddings (&&&^^^^2query2^^^^&&&).

Trajectory–lane Soft-Braid Attention uses an analogous construction:

$L$2

where $L$3 denotes lane features expressed in the local frame of agent $L$4.

The attention mechanism itself is standard scaled dot-product attention over spatially masked neighborhoods. For head $L$5 with projections $L$6, $L$7, and $L$8, the score and weight are

$L$9

with per-head output

$K$^^^^2query2^^^^

Heads are concatenated and linearly projected to update $K$^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^. The lane counterpart replaces $K$2 by $K$3 and masks by $K$4 (&&&^^^^2query2^^^^&&&).

The paper distinguishes this mechanism from standard attention in three ways. First, it is topology-aware because keys and values are augmented with soft-braid features derived at soft intersections. Second, it is proximity-masked because only agents or lanes within $K$5 or $K$6 contribute. Third, it is spatio-temporally coupled because the soft intersections select $K$7 or $K$8 by minimizing distance over time. A further distinction is progressive topology update: soft-braid features are recomputed after each refinement iteration, so attention is guided by the latest refined topology rather than by a fixed prior (&&&^^^^2query2^^^^&&&).

The trajectory–lane component is not an auxiliary add-on but a second topology-aware interaction channel. Lane centerlines are vectorized and expressed in agent-local coordinates, then concatenated with $K$9. The final per-agent embedding integrates both trajectory–trajectory and trajectory–lane outputs.

4. Iterative refinement architecture and optimization

SRefiner is explicitly multi-iteration. Initialization is

$$Y_0 \in \mathbb{R}^{K \times N \times T_+ \times 2}$$^^^^2query2^^^^

where $$Y_0 \in \mathbb{R}^{K \times N \times T_+ \times 2}$$^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^ is the position encoding of $$Y_0 \in \mathbb{R}^{K \times N \times T_+ \times 2}$$2 across time and $$Y_0 \in \mathbb{R}^{K \times N \times T_+ \times 2}$$3 are per-agent local-frame anchors. At iteration $$Y_0 \in \mathbb{R}^{K \times N \times T_+ \times 2}$$4, soft-braid topology is first recomputed from the most recent trajectories,

$$Y_0 \in \mathbb{R}^{K \times N \times T_+ \times 2}$$5

where $$Y_0 \in \mathbb{R}^{K \times N \times T_+ \times 2}$$6 collects $$Y_0 \in \mathbb{R}^{K \times N \times T_+ \times 2}$$7 and $$Y_0 \in \mathbb{R}^{K \times N \times T_+ \times 2}$$8 collects $$Y_0 \in \mathbb{R}^{K \times N \times T_+ \times 2}$$9. Soft-Braid Attention is then applied:

$f=(f_1,\dots,f_n)$^^^^2query2^^^^

followed by residual trajectory update,

$f=(f_1,\dots,f_n)$^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^

The default number of iterations is $f=(f_1,\dots,f_n)$2; increasing beyond $f=(f_1,\dots,f_n)$3 is reported to yield negligible gains but higher cost, and refinement is stated to converge within $f=(f_1,\dots,f_n)$4 under the reported settings (&&&^^^^2query2^^^^&&&).

The model architecture comprises a trajectory encoder, topology encoders, a lane encoder, two attention blocks, and a refinement head. The trajectory encoder maps $f=(f_1,\dots,f_n)$5 to $f=(f_1,\dots,f_n)$6. Separate MLPs encode $f=(f_1,\dots,f_n)$7 and $f=(f_1,\dots,f_n)$8 to $f=(f_1,\dots,f_n)$9 dimensions. The refinement head is an MLP producing trajectory offsets whose residual sum with $f_i: I \to \mathbb{R}^2 \times I$^^^^2query2^^^^ yields $f_i: I \to \mathbb{R}^2 \times I$^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^. The outputs are refined $f_i: I \to \mathbb{R}^2 \times I$2-mode trajectories $f_i: I \to \mathbb{R}^2 \times I$3. Reported hyperparameters are embedding dimension $f_i: I \to \mathbb{R}^2 \times I$4, iterations $f_i: I \to \mathbb{R}^2 \times I$5, neighborhood radii $f_i: I \to \mathbb{R}^2 \times I$6 and $f_i: I \to \mathbb{R}^2 \times I$7, with standard transformer-style projections for MHCA and no explicit specification of the number of heads (&&&^^^^2query2^^^^&&&).

Training uses joint winner-takes-all across modes for multi-agent worlds:

$f_i: I \to \mathbb{R}^2 \times I$8

A Huber loss is applied on the selected mode at each iteration,

$f_i: I \to \mathbb{R}^2 \times I$9

and the final objective averages over iterations:

$I=[0,1]$^^^^2query2^^^^

Optimization details are specified as 64 epochs on RTX 3^^^^2query2\2query2^^^^, batch size ^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^6, AdamW, cosine LR schedule, and weight decay $I=[0,1]$^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^. The initial learning rate is $I=[0,1]$2 for Argoverse v2 and $I=[0,1]$3 for INTERACTION (&&&^^^^2query2^^^^&&&).

5. Empirical performance and ablation results

The evaluation is conducted on Argoverse v2 and INTERACTION. Argoverse v2 is used at ^^^^2(Xiao et al., 6 Jul 2025) OR \2query2^^^^ Hz for long-term forecasting with $I=[0,1]$4 and $I=[0,1]$5, and metrics are avgMinFDE, avgMinADE, and actorMR. INTERACTION is used at ^^^^2(Xiao et al., 6 Jul 2025) OR \2query2^^^^ Hz for short-term forecasting with $I=[0,1]$6 and $I=[0,1]$7, and metrics are minJointFDE, minJointADE, and minJointMR. Evaluated baselines are AutoBots, FJMP, Forecast-MAE, and HPNet (&&&^^^^2query2^^^^&&&).

Dataset	Temporal setup	Metrics
Argoverse v2	^^^^2(Xiao et al., 6 Jul 2025) OR \2query2^^^^ Hz; $I=[0,1]$8, $I=[0,1]$9	avgMinFDE, avgMinADE, actorMR
INTERACTION	^^^^2(Xiao et al., 6 Jul 2025) OR \2query2^^^^ Hz; PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2query2query2^^^^, PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2query2(Xiao et al., 6 Jul 2025) OR \2^^^^	minJointFDE, minJointADE, minJointMR

Selected test-set improvements are reported directly. On Argoverse v2, FJMP improves from avgMinFDE PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2query22^^^^ to PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2query2^^^^3 (PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2query2^^^^4), avgMinADE PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2query2^^^^5 to PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2query2^^^^6 (PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2query2^^^^7), and actorMR PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2query2^^^^8 to PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2query2^^^^9 (PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2(Xiao et al., 6 Jul 2025) OR \2query2^^^^). Forecast-MAE improves from avgMinFDE PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2(Xiao et al., 6 Jul 2025) OR \2(Xiao et al., 6 Jul 2025) OR \2^^^^ to PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2(Xiao et al., 6 Jul 2025) OR \22^^^^ (PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2(Xiao et al., 6 Jul 2025) OR \2^^^^3), avgMinADE PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2(Xiao et al., 6 Jul 2025) OR \2^^^^4 to PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2(Xiao et al., 6 Jul 2025) OR \2^^^^5 (PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2(Xiao et al., 6 Jul 2025) OR \2^^^^6), and actorMR PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2(Xiao et al., 6 Jul 2025) OR \2^^^^7 to PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2(Xiao et al., 6 Jul 2025) OR \2^^^^8 (PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2(Xiao et al., 6 Jul 2025) OR \2^^^^9). On INTERACTION, AutoBots improves from minJointFDE PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \22query2^^^^ to PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \22(Xiao et al., 6 Jul 2025) OR \2^^^^ (PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \222^^^^), minJointADE PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \22^^^^3 to PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \22^^^^4 (PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \22^^^^5), and minJointMR PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \22^^^^6 to PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \22^^^^7 (PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \22^^^^8). FJMP improves from minJointFDE PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \22^^^^9 to PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2max_results2query2^^^^ (PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2max_results2(Xiao et al., 6 Jul 2025) OR \2^^^^), minJointADE PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^32 to PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^33 (PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^34), and minJointMR PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^35 to PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^36 (PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^37). HPNet improves from minJointFDE PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^38 to PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^39 (PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2sort_by2query2^^^^), minJointADE PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2sort_by2(Xiao et al., 6 Jul 2025) OR \2^^^^ to PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^42 (PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^43), and minJointMR PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^44 to PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^45 (PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^46). HPNet+SRefiner is reported to attain SOTA on INTERACTION (&&&^^^^2query2^^^^&&&).

Validation comparisons to existing refinement methods are also specified. With the Forecast-MAE baseline on Argoverse v2, avgMinFDE is reduced from PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^47 to PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^48 by SRefiner, outperforming DCMS (PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^49), R-Pred (PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2submittedDate2query2^^^^), QCNet (PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2submittedDate2(Xiao et al., 6 Jul 2025) OR \2^^^^), SmartRefine (PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^52), and MTR++ (PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^53). With the FJMP baseline on INTERACTION, minJointFDE is reduced from PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^54 to PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^55, outperforming DCMS (PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^56), R-Pred (PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^57), QCNet (PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^58), SmartRefine (PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^59), and MTR++ (PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2sort_order2query2^^^^). Reported latency per scenario on RTX 3^^^^2query2\2query2^^^^ is PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2sort_order2(Xiao et al., 6 Jul 2025) OR \2^^^^ ms for Argoverse v2 with Forecast-MAE and PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^62 ms for INTERACTION with FJMP (&&&^^^^2query2^^^^&&&).

The ablation study attributes the best result on Argoverse v2 with Forecast-MAE to the full configuration. Starting from a baseline avgMinFDE of PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^63, using Traj–Lane Soft-Braid plus topology update yields PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^64, using Traj–Traj Soft-Braid plus topology update yields PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^65, using both Soft-Braid modules without topology update yields PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^66, and the full SRefiner yields PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^67. A separate topology ablation reports: no topology, PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^68; braid topology (BeTop), PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^69; Soft-Braid (Traj–Traj only), PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2descending2query2^^^^; and Soft-Braid (Traj–Traj + Traj–Lane), PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2descending2(Xiao et al., 6 Jul 2025) OR \2^^^^ (&&&^^^^2query2^^^^&&&).

Sensitivity analyses for neighborhood radii indicate modest but nonzero dependence. For PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^72 m, avgMinFDE is PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^73, leading to the default PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^74 m. For PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^75 m, avgMinFDE is PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^76, leading to the default PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^77 m. The iteration study reports the best result at PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^78, with diminishing returns and higher latency beyond that point (&&&^^^^2query2^^^^&&&).

6. Complexity, robustness, and reproducibility

Per iteration, the complexity is characterized in terms of PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^79 modes, PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2query2query2^^^^ agents, average trajectory neighborhood size PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2query2(Xiao et al., 6 Jul 2025) OR \2^^^^, lane neighborhood size PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^82, and embedding dimension PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^83. Trajectory–trajectory MHCA has complexity PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^84, trajectory–lane MHCA has complexity PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^85, and the overall per-iteration complexity is

PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^86

over PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^87 iterations. Memory is described as linear in PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^88 and neighborhood sizes, and the soft-braid features are described as lightweight because they contain velocities, accelerations, distances, and angles. Reported runtime is PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^89 ms per scenario on Argoverse v2 and PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2\2query2^^^^ ms on INTERACTION on RTX 3^^^^2query2\2query2^^^^, with scaling aided by local masking (&&&^^^^2query2^^^^&&&).

The reported strengths are tied to the soft-intersection formalism. The method handles non-crossing logical interactions through soft intersections and motion-state conditioning; it reduces collisions and drivable-area violations by integrating lane topology; and qualitative visualizations are said to show correction of off-lane deviations and reduction of inter-trajectory conflicts. Progressive topology update is described as improving attention guidance iteratively (&&&^^^^2query2^^^^&&&).

The limitations are also explicit. Sensitivity to neighborhood thresholds PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2\2(Xiao et al., 6 Jul 2025) OR \2^^^^ and PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^92 is low but nonzero, so extreme values can under-connect or over-connect interactions. The method relies on accurate maps and baseline trajectories, meaning map errors or poor initial predictions can misplace soft intersections. It also incurs computational overhead relative to simple local attention because of topology computation and dual attention modules, although this is mitigated by small PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^93 and local masking. For edge cases such as occlusions and sudden maneuvers, soft intersections still reflect proximity at PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^94, but abrupt changes can shift soft intersection times; iterative updates help but do not guarantee perfect adaptation. Lane changes are modeled through trajectory–lane soft intersections, with quality depending on lane topology representation and neighborhood radius (&&&^^^^2query2^^^^&&&).

Reproducibility details are comparatively concrete. The codebase is released at the repository linked by the authors. The implementation is organized around a baseline wrapper that computes PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^95 from PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^96 and PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^97, a SoftBraidTopology module PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^98 that computes PRESERVED_PLACEHOLDER_^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^99 and $L$^^^^2query2query2^^^^ together with neighborhoods $L$^^^^2query2(Xiao et al., 6 Jul 2025) OR \2^^^^, trajectory–trajectory and trajectory–lane Soft-Braid MHCA blocks, a refinement head producing offsets, and a training loop with joint WTA selection and Huber loss. Key settings for reproduction are ^^^^2(Xiao et al., 6 Jul 2025) OR \2query2^^^^ Hz sampling on both datasets; horizons $L$^^^^2query22^^^^, $L$^^^^2query2^^^^3 for Argoverse v2 and $L$^^^^2query2^^^^4, $L$^^^^2query2^^^^5 for INTERACTION; $L$^^^^2query2^^^^6; $L$^^^^2query2^^^^7; $L$^^^^2query2^^^^8 m; $L$^^^^2query2^^^^9 m; AdamW with cosine learning rate schedule and weight decay $L$^^^^2(Xiao et al., 6 Jul 2025) OR \2query2^^^^; 64 epochs; batch size ^^^^2(Xiao et al., 6 Jul 2025) OR \2^^^^6; and per-agent local frames anchored at the end of history with heading $L$^^^^2(Xiao et al., 6 Jul 2025) OR \2(Xiao et al., 6 Jul 2025) OR \2^^^^ (&&&^^^^2query2^^^^&&&).

Taken together, these properties locate SRefiner as a refinement layer that substitutes brittle binary crossing logic with continuous, interpretable soft-braid topology. The principal implication is that trajectory refinement can be guided by explicit distances, angles, and motion states at dynamically selected soft intersections, rather than by latent interaction alone. In the reported experiments, that design yields consistent improvements across datasets and baselines while preserving practical latency for autonomous driving use.