{"id":"8058cc18-e46f-4ab9-b8fe-0e575830dbe4","arxiv_id":"2506.24083","paper_version":1,"verdict":"REJECT","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"high","formal_verification":"none","parameter_count":7,"one_line_summary":"A time shift governor combined with MPC-CBF cruise control achieved 100% collision-free performance in 50 simulated dynamic-driving trials, versus 82% for the baseline controller.","lead":"This paper adds two safety mechanisms to a self-driving cruise control system: a flexible collision-avoidance rule that can bend when needed, and a time shift adjustment that makes the car react to an earlier position of the car ahead. In 50 simulated trials, the combined controller avoided all collisions, while the standard version crashed in 9 trials.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Eq. (10g) reverses the relaxed C3BF inequality from §IV-D: with γ=1 it reads h(x_{k+1}) ≤ δ_k, an upper bound rather than a safety lower bound, so the claimed safety constraint is not enforced as written.","rationale":"The reader's verdict correctly identifies a high correctness risk, and I agree with the overall REJECT outcome. However, the single most load-bearing issue is sharper than the reader's stated weakest assumption about slack magnitude and physical distance. The sign inconsistency between Eq. (9) and Eq. (10g) is not merely an unvalidated tuning choice: as written, the implemented C3BF constraint is the reverse of a standard CBF inequality, so the mechanism credited for collision avoidance in the experiments is not the mechanism described in the paper. This directly undermines the central claim that TSG-guided MPC-CBF 'enhances robustness in ensuring constraint satisfaction and maintaining recursive feasibility.' The absence of code and the lack of error bars are secondary; the sign-flipped inequality alone invalidates the safety argument. I therefore recommend maintaining the reader's rejection rather than softening it to a conditional accept, because the core constraint equation would need to be corrected and re-validated before the empirical comparison can be interpreted.","tokens_in":8541,"tokens_out":6258,"duration_ms":73471,"concrete_test":"Re-run a minimal static-obstacle scenario with the OCP (10) exactly as written, fixing δ_k = 0 and λ = 0. If the solver reports a feasible trajectory satisfying h(x_{k+1}) ≤ 0 while approaching the obstacle, the implemented constraint is the anti-CBF and the safety claim fails. Then re-run the same scenario with the corrected relaxed CBF inequality LHS ≥ −δ_k and rerun the 50-trial protocol; if the success rate changes materially, the reported results do not arise from the claimed formulation.","verdict_should_be":"REJECT","load_bearing_attack":"Section IV-D defines the relaxed C3BF as h(x_{k+1}) − h(x_k) + α(h(x_k)) − δ ≥ 0 (Eq. 9), i.e. the left-hand side is required to be at least δ ≥ 0. The actual optimization constraint (10g) is the opposite inequality: h(x_{k+1}) − h(x_k) + α(h(x_k)) ≤ δ_k. These are not equivalent, and only (10g) appears in the implemented OCP. With the reported choice α(h)=γh, γ=1, constraint (10g) reduces to h(x_{k+1}) ≤ δ_k. Since δ_k ∈ [0,3], the C3BF value is capped from above rather than kept nonnegative as required by the safe set C_C3BF = {x : h(x) ≥ 0} in §II-C. In particular, when δ_k = 0 the constraint forces h(x_{k+1}) ≤ 0, which is outside the safe set. Thus (10g) is not a softened version of the CBF condition; it is an upper bound on the barrier value and provides no safety guarantee. Consequently, the reported 100% success over 50 simulated trials cannot be attributed to the C3BF constraint as stated, and the claimed robustness in constraint satisfaction and recursive feasibility is unsupported. Even if (10g) is interpreted as a typo for the intended relaxation h(x_{k+1}) − h(x_k) + α(h(x_k)) ≥ −δ_k, the paper still derives no bound linking the slack δ_k to the minimum physical distance to an obstacle, so the practical safety claim rests on an unvalidated tuning choice (δ ≤ 3, λ = 0.01).","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a TSG-guided MPC-CBF controller for adaptive cruise control on curved roads with moving obstacles. A time shift governor augments the MPC by shifting the lead-vehicle reference trajectory, and a slack variable is introduced to soften the collision-cone CBF condition. The method is evaluated in 50 randomized simulations with a sinusoidal-speed lead vehicle and moving obstacles, reporting 100% success for the TSG-guided MPC-CBF versus 82% for the baseline MPC-CBF.","tokens_in":9001,"tokens_out":6791,"duration_ms":76092,"significance":"The architectural idea of coupling a time shift governor with safety-critical MPC is interesting and the chosen low-speed ACC scenario is practically relevant. The paper is clearly organized and reports its simulation setup and parameters in a transparent way. However, the core C3BF constraint is internally inconsistent as written: Eq. (9) and Eq. (10g) have opposite slack signs, so the implemented OCP does not enforce the advertised safety condition. In addition, the recursive-feasibility and practical-safety claims are supported neither by proof nor by a quantitative link between the slack and physical distance. The contribution is therefore not established in the current manuscript.","major_comments":[{"comment":"The sign of the slack is inconsistent between the definition of the relaxed C3BF and the implemented OCP. Eq. (9) states h(x_{k+1}) - h(x_k) + alpha(h(x_k)) - delta >= 0, i.e., the left-hand side is required to be at least delta, which is stricter than the strict CBF condition; Eq. (10g) states the opposite inequality, with the left-hand side <= delta_k. With the reported alpha(h)=h (gamma=1), Eq. (10g) reduces to h(x_{k+1}) <= delta_k, an upper bound on the barrier value rather than a lower bound. Since the safe set is C_C3BF = {x : h(x) >= 0}, this constraint permits and even encourages h <= 0 and provides no obstacle-avoidance guarantee. The simulation results therefore cannot be attributed to the C3BF constraint as written. If the intended relaxation is h(x_{k+1}) - h(x_k) + alpha(h(x_k)) >= -delta_k, the OCP constraint must be corrected and the experiments rerun.","section":"IV-D and IV-E, Eq. (9)/(10g)"},{"comment":"No result is derived that links the slack variable delta_C3BF to the physical distance between the ego vehicle and an obstacle. The values delta in [0,3] and lambda=0.01 are hand-tuned parameters; when the slack is active, the CBF condition, even with a corrected sign, no longer implies forward invariance of any safety set. The paper's claim of 'practical safety guarantees' in dynamic environments is therefore unsupported by the theoretical development in Section II. A quantitative statement, such as a lower bound on the minimum distance as a function of delta, would be needed.","section":"IV-D through V"},{"comment":"Recursive feasibility is stated as a key requirement in Section III and is claimed as a benefit of the TSG in Sections IV-B and V, but no proof or formal argument is given. The OCP (10) contains nonlinear, time-varying constraints and a slack variable; recursive feasibility of such a formulation is nontrivial and cannot be inferred from 50 successful simulation trials. This is a load-bearing gap because the paper explicitly motivates the TSG as a means of 'enhancing recursive feasibility.'","section":"III and V"},{"comment":"The time shift parameter tau_shift is described in Sections III and IV-B as an optimization variable, but in (10a) the minimization is only over u_{0:N-1} and delta_C3BF,0:N-1. The cost and constraints depend on tau_shift through (10d). As written, either tau_shift must be included in the decision-variable list with an update rule, or the TSG is an externally prescribed parameter. This ambiguity affects the central claimed contribution, since the TSG mechanism is not fully defined in the optimization problem.","section":"IV-E, Eq. (10a)"}],"minor_comments":[{"comment":"The text refers to 'hC3BP' in one place; this should be 'hC3BF'.","section":"II-C, Eq. (4) vicinity"},{"comment":"The sentence 'using the IPOPT solver [23]' cites the do-mpc paper; IPOPT should be cited directly or the software stack should be described more accurately.","section":"V-A, solver reference"},{"comment":"The virtual heading is computed as atan2(ylead(tau+tau_shift), xlead(tau+tau_shift)), which projects the lead position onto a circle centered at the global origin. The reference-frame assumption should be stated explicitly, since a circular road reference can have an arbitrary center.","section":"IV-B, Eq. for fshift"},{"comment":"The phrase 'defined for obstacle-free curved road tracking' is confusing because the paper's contribution includes obstacle avoidance; the wording should be clarified.","section":"Abstract"}],"recommendation":"major_revision","confidential_remarks":"The sign error in Eq. (10g) appears fixable, but the claimed 100% success rate in Table I is currently unsupported by the written formulation. I would ask the authors to correct the relaxed C3BF constraint, rerun the simulations, and either provide a recursive-feasibility argument or substantially qualify the feasibility claims. The paper would also benefit from a sensitivity analysis over the slack bound, penalty weight, and horizon. The TSG references [13]-[16] are from the authors' own group; this is reasonable given the line of work, but the novelty relative to those papers should be stated more crisply for the reader."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague,\n\nThe thing to know: the paper's headline inequality is written backwards. Eq. (10g) enforces h(x_{k+1}) ≤ δ_k (with γ=1), an upper bound on the barrier value, not the safety lower bound h ≥ 0. The relaxed C3BF introduced in Eq. (9) has the opposite inequality. So the 100% vs 82% success claim cannot be traced to the constraint as stated. This is almost certainly a typo, but it sits at the center of the contribution.\n\nWhat's actually new: applying the Time Shift Governor to ground-vehicle ACC, with the TSG's scalar shift parameter as an extra decision variable in an MPC-CBF scheme. That is a genuine new application; the TSG lineage is properly cited. The paper is cleanly written, and the experiments—though limited—are described in enough detail to reproduce the setup. The authors are upfront about limitations (no long-horizon study, no hardware, no comparison to other constraint-enforcement methods). I believe them.\n\nThe soft spots beyond the sign error: recursive feasibility is claimed as a key property but never proven; the slack bound δ ∈ [0,3] is not tied to any physical distance, so the \"practical safety\" claim rests on tuning. Fifty random trials is a fine start, but there are no error bars and no code or data dropped. Given the hand-tuned weights for both controllers, I can't rule out that some of the baseline's failures are tuning artifacts. The ablation is also coarse: the TSG adds a decision variable and extra computation, and the paper doesn't isolate what part of the improvement comes from the TSG vs the slack relaxation.\n\nWho benefits: researchers working on safety-critical MPC for ground robots will find the architecture suggestive, and the sign error is instructive for anyone writing CBF constraints. The paper deserves a serious referee because the core idea is plausible and the flaw is fixable, but as written the simulation claims do not substantiate the method. My recommendation: send it to review, and make the inequality fix plus a formal recursive-feasibility argument or a much heavier simulation study (sensitivity sweeps, error bars, code release) conditions for acceptance.\n\nMore personally, I would not cite it in its current form, but I would keep an eye on a revised version.","headline":"A plausible TSG-MPC-CBF architecture for ACC, but the relaxed C3BF inequality is written backwards (likely a typo) and the safety claims rest on unvalidated slack tuning.","tokens_in":9501,"tokens_out":2728,"would_cite":false,"duration_ms":29144,"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":"A time shift governor that shifts the lead vehicle's reference trajectory backward in time, combined with a relaxed collision cone barrier, lets an MPC-based adaptive cruise controller avoid every collision in 50 randomized…","keywords":["adaptive cruise control","control barrier functions","collision cone CBF","time shift governor","model predictive control","safe autonomous driving","recursive feasibility","dynamic obstacle avoidance"],"falsifier":"Run the same 50-trial scenario with the slack upper bound lowered from 3.0 to 0.5 and obstacle speeds raised above 1.4 m/s while recording the minimum distance from the ego vehicle to each obstacle; a collision or a distance below the summed vehicle and obstacle radii in any trial where the slack saturates at its bound would directly refute the safety claim. A subtler check is to record whether the TSG-guided controller ever becomes infeasible when the lead vehicle reverses earlier than in the tested trials; if it does, recursive feasibility, not just slack tuning, is the limiting assumption.","tokens_in":8365,"feed_emoji":"🚗","tokens_out":9010,"duration_ms":82082,"temperature":0.7,"pith_summary":"The paper proposes adding a time shift governor to an MPC-CBF adaptive cruise controller so the controlled car remains safe when the lead vehicle brakes, reverses, or swerves suddenly and when obstacles move across the road. The key move is to make a small time shift in the lead vehicle's reference trajectory an extra decision variable inside the optimal control problem, so the controller can react to the lead's earlier position instead of declaring the safety problem infeasible. A relaxed collision cone barrier with a bounded slack term keeps the obstacle-avoidance constraint feasible when strict enforcement would be too conservative. In 50 randomized low-speed trials on a curved road with moving obstacles, the TSG-guided controller completed every trial without collision, while the baseline MPC-CBF collided in 9 trials.","feed_headline":"Adding a time shift makes MPC-CBF cruise control 100% collision-free","feed_subtitle":"In 50 random obstacle trials the time-shift governor avoided every crash; the baseline controller failed in 9.","key_machinery":"The central object is the Time Shift Governor (TSG), a scalar decision variable $\\tau_{\\mathrm{shift}}$ that time-shifts the lead vehicle's reference trajectory and projects it onto the circular road reference to form a virtual target. This virtual target enters the ACC safety control barrier function (7); together with a relaxed Collision Cone CBF (C3BF) whose inequality (9) includes a slack variable $\\delta_{\\mathrm{C3BF}}$ penalized in the cost, it keeps the discrete-time CBF constraints (10e)-(10g) feasible over the MPC horizon. The TSG supplies the mechanism for adapting to sudden lead-vehicle reversals or moving obstacles without lengthening the prediction horizon.","core_discovery":"The central claim is that augmenting the MPC-CBF formulation with a time shift governor and a relaxed collision cone CBF keeps adaptive cruise control safe when the lead vehicle and obstacle motion change rapidly. The time shift parameter $\\tau_{\\mathrm{shift}}$ shifts the lead vehicle's trajectory backward in time to generate a virtual reference target, and the relaxed C3BF constraint with a bounded slack $\\delta_{\\mathrm{C3BF}} \\in [0, 3.0]$ softened by a penalty coefficient $\\lambda = 0.01$ keeps the optimization feasible when strict safety constraints cannot be met. In simulation, the TSG-guided controller completes all 50 trials without collision whereas the baseline MPC-CBF collides in 9 trials (6 rear-end collisions with the lead vehicle and 3 with dynamic obstacles), supporting the claim that the augmentation improves recursive feasibility and constraint satisfaction in dynamic environments.","pith_inferences":["Because the result is measured as collision rate over 50 trials, an independent stress test with obstacles moving faster than the sampled $[0.8, 1.4]$ m/s range and with lead-vehicle reversals at shorter notice would probe whether the TSG gain holds near the edge of the slack bound.","The slack bound $\\bar{\\delta} = 3.0$ is not tied to a physical distance; a state-dependent slack limit derived from a minimum avoidable distance would give the safety claim a quantitative foundation the paper does not provide.","On straight roads the circular-projection step would need to be replaced by a straight-line projection; verifying the TSG's benefit in that geometry is a direct next test suggested by the paper's circular-path assumption.","The paper states that long-horizon scenarios and comparisons with other constraint-enforcement methods remain future work; benchmarking against tube-based MPC or learning-based CBF adaptation would clarify how much of the 18-point success-rate gap is attributable to the TSG itself."],"forward_implications":["TSG augmentation can preserve recursive feasibility of short-horizon MPC-CBF in dynamic environments where strict CBF constraints would otherwise make the optimization infeasible.","A relaxed C3BF with slack reduces the conservatism of collision cone avoidance, letting the controller react to obstacles that are far away but approaching.","The approach adds only one extra scalar decision variable, so it remains computationally light with a prediction horizon of five steps.","The same architecture transfers to other curved-road ACC scenarios with reversing or off-track lead vehicles, as illustrated by the circular-track simulations."],"supporting_citations":[{"why":"Supplies the baseline MPC with discrete-time CBF constraints that the TSG augmentation modifies.","marker":"[7]"},{"why":"Defines the Collision Cone CBF (C3BF) that the paper relaxes with a slack variable.","marker":"[11]"},{"why":"Introduces the Time Shift Governor for constraint enforcement that the paper adapts to ACC.","marker":"[13]"},{"why":"Provides the discrete-time CBF condition used in the safety constraints (10e)-(10g).","marker":"[17]"},{"why":"Gives the CBF definition and forward invariance framework for the safety set.","marker":"[8]"},{"why":"Establishes the parameter governor approach that the TSG builds on.","marker":"[12]"},{"why":"Supplies the half-speedometer safe-distance guideline used in the ACC CBF (7).","marker":"[22]"},{"why":"The robust MPC for tracking piece-wise constant references that inspired integrating TSG into MPC-CBF.","marker":"[18]"}],"fun_headline_variants":["Time shift governor steers MPC-CBF to zero crashes in 50 trials","Shifted target keeps MPC-CBF crash-free in 50 dynamic trials","TSG-MPC-CBF: zero collisions where baseline crashed 9 times","Time shift governor reduces MPC-CBF collisions from 9 to zero"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The controller's safety guarantee rests on the unproven assumption that allowing the obstacle-avoidance condition to be softly violated up to a fixed limit of 3.0 units will never let a real collision happen, even though no relationship between that violation limit and the physical distance to an obstacle is established.","fun_headline_variants_meta":{"raw":{"variants":["Time shift governor steers MPC-CBF to zero crashes in 50 trials","Shifted target keeps MPC-CBF crash-free in 50 dynamic trials","TSG-MPC-CBF: zero collisions where baseline crashed 9 times","Time shift governor reduces MPC-CBF collisions from 9 to zero"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000553,"raw_usage":{"total_tokens":2574,"prompt_tokens":819,"completion_tokens":1755,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":435,"completion_tokens_details":{"reasoning_tokens":1675}},"tokens_in":435,"tokens_out":1755,"duration_ms":11763,"temperature":1.0,"reasoning_tokens":1675,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-06T21:24:54.856475+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run the same 50-trial scenario with the slack upper bound lowered from 3.0 to 0.5 and obstacle speeds raised above 1.4 m/s while recording the minimum distance from the ego vehicle to each obstacle; a collision or a distance below the summed vehicle and obstacle radii in any trial where the slack saturates at its bound would directly refute the safety claim. A subtler check is to record whether the TSG-guided controller ever becomes infeasible when the lead vehicle reverses earlier than in the tested trials; if it does, recursive feasibility, not just slack tuning, is the limiting assumption.","supporting_citations":[{"cited_title":"Safety-Critical Model Predictive Control with Discrete-Time Control Barrier Function,","cited_arxiv_id":null,"evidence_quote":"Supplies the baseline MPC with discrete-time CBF constraints that the TSG augmentation modifies."},{"cited_title":"Time shift governor for coordinated control of two spacecraft formations,","cited_arxiv_id":null,"evidence_quote":"Introduces the Time Shift Governor for constraint enforcement that the paper adapts to ACC."},{"cited_title":"Discrete Control Barrier Functions for Safety-Critical Control of Discrete Systems with Application to Bipedal Robot Navigation,","cited_arxiv_id":null,"evidence_quote":"Provides the discrete-time CBF condition used in the safety constraints (10e)-(10g)."},{"cited_title":"Control barrier functions: Theory and applications,","cited_arxiv_id":null,"evidence_quote":"Gives the CBF definition and forward invariance framework for the safety set."},{"cited_title":"Parameter governors for discrete- time nonlinear systems with pointwise-in-time state and control con- straints,","cited_arxiv_id":null,"evidence_quote":"Establishes the parameter governor approach that the TSG builds on."},{"cited_title":"A comparison of headway and time to collision as safety indicators,","cited_arxiv_id":null,"evidence_quote":"Supplies the half-speedometer safe-distance guideline used in the ACC CBF (7)."},{"cited_title":"Robust tube based mpc for tracking of piece-wise constant references,","cited_arxiv_id":null,"evidence_quote":"The robust MPC for tracking piece-wise constant references that inspired integrating TSG into MPC-CBF."}],"review_version":1}