- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper proposes a self-supervised solution operator for shape reconfiguration of modular robotic swarms. The method uses a graph Transformer with geometric and connectivity-aware inductive biases to predict agent velocities, trained through differentiable swarm dynamics with collision avoidance, connectivity preservation, and terminal matching objectives. At deployment, a trajectory projection step is applied to the predicted trajectory to reduce safety constraint violations, followed by independent verification. Experiments on planar and 3D benchmarks show that the proposed method achieves higher certified success rates than the evaluated baselines. Ablation studies demonstrate that both the learned trajectory guide and the projection step contribute to successful reconfiguration.
Critical strengths
The paper provides a solid mathematical formulation of the swarm reconfiguration problem, with well-defined constraints and a rigorous verification procedure. I also appreciate the thoughtful design of the inductive biases, which are well motivated and closely aligned with the underlying problem.
Critical weaknesses
-
Insufficient experimental analysis. The proposed method introduces several design choices, including the history-dependent active graph, tether-based features, geometric attention biases, and priority gating. However, the current ablation studies mainly examine the contributions of the learned guide and trajectory projection, without isolating the effects of these individual components. In addition, the experiments use a fixed time-budget multiplier and report certified success rates under a relatively large terminal tolerance , without sufficient sensitivity analysis. More comprehensive ablation studies and evaluations across different time budgets and terminal tolerances would help clarify the contributions of the proposed components and the robustness of the reported results.
-
Insufficient justification for the learned solution operator. I understand that one of the motivations of this paper is to avoid repeatedly solving expensive trajectory optimization problems, which can be non-convex. However, since the authors have already formulated explicit geometric constraints and optimization objectives, why is a learning-based approach necessary? Can the authors compare their method against directly optimizing the trajectory objective in Eq. (2)? Such a comparison would help assess the actual benefits of the learned operator, especially considering that the proposed pipeline still requires expensive trajectory projection at deployment. Moreover, the authors do not evaluate whether alternative trajectory guides, such as Transport or MAPPO, could achieve comparable performance when combined with the same projection.
Questions for authors
-
Architecture Ablations. The proposed method introduces several inductive biases, including the history-dependent active graph, tether-based features, geometric attention biases, and priority gating. Could the authors provide ablation studies to evaluate the individual contributions of these components? Also, how does the performance change when replacing the active graph with standard full attention or the instantaneous contact graph?
-
Time-Budget Sensitivity. The model is trained with varying time budgets, but the main experiments just use a fixed multiplier . How does the certified success rate change across different values of ? Also, could the authors also compare their method against the baselines under the same maximum execution-time constraints? Since trajectory projection may increase the execution time through retiming, I wonder whether the reported performance advantage remains consistent when all methods are given the same actual execution-time budget.
-
Terminal-Tolerance Sensitivity. The reported certified success rates use a terminal tolerance of , which I think is relatively permissive, and no method passes the stricter tolerance of . Could the authors provide a sensitivity analysis using intermediate tolerances between and , to clarify how terminal accuracy affects the reported success rates?
-
Direct Trajectory Optimization. Since the authors have already formulated an explicit trajectory optimization objective in Eq. (2), could they compare the learned solution operator against directly optimizing this objective without a neural network? In particular, how do direct optimization and the proposed learned pipeline compare in certified success rate and planning time under similar computational budgets?
-
Alternative Guides with the Same Projection. The current ablation compares the learned guide with a straight-line guide under the same projection. Could the authors additionally apply the proposed trajectory projection to the Transport and MAPPO baselines?
-
Computational Complexity and Scalability. Could the authors provide a more detailed analysis of the computational complexity and runtime of the proposed pipeline? In particular, I would like to understand the costs associated with Hungarian matching, active graph and tether updates, MST computation, graph Transformer inference, and trajectory projection. How do these costs scale with the number of agents, and which components dominate the overall planning time?