- Rating
- 2(+1)
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper proposes Persistent Particle Planning (P3), a test-time constrained planning framework for pretrained diffusion models. Rather than regenerating candidate trajectories from Gaussian noise at every replanning step, P3 maintains a persistent population of weighted plans. At each step, the previous trajectories are shifted, partially re-noised, and denoised under the latest observation. Constraint-aware weighting and sequential Monte Carlo (SMC) resampling guide the selection of feasible trajectories, while optional particle rejuvenation introduces fresh candidates to maintain exploration.
The authors provide theoretical analyses of trajectory retention under partial re-noising, the advantages of preserving rare feasible routes, and the effects of particle reuse. Experiments on D3IL Avoiding, PointMaze, and AntMaze with test-time constraints demonstrate improvements in constraint satisfaction, trajectory consistency, and computational efficiency compared with several diffusion-based planning baselines.
Critical strengths
-
Theoretical analysis: The authors provide a theoretical framework for understanding how partial re-noising affects trajectory retention and how maintaining a population of candidate plans can improve the probability of preserving rare feasible solutions. In particular, the analysis characterizes the trade-off between preserving previously discovered trajectories and introducing sufficient noise for adaptation. Although the results rely on idealized assumptions, they offer useful insights into the behavior of persistent diffusion-based planners and help motivate the proposed algorithm.
-
Empirical improvements in constrained diffusion planning: The experiments demonstrate that retaining candidate trajectories across replanning steps can substantially improve performance, particularly when feasible routes are difficult to discover through independent sampling. For example, P3 achieves 99% clean success on the cluttered obstacle-avoidance configuration, compared with 48% for conventional SMC. The ablations further distinguish the contributions of particle persistence and constraint-aware selection. These results provide meaningful empirical evidence for the practical benefits of trajectory reuse in diffusion-based control.
Critical weaknesses
-
Limited algorithmic novelty relative to existing planning methods: The central idea of reusing previously generated trajectories across successive planning steps has been extensively investigated in model-predictive control and related planning frameworks. In particular, sampling-based MPC methods reuse and perturb previous control sequences, while Stein Variational MPC [1] maintains multiple candidate solutions to preserve multimodality during planning. More directly, Diffusion-ES [2] already employs partial re-noising and denoising to refine a population of diffusion-generated trajectories. Although P3 extends these ideas by maintaining constraint-weighted particles and their selection history across replanning steps, the individual components such as trajectory warm-starting, population-based optimization, SMC resampling, and partial diffusion refinement are largely established techniques.
-
Limited evaluation of diverse test-time planning constraints: The experimental evaluation primarily focuses on obstacle avoidance and navigation under spatial exclusion constraints. While the results are encouraging, these tasks do not fully establish the general applicability of P3 to more diverse and complex test-time planning problems. In particular, Tree-Guided Diffusion Planner (TDP) [3] studies a closely related setting of zero-shot test-time planning using pretrained diffusion models. Their tasks involve more diverse objectives and constraints. I strongly encourage the authors to evaluate P3 on these benchmarks and compare it against TDP. Such experiments would provide a more comprehensive assessment of P3's ability to handle different types of test-time constraints and establish its effectiveness beyond the relatively restricted obstacle-avoidance settings considered in the current paper.
[1]: Alexander Lambert et al. Stein Variational Model Predictive Control. 2020.
[2]: Brian Yang et al. Diffusion-ES: Gradient-free Planning with Diffusion for Autonomous and Instruction-guided Driving. 2024.
[3]: Hyeonseong Jeon et al. Tree-Guided Diffusion Planner. 2025.
Questions for authors
-
Q1. Novelty relative to population-based planning methods: Could you clarify the key algorithmic differences between P3 and existing approaches such as Diffusion-ES, which also employs population-based trajectory refinement through partial diffusion noising and denoising? In particular, have you considered comparing P3 against a warm-started Diffusion-ES baseline under the same computational budget? This would help isolate the benefits of maintaining SMC particle weights and selection histories across replanning steps.
-
Q2. Adaptability to changing constraints: While trajectory persistence improves consistency, could it also reduce adaptability when constraints change substantially between replanning steps? For example, previously feasible trajectories may become infeasible due to newly introduced obstacles or changing goal conditions. Could you clarify how P3 handles such scenarios and whether the particle rejuvenation mechanism is sufficient to prevent premature convergence to previously preferred trajectories?
4 comments
Part 2
W2: diverse constraints and TDP
We ported TDP and added a TDP-style manipulation task. P3 is above TDP on all eight configurations, and on the new task it places as many blocks as TDP, with more stages without violation and about half the planning time.
We did both halves of this. We ported TDP from its official code and ran it on all eight configurations, where it reaches 0.94, 0.38, 0.90, 0.89, 0.76, 0.50, 0.01 and 0.42 success without constraint violation, below P3 on every column, at 149 ms per step against 117 for P3 on Clutt.
We also added KUKA sequential block placement, a task family from TDP, with a protection constraint that forbids disturbing the three inactive blocks. Against TDP itself, on ten paired scenes, P3 and TDP both place 1.10 of four blocks, with 1.10 stages without violation for P3 against 0.70 for TDP, and 17.94 s of planning per episode against 34.76 s. Table R2 compares the other methods on a separate set of 20 scenes, so its P3 row differs from the ten-scene numbers.
Table R2: KUKA, 20 paired scenes, one pretrained model. Any violation is the share of episodes with a protection violation. A stage without violation places its active block without a protection violation. NFE counts particle denoiser evaluations, matched within 3%. Bold marks the best value in each column.
| Method | Any violation | Placed / 4 | Stages without violation / 4 | NFE () |
|---|---|---|---|---|
| SafeDiffuser | 85% | 0.55 | 0.45 | 72 |
| Best-of- | 85% | 0.65 | 0.50 | 72 |
| FK steering | 75% | 0.75 | 0.70 | 72 |
| SMC | 70% | 1.10 | 1.00 | 72 |
| Persistent best-of- | 60% | 1.20 | 0.95 | 70.4 |
| P3 (ours) | 30% | 1.40 | 1.20 | 70.4 |
P3 violates the protection constraint in 30% of episodes against 60% for the next best method, and places the most blocks. Partial placement is the normal level on this benchmark. TDP's paper reports 36.9 on its 100-point scale for this task, about 1.5 of four blocks.
Beyond obstacle avoidance, the revision adds a height ceiling on Walker2d locomotion, where P3 is above the roof on 3.1% of steps against 9.3% for SMC, at less than half the denoiser evaluations.
Q2: adaptability when constraints change
We tested this, and persistence does not prevent adaptation.
We added Appendix F. An obstacle appears on the current plan at a fixed step, or moves across the workspace from one of two onset times, and the change is never disclosed in advance.
Table R3: success without constraint violation under changing constraints on Avoiding. Bold marks the best value in each column.
| Method | Still | Moves from step 24 | Moves from step 40 | Appears on the plan |
|---|---|---|---|---|
| Projection | 0.31 | 0.33 | 0.36 | 0.33 |
| SMC | 0.50 | 0.54 | 0.47 | 0.67 |
| P3 (ours) | 0.99 | 0.96 | 0.74 | 0.78 |
| P3, no fresh plans | 0.90 | 0.90 | 0.89 | 0.67 |
P3 stays above SMC in all four columns, by 0.11 to 0.49. P3 loses 0.03 when the obstacle starts moving at step 24, from 0.99 to 0.96, and 0.25 when the motion starts at step 40. Constraints are reevaluated at every call, so a carried plan that has become infeasible loses its weight and is resampled away.
On whether adding fresh plans is sufficient, they help in three of our four tests with a change and cost success in one. They raise success from 0.90 to 0.96 when the obstacle moves from step 24, from 0.67 to 0.75 on the trials both variants ran when it appears on the plan, and from 0.35 to 0.94 on a separate changing-obstacle study on PointMaze, at 122 against 8 denoiser evaluations per step (Table 17). When the motion begins late, at step 40, the variant without fresh plans reaches 0.89 against 0.74 for full P3. The revised Limitations state that with a fixed number of fresh plans per step P3 can lose success when the change comes late.
On the same PointMaze study, P3 reaches 0.94 against 0.69 for SMC and against 0.78 with its weights reset, a gap that varies across models. On Avoiding, resetting the weights changes success by at most 0.03, so the weights carried from before a change do not hold P3 on a blocked route.
Presentation
We clarified terminology and sentence structure.
We made targeted language edits in the revised manuscript. We replaced the non-standard terms, added short definitions, and split long sentences in Sections 3.3 and 3.4. The appendices, tables and figure labels use the same terminology. The revised wording is marked in blue.
Thank you for conducting experiments I requested. However, new results brought me additional concerns on this paper.
-
Algorithmic novelty: It seems a substantial portion of P3's improvements arises from trajectory warm-starting. While the additional improvements from persistent particle weighting and within-denoising resampling are meaningful, I regard the overall algorithmic contribution as relatively incremental.
-
Comparison with TDP: P3 and TDP achieve the same average task completion (1.10 out of four blocks) on only ten paired scenes. Although P3 improves constraint satisfaction and planning efficiency, I would appreciate clarification on the comparability of planning budgets and evaluation setup.
I acknowledge that the additional experiments are helpful, so I raised my rating. However, as long as my concern about limited algorithmic novelty remains, I am learning toward rejection.
We thank the reviewer for reading the new results and raising the rating. The PDF is updated again, with changes in blue.
Algorithmic novelty
No released population baseline keeps its plans across replanning calls. The paper shows how large the gain from keeping them is, when it appears and why, and P3 adds to it where feasible plans are rare.
We agree that warm starting is an established idea and that it accounts for a substantial part of the gain. Earlier diffusion planners warm-start one trajectory (Table 21). The population methods we compare with, FK steering, TDP and the released Diffusion-ES, all redraw their plans at every replanning call, and the warm-started control exists because we built it at the reviewer's request (Appendix B). The paper explains the gain from a kept population with one Feynman–Kac model over denoising and replanning. Theorem 1 quantifies route retention under exact conditional denoising at a fixed observation without shifting, and Proposition 1 compares retained acceptable plans with fresh draws.
Controlled comparisons show what P3's within-denoising selection and carried weights add:
- Warm starting alone is unreliable.
Persistent best-of-N(shift, partial re-noise and denoise, selection only at the end) helps onClutt.but is worse than coldBest-of-Non Walker2d (12.9% vs. 8.7% of steps above the roof) and onTurn(0.37 vs. 0.43). - P3 selects during denoising and carries its weights.
Diffusion-ES (warm)reweights and resamples once per pass from current-step scores. OnTurn, both warm controls (0.38, 0.37) fall below cold SMC (0.53), while P3 reaches 0.62.
Table R4: persistent controls at matched denoiser budgets, on four of Table 1's eight configurations and the two new tasks. Bold marks the best value, and both values in the Walker2d tie.
| Method | Resampling | Carried weights | Clutt. | Broad | Narrow | Turn | Walker2d above roof | KUKA violation | KUKA placed / 4 |
|---|---|---|---|---|---|---|---|---|---|
| Persistent best-of- | none | no | 0.87 | 0.75 | 0.56 | 0.37 | 12.9% | 60% | 1.20 |
| Diffusion-ES (warm) | after pass | no | 0.98 | 0.86 | 0.74 | 0.38 | 3.3% | 50% | 1.30 |
| P3 (ours) | in denoising | yes | 0.99 | 0.89 | 0.85 | 0.62 | 3.1% | 30% | 1.40 |
When an obstacle appears on the plan, P3 reaches 0.78 vs. 0.67 for Diffusion-ES (warm) (, 95% CI ). On the other four Table 1 configurations the two are tied, except Left, where the warm control is ahead. On the other new tests, it ties P3 on Walker2d, is within 0.04 on Avoiding with a moving obstacle, and leads on the sliding-disc maze at 0.99 vs. 0.94 (Tables 2, 16, 17).
Comparison with TDP
Both methods ran on the same model, scenes, cost, grading and denoiser budget. P3 places twice as many blocks as TDP on the 20 scenes of Table 20, and 1.30 against 0.83 over all 30 scenes.
The setup is identical for both methods:
- Model & scenes: the released TDP KUKA checkpoint, with the same initial block positions, placement order and targets.
- Protocol & grading: four stages and eight planning calls per episode (replan after 64 commands), graded at every physics substep with TDP's placement test.
- Cost: shared target error plus protection penalty; TDP's tree is scored by it, so TDP sees the constraint.
- Budget: 70,400 particle denoiser evaluations per episode for both. P3 keeps 16 plans (four full calls of 1,000 steps, four warm calls of 100). TDP draws 8 plans (eight calls of 1,000 parent and 100 child steps) with its released settings.
Ten scenes were too few, as the reviewer notes. We ran TDP on the 20 scenes of Table 20, plus a second TDP row with the protection penalty gradient in its guidance.
Table R5: KUKA, 20 paired scenes, 70,400 denoiser evaluations per episode. Bold marks the best value.
| Method | Any violation | Placed / 4 | Stages without violation / 4 |
|---|---|---|---|
| TDP | 65% | 0.70 | 0.50 |
| TDP, protection guidance | 60% | 0.90 | 0.55 |
| P3 (ours) | 30% | 1.40 | 1.20 |
P3 places 1.40 blocks against 0.70 for TDP (paired difference , 95% CI ) and lowers episode violations by percentage points (95% CI ). These 20 scenes are separate from the ten earlier ones. Over all 30, P3 places 1.30 blocks against 0.83, with a violation in 37% of episodes against 67%. Both TDP rows are in Table 20 (Appendix K). On an idle single GPU on the ten earlier scenes, planning took 17.94 s/episode for P3 vs. 34.76 s for TDP at equal denoiser calls, due to TDP's guidance and tree operations. On Walker2d, TDP with roof gradient guidance leaves 4.1% of steps above the roof vs. 3.1% for P3 at the denoiser calls; a stronger gradient lowers this to 0.1%, but the walker falls in 15 of 48 episodes (Table 19).
We thank the reviewer for the precise questions. Q1 asks for the one experiment that isolates our contribution, and we ran it. We have updated the manuscript, and the changes are marked in blue.
W1, Q1: novelty and warm-started Diffusion-ESWe respectfully disagree, in particular on Stein Variational MPC, and we built the requested baseline and added it to Table 1.
The individual operations exist in prior work, as the reviewer says. None of the cited methods selects during denoising on a weighted population that it keeps across control steps, which is what P3 does. We formalize this process and analyze, under idealized assumptions, when retaining a discovered rare route is easier than repeatedly rediscovering it. The new warm-start comparisons show that reuse accounts for substantial gains, and P3 adds to them where the feasible route is rare and long, 0.85 against 0.74 for a warm-started Diffusion-ES on
Narrowand 0.62 against 0.38 onTurn.The overlap with Stein Variational MPC is that both keep several candidates between control steps. It has no diffusion model, so it cannot sample a multimodal trajectory distribution learned from demonstrations. It moves its particles by Stein variational gradient steps, and its weights set only the starting distribution of the next step, while P3 carries each plan's weight into the next denoising pass, where reweighting and resampling continue to act on it (Table 21). Keeping several candidates is not what produces our result. Persistent best-of-N in Table R1 keeps its population and selects only at the end of denoising, and it reaches 0.56 on
Narrowand 0.37 onTurnagainst 0.85 and 0.62 for P3.P3 differs from Diffusion-ES in three ways:
A warm-started Diffusion-ES is the right control, and it was missing. Diffusion-ES suggests warm starting in one sentence of its Sec. 3.2, but we checked the released code and its planner restarts from noise at every replanning call, so no published warm variant exists. We therefore built it ourselves, label it as our construction, and match its compute to P3, so that it differs from P3 only in the first and third points. The warm variant starts from the previous population shifted, takes the same number of denoiser calls per particle as P3, and selects by exponential reweighting over the current step only, with no weights or ancestry carried forward.
Table R1: success without constraint violation on Table 1's eight configurations at matched budgets. Bold marks the best value in each column among the rows shown.
Three readings follow. Warm starting accounts for most of the gain, as the warm row moves from 0.38 to 0.98 on
Clutt.relative to cold Diffusion-ES. P3 keeps its further margin onNarrowandTurn. On the easy configurations P3 and the warm baseline are tied, and onLeftthe warm baseline is ahead. Per-step planning times on one GPU are 117, 93, 24 and 186 ms for P3 against 172, 86, 23 and 171 ms for the warm baseline onClutt.,Narrow,BlockedandTurn(Table 10).To isolate the carried weights, we reset them to uniform at every control step at the same compute. On the large maze with a disc in a corridor, this lowers success from 0.94 to 0.78 when the disc slides and from 0.96 to 0.76 when it stays still (Table 17 in Appendix F). On Avoiding the same reset changes success by at most 0.03 (Table 16), so the carried weights matter on the large maze and not on Avoiding.
On the other prior work, Table 21 in Appendix L compares the operations of each method. MPPI keeps one control sequence and redraws its samples around it. FK steering discards its population after each sample. The one Feynman-Kac model spanning denoising and replanning, with weights and ancestry carried across control steps, is what we claim. Table R1 is the evidence for selection during denoising on a kept population, and the weight-reset test is the evidence for the carried weights on the large maze.