- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
TFDP refines coarse multi-agent trajectories using analytical local scores for smoothness, obstacle avoidance, agent separation, and velocity constraints. It avoids learned scoring models and adopts an annealed Langevin procedure. Experiments demonstrate high feasibility and substantially shorter runtimes compared with learned diffusion-based planners, alongside ablation studies on initialization, noise, and scalability. While the practical results are promising, the unique benefit stemming from the diffusion formulation and the contribution of the refinement module need to be more clearly isolated.
Critical strengths
- Strong reported efficiency. Table 1 reports 0.18-1.24 seconds on standard maps, with 100% success rate except for the dense 18-agent setting, where successs rate is 96%. Avoiding training and demonstrations makes this practically attractive.
- Informative ablations. The appendix examines initialization, noise, SDF guidance, hyperparameters, and same-CPU MPPI runtime. These studies help identify when local refinement works and when it depends on a good initial route.
Critical weaknesses
- It is unclear how much of the contribution is genuinely diffusion-specific rather than a new analytical trajectory-optimization objective. Appendix A.10 shows that the noiseless added value of the diffusion procedure uncertain.
- Performance depends strongly on the coarse planner, making it difficult to isolate the contribution of TFDP refinement. Appendix A.8 reports only 0-17% success with simple initializations on Room and Shelf, versus 99-100% with obstacle - aware planners.Matched initializaion comparisons are needed.
- Inconsistent score signs. In Eq.(13), signed distance is positive outside the feasible set, yet the score follows its positive gradient. For C=[0, infinity] and x<0, this moves x away from feasibility, contradicting Eq.(11). Appendix A.3 also reverses the derivative of Gaussian mass over an interval. These may be manuscript errors, but the implemented convention must be clarified.
Questions for authors
- What benefit requires diffusion rather than deterministic refinement under the same analytical objective?
- What gains remain when TFDP and competing refiners use identical coarse plans and end-to-end time budgets?
- Which score signs are implemented? Can the authors reconcile Eq.(13)and Appendix A.3 with numerical derivatives?
3 comments
Thank you very much for the authors' detailed responses and the additional experiments—the effort is much appreciated. The clarification that the stochastic perturbations are not essential for performance, and that the core contribution lies in the analytical energy formulation, is helpful. At the same time, this leads me to wonder whether the relationship to conventional Gaussian smoothing and continuation-based optimization could be discussed more explicitly, since the analytical formulation now carries most of the contribution. The promised ablation with a deterministic optimizer, and comparisons with classical optimization-based planners, would also be valuable. On balance, I feel the overall novelty of the work remains limited relative to existing non-learning-based trajectory optimization, and I therefore keep my score unchanged.
Hi! Thank you for the follow-up. Our main idea is that one can motivate the design decisions of motion planning algorithms that leverage probabilistic inference by attempting to model them after a diffusion process. Furthermore, that representing the optimization in this way allows directly representing "zero probability" for infeasible subsets of configuration space rather than assigning high energy to them. SDFs (and other energy functions) may be used with or without Gaussian smoothing, but there is no energy or cost function that directly represents the feasible distribution, due to the divergence of when (i.e., when ). Therefore, D4ORM uses a constant energy term for the infeasible set, and other works, like Model Predictive Path Integral Control: From Theory to Parallel Computation (Williams, Aldrich, and Theodorou, 2017) include energy terms for approaching or entering the infeasible set.
During importance sampling for traditional Gaussian smoothing, one may omit infeasible samples by effectively dropping them out. This can also be practically simulated with energy functions by setting a very high energy for entering obstacles. However, this is high-variance and requires a large number of samples to estimate (we show above the performance on using fewer than 64 samples, for example). To reduce this variance, we introduce a score surrogate that is more effective (i.e., less sensitive to hyperparameters) than SDFs and accurate enough to be competitive with the unbiased score estimate from direct Monte Carlo sampling. We motivate this score surrogate theoretically by suggesting that it be based on the score function for the feasible set convolved with a Gaussian, as would be used in a reverse diffusion process. We then simply add together these local score surrogates.
We add an ablation to compare to GPMP2 to hopefully supplement some of the comparisons. We implemented GPMP2 using GTSAM (without obstacle interpolation factors, using RRT as a coarse planner, giving a budget of 250 optimization steps, and testing some combinations of and , which are the obstacle and agent collision scales and velocity violation scales respectively), and got the following results.
| Map | Robots | TFDP | GPMP2 () | GPMP2 () | GPMP2 () |
|---|---|---|---|---|---|
| Basic | 6 | 0.99 ± 0.01 | 0.96 ± 0.03 | 0.96 ± 0.03 | 0.97 ± 0.03 |
| 12 | 0.99 ± 0.01 | 0.88 ± 0.06 | 0.91 ± 0.05 | 0.88 ± 0.06 | |
| 18 | 0.99 ± 0.01 | 0.78 ± 0.07 | 0.76 ± 0.07 | 0.64 ± 0.08 | |
| Dense | 6 | 0.99 ± 0.01 | 0.76 ± 0.07 | 0.86 ± 0.06 | 0.81 ± 0.07 |
| 12 | 0.97 ± 0.03 | 0.52 ± 0.09 | 0.63 ± 0.08 | 0.49 ± 0.09 | |
| 18 | 0.95 ± 0.04 | 0.34 ± 0.08 | 0.37 ± 0.08 | 0.16 ± 0.06 | |
| Room | 6 | 0.99 ± 0.01 | 0.70 ± 0.08 | 0.80 ± 0.07 | 0.81 ± 0.07 |
| 12 | 0.99 ± 0.01 | 0.45 ± 0.09 | 0.46 ± 0.09 | 0.43 ± 0.09 | |
| 18 | 0.99 ± 0.01 | 0.20 ± 0.07 | 0.19 ± 0.07 | 0.17 ± 0.06 | |
| Shelf | 6 | 0.99 ± 0.01 | 0.71 ± 0.08 | 0.86 ± 0.06 | 0.78 ± 0.07 |
| 12 | 0.99 ± 0.01 | 0.47 ± 0.09 | 0.57 ± 0.09 | 0.60 ± 0.08 | |
| 18 | 0.97 ± 0.03 | 0.26 ± 0.07 | 0.27 ± 0.08 | 0.19 ± 0.07 |
Overall, our approach seems to be more successful than GPMP2 on these maps under these optimization settings.
Response to Reviewer Ss1j
Thank you for recognizing the practical value of our training-free approach and the usefulness of our ablation studies. We agree that your questions regarding the refinement module and its mathematical expressions are essential to assessing the contribution.
Q1. What benefit requires diffusion rather than deterministic refinement under the same analytical objective?
Thank you for the question! The diffusion process of TFDP can help construct scale-dependent analytical guidance from Gaussian-smoothed feasibility factors. Meanwhile, the resulting analytical field also supports deterministic updates. Empirically, we actually find the stochastic perturbations are unnecessary for improved performance. However, we believe formulating the problem in this way is what enabled us to discovery of a more effective energy function than the signed distance fields typically used (e.g. in CHOMP and GPMP2). Accordingly, the central contribution of this paper is the analytical local field and its efficient evaluation. We will incorporate these results and distinguish the analytical formulation from the choice of stochastic or deterministic updates.
Q2. What gains remain with identical coarse plans and end-to-end time budgets?
Thank you for suggesting this comparison. In all our comparisons to CHOMP-style SDF-based energy functions, we use the same coarse planner, and find that they are significantly more sensitive to the scaling of the SDF. Because these experiments also only differ from TFDP in how they scale the energy function, the experiments are intrinsically matched in the time budget. Furthermore, although one can use a GPU to achieve the same success rate as TFDP with a sampling-based planner, the efficiency gain of using an analytical formulation allows the same speed to be obtained on a CPU. Therefore, given the same time budget, we enable using cheaper hardware for planning and stronger hyperparameter robustness.
Q3. Which score signs are implemented, and how do Eq. (13) and Appendix A.3 agree with numerical derivatives?
Thank you for identifying these inconsistencies. With signed distance positive outside the feasible set, Eq. (13) requires a negative sign:
\, d(\pi_i^h, \mathcal{C}_f) + \dfrac{\sigma}{2} & \text{if } d(\pi_i^h, \mathcal{C}_f) > 0, \, \frac{1}{2\sigma}\left( d(\pi_i^h, \mathcal{C}_f) + \sigma \right)^{2} & \text{if } d(\pi_i^h, \mathcal{C}_f) \in (-\sigma,\, 0], \, 0 & \text{otherwise.} \end{cases}$$ For your example $C=[0,\infty)$, $$q_\sigma(x)=\Phi(x/\sigma),\qquad \partial_x\log q_\sigma(x) =\frac{\varphi(x/\sigma)}{\sigma\Phi(x/\sigma)}>0.$$ Here, $\Phi$ and $\varphi$ denote the standard normal CDF and density. For $x<0$, both the exact score and corrected surrogate point toward increasing $x$, consistent with feasibility and Eq. (11). For Appendix A.3, define the Gaussian mass over $[a,b]$ as $$M_\sigma(x)= \Phi\left(\frac{b-x}{\sigma}\right) -\Phi\left(\frac{a-x}{\sigma}\right).$$ Its derivative is $$M_\sigma'(x)= \frac{\varphi((a-x)/\sigma)-\varphi((b-x)/\sigma)}{\sigma},$$ and its score is $M_\sigma'/M_\sigma$. Equivalently, the derivative is $\mathcal N(x;a,\sigma^2)-\mathcal N(x;b,\sigma^2)$. Appendix A.3 reverses this order. We will propagate the correction consistently to A.4 and state that $\sigma$ is standard deviation. This error solely existed in the manuscript; the actual score function direction pulled variables into the feasible region. ### W2. Isolating the impact of refinement. You suggested ablating the coarse refiner -- We test using RRT, our default coarse planner, without any further refinement or deconflicting optimization steps. We find that refinement introduces significant advantages on top of using several independent path planners. We report the results below. | Map | Robots | TFDP | RRT, no refinement | Voronoi, no refinement | | ----- | ------ | --------------- | ------------------ | ---------------------- | | Basic | 6 | **0.99 ± 0.01** | 0.26 ± 0.08 | 0.01 ± 0.01 | | | 12 | **0.99 ± 0.01** | 0.01 ± 0.01 | 0.01 ± 0.01 | | | 18 | **0.99 ± 0.01** | 0.01 ± 0.01 | 0.01 ± 0.01 | | Dense | 6 | **0.99 ± 0.01** | 0.08 ± 0.05 | 0.01 ± 0.01 | | | 12 | **0.97 ± 0.03** | 0.01 ± 0.01 | 0.01 ± 0.01 | | | 18 | **0.95 ± 0.04** | 0.01 ± 0.01 | 0.01 ± 0.01 | | Room | 6 | **0.99 ± 0.01** | 0.07 ± 0.04 | 0.01 ± 0.01 | | | 12 | **0.99 ± 0.01** | 0.01 ± 0.01 | 0.01 ± 0.01 | | | 18 | **0.99 ± 0.01** | 0.01 ± 0.01 | 0.01 ± 0.01 | | Shelf | 6 | **0.99 ± 0.01** | 0.07 ± 0.04 | 0.01 ± 0.01 | | | 12 | **0.99 ± 0.01** | 0.01 ± 0.01 | 0.01 ± 0.01 | | | 18 | **0.97 ± 0.03** | 0.01 ± 0.01 | 0.01 ± 0.01 |