{"id":"0a6b5429-8118-4203-8d86-abc815db20cf","arxiv_id":"1908.06535","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":2,"one_line_summary":"Scale-free dynamic protocols are proposed for global and semi-global regulated state synchronization of homogeneous multi-agent systems with input saturation, requiring no knowledge of the network topology or size.","lead":"This paper designs distributed control laws that make networks of identical agents with saturating actuators track a common reference trajectory, without needing to know the network size or its Laplacian spectrum. If the proofs are correct, the same protocol works for any number of agents and any directed graph, a property that would simplify deployment of consensus control in large networks.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Semi-global linear protocol is not shown to be scale-free: the proof's ε* depends on the Laplacian spectral gap, so the abstract's no-topology-knowledge claim is stronger than the theorems.","rationale":"The reader's weakest_assumption was Assumption 1, which I do not regard as the main soft spot: Assumption 1 is the standard ANCBC hypothesis for global/semi-global stabilization with input saturation, and the paper explicitly assumes it. The load-bearing weakness I identify is the mismatch between the formal semi-global result and the scale-free/no-knowledge claim. In Theorem 3, the proof of saturation inactivity uses the L2 bound (32), and that bound inherits the graph spectral gap through the e-dynamics. Since α can be arbitrarily small across G_N^C, the ε* whose existence is asserted must depend on the graph. The problem statement allows this dependence, so the theorem is not false as written, but the abstract and the word 'scale-free' promise more than the proof delivers. The adaptive global protocol is genuinely scale-free because ε(χ_i) is scheduled online, so the central global contribution is not overturned. The reader's rationale already flags the semi-global saturation-inactivity argument as weak; my concern is a concrete consequence of that weakness. I therefore keep the verdict CONDITIONAL: the paper should either prove a uniform ε* over all graphs (which I expect is impossible) or qualify the semi-global claim as graph-dependent and adjust the abstract accordingly. The proof gaps in the global theorems are also worth fixing, but the scale-free issue is the more specific and load-bearing concern.","tokens_in":12218,"tokens_out":30310,"duration_ms":317297,"concrete_test":"For N=2, C={1}, take A as a double integrator, B=[0;1]^T, and a directed edge of weight a from agent 1 to agent 2, so \\bar L = [[1,0],[-a,a]]. Fix a compact set of initial conditions, e.g., \\|\\tilde x_i(0)\\|≤1 and \\|χ_i(0)\\|≤1. For a ∈ {1, 10^-2, 10^-4, 10^-6}, simulate the linear protocol (27)-(28) and numerically find the largest ε for which the control never saturates, i.e., \\|u_i(t)\\|_∞<1 for all t≥0. If this maximal ε decreases with √a (or tends to 0 as a→0), then no uniform ε>0 exists over all graphs in G_N^C, confirming that the semi-global protocol is not scale-free in the uniform sense. As an analytic counterpart, re-derive inequality (32) explicitly; if the bound contains the factor α^{-1/2}, the dependence on the graph spectral gap is established directly.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The most load-bearing weakness is the scale-free claim for the linear semi-global protocol in Theorem 3. The saturation-inactivity argument requires the time-L2 bound \\|(I⊗B^T P_ε)e\\|_2 < 1 (inequality (32)). The error e obeys \\dot e = (I⊗A − \\bar L⊗I)e, whose decay rate is α = min_j Re λ_j(\\bar L). This α can be made arbitrarily small by choosing a graph in G_N^C with a very small edge weight; for example, with N=2, C={1}, and a single edge of weight a→0 from the root to the follower, \\bar L has eigenvalue a, so α=a. For such graphs \\|e\\|_2 grows like \\|e(0)\\|/√α, and the proof therefore requires ε* to shrink like √α / \\|e(0)\\|. Thus the ε* whose existence is asserted depends on the Laplacian spectral gap and on N. Problem 2 formally permits this dependence, but the abstract's claim that the protocol 'does not need any knowledge of the directed network topology and the spectrum' and is 'scale-free' overstates what is proved: the proof does not establish, and the bound suggests there is no single ε>0 that works for all graphs in G_N^C with uniformly bounded initial conditions. The adaptive global protocol (14)-(16) avoids this by scheduling ε online, so the global claim is not affected; however, the semi-global linear claim needs either a uniform bound over graphs (which the proof does not provide and which is likely false) or an explicit qualification in the problem statement and abstract.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"This manuscript studies regulated state synchronization in homogeneous linear multi-agent systems with input saturation and non-introspective agents. It proposes an adaptive nonlinear protocol for global synchronization and a linear low-gain protocol for semi-global synchronization, with separate versions for full-state and partial-state coupling. The claimed contribution is that the protocol design uses only the agent model (A,B,C) and requires no knowledge of the graph or of the Laplacian spectrum, and that it is scale-free in the number of agents. Theorems 1 and 2 address global results, Theorems 3 and 4 address semi-global results, and a numerical example illustrates the global partial-state protocol on three graphs of different sizes.","tokens_in":12541,"tokens_out":15406,"duration_ms":147846,"significance":"If fully proven, the global result would be a useful contribution: a single scheduled low-gain protocol that avoids saturation by construction and works for arbitrary N and for all graphs in G_N^C is an elegant construction, and the simulations support the ease of implementation. The semi-global linear protocol is a natural low-gain design that would complement the existing literature. However, the manuscript as written has a load-bearing circular step in the semi-global proof, an incomplete global proof, and a mismatch between the abstract's 'scale-free / no spectrum knowledge' wording and the theorem statements, which allow epsilon* to depend on the graph. These issues are central and require a major revision.","major_comments":[{"comment":"The saturation-inactivity argument is circular. Equation (30) gives dot e = (I otimes A - Lbar otimes I) e only under the assumption that sigma(u)=u, yet inequalities (31) and (32), which are then used to conclude that saturation is never active, are derived from this unsaturated error dynamics. The actual error dynamics obtained from (29) contains the saturation nonlinearity, so the proof does not rule out an interval on which saturation is active before the bound (32) is available. The same circular step is reused in the proof of Theorem 4 in Section IV-B. A valid proof must analyze the saturated closed-loop dynamics directly or establish an invariant-region argument that does not presuppose the conclusion.","section":"Section IV-A, proof of Theorem 3, Eqs. (30)-(32)"},{"comment":"Even if the circularity is repaired, the proof does not support the paper's strong scale-free and no-spectrum-knowledge claims for the linear protocol. The existence of epsilon_1 in (31) and epsilon* in (35) depends on the decay rate of e, which is min_j Re lambda_j(Lbar). Graphs in G_N^C can have arbitrarily small edge weights (for example, a root-follower pair connected by an edge of weight a tending to 0), making this decay rate arbitrarily small and forcing epsilon* to shrink accordingly. The theorem as stated only asserts, for each graph, existence of an epsilon*, so it does not imply a single protocol parameter that works for all graphs with uniformly bounded initial conditions. The proof gives no way to choose epsilon without spectral information. Please either prove a uniform bound over G_N^C or qualify the abstract and introduction to state that epsilon* may depend on the graph's spectral properties.","section":"Abstract and Problem 2 vs. Theorem 3"},{"comment":"The proof of the global result is not complete. First, the statement that (16) guarantees saturation is inactive by construction should be justified with the explicit inequality ||B^T P_rho x||^2 <= tr(B^T P_rho B) x^T P_rho x, which is not stated. Second, the bounds involving z1, z2, z3 and beta_1, beta_2 in L1 are asserted without derivation; moreover, the notation ||.||_1 is used both for instantaneous absolute values and for L1 signal norms, and the claimed monotonicity property relating V_i and epsilon_alpha is not proved. Finally, the conclusion V_i -> 0 from dV_i/dt <= -alpha_tilde V_i + beta_tilde(t)(V_i+1)^{1/2} with beta_tilde in L1 is stated as clear but deserves a proof. Since Theorem 1 is a central claim, this gap must be closed. The proof of Theorem 2 in Section III-B refers back to this analysis and is only a sketch; it should be written out in full as well.","section":"Section III-A, proof of Theorem 1, after Eq. (21)"}],"minor_comments":[{"comment":"The heading contains a typo: 'Scalabale' should be 'Scalable'.","section":"Section IV heading"},{"comment":"In the sentence about reference [39], 'studid' should be 'studied'.","section":"Section I, paragraph 5"},{"comment":"The matrix Lbar is used from Eq. (18) onward but is never defined; it should be introduced explicitly (it appears to be the expanded Laplacian Ltilde).","section":"Section II, Eq. (18) and later"},{"comment":"The communicated information is written as zeta_hat_i = (zeta_hat_i2^T, zeta_hat_i2^T)^T; the second block should be zeta_hat_i1.","section":"Section IV-B, after Eq. (39)"},{"comment":"The compact sets should be written as subsets: S_a subset R^n, S_e subset R^n, and S_c subset R^{2n}, rather than elements of those spaces.","section":"Theorem 4 statement"}],"recommendation":"major_revision","confidential_remarks":"To the editor: the stress-test concern about the dependence of epsilon* on the Laplacian spectral gap is valid in my reading and should be resolved before publication. The circular step in the semi-global proof is the main technical obstacle. The global proofs are also too compressed for a journal. I believe the results are likely correct in substance, so major revision rather than rejection is appropriate."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"This is a credible extension of the group's established low-gain framework to regulated state synchronization with an exosystem, and the adaptive global protocol is the genuinely new piece. It does what it says for that part: a single protocol (14)-(16) achieves global synchronization for arbitrary N and any graph in G_N^C, and the numerical examples give some support. Credit where due: the scheduling law (16) does guarantee saturation inactivity by construction for the adaptive design, so the global theorems rest on a solid foundation even if the proofs are compressed.\n\nThe soft spots are in the semi-global linear protocol (Theorem 3) and in the paper's framing. The proof of Theorem 3 is circular: it derives the error bound (31)-(32) from the unsaturated error dynamics (30), then uses that bound to show saturation never activates. That is the same step the stress-test flags, and I agree it is a real gap. A standard two-step comparison argument might repair it, but it is not in the paper.\n\nMore importantly, the scale-free claim for the linear protocol is not supported. Problem 2 correctly allows ε* to depend on N and G, and the proof indeed needs ε* to shrink with the spectral gap; for a fixed compact set and a graph with very small edge weights, the transient of the synchronization error grows like 1/√α, so no single ε works uniformly over all graphs. The abstract says the protocol 'does not need any knowledge of the directed network topology and the spectrum'—that is true of the design, but the tuning parameter still implicitly depends on the graph. The adaptive protocol avoids this by online scheduling, so the global claim is fine; the semi-global claim is just overstated.\n\nThe citation pattern is honest and mostly self-referential, but that is normal for a group developing its own machinery. The numerical section lacks full simulation parameters, but that is minor for a theory paper.\n\nWho is this for? Researchers working on low-gain consensus with saturation, especially those who want a regulated tracking variant. It would benefit from a serious referee who can push the authors on the circularity and the uniformity issue. I would recommend sending to review, but with the expectation of major revision and a toned-down abstract.","headline":"Plausible extension of prior low-gain work, but the semi-global 'scale-free' claim is stronger than the proof; the abstract overstates what the theorems establish.","tokens_in":13073,"tokens_out":3116,"would_cite":false,"duration_ms":32519,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["93A16","93C10","93D05","93D20","93B52"],"pacs":[],"model":"deepseek-v4-flash","headline":"A single protocol, designed without knowing the network size or topology, achieves regulated state synchronization for saturated homogeneous multi-agent systems on any graph whose agents are reachable from a root set.","keywords":["multi-agent systems","state synchronization","input saturation","scale-free protocol","low-gain feedback","adaptive nonlinear protocol","semi-global regulation","non-introspective agents"],"falsifier":"Run the adaptive protocol (14)-(16) on a large directed chain, say 1,000 agents with a single root agent, using the paper's triple-integrator example and initial states far outside the unit ball. The claim predicts that the one-shot protocol drives every agent to the exosystem trajectory with no input ever saturating; if any input is saturated for a positive time interval, or if the regulation errors fail to converge, the global scale-free claim is refuted.","tokens_in":12013,"feed_emoji":"🔄","tokens_out":15096,"duration_ms":150241,"temperature":0.7,"pith_summary":"This paper sets out to prove that a network of identical linear agents, each with saturating actuators, can be driven to track a common reference trajectory by a protocol that is designed from the agent model alone and requires no knowledge of the number of agents or the structure and spectrum of the communication graph. The authors establish two results: an adaptive nonlinear protocol that achieves global regulated state synchronization for every initial condition, and a parametrized linear low-gain protocol that achieves semi-global regulation for any fixed compact set of initial conditions. Both cover full-state coupling and partial-state coupling, and both work for any directed graph in which every agent is reachable from at least one root agent that can observe the reference. If the results are right, a single one-shot protocol design can be reused when agents are added or the communication topology changes, as long as the reachability condition persists.","feed_headline":"Synchronize any saturated agent network with one protocol","feed_subtitle":"No need to know how many agents or how they are connected; the same design tracks a reference trajectory on any reachable graph.","key_machinery":"The mechanism that carries the argument is the combination of the expanded Laplacian $\\tilde{L} = L + \\mathrm{diag}\\{\\iota_i\\}$, whose eigenvalues all have positive real parts precisely when every agent is reachable from the root set $\\mathcal{C}$, with the low-gain Riccati solution defined by $A^T P_\\rho + P_\\rho A - P_\\rho B B^T P_\\rho + \\rho P_\\rho = 0$ (or its semi-global counterpart with $+ \\varepsilon I$). The additional information exchange $\\hat\\zeta_i = \\sum_j a_{ij}(\\xi_i - \\xi_j)$, where $\\xi_i$ collects internal protocol variables, is what creates the decoupled error system $\\dot e = (I \\otimes A - \\tilde{L} \\otimes I)e$, which is Hurwitz because $A$ is at most weakly unstable. The Riccati solution $P_\\rho \\to 0$ as $\\rho \\to 0$ supplies the small feedback gains that keep the saturated input in its linear region, and in the adaptive protocol the scheduling law $\\varepsilon(\\chi_i) = \\max\\{\\rho \\in (0,1] : \\chi_i^T P_\\rho \\chi_i \\, \\mathrm{tr}(B^T P_\\rho B) \\le 1\\}$ guarantees the control never saturates, converting the global problem into a time-varying low-gain stabilization problem.","core_discovery":"The central claim is that regulated state synchronization under input saturation is scale-free solvable for homogeneous non-introspective agents: for any number $N$ and any directed graph in which every node is reachable from a nonempty root set $\\mathcal{C}$, the same protocol built only from the agent triple $(A,B,C)$ makes every agent state $x_i(t)$ converge to the exosystem trajectory $x_r(t)$. The global result uses the nonlinear adaptive protocol (14)-(16), whose scheduling law $\\varepsilon(\\chi_i)$ chooses the instantaneous low-gain parameter so that the control signal lies inside the saturation limits for all time; the semi-global result uses the linear protocol (27)-(28) with a fixed small low-gain parameter chosen from the prescribed compact set of initial conditions. In both cases saturation is never activated along closed-loop trajectories, so the saturated system behaves linearly, and the proof reduces to coupled error systems driven by the expanded Laplacian $\\tilde{L} = L + \\mathrm{diag}\\{\\iota_i\\}$ and by the low-gain Riccati solution. The load-bearing property is that all eigenvalues of $A$ lie in the closed left half-plane, which makes each block $A - \\lambda_i I$ Hurwitz for the positive-real-part eigenvalues $\\lambda_i$ of $\\tilde{L}$.","pith_inferences":["Going beyond the paper, the adaptive protocol's independence from tuning suggests a natural testable extension to switching topologies: if the graph at every instant lies in $\\mathcal{G}_N^\\mathcal{C}$, the same one-shot protocol may retain its guarantee, although the proof here treats a fixed graph.","A second extension, not proven here, is whether the semi-global $\\varepsilon^*$ can be chosen uniformly for all graphs in $\\mathcal{G}_N^\\mathcal{C}$; the proof's bounds depend on the smallest positive real part among the eigenvalues of $\\tilde{L}$, so a uniform choice may be impossible unless such a lower bound is available.","The same low-gain-plus-expanded-Laplacian decoupling should carry over to discrete-time agents with saturation and to output synchronization problems, since neither the error decoupling nor the saturation-avoidance step uses continuous-time structure.","The paper's setting assumes saturation level one and a normalized input; rescaling the saturation level or the input matrix tests whether the scale-free property survives actuator scaling, which is a practical concern not addressed in the text."],"forward_implications":["A single protocol implementation can be deployed in a fleet without redesigning gains when agents join or leave, provided every new agent remains reachable from some root agent.","The designer never needs to estimate the Laplacian spectrum or the graph's algebraic connectivity; only the reachability condition of Definition 1 must be checked.","The adaptive global protocol removes the need to choose a low-gain parameter at all, while the linear semi-global protocol trades that tuning freedom for a simpler fixed-gain implementation.","The results cover both full-state coupling and partial-state coupling, the latter using an observer gain and additional exchange of protocol states and inputs.","Regulated synchronization means the network does not merely agree with itself; it tracks a reference trajectory generated by the same dynamics, which is the form needed when agents must follow a planned path."],"supporting_citations":[{"why":"Provides the parametric Lyapunov equation whose solution P_rho is increasing in rho and tends to 0 as rho goes to 0, the low-gain property used to keep the control inside the saturation limits.","marker":"[40]"},{"why":"Supplies the existence, uniqueness, and low-gain limit of the Riccati solution P_epsilon for the semi-global linear protocol.","marker":"[18]"},{"why":"Its Lemma 6.1 bounds the time derivative of the scheduling-dependent Lyapunov function in the global adaptive proof.","marker":"[17, Lemma 6.1]"},{"why":"Supplies the algebraic graph theory facts: Laplacian eigenvalues lie in the closed right half-plane, with a single zero eigenvalue when a directed spanning tree exists.","marker":"[4]"},{"why":"Book that provides the directed-graph Laplacian properties and the consensus background this paper builds on.","marker":"[16]"},{"why":"The earlier semi-global state synchronization result for saturated homogeneous agents that this paper extends to regulated synchronization with a scale-free protocol and partial-state coupling.","marker":"[39]"},{"why":"The semi-global output synchronization result for heterogeneous non-introspective, invertible agents under saturation that motivates the regulated, non-introspective formulation.","marker":"[36]"}],"fun_headline_variants":["One protocol syncs any saturated agent network","Scale-free sync for saturated homogeneous agents","No topology knowledge needed: sync saturated agents","Saturating agents? One protocol fits all"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that the agents are at most weakly unstable—none of the agent's natural modes grows without bound—together with the standard stabilizability and detectability assumptions; if any mode of A were genuinely unstable, the low-gain strategy that keeps the saturated inputs unsaturated would no longer work, and the claimed scale-free regulation would collapse.","fun_headline_variants_meta":{"raw":{"variants":["One protocol syncs any saturated agent network","Scale-free sync for saturated homogeneous agents","No topology knowledge needed: sync saturated agents","Saturating agents? One protocol fits all"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000204,"raw_usage":{"total_tokens":1365,"prompt_tokens":893,"completion_tokens":472,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":509,"completion_tokens_details":{"reasoning_tokens":417}},"tokens_in":509,"tokens_out":472,"duration_ms":5530,"temperature":1.0,"reasoning_tokens":417,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T12:42:30.786921+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run the adaptive protocol (14)-(16) on a large directed chain, say 1,000 agents with a single root agent, using the paper's triple-integrator example and initial states far outside the unit ball. The claim predicts that the one-shot protocol drives every agent to the exosystem trajectory with no input ever saturating; if any input is saturated for a positive time interval, or if the regulation errors fail to converge, the global scale-free claim is refuted.","supporting_citations":[{"cited_title":"Zhou, G.R","cited_arxiv_id":null,"evidence_quote":"Provides the parametric Lyapunov equation whose solution P_rho is increasing in rho and tends to 0 as rho goes to 0, the low-gain property used to keep the control inside the saturation limits."},{"cited_title":"Saberi, A.A","cited_arxiv_id":null,"evidence_quote":"Supplies the existence, uniqueness, and low-gain limit of the Riccati solution P_epsilon for the semi-global linear protocol."},{"cited_title":"Godsil and G","cited_arxiv_id":null,"evidence_quote":"Supplies the algebraic graph theory facts: Laplacian eigenvalues lie in the closed right half-plane, with a single zero eigenvalue when a directed spanning tree exists."},{"cited_title":"Ren and Y.C","cited_arxiv_id":null,"evidence_quote":"Book that provides the directed-graph Laplacian properties and the consensus background this paper builds on."},{"cited_title":"Semiglobal state synchronization for continuous-or discrete-time multiagent systems subject to actuator saturation","cited_arxiv_id":null,"evidence_quote":"The earlier semi-global state synchronization result for saturated homogeneous agents that this paper extends to regulated synchronization with a scale-free protocol and partial-state coupling."},{"cited_title":"Yang, A.A","cited_arxiv_id":null,"evidence_quote":"The semi-global output synchronization result for heterogeneous non-introspective, invertible agents under saturation that motivates the regulated, non-introspective formulation."}],"review_version":1}