- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes a motion planner that decides each step if trajectory search among candidates is necessary or not. In closed-loop experiments it shows that the approach can save search in almost half of the steps. For some planners, such as the Diffusion Planner, it can even improve performance compared to doing a search at every step. The paper contributes also investigations into benefits of search and search frequency scaling on the Val14 Development Set of nuPlan. Decisions are learned from a created dataset of paired trajectory alternatives for each step, one from the base planner and one which is the result of a search in that step. With this, a small score prediction model is trained to decide if a search should be done based on the most recent planning steps and a custom set score threshold.
Critical strengths
Given the idea of re-planning is investigated in the robotic domain for decades, this application in autonomous driving is surprisingly simple and efficient. Predicting the need for trajectory search based on PDM component scores rather than inside of a full RL pipeline should allow for fast training and produces surprisingly good results.
It is positive that the method achieves on-par performance with the diffusion planner with full PDM search but at almost half the amount of searches. In general, the reduction of search is significant even if the performance of other planners sometimes suffers. The trade-off seems minor.
Independent of the method and results, the investigation uncovered that, given the nuPlan dataset and Diffusion planner, the top 20% of the planning steps account for 78.3% of the total positive improvement. This is an interesting insight for the domain.
The approach works as added module for any planner with a compatible search step.
Critical weaknesses
The related work is a bit light on re-planning approaches and the novelty of treating it as a "when to search" task is smaller than it may appear from the phrasing. Apart from that, relevant close work such as [1] which investigated deciding on when to replan with reinforcement learning should be cited.
While the investigation into search benefits seems solid, a 0,164 and 0.277 Spearman correlation of route heading changes and heading differences to the base trajectory is rather low and concluding that these relations provide useful clues seems optimistic.
The runtime analysis does not look into peak planning conditions. The analysis shows a 32% reduction in planning time but this is averaged over the whole dataset. In practice, this may serve to safe searches overall but in situations where every step does need a re-planning step, the search will only add overhead. This is especially important when the expectation of some challenges is to provide trajectories with 10 fps. There may be a conceptual issue in this: Why use the method if it saves planning steps overall but adds to peak computation and inference time? This is not a major issue since only the fast predictor runtime is added but this may affect the overall impact.
Simple baselines to compare against would be useful, e.g. one that decides randomly to search or not and another history based baseline that searches if the recent history required searches and vice versa. Such a baseline can be expected to perform well if there is such a strong temporal correlation of the need for search.
While it is clever to use PDM scores for the search decision this is different from comparing future closed-loop rollouts as the paper admits in A.2.4. PDM scoring and the true objective may not be aligned in a systematic way and the approach will inherit PDM score issues.
The evaluated planners and improved planners in a closed loop setting are necessarily tested on separate state distributions because their trajectories should drift apart. It would be useful to evaluate for the visited states of the base planner if search would have been executed. That way the same states would have been visited, even though in an offline way, but which would allow for a comparison on the same state distribution. This is similar to 5.3 but not the same.
The repeated call control seems to have an outsized effect on the final result and should be mentioned in the final paper. A lot of similar details in the appendix make the approach appear a bit engineered.
[1] Honda, K., Yonetani, R., Nishimura, M., & Kozuno, T. (2024, May). When to replan? an adaptive replanning strategy for autonomous navigation using deep reinforcement learning. In 2024 IEEE International Conference on Robotics and Automation (ICRA) (pp. 6650-6656). IEEE.
Questions for authors
Is there any insight why the score increase vs. search rate is not strictly monotonic?
Could you give any indication on the variance of the closed-loop score over different runs with different random seeds?
Could you describe the 4 of 5 rule and other details in repeated call control more closely? Was this estimated? How robust are these results to using more or less than 8 positive requests?
Without clarification of the issues described in critical weaknesses and answers to these questions I see the paper as borderline, slightly below the acceptance threshold but given a solid rebuttal I see potential to give a significantly more positive rating.
7 comments
Response to TNLf (2/5): Search runtime and peak computation
Critical Weakness 3
The runtime analysis does not look into peak planning conditions. The analysis shows a 32% reduction in planning time but this is averaged over the whole dataset. In practice, this may serve to safe searches overall but in situations where every step does need a re-planning step, the search will only add overhead. This is especially important when the expectation of some challenges is to provide trajectories with 10 fps. There may be a conceptual issue in this: Why use the method if it saves planning steps overall but adds to peak computation and inference time? This is not a major issue since only the fast predictor runtime is added but this may affect the overall impact.
Thank you for highlighting the importance of peak computation under 10 Hz planning. We substantially reduced the computation time of each search through implementation optimizations that reuse repeated route encodings, reduce GPU kernel dispatch, cache PDM route geometry, and batch projection calculations. After optimization, CALL mean runtime is 57.56 ms and P95 is 71.53 ms, both below the 100 ms planning interval, easing latency pressure on search frames.
Revised Ours completed 1,066 tests across the four test sets on RTX 4090 with test-run seed 0. These engineering optimizations preserve the original model weights, FP32 precision, and 21 candidates. The mean closed-loop score remains nearly unchanged after optimization: 86.521 before versus 86.553 after (+0.033 points). The search predictor takes only 4.14 ms on average; on-demand search reduces total computation, while implementation optimization further reduces runtime when search is needed.
| Model (ms) | Search predictor (ms) | PDM (ms) | Other overhead (ms) | Core total (ms) |
|---|---|---|---|---|
| 13.96 | 4.14 | 33.87 | 5.59 | 57.56 |
These are mean runtimes over all CALL frames. The search predictor includes feature extraction, processing, and prediction; other overhead includes trajectory conversion, search wrapping, and the remaining call overhead.
| Test set | CALL core mean (ms) | CALL core P95 (ms) | Over 100 ms |
|---|---|---|---|
| Hard-NR | 58.79 | 72.65 | 1.00% |
| Hard-R | 57.50 | 71.29 | 0.95% |
| Random-NR | 57.15 | 71.34 | 0.95% |
| Random-R | 56.52 | 70.20 | 0.91% |
The mean core runtime over all decision frames is 42.37 ms. Of these, 926 / 149,400 frames exceed 100 ms (0.6198%); among CALL frames, the corresponding count is 794 / 82,857 (0.9583%).
| Statistic | Driving score / 100 | Mature-frame call rate |
|---|---|---|
| Mean after optimization | 86.553 | 55.37% |
Response to TNLf (3/5): Simple baselines and PDM supervision
Critical Weakness 4
Simple baselines to compare against would be useful, e.g. one that decides randomly to search or not and another history based baseline that searches if the recent history required searches and vice versa. Such a baseline can be expected to perform well if there is such a strong temporal correlation of the need for search.
Thank you for suggesting these two direct comparisons. Additional experiments on the Random-NR, Random-R, Hard-NR, and Hard-R test sets show that Revised Ours has a clearly higher macro-average driving score than Random and History: it achieves 86.591 points with a 55.44% call rate, exceeding History by 1.486 points and Random by 1.710 points. Submitted Ours also scores higher than these simple rules. The table reports the equally weighted macro-average over Random-NR, Random-R, Hard-NR, and Hard-R (261/272 scenarios in Random/Hard, respectively) with test-run seed 0, together with each method's actual call rate.
| Method | Driving score / 100 | Mature-frame call rate |
|---|---|---|
| Revised Ours | 86.591 | 55.44% |
| Submitted Ours | 86.074 | 56.81% |
| Full Search | 85.685 | 100.00% |
| History | 85.105 | 51.79% |
| Random | 84.882 | 56.81% |
History continues searching when the most recently observed search gain exceeds 0.05; otherwise, it probes after six planner calls have elapsed since the last search. The probing interval is fixed on Val14. Compared with Submitted Ours, the direct threshold-based decisions of Revised Ours further improve the driving score and reduce the call rate.
Critical Weakness 5
While it is clever to use PDM scores for the search decision this is different from comparing future closed-loop rollouts as the paper admits in A.2.4. PDM scoring and the true objective may not be aligned in a systematic way and the approach will inherit PDM score issues.
Thank you for your comment. The scenario-average post-search PDM score over Revised Ours' actual CALL steps has a Spearman rank correlation of 0.456 with its final closed-loop score. This shows a positive association between local PDM scores and final closed-loop driving performance.
PDM's sub-objectives are themselves constructed around closed-loop driving evaluation. In Section 3.3 of Parting with Misconceptions about Learning-based Vehicle Motion Planning (CoRL 2023) [1], Dauner et al. explicitly state that the scoring function "closely resembles the nuPlan evaluation metrics". Candidate execution is first simulated using an LQR controller and a bicycle model with the same parameters as nuPlan, and candidates are then scored for traffic compliance, progress, and comfort.
We use the StateTransformer/PDM refinement branch integrated into Diffusion Planner [3]. The supervised components include no at-fault collision (NC), time to collision (TTC), drivable area compliance (DAC), driving direction compliance (DDC), progress (P), comfort (C), and speed limit compliance (SL). These components incorporate the safety, rule compliance, efficiency, and comfort objectives of final closed-loop evaluation into short-horizon candidate evaluation. Diffusion Planner [3] and NAVSIM [2] also provide evidence of closed-loop improvements from refinement and an association between PDM scores and closed-loop performance, respectively.
With this supervision, Revised Ours improves the average score over Base by 7.555 points and over Full Search by 0.907 points under test-run seed 0. Across three test-run seeds, its mean complete closed-loop score is 86.429, compared with 85.469 for Full; their search call rates are 55.59% and 100%, respectively.
[1] Dauner et al. Parting with Misconceptions about Learning-based Vehicle Motion Planning. CoRL 2023. Official paper.
[2] Dauner et al. NAVSIM: Data-Driven Non-Reactive Autonomous Vehicle Simulation and Benchmarking. NeurIPS 2024. Full text.
[3] Zheng et al. Diffusion-Based Planning for Autonomous Driving with Flexible Guidance. ICLR 2025. Full text.
Response to TNLf (1/5): Related work and feature choice
Thank you for carefully reviewing our work and for your specific and insightful suggestions. Following your comments, we have added methodological explanations and experimental comparisons. In particular, we further validated direct threshold-based decisions after removing the hand-crafted repeated-call rules and adopted this as our revised main method.
We refer to the method in the original submission as Submitted Ours. In addition to learning search value, it uses hand-crafted rules to control repeated calls. At each frame, the base planner first generates a new trajectory. The method then uses current and historical information to predict PDM component scores, component changes due to search, and degradation probabilities, combining them into a search value v. Search is executed only when v exceeds the threshold δ and passes the repeated-call control. Inspired by your suggestion, we removed the hand-crafted repeated-call control rules and refer to the simplified method as Revised Ours. During its mature phase, it decides whether to search directly using v>δ: CALL executes PDM candidate search, whereas SKIP executes the current frame's base trajectory.
Critical Weakness 1
Thank you for recommending Honda et al.'s When to Replan? An Adaptive Replanning Strategy for Autonomous Navigation Using Deep Reinforcement Learning (ICRA 2024) [1]. We will add this reference and precisely define our contribution. That work learns when to regenerate a global reference path in hierarchical navigation; in our method, a new base trajectory is generated at every step, and the learned module decides whether to add candidate search. Our contribution lies in analyzing the distribution of benefits from this additional search and allocating its computation using a lightweight supervised model.
[1] Honda, K., Yonetani, R., Nishimura, M., & Kozuno, T. (2024, May). When to replan? an adaptive replanning strategy for autonomous navigation using deep reinforcement learning. In 2024 IEEE International Conference on Robotics and Automation (ICRA) (pp. 6650-6656). IEEE. Full text.
Critical Weakness 2
Thank you for your suggestion. We added a direct closed-loop comparison: the heading-deviation threshold policy scores 0.672 points higher than Random while using fewer search calls, showing that this feature contains information useful for search decisions. Below are the mean results on the Random-NR, Random-R, Hard-NR, and Hard-R test sets with test-run seed 0.
Route heading change describes the need to turn ahead, while the heading deviation between the base trajectory and the route describes their directional consistency. Our search predictor jointly models these quantities with the traffic environment, route geometry, and base-trajectory dynamics, using 25 factors in total and recent history. Revised Ours achieves 86.591 points, a further 1.037-point improvement over the heading-deviation threshold policy alone.