- Rating
- 3(+1)
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
In the paper "Collision-Free Is Not Enough: Passage-Conditioned Navigation for Wheeled-Legged Robots," the authors propose a navigation framework that preserves information from previously successful trajectories, including approach geometry, speed limits, and locomotion modes, while allowing local replanning around obstacles. They demonstrate the approach on a wheeled-legged robot and report improved task completion and trajectory recovery in simulation.
Overall, I find that the paper lacks a clear methodological contribution. The underlying problem is reasonable, but it is unclear how the proposed approach differs fundamentally from existing reference-based or kinodynamic planning methods. Much of the proposed framework appears to combine standard trajectory optimization, reference tracking, and manually specified execution constraints. The paper does not convincingly establish what new capability this combination provides.
Critical strengths
The paper is supported by a physical robot deployment across multiple terrain transitions, along with extensive simulation experiments. The authors also provide component ablations and report negative results, which help characterize the limitations of their implementation.
Critical weaknesses
My primary concern is the lack of a clearly defined methodological contribution. The authors argue that collision avoidance alone is insufficient because successful traversal also depends on approach geometry, velocity, and locomotion mode. However, these considerations are already central to kinodynamic motion planning. It is unclear what specific limitation of existing methods the proposed framework addresses.
The proposed method appears to retain a demonstrated reference trajectory, associate it with manually configured constraints, and perform local replanning while encouraging the robot to return to that reference. These are established planning and control mechanisms. The paper does not clearly explain what is novel about their integration or why existing formulations could not accomplish the same objective.
The experimental results also provide limited evidence for the proposed contribution. The strongest improvements come from reference rejoining and explicit approach correction, both of which are expected behaviors of conventional trajectory-following methods. The experiments do not convincingly isolate the benefit of the proposed passage representation.
Questions for authors
-
What distinguishes the proposed approach from existing kinodynamic planning or reference-based replanning with maneuver-specific constraints?
-
How are the passage conditions determined, and what evidence establishes that preserving them improves maneuver feasibility?
-
Can the authors demonstrate an improvement attributable specifically to passage conditioning, independent of conventional reference rejoining, approach correction, and gait scheduling?
6 comments
Response to Reviewer TGv8 (2/2): Q2 and Q3
Q2. How the passage conditions are determined, and the evidence that preserving them improves feasibility. They come from the demonstration: the crossing position, the crossing direction and the gait intervals are taken from the teaching recordings. The tolerances (10 cm, 10°), window lengths, speed caps and retry count are settings shared by the whole environment (Section 4.1, Table 10). The evidence is of three kinds.
- Robot (Table 11): with the ledge stored as an ordinary waypoint, both full-speed runs stalled at the first ledge. With the ledge stored as an event, the gate refused an approach 0.16 m off the line, the robot backed up once and crossed within 0.07 m, and the run reached all 29 waypoints. These are consecutive versions of one system, and the controlled comparison is the factorial below.
- Learned skill in contact simulation (Appendix N): our stairs policy passes 98.7% of entries within 5° of heading error and 32.7% beyond 25°.
- Controlled experiment (Section 5.2): the factorial under Q3.
Q3. An improvement attributable to passage conditioning, independent of rejoining, approach correction and gait scheduling. The new experiment was designed around this question (Section 5.2). Every arm has the same centerline, gait schedule, sensing input and feedback model, and the first arm is conventional tracking with gait scheduling, so approach correction by a conventional tracker is the baseline. Share of disturbed ledge crossings inside the entry limits:
| Disturbance arrives | Conventional tracking + gait schedule | + stored approach window | + entry gate |
|---|---|---|---|
| 2.4 m before the ledge | 95.9% | 100% | 100% |
| 1.2 m | 46.3% | 100% | 98.6% |
| 0.76 m | 22.4% | 47.6% | 100% |
A conventional tracker corrects the approach when it has distance (95.9% at 2.4 m) and does not in the last 1.2 m, which is where a detour that rejoins late leaves the robot. The part attributable to the stored events is that remainder: +25.2 points for the approach window at 0.76 m, and the rest for the gate, whose main effect over all other factor combinations is +64.5 points. The gate column is measured on entry geometry in kinematic simulation: the gate refuses an approach outside the limits and the robot approaches again, and no rollout at 0.76 m ends in a hold. Its check is also conservative: across 1,470 approaches made without the gate, all 350 that pass the check end inside the limits, against 50.8% of those that fail it.
On rejoining, we separated the effect of returning to the reference from the way the robot returns, by adding the tracker's default recovery behaviour (turn and side-step) as a plain baseline to our strategy (walk forward while steering to the stored line; Section 5.3). Runs are scored by the competition's waypoint rule: the body touches the 0.25 m disk of every goal in order, and a fall voids the run. After a 1.2 m push, completion is 0.4% when the robot holds, 61.4% with the default behaviour and 75.9% with our rejoining strategy (14.5 points or 24% more; interval 8.2 to 21.3), against 78.0% for the same cells with no push. Under the stricter rule of the previous version (centre within 0.20 m, a target 36% smaller in area) the three figures are 0%, 44.4% and 56.8%. Our strategy returns the robot to the undisturbed level and reaches the next goal in all 241 cells, a median of 1.6 s later than without a push; the default behaviour reaches it in 216 cells, a median of 5.8 s later.
Two points that the previous version may not have made clear enough. The method contains no trajectory optimization: Section 4.2 generates a small set of lateral offsets in route-relative coordinates, scores them with the closed-form cost of Eq. (5), and falls back to a bounded A* search where detours are permitted. And the constraints are configured by hand only in part: the limits are set once for the whole environment, while the crossing position, the crossing direction and the gait intervals come from the demonstration (Table 10). The revised Section 4 states both.
We sincerely hope that these clarifications and the new experiment address the concern about the contribution, and that the reviewer would consider raising the score. Thank you again for the thoughtful review; we wish you every success in your research and would welcome further exchange.
Further response to Reviewer TGv8: Q1 from practice
We thank the reviewer again and add one point to Q1, from practice. Before this method, we tried the standard approaches in the same environment. Planning the route from the map with two grid planners of our own, one over flat cells and one over cells and gaits, found a path for 13 of 29 segments (Appendix B). Following a fixed route without recovery completed the full route in 4 of 24 contact-simulation seeds (Appendix N). On the robot, on the day before the final, earlier versions that followed the route without the re-adjust state ended 9 of the 13 logged runs in a hold: 4 when the robot was more than 0.8 m off the route and 5 after 8 s without progress. With the ledges stored as ordinary waypoints, both full-speed runs stalled at the first ledge (Appendix I, Table 11). In contact simulation, replacing the taught centerline inside the same corridor by shortest-path planning or by the RB-TRG body-aware planner gave 44.0% and 43.6% completion, against 62.6% for the taught reference with live sensing (Section 5.4). The final version, which stores each transition as an event and rejoins the reference, completed that evening's full run without a hold and six of six runs on the competition day.
The robot record of the earlier versions is now stated in Appendix I of the updated PDF. We would be glad to clarify anything further.
Response to Reviewer TGv8 (1/2): contribution and Q1
We sincerely thank the reviewer for the careful assessment and for three clear questions, which helped us sharpen the paper. In short, the revision responds to each point as follows.
Numbers refer to the revised PDF.
The contribution. We may not have made it clear enough in the previous version, and the revised introduction now states it directly. The paper addresses one specific limitation: when the locomotion controllers are fixed and can be neither modelled nor retrained, a planner has no description of the states from which a stair or ledge can be climbed. We are indebted to earlier work on route following, kinodynamic planning and skill composition; building on what it explored, the paper contributes three things:
Q1. Difference from kinodynamic planning and reference-based replanning with maneuver-specific constraints. The difference lies in what is assumed to be available. We agree that approach geometry, speed and locomotion mode are classical concerns of kinodynamic planning, and the revised related work says so. A kinodynamic or maneuver-constrained planner derives the admissible approach states from a model of the system. Our controllers are black boxes (factory gaits on the robot; in simulation, two PPO policies that we trained and then froze), so there is no such model.
The learning literature obtains these states through further interaction or through access to the skills: skill chaining learns initiation sets from repeated interaction (Konidaris & Barto, 2009; Bagaria & Konidaris, 2020), terminal-state regularization shapes where each policy ends during training (Lee et al., 2022), STAP scores a skill sequence with the skills' value functions (Agia et al., 2023), and ANYmal parkour trains a navigation policy over its locomotion skills (Hoeller et al., 2024). Closest to our setting, Hedegaard et al. (2025) plan with black-box skills by inserting motion plans that bring the robot to a configuration from which each skill can start. We study the case in which those start conditions are not given: they are recorded in one teaching session in which every transition was crossed.
Reference-based replanning (e.g., Sehn et al., 2022) retains the taught path through a deviation penalty. The new experiment tests directly whether retaining the path is enough, and within about 1.2 m of a transition it is not (Table 3). We retain, in addition, one event per transition and enforce it where it occurs. These references are now in the paper.
Practical evidence. The system was developed for a public competition in which every team could draw on the same published wheeled-legged, driving and aerial navigation methods, and we started from that literature ourselves; we found no open-source method that met the conditions of the task together. Our first versions followed a fixed route and failed under small changes in the scene and under map and localization error; in contact simulation, route following completed the full route in 4 of 24 seeds without recovery and in 19 of 32 with it (Appendix N). The final system won third place at the competition, which drew 2,999 submissions, and was the only finalist in its task to complete the route fully autonomously (Section 5.5). We also looked at commercial navigation services. We have not used them, but their public documentation describes related functions, for example route edges annotated for stairs in Boston Dynamics' GraphNav; they are proprietary and tied to the vendor's robots, and we found no published account of how they enforce entry. Our method needs only one simple teaching session, and the navigation stack and benchmark are released with the paper.
We would be glad to discuss any specific formulation the reviewer has in mind.