- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies obstacle-aware formation coordination for multiple UAVs. The authors propose a hierarchical guiding vector field that combines obstacle-aware path deformation, adaptive formation reconfiguration, and virtual-coordinate coordination. The formation changes between circular and line configurations according to the estimated obstacle risk, while local repulsive terms are used for obstacle and inter-UAV avoidance. The method is evaluated through numerical simulations and CoppeliaSim experiments, including comparisons with two potential-field-based approaches.
Critical strengths
The overall framework is reasonable and addresses a practical problem in multi-UAV coordination. Combining path deformation with adaptive formation reconfiguration is useful for handling obstacles along a prescribed path. The numerical results also show improvements in obstacle clearance and reference tracking over the two compared baselines.
Critical weaknesses
-
My main concern is the limited novelty. Guiding vector fields, virtual-coordinate coordination, and potential-field-based obstacle avoidance have been extensively studied. The proposed method mainly combines these existing techniques with a risk-dependent formation adjustment mechanism. I would also suggest moving the qualitative comparison in Table 1 from the Introduction to the Related Work section. More importantly, the comparison itself seems to suggest an incremental extension of existing methods rather than a substantial methodological advance. Although the overall framework is reasonable, I do not see a sufficiently new control principle or learning-based contribution. The distributed property is also limited, since the common formation variable still depends on information from all UAVs. Overall, the contribution appears rather limited, particularly for ICLR.
-
The theoretical and experimental support is also insufficient. The paper does not establish convergence or collision-avoidance guarantees for the complete closed-loop system, especially during formation reconfiguration and under velocity saturation. The experiments are largely restricted to six UAVs moving in a two-dimensional environment with known static circular obstacles. There is no direct comparison with closely related guiding-vector-field methods, and no ablation study to distinguish the contributions of the main components. I also noticed inconsistent results between Tables 2 and 3 under seemingly identical parameter settings. These issues make it difficult to assess the reliability and generality of the reported improvements.
Questions for authors
-
Could the authors clarify the main technical novelty compared with existing guiding-vector-field and virtual-coordinate coordination methods, particularly Yao et al. (2023)? Beyond combining established control techniques, what is the main generalizable contribution?
-
Can the authors provide any convergence or collision-avoidance guarantees for the proposed closed-loop system, especially when the formation offsets vary with time and the velocity commands are saturated? If such guarantees are not available, what are the limitations of the method?
-
Could the authors explain the differences between Tables 2 and 3 under the nominal parameter settings? It would also be useful to clarify why the experiments do not include direct comparisons with closely related GVF methods or ablations of the main components.
3 comments
Safety and convergence
W2 Safety scope
Review:
W2 “The paper does not establish convergence or collision-avoidance guarantees for the complete closed-loop system”
Response: In Sec. 3.3, the applied velocity is the sum of tracking and both repulsive corrections after speed limiting. The reported clearances concern the tested planar point trajectories. A guarantee for the complete closed loop during reconfiguration requires a separate analysis of reference motion and both limits.
Q2 Sampled error dynamics and convergence limits
Review:
Q2 “especially when the formation offsets vary with time and the velocity commands are saturated?”
Response: Let , and . The raw velocity is , where is the clipped virtual rate, is the centered difference at fixed , and is the sum of the two repulsive velocities. Let be the applied velocity after the speed limit. Subtracting the next reference from the Euler position update gives
The reference increment includes normal-offset motion, which the tracking feedforward omits. Virtual-rate clipping also affects the shifted-coordinate update described in W1. Even when the scalar factor is contractive, the residual depends on the coupled closed loop. Zero-error convergence requires additional analysis.
These observations specify the scope of our conclusions. The distance, tracking and formation results describe behavior under the specified maps, parameters and initial conditions. They are not a general stability or safety theorem. We will make that distinction explicit in the method description and conclusion. The companion comment on Q3 and W2 gives the component and task evidence.
One possible certification direction is to check separation and obstacle clearance for all reference configurations during reconfiguration and combine a feasible safe initial set with constraints compatible with sampling and the applied velocity limits. Finite-body dynamics and uncertainty would require further analysis. These directions require a separate study and are not guarantees of the present controller.
Tables 2 and 3 and component tests
Q3 Tables 2 and 3 and the GVF comparison
Review:
Q3 “Could the authors explain the differences between Tables 2 and 3 under the nominal parameter settings?”
“It would also be useful to clarify why the experiments do not include direct comparisons with closely related GVF methods or ablations of the main components.”
Response: Tables 2 and 3. The discrepancy comes from three parameter settings omitted from the original manuscript. Table 2 used . Table 3 used . We checked all eight parameter combinations, including both original configurations, and reproduced their respective results from the same initial states. We also ran the original sensitivity-analysis code separately. Minimum sampled point distances were 0.27870147/0.06530318 m, and tracking RMSEs were 0.09497343/0.06546116 m. This explains the combined effect of the three parameter changes in that scene. For the proposed method and VAPF, the original coordination metrics satisfy within a single run. This conversion cannot align different parameter configurations, and changing the offsets changes the reference task.
Comparison with Yao et al. Adding our routes, repulsion and limits to their GVF coordination law changes the method being tested. The experiments below measure the effects of our own components. A numerical comparison with Yao et al.’s complete method under matched conditions remains open. The theoretical comparison is in W1 and Q1.
W2 Component evidence and evaluation scope
Review:
W2 “There is no direct comparison with closely related guiding-vector-field methods, and no ablation study to distinguish the contributions of the main components.”
Response: In the earlier experiments with four environments and ten paired initial states per environment, fixed line has greater mean obstacle clearance and lower tracking error relative to its own reference than our complete controller (Full). Different reference tasks prevent using these errors as a ranking on an identical prescribed reference.
Reconfiguration task. All six points must pass the designated central gate without obstacle penetration, then keep the centered, labeled circular-formation RMS error within 0.09 m at the sampled instants over 1 s after all exit. No point-model trajectory may enter an obstacle during this interval. At 0.8/0.4 m, Full meets both conditions in 20/20 runs for each width. With the original tracking law, the fixed-circle condition has obstacle entry in 20/20 runs. Fixed line passes in 20/20 runs but recovers the required circular formation in 0/20 runs. Each condition and width uses two gate locations and ten paired starts. This supports reference reconfiguration for the stated point-model task, not a limitation of Yao's general framework or random-map generalization.
Component effects. Removing path deformation gives 40/40 runs entering an obstacle versus Full's 0/40. Removing inter-agent correction reduces mean minimum point distance from 0.05333 to 0.00357 m. Same-map risk lookup nearly reproduces Full, and a preset time schedule improves some geometric metrics. The tests therefore do not show an independent benefit from online static-map risk recomputation.
Obstacle-repulsion cost. In a separate experiment group with conflicting geometric requirements, repulsion on/off gives 0/40 runs entering an obstacle in both conditions. Mean minimum clearance is 0.53135/0.13904 m, but the number of events with line-template error at most 0.09 m at sampled instants over 1 s is 0/160 versus 150/160. These 160 events are repeated observations within 40 runs. They use different scenes and observation intervals from the older 130/160 line-then-circle result and cannot replace or be pooled with it.
Obstacle repulsion increases clearance but can impede shape transitions. These results support specific component and task conclusions for planar point agents in known static maps. They do not certify finite airframes or establish general controller superiority.
Technical contribution and reuse
W1 Technical contribution and prior work
Review:
W1 “The proposed method mainly combines these existing techniques with a risk-dependent formation adjustment mechanism.”
Response: We use GVF to coordinate agents along a common route deformed from the known map. At each step, the same filtered map risk changes both the relative progress targets and the normal shift of each reference. The route itself stays fixed. The two offsets are ai and hi.
h_i=(1-\lambda)h_i^c+\lambda h_i^l,\quad p_i^d=f_o(w_i)+h_i n_o(w_i),\quad \Delta_{ij}=a_i-a_j.$$ Risk is evaluated at $\operatorname{mean}_i(w_i-a_i)$, not each robot's measured clearance. With $z_i=w_i-a_i$, the neighbor error is $z_i-z_j$. The update includes $(a_{i,k+1}-a_{i,k})/\Delta t$, cancelling the direct offset increment in the next offset-corrected coordinate when virtual clipping is inactive. Tracking uses the actual clipped rate $\nu_i$ in $\nu_i f_i'(w_i,t)-k_pe_i$. Repulsion and physical limiting modify the applied velocity. The GVF framework of [Yao et al. (2023)](https://doi.org/10.1109/TRO.2022.3224257) coordinates general parametric paths and surfaces. The main convergence analysis assumes fixed desired parameter differences and explicit graph and regularity conditions, although the general formulation permits time-varying differences. Sec. V provides a safety extension using quadratic programming (QP) and pairwise point distances, and Sec. VI analyzes heading alignment with saturated yaw input. Our addition is a rule that computes shared filtered risk from the map, adjusts both offsets together and includes the along-route offset increment in the coordination update. Yao et al. leave this rule unspecified. Their general path and surface representation can describe our references. Analyzing the time-varying closed loop here requires additional work. [Liu et al. (2026)](https://doi.org/10.1109/TAES.2026.3659453) combine formation surfaces defined along a route, route replanning and route-dependent scaling/rotation, and study tracking-coordination interaction. Our distinction is the specific shared risk rule, not greater expressiveness. Hu et al. study [spontaneous ordering](https://arxiv.org/html/2311.00976v1) and [flexible ordering](https://arxiv.org/html/2401.14013v1), and [Lu et al.](https://arxiv.org/html/2505.05840v1) study generalized formations. Our comparison with [Liu et al. (2025)](https://doi.org/10.1016/j.ifacol.2025.11.164) on obstacle-aware path following draws on their publisher abstract. **Connection to learning-based coordination.** In this known-map task, the risk thresholds and templates determine when the team starts changing shape and what references each member follows. This requires no policy training or fitted trajectory model. A learned controller could use these trajectories as references. That integration remains to be tested. **Q1 What can be reused and under what conditions** *Review:* Q1 “Beyond combining established control techniques, what is the main generalizable contribution?” **Response:** The offset rule can also use other routes or replace the circle and line templates. Desired differences are still computed by subtracting the two agents’ offsets. New templates still require checks on regularity, separation, clearance and executable rates, as well as closed-loop analysis. The original tracker omits explicit $\dot h_i n_o$ compensation, and nominal references during reconfiguration can coincide. Neighbor coordination exchanges scalar virtual coordinates, while shared risk needs aggregate progress and repulsion needs relative positions. The architecture is partially distributed, and network robustness remains untested. We will move Table 1 from the Introduction to Related Work to explain these mechanism and scope distinctions.