- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2(−1)
- Soundness
- 1(−1)
Read review
Paper summary
This paper proposes a predictive composite guiding vector field for manipulator path following with full-link obstacle avoidance. It combines obstacle prediction, capsule-based link models, and joint-space corrections, and introduces an event-driven mechanism for returning to the path after avoidance. The method is demonstrated in simulation and on a real robot.
Critical strengths
I think the problem is useful. Keeping the end effector clear of obstacles does not mean the whole arm is safe, so considering the other links is necessary. I also like that the paper considers what happens after avoidance. The robot still needs to return to the path, and simply restoring the original controller may not handle this well. Bringing avoidance and recovery together makes sense for this task.
Critical weaknesses
What I did not fully understand is the main insight behind the method. Prediction, capsule geometry, link correction, and recovery modulation each have a clear purpose. But why combine them in this particular way? What does this combination tell us beyond the usefulness of each component? I can follow how the controller is constructed, but the paper does not make its main conceptual contribution equally clear. Different links may need conflicting motions to avoid obstacles, while returning to the path adds another requirement. The paper uses weighted corrections and gives avoidance more weight as the threat increases. But when these requirements cannot all be satisfied, what behavior should we expect? How does the design decide which requirement to compromise? Giving the weighting rules does not fully explain the reasoning behind that choice.
I also have a question about the global threat index. A lower threat value means less danger according to the index, but why does it mean that the robot should move more strongly toward the path? Threats with similar magnitudes can have different locations and directions. I understand that the individual link corrections still use this information, but how does the recovery decision based on the global index remain consistent with those corrections?
The role of event history is also not clear enough to me. What does remembering an avoidance event tell the controller that the current robot and obstacle state does not? Is it mainly used to prevent unstable switching, or does it provide a different basis for deciding when recovery is appropriate? The paper should explain this distinction more directly.
Since an appendix is allowed, why is there no appendix at all? The paper feels underdeveloped in several places. Why not use that space to explain the design choices, how the components work together, and the limitations more fully? There are quite a few interacting mechanisms here, and I do not think their rationale has been discussed in enough depth.
Questions for authors
What is the main insight gained by combining these components in this particular way? When link avoidance and path recovery request conflicting motions, what principle determines the compromise? Why is the global threat index suitable for deciding when to accelerate recovery, and what does event history add beyond the current state? Also, why not include an appendix to explain these design choices and their limitations more fully?
3 comments
W2 and Q2 Soft coordination after command limiting
Review:
Collision-safety guarantees. Given that Equation (7) formulates link-level avoidance as soft optimization objectives and Equation (10) applies componentwise joint-velocity saturation, under what conditions can collision avoidance be guaranteed? If formal guarantees are not available, could the authors clarify the limitations of the safety claims and provide additional evidence concerning controller behavior under challenging or uncertain conditions?
Response: Equation (7) coordinates link-level avoidance corrections as soft tasks; Eq. (10) explicitly bounds the final joint-velocity commands. Prediction, finite-thickness corrections and threat-dependent weights shape avoidance, and geometric evaluation follows the realized motion after the complete filtering and saturation pipeline.
At 40 ms command updates and 1 ms geometry checks, the original controller completes 20/20 narrow-frame tasks with worst sampled full-capsule clearance of 8.343 mm (Table 3). The controlled body-protection ablation gives 0/20 overlaps for full control versus 20/20 for end-effector-only protection under the same true link geometry. This supports collision-free execution with bounded joint commands in the tested modeled conditions; Section 3.3 makes this empirical scope explicit rather than presenting a general forward-invariance theorem.
A separate archived diagnostic with setting C065, 40 ms updates and 1 ms geometry checks records overlap in 0/20 environments without sensing delay, 1/20 at 80 ms and 2/20 at 120 ms, characterizing sensitivity to delayed information for that setting.
The C065 diagnostic is distinct from the default-controller results and computation timing. Archived noncircular-path checks of the original controller also have no observed overlap in four path-scene combinations with 20 seeds each, totaling 80 run conditions rather than 80 independent environments. A separately parameterized setting C has three overlaps in 20 static-ellipse conditions. These checks characterize the tested conditions and parameter sensitivity; they are not a generalization guarantee. Physical execution evidence is addressed separately below.
W1 and Q3 Component contributions and repeated evaluation
Review:
Component contributions and experimental reliability. Could the authors clarify the number of independent trials or avoidance events used to calculate the success rates in Table 2? In addition, can the individual contributions of predictive activation, capsule-based link correction, and rank-discounted threat aggregation be isolated through ablation experiments?
Response: The additional tests separately examine predictive activation, full-link correction and rank discount. Removing prediction at unchanged thresholds produces 2/20 overlaps versus 0/20 with prediction. Removing applied link correction or modeled thickness gives 20/20 frame overlaps versus 0/20 for full control. The 180-trajectory discount test finds small paired motion changes with unchanged collision/completion outcomes. The full-link and compensation/feedforward controls are reported with our component replies; their roles are not inferred from the original illustration alone.
Each method in the original Table 2 has one static trajectory, with reconstructed completed/released event counts of None 1/1, Fixed window 0/1, State-driven 1/2 and EDSR 1/1.
The extra state-driven event is interrupted by renewed threat, and the fixed-window event is unfinished at the simulation end. These are within-run fractions, with time and integrated error summarized over completed recoveries. Table 2 keeps the original displayed values while clarifying the recovery windows and completed/released counts; the windows are reconciled through numerical reconstruction from archived trajectories.
The repeated common-release test covers 40 environments, with 40/40 recovery for all four strategies. EDSR has mean confirmation time of 0.4478 s versus 0.4447 s for gain-matched state-driven control, a 3.1 ms difference, with approximately 51% lower mean command variation. The persistent-obstacle test covers 20 new environments with four primary strategies (80 trajectories), plus a 20-trajectory intensity-rate diagnostic; it evaluates stable near-path duration rather than an event success probability. These studies distinguish recovery speed and command variation from repeated-trial reliability. The component and repeated-environment results are supplied in the responses; Section 4.2/Table 2 now makes the original event denominator explicit.
W2 and Q3 UR7e execution evidence
Review:
Quantitative measurements and repeated trials on the physical robot would also help assess the reliability of the reported improvements.
Response: The complete controller has been deployed on the UR7e for path following, obstacle avoidance and rejoining, with joint-angle logs recorded. Section 4.4 presents the physical execution snapshots and specifies those recordings. This establishes deployment and physical execution of the model-based controller using known kinematics and explicit link geometry.
The repeated-environment statistics and quantitative path-error/clearance comparisons above are simulation results; the hardware experiment is reported as a qualitative execution demonstration. Reporting these forms of evidence separately keeps their respective roles clear.
We thank the reviewer for identifying the need to separate comparative performance, component contributions and the scope of the safety evidence. We address these points in three responses.
W1 and Q1 Matched task comparison and timing
Review:
Comparison with existing methods. Could the authors provide quantitative comparisons against representative GVF-based, CBF-based, or MPC-based collision-avoidance methods under matched experimental conditions? In particular, comparisons of minimum collision clearance, path-following error, recovery time, success rate, and computational cost would help establish the practical advantages of the proposed framework.
Response: Section 4.5/Table 3 now compares our original-parameter controller, FASM-MPC and three HARMONIOUS settings in 20 paired narrow-frame environments, with the same robot, joint bounds, 15 mm evaluation radius, 10 s duration and 40 ms command updates; body geometry is checked every 1 ms. Completion requires no observed overlap and at least one net turn.
Our controller and FASM-MPC both complete 20/20. Mean progress is 2.583 versus 2.270 turns (+13.8%); FASM-MPC has lower RMS (21.977 versus 31.152 mm) and greater worst clearance (37.276 versus 8.343 mm). HARMONIOUS k2/d30, k6/d30 and k2/d5 complete 10/20, 2/20 and 6/20, respectively. These are control-layer adaptations: FASM-MPC's GPIO observer and HARMONIOUS's perception stack are excluded, and frame-specific directional guidance remains only in our implementation. The comparison therefore evaluates the implemented controllers, with their performance trade-offs.
Recovery is additionally tested in a separate 20-environment common-release protocol at 40 ms updates: mean 5 mm confirmation time is 0.60055 s for ours, 0.09000 s for FASM-MPC (40 mm margin, penalty 10) and 0.65540/0.21695 s for HARMONIOUS k2/d30 and k6/d30, all with 20/20 completion. FASM-MPC is faster in that recovery protocol; our observed external benefit concerns sustained task progress.
The computation column in Table 3 is measured separately on an Intel Core Ultra 7 265KF with MATLAB R2022b (9.13.0.2049777), Windows x64. Each method receives a 0.4 s warm-up and three sequential 10 s replays of its own archived trace in one fixed frame environment (seed 9201), at common 40 ms updates; excluding each replay's first call leaves 747 retained calls per method. Mean elapsed time is 0.689 ms for ours, 184.403 ms for FASM-MPC and 0.951/0.974/0.581 ms for the three HARMONIOUS settings. Our 95th percentile is 1.075 ms, with no retained call exceeding 40 ms.
Timing includes controller geometry, filtering, optimization and internal bookkeeping; it excludes physical integration, plotting, file I/O and independent clearance checking. The 20-environment performance trajectories do not inject computation delay, and these controller-call measurements are separate from end-to-end hardware latency. The full task comparison and mean computation column are in Section 4.5/Table 3; the additional recovery protocol is reported here.