{"id":"944e8da6-c92b-44a5-8b89-0e5ebdc5a3ae","arxiv_id":"2506.06746","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"high","formal_verification":"none","parameter_count":5,"one_line_summary":"An adaptive event-triggered formation controller with a sampling-based observer is presented and validated in simulation for three vehicle formation scenarios.","lead":"This paper proposes three event-triggered control strategies for autonomous vehicle formations, using a sampling-based observer and adaptive backstepping to handle motion uncertainties. It uses simulation to compare tracking accuracy, safe distances, and time headways across linear, square, and queue formations.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 1's proof treats the sampling error as uniformly bounded even though Assumption 1 gives only a time-dependent Lipschitz bound, and the event rule does not bound the inter-sample interval.","rationale":"The reader identified Assumption 1 and Assumption 2 as the weakest assumptions, but framed the risk as the bounds being violated under irregular sampling. My concern is more internal: even when Assumption 1 holds exactly, the proof incorrectly converts the time-dependent Lipschitz bound into a uniform constant λ_max^i. Because the event-triggering condition bounds the control error, not the position sampling error, the inter-sample time t-t_k is not a priori bounded, so λ(t) can grow without bound. This directly breaks the differential inequality (17)-(20) and leaves the central bounded-tracking and Zeno-free claims unproven. The switched-threshold inconsistency between Eq. (12) and Algorithm 1, and the max/min error in the Theorem 3 Zeno bound, are real but secondary; they affect only the switched strategy and are readily fixable. My finding affects all three theorems and requires either a new assumption (uniform bound on sampling intervals) or a redesigned trigger condition that limits the observer error. Because the issue is a proof gap rather than a demonstrated counterexample to the algorithm, the reader's CONDITIONAL verdict remains appropriate; the paper should not be accepted until the proof is repaired.","tokens_in":19077,"tokens_out":13093,"duration_ms":127514,"concrete_test":"Check the step in the proof of Theorem 1 that infers a constant bound λ_max^i for λ_i,1 from Assumptions 1 and 2. Construct a trajectory permitted by the event rule (9) in which no trigger occurs for all t>t_k, e.g., a constant desired speed with |w_i-u_i|<ς_i. Under Assumption 1, ||λ_i,1(t)|| = ||C_{i,1}|| g_max (t-t_k) → ∞ as t→∞, whereas the proof requires a finite λ_max^i. If this no-trigger trajectory is admissible, then (17)-(20) cannot yield the uniform boundedness asserted in (13), confirming the proof gap. A complementary simulation check: run the Section V fixed-threshold scenario for T=500 s and record sup_t ||x_i(t_k)-x_i(t)|| and the observer error; unbounded growth would indicate the flaw is not merely stylistic.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The proof of Theorem 1 (Section IV) is the load-bearing argument for all three event-triggered strategies, since Theorems 2 and 3 are said to follow from the same analysis. In the Lyapunov derivation, the sampling-induced perturbation λ_{i,1}=C_{i,1}(x_i(t_k)-x_i(t)) and λ_{i,2}=C_{i,2}(x_i(t_k)-x_i(t)) is asserted to be bounded with constants λ_max^i and ϖ_max^i, and the squares of these constants are placed into the time-invariant μ in (19), yielding the uniform bound (20). However, Assumption 1 only provides the Lipschitz estimate ||x_i(t_k)-x_i(t)|| ≤ g_max(t-t_k), which is not a uniform bound: the elapsed time t-t_k since the last sample is not constrained by the fixed-threshold event rule (9), which bounds |w_i-u_i|≤ς_i rather than the position sampling error or the inter-event interval. After transients, the control error may remain below ς_i indefinitely, so t-t_k → ∞ and ||λ(t)|| can grow without bound while all stated assumptions hold. In that case μ in (19) is time-dependent and unbounded, and \\.dot V≤-βV+μ(t) does not imply the uniform error bound (13). The proof therefore does not establish the central boundedness claim; an additional maximum sampling interval assumption, or an event condition that directly limits the observer error, is needed.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes an adaptive backstepping formation controller for autonomous vehicles with longitudinal and lateral motion uncertainties, using a sampling-based observer and three event-triggered strategies: fixed-threshold, relative-threshold, and switched-threshold. Theorems 1-3 claim bounded tracking errors and exclusion of Zeno behavior. Simulation studies with four vehicles in linear, square, and linear-queue formations illustrate tracking performance and compare safety and mobility through inter-vehicle distances and time headway.","tokens_in":19424,"tokens_out":12482,"duration_ms":127370,"significance":"The direction is timely: combining sampling-based observers with event-triggered adaptive control for multi-dimensional vehicle formation, rather than longitudinal platooning only, and explicitly comparing traffic safety and mobility across event-triggered strategies is a useful contribution. The simulation setup is detailed and the comparison among strategies is informative. However, the theoretical core currently has a load-bearing gap in the treatment of sampling-induced perturbations, and Theorem 2's key inequality and Theorem 3's Zeno bound are not correctly justified. If these issues are repaired, the paper could make a solid contribution.","major_comments":[{"comment":"The proof bounds lambda_{i,1}=C_{i,1}(x_i(t_k)-x_i(t)) and lambda_{i,2}=C_{i,2}(x_i(t_k)-x_i(t)) by constants lambda_max^i and varpi_max^i using Assumptions 1 and 2, but Assumption 1 only provides ||x_i(t_k)-x_i(t)|| <= g_max (t-t_k). Since the fixed-threshold event rule (9) bounds |w_i-u_i| <= ς_i rather than the sampling error or the elapsed time t-t_k, the inter-sample interval is not upper bounded. If the measurement error remains below the threshold, t-t_k can grow without bound, making μ in (19) unbounded, so inequality (20) does not imply the uniform bounds in (13). A maximum allowable sampling interval assumption, or an event condition that directly bounds the observer sampling error, is needed. Because Theorems 2 and 3 are said to follow from the same analysis, this gap affects all three theorems.","section":"Section IV, proof of Theorem 1, Eqs. (17)-(20)"},{"comment":"The representation w_i(t)=(1+π_1(t)ζ_i)μ_i(t)+π_2(t)ξ_i does not follow from the definition of w_i in (10), which contains tanh terms and a negative coefficient (1+ζ_i). Inequality (23) is then asserted without derivation, so the application of Lemma 1 and the resulting boundedness conclusion for the relative-threshold strategy are not justified. This step must be derived explicitly or corrected.","section":"Section IV, Theorem 2, Eqs. (22)-(23)"},{"comment":"After switching, the inter-execution interval is governed by one of the two per-mode thresholds. A universal lower bound should be the minimum of (ς_i/Ψ_i) and (ζ_i|u_i|+ξ_i)/Ψ_i, not the maximum. The statement t* > max{...} is therefore not a valid guaranteed lower bound: an interval in the mode with the smaller threshold can be shorter than that maximum. Since the switched strategy includes both modes, the proof should use min, or should establish the claimed maximum bound through additional reasoning.","section":"Section IV, Theorem 3, Zeno bound"},{"comment":"The reference trajectory is defined as x_i^r = \\hat{x}_{i-1} - l_i, but its time derivative is set to v_{i-1}^r. Since \\hat{x}_{i-1} is the observer output, \\dot{x}_i^r should contain \\dot{\\hat{x}}_{i-1} = \\hat{v}_{i-1} + C_{i-1,1}(x_{i-1}(t_k)-\\hat{x}_{i-1}), not the preceding vehicle's desired speed. This mismatch enters z_{i,2} and the backstepping derivatives in (7), and it is not accounted for in the Lyapunov analysis. It should be either corrected or explicitly treated as an additional perturbation.","section":"Section III, Eq. (4)"}],"minor_comments":[{"comment":"The definitions lambda_{i,1}=C_{i,1}(x_i-x_i) and lambda_{i,2}=C_{i,2}(x_i-x_i) are self-cancelling as written; presumably the first argument should be the sampled value, e.g., x_i(t_k)-x_i(t).","section":"Section IV, proof of Theorem 1"},{"comment":"The inequality ||x_i(t_k)-x_i(t_k)|| <= ϱ_i uses identical symbols on both sides; the intended distinction between the measured sampled value and the actual value at the sampling instant should be made explicit.","section":"Assumption 2"},{"comment":"For β>0, the term (φ_min(Q)-3||P||^2)φ_min(P^{-1}) must be positive; the implied condition on the observer gains and Lyapunov matrices is not stated or verified in the parameter setting.","section":"Eq. (19)"},{"comment":"The condition on θ_i(t) should read |θ_i(t)| ≤ 1, not θ_i(t) ≤ 1, since θ_i can take negative values between resets.","section":"Proof of Theorem 1, Eq. (14)"},{"comment":"The expression in (23) is missing parentheses and transposes; the scalar product involving z_{i,2} and the ratio should be written with proper grouping and transposition.","section":"Eq. (23)"}],"recommendation":"major_revision","confidential_remarks":"The manuscript is within the scope of the journal and the topic is relevant. The main obstacle is the missing uniform bound on the sampling error in Theorem 1, which propagates to Theorems 2 and 3; this is fixable by adding a maximum sampling interval assumption or an event condition that directly limits the observer error. I did not find evidence of inappropriate citation practice; the self-citations [41] and [43] are relevant to the techniques used."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Tao, quick take on 2506.06746. The paper extends Xue et al.'s observer-based event-triggered platooning to multi-formation settings (linear, square, queue) and compares three threshold policies (fixed, relative, switched) in terms of tracking, trigger counts, safety distances, and time headway. The comparative simulation is the real value: it gives a practical sense of the trade-offs, and the switched-threshold strategy comes out looking reasonable, with less impact on time-headway variation than the others. If you design AV formation controllers and want a quick map of these ETC options, this is a useful data point.\n\nBut the theory is not solid as written. In the proof of Theorem 1, the observer perturbation λ = C(x(t_k)-x(t)) is treated as uniformly bounded, but the fixed-threshold event condition only bounds the controller error |w-u| ≤ ς; it says nothing about how long t-t_k can grow. Under Assumption 1, the sampling error is Lipschitz in t-t_k, so after the control error settles below the threshold, t-t_k can go to infinity and λ is unbounded. That means μ in (19) is time-dependent and unbounded, and the inequality V-dot ≤ -βV + μ(t) does not yield the uniform bound (20). Without an explicit maximum sampling interval or an event rule that directly constrains the observer error, the bounded-tracking and Zeno-exclusion claims for all three strategies don't follow from the stated assumptions.\n\nOther issues are smaller but real: Theorem 3's Zeno lower bound uses max when it should be min for a switched system; Algorithm 1's Case 3 condition is the opposite of Eq. (12) and the text; and the key inequality (23) in Theorem 2 is asserted without proof. The safety analysis is also only descriptive and does not compare the three strategies against each other.\n\nThe paper is not a wreck. The adaptive backstepping structure is standard, the simulations are detailed, and the identified gaps look fixable (adding a maximum sampling interval assumption would be the natural patch). But the central theoretical promises need repair before the quantitative findings can be fully trusted. Worth sending to a serious referee with a request for major revision; I'd be surprised if it passes without a rewritten proof of Theorem 1 and a cleanup of the switched-strategy details.","headline":"A useful comparative simulation of three event-triggering rules for AV formations, but the stability proof is not watertight: the fixed-threshold rule does not bound inter-sample time, so the claimed uniform error bounds are unsupported.","tokens_in":19951,"tokens_out":5766,"would_cite":false,"duration_ms":56322,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper claims that a sampling-based adaptive event-triggered controller can keep an autonomous-vehicle formation tracking bounded position and speed trajectories in linear, square, and linear-queue configurations while excluding Zeno…","keywords":["adaptive control","event-triggered control","formation control","autonomous vehicles","sampling-based observer","backstepping","neural network approximation","Zeno behavior"],"falsifier":"One concrete test is to log the true position, the sampled position, and the sampling time in the same three simulations or on a test vehicle, and check at every event whether $\\|x_i(t_k)-x_i(t)\\| \\leq g_{\\max}(t-t_k)$ and whether the reported sampled value at a sampling instant is within $\\varrho_{\\max}$ of the true position. A single violation, or a measured inter-execution interval shorter than the claimed lower bound, would contradict the boundedness and no-Zeno conclusions.","tokens_in":18873,"feed_emoji":"🚗","tokens_out":11089,"duration_ms":99012,"temperature":0.7,"pith_summary":"This paper tries to establish that an autonomous-vehicle formation can track a leader's trajectory with only intermittent, imperfect position measurements, without sacrificing safety or mobility. The proposed framework combines a sampling-based observer that reconstructs velocity from triggered position samples, a backstepping controller with adaptive neural-network compensation for unknown resistances and disturbances, and three event-triggered update rules. Theorems 1-3 state that all tracking, observation, and parameter-estimation errors stay bounded and that Zeno behavior is excluded for each rule. Simulation comparisons then support the claim that event-triggered operation preserves safety margins and that the switched-threshold rule affects time headway least while still cutting update frequency.","feed_headline":"Event-triggered formation keeps AVs tracking with fewer updates","feed_subtitle":"Sampling-based adaptive control bounds tracking errors, avoids Zeno behavior, and cuts controller updates by up to 96%.","key_machinery":"The load-bearing object is the composite Lyapunov function $V = V_0 + \\sum_{i=1}^{n} V_i$, assembled from the sampling-observer error $e$, the backstepping position and speed errors $z_{i,1}$ and $z_{i,2}$, the neural-network weight estimation error, and the adaptive parameter error. A sampling-based observer reconstructs velocity from intermittent position samples, while radial-basis-function neural networks approximate the unknown drag and disturbance term. The event-triggered controller rewrites the continuous backstepping controller with tanh terms so that Lemma 1 bounds the error introduced by holding the control signal constant between events; the three threshold rules differ only in the set of measurement errors that trigger an update. The bound $\\dot{V} \\leq -\\beta V + \\mu$ then gives uniform boundedness, and the inter-event lower bound $t^* \\geq \\varsigma_i/\\Psi_i$ (or its relative-threshold counterpart) rules out Zeno behavior.","core_discovery":"On the paper's own terms, the central result is that one observer-controller structure, without relying on a predefined communication topology or continuous state transmission, realizes formation tracking in linear, square, and linear-queue geometries under three threshold policies. For each policy the Lyapunov function built from observer error, backstepping tracking errors, and estimation errors satisfies $\\dot{V} \\leq -\\beta V + \\mu$, yielding uniformly bounded position and speed tracking errors, bounded observer error, and bounded neural-network and adaptive parameter estimates; and the inter-execution interval is lower-bounded so Zeno behavior is excluded. The practical content is that reducing control-update frequency through event-triggering does not by itself undermine formation safety or, for the switched-threshold rule, mobility.","pith_inferences":["Because the followers' reference trajectories are built from the observed predecessor position rather than from a fixed communication graph, the same observer-controller structure should extend to formations that add or remove vehicles without redesigning the control law; this is a corollary of the construction rather than a claim the paper tests.","The switching boundary $S$ in the switched-threshold strategy is an explicit dial between trigger count and tracking precision, so one could tune it online from traffic density or sensor-noise level as a practical extension.","Real lidar and radar errors sometimes include outliers that violate the bounded sampling-error assumption; a robustified version of the observer with saturation or fault detection would make the guarantees hold under heavier-tailed sensor noise.","Because the theorem requires the sampled positions to be Lipschitz in time, event-triggered scheduling that also predicts the next sampling time would need to enforce that bound at the sampling layer; the paper lists self-triggered control as future work."],"forward_implications":["Under the fixed-threshold rule, the overall formation tracks the expected position and speed trajectories with all closed-loop signals bounded; in the simulations this rule also gives the lowest trigger counts, with the fewest updates for the lead vehicle.","Under the relative-threshold rule, tracking precision near equilibrium is the highest among the three policies, at the cost of many more controller updates.","Under the switched-threshold rule, the inter-vehicle time-headway variation comes closest to the continuous-in-time benchmark, indicating that the largest mobility loss among the three event-triggered rules is avoided.","Because inter-execution times are lower-bounded, none of the three rules can produce infinitely many updates in finite time, so the control laws are implementable on digital platforms.","Minimum inter-vehicle distances in the simulations stay above 5 m in the linear and linear-queue scenarios and above 4 m in the square scenario, which the paper reads as maintaining safety while switching formations."],"supporting_citations":[{"why":"Supplies the observer-based event-triggered platooning baseline, including Assumptions 1 and 2 and the standard analysis that all closed-loop signals are bounded before the inter-event time bound is derived.","marker":"[15]"},{"why":"Provides the backstepping method used to construct the virtual controller and the continuous-in-time controller.","marker":"[22]"},{"why":"Provides the event-triggered adaptive control technique, including the switched-threshold idea and the tanh-based controller modification.","marker":"[26]"},{"why":"Supplies the stable adaptive neural-network control scheme used to approximate the unknown drag and disturbance term.","marker":"[37]"},{"why":"States the tanh inequality (Lemma 1) used to bound the triggering error terms in the Lyapunov analysis.","marker":"[40]"},{"why":"Reaffirms the tanh inequality (Lemma 1) that bounds the effect of the held control value between events.","marker":"[41]"},{"why":"Motivates the relative-threshold strategy, where the trigger threshold scales with the magnitude of the control signal.","marker":"[43]"},{"why":"Supplies the desired longitudinal and lateral speed trajectories used in the simulation validation.","marker":"[44]"},{"why":"Defines the safety-distance standards the paper uses to judge inter-vehicle spacing in the simulations.","marker":"[45]"},{"why":"Provides the time-headway definition and the empirical conclusion used for the mobility analysis in the linear-formation scenario.","marker":"[46]"}],"fun_headline_variants":["Adaptive event-triggering keeps AV formations stable, cuts updates","Event-triggered observer slashes control updates for AV formations","Adaptive event-triggered control stabilizes AV formations, avoids Zeno","Fewer updates, stable formation: adaptive event-triggering for AVs","Event-triggered adaptation keeps AV formations safe with fewer updates"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof depends on Assumptions 1 and 2: between sampling instants the true vehicle position may not drift away from the sampled position faster than a fixed Lipschitz rate $g_{\\max}$, and at each sampling instant the reported sampled position may not differ from the true position by more than $\\varrho_{\\max}$. If a sensor produces irregular or unbounded measurement errors that violate these bounds, the Lyapunov derivative estimate in (17) fails and the bounded-tracking and no-Zeno claims no longer follow.","fun_headline_variants_meta":{"raw":{"variants":["Adaptive event-triggering keeps AV formations stable, cuts updates","Event-triggered observer slashes control updates for AV formations","Adaptive event-triggered control stabilizes AV formations, avoids Zeno","Fewer updates, stable formation: adaptive event-triggering for AVs","Event-triggered adaptation keeps AV formations safe with fewer updates"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000814,"raw_usage":{"total_tokens":3524,"prompt_tokens":860,"completion_tokens":2664,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":476,"completion_tokens_details":{"reasoning_tokens":2566}},"tokens_in":476,"tokens_out":2664,"duration_ms":18261,"temperature":1.0,"reasoning_tokens":2566,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-07T05:51:33.330914+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"One concrete test is to log the true position, the sampled position, and the sampling time in the same three simulations or on a test vehicle, and check at every event whether $\\|x_i(t_k)-x_i(t)\\| \\leq g_{\\max}(t-t_k)$ and whether the reported sampled value at a sampling instant is within $\\varrho_{\\max}$ of the true position. A single violation, or a measured inter-execution interval shorter than the claimed lower bound, would contradict the boundedness and no-Zeno conclusions.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the observer-based event-triggered platooning baseline, including Assumptions 1 and 2 and the standard analysis that all closed-loop signals are bounded before the inter-event time bound is derived."},{"cited_title":"Krstic, I","cited_arxiv_id":null,"evidence_quote":"Provides the backstepping method used to construct the virtual controller and the continuous-in-time controller."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the event-triggered adaptive control technique, including the switched-threshold idea and the tanh-based controller modification."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the stable adaptive neural-network control scheme used to approximate the unknown drag and disturbance term."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"States the tanh inequality (Lemma 1) used to bound the triggering error terms in the Lyapunov analysis."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Reaffirms the tanh inequality (Lemma 1) that bounds the effect of the held control value between events."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Motivates the relative-threshold strategy, where the trigger threshold scales with the magnitude of the control signal."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the desired longitudinal and lateral speed trajectories used in the simulation validation."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Defines the safety-distance standards the paper uses to judge inter-vehicle spacing in the simulations."}],"review_version":1}