- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes DeGG-Flow, a framework for enforcing coupled hard requirements in multi-agent flow matching through agent-wise QP guidance. It considers shared-entangled (SE) and private-entangled (PE) requirements, and develops adaptive SE constraint allocation, conditional finite-horizon convergence and feasibility results, and a Wasserstein bound on guidance-induced distributional deviation. Experiments on multi-robot collaboration and multi-object scene generation show substantial improvements in constraint satisfaction, including for unseen agent counts and modified affordance requirements without retraining.
Critical strengths
1. A concrete feasibility result for agent-wise guidance. Proposition 3.2 is the part I find most interesting. Its effective-direction construction accounts for conflicting local constraints and establishes feasibility under explicit assumptions. That is a useful addition to the SE/PE framework. The time-varying SE bounds accommodate initially infeasible samples, which matters when generation starts from noise. The finite-horizon results and Wasserstein bound also make the assumptions behind constraint satisfaction and distributional deviation explicit.
2. Clear gains in both applications. The gains over nominal generation are clear in both tasks. In Task 2, success under modified requirements rises from 112/250 to 250/250 without retraining. The left-handed laptop example makes the benefit easy to see. Results at unseen agent counts, the additional requirement tests, and training curves across seeds also strengthen the evaluation.
Critical weaknesses
1. Pointwise feasibility does not ensure complete trajectories.
Theorem 3.3 assumes a full-horizon trajectory satisfying the guidance inequalities, but Corollary 3.4 only establishes pointwise QP feasibility. For example, let , , , , , , , , and . The QPs are feasible everywhere but induce for and for . Starting from , the terminal budget condition holds, yet the trajectory reaches zero at and admits no Carathéodory continuation. This exposes a gap between the conditional theorem and the implemented feedback, rather than contradicting Theorem 3.3. A Filippov continuation is possible, but its connection to the numerical sampler remains unestablished.
2. Decoupling can impose excessive correction.
For a single SE factor with , consider , nominal velocities with , identity guidance maps, and unit quadratic costs. The local QPs require squared correction norm , versus for a centralized QP. This instantaneous cost ratio is unbounded, although it does not imply an equivalent gap in terminal distributional deviation. The experiments do not establish whether computational savings justify this conservatism.
3. The specific contribution lacks experimental support.
The SE/PE framework and agent-wise QPs build on prior work already cited by the authors. Proposition 3.2 adds a specific adaptive allocation, but comparisons mainly against unguided generation do not isolate its benefit. Centralized guidance and simpler allocation baselines are needed to establish the value of the proposed design.
Questions for authors
Q1. Closed-loop guarantees.
What checkable assumptions are needed to rule out the closed-loop counterexample above? Do they cover the squared-hinge violation functions used in the experiments, including the boundaries where their gradients vanish? Please establish that the QP feedback admits complete trajectories on under a stated solution concept, that these trajectories satisfy (9), and that the claimed terminal guarantee follows. If generalized solutions such as Filippov solutions are used, how does the numerical sampler approximate a solution satisfying these guarantees?
Q2. Cost of decoupling.
In one representative SE setting, please compare the proposed guidance with a centralized minimum-norm QP using the same nominal model, shared requirements, and sampling settings. Report constraint satisfaction, cumulative correction energy, runtime, and the information exchange required by (14). This would help establish whether the benefit of independent computation or reduced coordination justifies the additional correction.
Q3. Specific novelty and empirical attribution.
What changes if (14) is replaced by uniform weights or weights proportional to ? Please provide a reproducible case in which a simpler allocation fails but the effective-direction allocation succeeds, and show whether Task 1 actually encounters this type of local conflict. Which reported gains can then be attributed specifically to Proposition 3.2?
The proposed example does not invalidate any theorems, which explicitly assumes a full-horizon trajectory satisfying the Lyapunov inequalities, as is common in control Lyapunov and control barrier function literature. Establishing closed-loop existence is a separate theoretical question.
Our goal is not to outperform centralized guidance in correction energy, but to enable independently computed guidance inputs when centralized decision making is undesirable or unavailable.
Our proposition establishes a specific feasibility guarantee for conflicting local constraints, and the experimental improvements demonstrate the effectiveness of guidance.
We do not claim that pointwise QP feasibility implies complete trajectories. Generalized existence of trajectory theory and numerical approximation guarantees are valuable but are beyond our stated results.
Centralized minimum-norm guidance can require less correction, but our contribution is to eliminate dependence on other agents' simultaneously computed guidance inputs, not to claim lower communication or correction costs.
Unlike fixed allocation rules, our adaptive allocation method provides explicit feasibility conditions under conflicting constraints.