- Rating
- 2(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper's idea of reusing the learned masked-generation prior for test-time structural repair is interesting. The Ring Maze and Controlled Route Invalidation benchmarks are informative diagnostics, and MGMP shows clear gains in success rate, valid-sample fraction, and planning time across a broad range of simulated and real-world settings. However, the central claim that discrete, prior-guided token search is what enables route-level repair is not yet convincing. Key comparisons are missing: sampling-based planners such as BIT on the diagnostic benchmarks, and a continuous generative model on the same backbone.
Critical strengths
None.
Critical weaknesses
-
The main claim isn't really isolated. The paper says the gains come from prior-guided discrete search, but BIT* is missing from both basin-escape benchmarks, and there's no continuous-generative baseline on the same backbone.
-
Some evaluations don't quite test what they claim. Obstacles are given to the model only as center points, so on Ring Maze and the unseen meshes the prior can't see the actual geometry, and most of the work is likely done by the DeepSDF objective.
Questions for authors
-
How does BIT* (or another sampling-based planner) do on Ring Maze and Controlled Route Invalidation under a similar time budget?
-
What happens if GGTS uses random codebook candidates instead of MGT proposals, or remasks only the colliding tokens?
-
In Ring Maze, how is the opening direction of each C-shaped obstacle given to the MGT, if only obstacle centers are encoded? The same question applies to the unseen meshes: do the baselines get the same DeepSDF cost?
-
In Controlled Route Invalidation, how do you check that a local fix near Route A is actually infeasible, rather than just assuming it because a distant Route B exists?
-
How many tokens are remasked, verified, and committed per round in practice?
11 comments
Reply to reviewer 8AT9 (2/4)
What happens if GGTS uses random codebook candidates instead of MGT proposals, or remasks only the colliding tokens?
We thank the reviewer for this suggestion. To further investigate the contributions of MGT-guided proposals and geometry-guided adaptive remasking, we introduce two additional ablations. Random Codebook Proposals replaces the MGT-predicted top-M candidates at each remasked position with M uniformly sampled codebook indices and uses uniform weights in the screening of Eq. 2, while the same exact verification procedure is retained. Collision-only Remasking restricts token updates to positions associated with detected collisions, excluding all additional positions selected by Eq. 1. All other components and refinement budgets remain unchanged.
We evaluate both variants on Ring Maze and 7-DoF Kuka under unseen obstacle layouts, following the settings of our existing ablation study (Table 4). We additionally evaluate Controlled Route Invalidation on Kuka, where all variants start from the same invalidated trajectory, to directly assess structural repair.
| Method | Ring Maze SR | Ring Maze VSF | Ring Maze RT | Kuka Unseen Layouts SR | Kuka Unseen Layouts VSF | Kuka Unseen Layouts RT | Controlled Kuka RS |
|---|---|---|---|---|---|---|---|
| Random Codebook Proposals | 0.77 | 0.34 | 0.08 | 0.89 | 0.68 | 0.43 | 0.53 |
| Collision-only Remasking | 0.87 | 0.52 | 0.07 | 0.93 | 0.79 | 0.42 | 0.68 |
| Full MGMP | 0.96 | 0.67 | 0.08 | 0.97 | 0.87 | 0.44 | 0.82 |
Replacing MGT proposals with random codebook candidates reduces SR from 0.96 to 0.77 on Ring Maze and from 0.97 to 0.89 on Kuka under unseen layouts, indicating that the learned trajectory prior provides more effective replacement candidates than random codebook sampling. Similarly, restricting remasking to collision-associated tokens reduces SR from 0.96 to 0.87 on Ring Maze and repair success from 0.82 to 0.68 on Controlled Route Invalidation. This suggests that modifying only collision-associated tokens can be insufficient when successful repair requires broader changes to the trajectory structure. Together, these results support the complementary roles of the learned trajectory prior in proposing meaningful motion alternatives and geometry-guided adaptive remasking in enabling structural repair beyond local collision correction. We will include these ablations in the revised paper.
In Ring Maze, how is the opening direction of each C-shaped obstacle given to the MGT, if only obstacle centers are encoded? The same question applies to the unseen meshes: do the baselines get the same DeepSDF cost?
We thank the reviewer for this question. Each C-shaped Ring Maze obstacle is constructed from multiple rectangular blocks, and the center of each block is provided individually to the obstacle encoder. The opening direction is not given as a separate condition; it is implicitly encoded by the spatial arrangement of the blocks, from which the MGT learns to generate feasible trajectories. Thus, the model must infer the opening direction from the obstacle configuration rather than receiving an explicit orientation label. We will clarify this representation in Sec. 3.2 and App. B.2 in the revised paper.
In the unseen-geometry experiments of Table 3, all methods are evaluated on the same ShapeNet meshes and start–goal queries. MGMP, CHOMP, STOMP, MPD, PBD and SafeFlowMatcher share the same DeepSDF-based signed-distance fields. These fields provide collision distances and gradients for trajectory optimization, sampling guidance, or safety-constrained correction, according to each method's planning mechanism. In contrast, TrajOpt uses mesh-derived collision distances and contact normals, RMP uses obstacle-distance information for reactive avoidance, and RRT*, P-RRT*, and BIT* rely on direct mesh collision checking. These methods can therefore use obstacle geometry without requiring DeepSDF. Importantly, all returned trajectories are evaluated against the same ground-truth meshes using identical PyBullet collision-checking and endpoint-validity criteria. We will clarify the method-specific geometry interfaces in App. B.10 in the revised paper.
Reply to reviewer 8AT9 (3/4)
In Controlled Route Invalidation, how do you check that a local fix near Route A is actually infeasible, rather than just assuming it because a distant Route B exists?
We thank the reviewer for raising this question. Controlled Route Invalidation (CRI) is designed to evaluate trajectory repair under identical initialization, independently of initial trajectory generation. For each problem, we relocate an obstacle to invalidate a previously verified feasible Route A while preserving a verified alternative Route B that is separated from Route A in joint space. This construction ensures that a feasible alternative exists after invalidation, although it does not exclude the possibility of local repairs near Route A. Importantly, all methods receive the same invalidated trajectory and modified obstacle configuration, without generating new trajectories from scratch. Repair success is determined solely by the feasibility of the resulting trajectory, regardless of whether the repair is local or involves substantial route changes. Thus, the evaluation does not inherently favor large-scale modifications.
Our results demonstrate GGTS's ability to perform large-scale trajectory repair under identical initialization. MGT+EmbOpt-30 shares MGMP's backbone, initial token representation, decoder, and objective, differing primarily in its use of continuous embedding optimization instead of discrete token search. As shown in Table 1, GGTS without polishing achieves 76% repair success, compared with 60% for MGT+EmbOpt-30. Moreover, successful GGTS repairs exhibit a substantially longer changed span (73.4% vs. 45.2%), indicating its ability to modify extended portions of the trajectory rather than only the immediate collision region. Continuous polishing further improves repair success to 82%.
To further investigate this difference, we conduct a paired analysis on the same 500 CRI problems, comparing GGTS without polishing and MGT+EmbOpt-30 under identical initial trajectories and obstacle configurations. We classify the outcomes into four groups: both methods succeed (285), only GGTS succeeds (95), only EmbOpt-30 succeeds (15), and both fail (105). GGTS successfully repairs 95 problems where EmbOpt-30 fails, whereas EmbOpt-30 succeeds in only 15 problems where GGTS fails. For problems repaired exclusively by GGTS, the changed span reaches 80.0%, compared with 71.2% for problems successfully repaired by both methods. These results demonstrate that GGTS recovers feasible solutions on additional problems that continuous embedding optimization fails to resolve from the same initialization. Together with the larger changed span, this provides further evidence that discrete token search enables effective, extended trajectory modifications beyond those typically achieved by continuous embedding optimization. We will clarify the CRI construction and evaluation protocol and include the additional paired analysis in the revised paper.
Reply to reviewer 8AT9 (1/4)
We are grateful to the reviewer 8AT9 for the thorough and insightful comments. These suggestions have helped us improve the clarity of the work, and we address each point in detail below.
We thank the reviewer for this suggestion. Our original Ring Maze evaluation was primarily designed to investigate whether classical trajectory optimization and generative planners with test-time guidance or correction become trapped in local minima, and whether MGMP can overcome these limitations by exploring alternative route topologies. In contrast, sampling-based planners such as BIT* explore the configuration space through sampling and tree expansion, rather than relying on local trajectory optimization, and are therefore not subject to the same optimization-induced local minima.
However, we recognize that this original focus should not have limited our comparison with other planning methods. We appreciate the reviewer for pointing out so we therefore evaluated BIT* on the Ring Maze environment under constrained planning-time budgets. With a 0.1 s budget, BIT* achieves a 0.0% success rate. Under such a tight time budget, BIT* cannot perform sufficient sampling and collision-checked tree expansion to reliably identify feasible paths. Increasing the budget to 1, 2, and 3 s improves its success rate to 61.95%, 88.33%, and 91.35%, respectively. In comparison, MGMP achieves 96% success with approximately 0.08 s running time. These results highlight the computational limitations of sampling-based planning, which requires substantial online exploration to identify feasible paths in complex environments. In contrast, MGMP leverages learned trajectory priors and geometry-guided refinement to efficiently generate feasible solutions, achieving substantially higher success rates under tight planning-time budgets. Moreover, for Controlled Route Invalidation, it is designed to isolate trajectory repair from initial generation, requiring all methods to refine the same invalidated trajectory. Standard BIT* performs sampling-based planning rather than trajectory repair, and replanning from scratch would not satisfy this evaluation protocol.
To further isolate the contribution of discrete token search from the choice of generative architecture, we additionally introduce a same-backbone Diffusion Transformer (DiT) baseline. It retains MGMP's Transformer architecture, obstacle encoder, and start–goal conditioning, but replaces masked discrete token prediction with continuous trajectory denoising. DiT is trained on the same demonstrations using a standard noise-prediction objective. Following MPD's cost-guided denoising strategy (Carvalho et al., 2023), we apply geometric guidance using the same planning objective J as MGMP. DiT uses 15 DDIM steps, with 30 gradient updates across the final five denoising steps. We evaluate both methods on identical Ring Maze and Kuka unseen-layout problems, using 20 candidates per problem. Despite using the same Transformer backbone architecture and conditioning, guided DiT achieves 0.81/0.92 SR and 0.42/0.75 VSF on Ring Maze and 7-DoF Kuka, respectively, compared with 0.96/0.97 SR and 0.67/0.87 VSF for MGMP. On Ring Maze, guided DiT has an estimated RT of 0.35 s, compared with 0.08 s for MGMP. The larger performance gap on Ring Maze suggests that geometry-guided discrete token search is particularly beneficial when feasibility requires substantial route changes. Together with the MGT+EmbOpt-30 comparison (0.75/0.90 SR and 0.29/0.74 VSF on Ring Maze/Kuka; Tables 1 and 4), these results suggest that MGMP's advantages cannot be explained solely by differences in network architecture, providing further evidence for the effectiveness of prior-guided discrete search in structural trajectory repair. We will include the additional BIT* results on Ring Maze and comparisons with a continuous generative baseline using the same backbone in the revised paper.