{"id":"9e3cde1c-aebe-4617-85ee-fd3e041d26ef","arxiv_id":"2509.00582","paper_version":1,"verdict":"REJECT","confidence":"MODERATE","novelty_score":4.0,"correctness_risk":"high","formal_verification":"none","parameter_count":5,"one_line_summary":"An optimization-based double quintic lane-change planner that penalizes low time-to-collision is proposed and tested in simulation.","lead":"The paper combines double quintic polynomial lane-change trajectories with a time-to-collision penalty added to the optimization cost. It reports simulations showing smoother, safer lane changes than classic polynomial, Bezier, and B-spline planners, but the evaluation is weakened by self-referential synthetic traffic and missing derivations.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Self-referential HDV generation (Eq. 44) makes the 45-scenario safety claim untestable; independent obstacle dynamics are needed.","rationale":"The reader's weakest_assumption identically identifies Eq. (44) as the critical flaw. My stress-test confirms this is the most load-bearing concern: it directly undermines the central safety claim because the obstacle field is self-referential. The paper's own text supports this reading: Section 5 defines HDV trajectories via time delay and lateral offset of the ego trajectory, and Section 6.5 notes that NGSIM replay is used only 'in some simulations' to 'eliminate the idealization'—implying the main benchmark does not use independent real-world trajectories. The soft TTC penalty and the ablation results showing near-1 m gaps further show that the method does not guarantee safety in a hard sense. The proposed concrete test would settle the matter by running the same scenarios with independent obstacle dynamics. Until such a test is performed, the empirical claim of 'all 45 scenarios' cannot be accepted as evidence for safety in realistic traffic. Therefore the reader's rejection verdict stands, and no change to the verdict is recommended.","tokens_in":33234,"tokens_out":3301,"duration_ms":39311,"concrete_test":"Re-run all 45 scenarios from Section 6 replacing Eq. (44) HDV generators with independent obstacle trajectories: either NGSIM replays (as in Eq. 7) or an IDM car-following model with randomized parameters, keeping all other settings (initial states, weights, thresholds) identical. Record the minimum TTC and the fraction of time steps with TTC < Tsafe for each scenario. If any scenario yields TTC below the user-defined threshold, the claim that TTC stays above threshold in all 45 scenarios is false. If all scenarios still pass, the self-referential-obstacle concern is empirically refuted.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim—that the TTC-integrated double-quintic solver 'completely eliminates sub-second TTC violations and keep TTC above the user-defined threshold in all 45 simulated scenarios'—rests on an experimental setup where surrounding HDVs are generated by time-delaying and laterally offsetting the ego vehicle's own planned trajectory (Eq. 44: r_HDV(t) = r_ego(t+τ) + δ). This makes every obstacle a shifted copy of the ego's trajectory, so the relative motion between ego and HDV is entirely determined by the ego's own planned path. The TTC penalty can then trivially shape the ego trajectory to avoid low-TTC regions because the 'obstacles' have no independent dynamics; they do not brake, accelerate, or cut in based on the ego's behavior. Real traffic does not work this way. The NGSIM replay mentioned in Section 6 is explicitly described as an alternative to 'synthetic HDV generators' in only 'some simulations,' so the primary 45-scenario benchmark likely relies on the self-referential generator. Consequently, the empirical evidence for 'safety-guaranteed' performance does not transfer to realistic mixed traffic, and the claimed all-45-scenario success is not a meaningful test of collision avoidance. Additionally, the TTC penalty is a soft penalty (Section 2.5, Eq. 23) and the optimization is non-convex; the paper's own ablation (Section 6.3) shows minimum gaps approaching 1 m in aggressive/fast configurations, illustrating that the method does not provide a hard safety guarantee even in these contrived scenarios. Thus the central claim is not supported by the presented evidence.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes an improved double-quintic polynomial lane-change planner in which a time-to-collision (TTC) penalty is embedded directly into the coefficient optimization. The central claims are that this produces C2-continuous trajectories, eliminates sub-second TTC violations, keeps TTC above a user-defined threshold in all 45 simulated scenarios, and is the first analytic TTC penalty inside a closed-form double-quintic solver. The method is compared against quintic, Bezier, and B-spline baselines in lane-changing and overtaking scenarios, with additional experiments on ramps, an unsignalized intersection, an ablation study, and a highway-env/NGSIM extension.","tokens_in":33582,"tokens_out":5404,"duration_ms":65878,"significance":"If the central claim were established, embedding TTC directly into polynomial coefficient optimization would be a useful, low-cost alternative to post-hoc safety validation. The authors are transparent about several limitations, notably the simplified constant-speed/no-sideslip vehicle model and simulation-only evaluation, and the later NGSIM replay and highway-env experiments are steps toward more realistic interactions. However, the load-bearing evaluation is circular and the safety guarantees are not supported by the evidence. The main contribution as stated, namely a safety-guaranteed planner that completely eliminates low-TTC events, does not follow from the presented method or experiments.","major_comments":[{"comment":"The HDV trajectories are generated as r_HDV(t) = r_ego(t+tau) + delta, i.e., every obstacle is a time-delayed, laterally shifted copy of the ego vehicle's own planned trajectory. The 45-scenario claim that TTC remains above threshold is therefore a property of the optimizer's own output, not of interaction with independent traffic. The NGSIM replay in Section 6 is described as replacing synthetic HDV generators only 'in some simulations,' so it does not repair the core benchmark. This makes the headline safety result untestable and not transferable to real mixed traffic.","section":"Section 5, Eq. (44)"},{"comment":"The TTC term is a soft penalty, not a hard constraint: Eq. (22) is stated as an inequality but is not enforced as such; the cost is the piecewise-quadratic penalty in Eqs. (23)-(24). The paper's own ablation reports a minimum gap of about 1 m in the Fast-Lane-Change overtaking configuration and gaps below 4 m for the Aggressive-TTC configuration, directly contradicting the abstract's 'completely eliminate sub-second TTC violations' and the introduction's claim of a 'minimum gap to every HDV above 10m.' At best, the method reduces low-TTC exposure; it does not guarantee safety.","section":"Section 4.4 / Section 6.3"},{"comment":"The exact TTC formula and penalty are not fully present in the manuscript. Eq. (21) uses d_i(t) and Delta v_i(t) without defining them; Eqs. (23) and (24) are blank in the text; Eq. (26) is incomplete. Since every claimed result depends on this cost, the derivation is not reproducible from the manuscript and the 'analytic TTC penalty' central to the contribution cannot be examined.","section":"Section 4.4, Eqs. (21)-(26)"},{"comment":"The planner assumes constant longitudinal velocity, x(t)=v t, and neglects sideslip. However, the experiments show longitudinal speed variation (e.g., 22-25 m/s in Figs. 25 and 27), braking HDVs, and speed-oscillating vehicles. The authors themselves state in Section 7.1 that the simplified model does not capture real-world steering, acceleration, and tire-road constraints. The safety and feasibility claims therefore go beyond what the stated model can support. The internal inconsistency between the constant-speed planning model and the time-varying speed in the evaluation should be resolved.","section":"Section 4.2 / Eq. (19) / Section 7.1"}],"minor_comments":[{"comment":"The two theoretical subsections contradict each other: Section 4.4.1/4.4.2 says the problem is not globally convex, while Section 4.7.1 states the overall cost 'remains convex with respect to the polynomial coefficients.' Also, the proof of Theorem 1 claims the smoothness term is quadratic and 'hence coercive,' which is not guaranteed for a positive semi-definite quadratic form on an affine subspace.","section":"Section 4.4.1 vs. 4.7.1"},{"comment":"Road boundaries are defined as offsets of the ego trajectory, r_left(t)=r_ego(t)+w n(t). This makes the road geometry depend on the planned path itself; in real applications lane boundaries are independent of the ego vehicle. This should be clarified or replaced with a fixed road model.","section":"Section 5, Eq. (42)"},{"comment":"The labels Vx and Vy appear inconsistent with Eq. (3): the text calls Vx 'lateral speed' and Vy 'longitudinal speed' in places, while Eq. (3) and the vehicle dynamics use x as longitudinal and y as lateral. The captions also refer to 'lateral acceleration alpha' and 'lateral velocity Vy' interchangeably. Please unify notation.","section":"Figures 25-27"},{"comment":"The column header 'Improvement' shows -9.9% for minimum TTC and minimum distance, which is a degradation, not an improvement. The text explains this as 'decisive' behavior, but the table as presented is misleading. Also, the method name 'stable TTC' is not introduced elsewhere.","section":"Table 6"},{"comment":"The paper states 'We release an open MATLAB testbed' but no repository link or availability statement is provided. This should be added if the claim is to hold.","section":"Section 1, Contribution 3"},{"comment":"There are duplicated sections (Section 2.5 and Section 4.6 both titled 'Clarification of the methodological novelty'), duplicated existence/convergence discussions (Sections 4.4.1-4.4.3 and 4.7.1-4.7.4), and several typos ('effieicncy', 'comforts', 'stabilization' for 'robustness'). A thorough editing pass is needed.","section":"Throughout"}],"recommendation":"reject","confidential_remarks":"The circular HDV generation in Eq. (44) and the soft-penalty nature of the TTC term undermine the main claim of a safety-guaranteed planner. The ablation study itself reports minimum gaps near 1 m, and the NGSIM replay is not used in the 45-scenario benchmark. These are load-bearing issues that cannot be fixed by local rewriting; a substantially revised evaluation with independent obstacle dynamics and a weakened, honest claim about soft safety shaping would be needed before reconsideration."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: this is an incremental but legitimate extension of polynomial trajectory planning—putting an analytic TTC penalty inside the double-quintic coefficient optimization instead of checking safety afterward. That piece is real, and the paper explains the optimization, convergence behavior, and numerical stability more carefully than most. The highway-env validation with NGSIM replay and braking/oscillating HDVs is a step toward realistic evaluation, and the comparison against quintic/Bezier/B-spline baselines shows genuine improvements in jerk and curvature. The authors also honestly list limitations in Section 7.1 (constant velocity, no sideslip, structured highway only).\n\nThe soft spots are not minor. The main claim—'completely eliminates sub-second TTC violations and keeps TTC above threshold in all 45 simulated scenarios'—rests on Eq. (44), where HDV trajectories are generated as time-delayed, laterally offset copies of the ego's own planned trajectory. The obstacles are thus self-referential; avoiding them is essentially guaranteed by construction. That makes the 45-scenario benchmark uninformative about real traffic. Second, the TTC term is a soft penalty, not a hard constraint. The ablation shows minimum gaps approaching 1 m in aggressive/fast configurations, which directly contradicts 'safety-guaranteed.' Third, some key equations are missing (the actual TTC formula and the penalty/cost terms), and there are internal contradictions: Section 4.7.1 calls the objective convex, while Section 4.4.2 correctly says it is not; Table 6 shows the proposed method has lower minimum TTC than the baseline, which the text spins as 'decisive' rather than a safety regression. The 'Normal' baseline driving straight into the obstacle is a strawman, but that is a minor point.\n\nBottom line: the central claim as stated is not supported, and the paper needs major revision—specifically, independent HDV dynamics (NGSIM or a proper traffic model) for the main benchmark, hard safety constraints or honest rephrasing of the guarantee, and a cleaned-up math presentation. But the core idea is coherent and the engineering is honest; this is not a desk reject. A knowledgeable reviewer would find the flaws quickly but would also see a fixable paper. I'd send it to peer review and let a referee decide after revision.","headline":"A real but incremental contribution—TTC-in-the-loop double-quintic planning—undermined by self-referential simulation; deserves a serious referee, not a desk reject.","tokens_in":34096,"tokens_out":3255,"would_cite":false,"duration_ms":40037,"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":"This paper embeds a time-to-collision penalty inside a double-quintic lane-change solver, claiming it eliminates sub-second TTC violations while keeping trajectories smooth and comfortable.","keywords":["autonomous driving","lane changing","double quintic polynomial","time-to-collision","trajectory optimization","mixed traffic","jerk minimization","safety planning"],"falsifier":"Run the same planner in closed loop against pre-recorded NGSIM trajectories or an independent car-following model that does not depend on the ego vehicle's planned path, then count sub-second TTC violations and minimum gaps. If any sub-second TTC violation appears or the minimum gap drops below 10 m in those scenarios, the central safety claim is refuted.","tokens_in":33080,"feed_emoji":"🚗","tokens_out":3179,"duration_ms":42172,"temperature":0.7,"pith_summary":"The paper tries to show that lane-changing safety does not have to be a post-hoc check: a time-to-collision penalty can be baked directly into the closed-form double-quintic polynomial solver that generates the trajectory. It claims this is the first time an analytic TTC term is embedded in the polynomial coefficient optimization, producing C2-continuous paths that keep TTC above a user-set threshold in all 45 simulated scenarios. The contribution matters because it promises real-time, safety-aware trajectory generation without the replanning loops or black-box behavior of learning-based planners. If true, it would give autonomous vehicles a lightweight, interpretable way to balance safety, efficiency, and passenger comfort during lane changes in mixed traffic.","feed_headline":"TTC penalty built into quintic lane-change solver","feed_subtitle":"Improved double-quintic planner claims zero sub-second TTC violations across 45 scenarios while cutting jerk and curvature.","key_machinery":"The central object is the double-quintic polynomial trajectory, split into two quintic segments at a switching time so the maneuver has explicit phase control. The key mechanism is the analytic TTC penalty embedded in the coefficient optimization: a differentiable term added to the jerk-smoothness cost, with coefficients initialized from the closed-form boundary inversion and refined by an interior-point solver. This converts safety from a post-hoc filter into a continuous gradient signal that shapes the trajectory during generation.","core_discovery":"The core claim is that replacing the direct boundary-condition inversion a = M⁻¹b with a constrained optimization that minimizes a combined smoothness-plus-TTC cost yields trajectories that are proactively safe rather than merely smooth. The TTC penalty is a piecewise-quadratic function φᵢ(t) = [max{0, T_safe − TTCᵢ(t)}]², which is C¹ and differentiable with respect to the polynomial coefficients, so gradient-based solvers can steer coefficients away from low-TTC regions. The paper reports that this eliminates sub-second TTC violations in all 45 simulated scenarios, more than doubles the minimum obstacle gap from 8.75 m to 19.53 m, cuts the share of low-TTC (<3 s) time steps from 64% to 42%,","pith_inferences":["The paper's safety guarantees are demonstrated in simulations where surrounding HDV trajectories are partly generated by time-shifting and laterally offsetting the ego vehicle's own planned trajectory (Eq. 44); this makes avoidance easier than it would be with fully independent human drivers, and transferring the guarantees to real traffic would require testing against independent, pre-recorded or","The TTC penalty as defined rewards keeping TTC above one global threshold; in real traffic, a more informative safety measure might combine TTC with lateral spacing, road curvature, and prediction uncertainty, which the current analytic form does not capture.","The claim of being 'the first' to embed an analytic TTC penalty in a double-quintic solver is a literature claim, not a mathematical one; a careful reader should check whether earlier polynomial-planner papers used similar differentiable safety penalties before treating that novelty as established.","The differentiable-penalty trick could plausibly be extended to other safety metrics, such as predicted minimum distance or jerk-weighted collision risk, opening a family of 'safety-in-the-cost' planners."],"forward_implications":["Lane-change planners could enforce user-defined safety margins directly in the trajectory-generation step, removing the need for frequent reactive replanning.","The TTC threshold T_safe becomes a tunable dial: raising it produces more conservative, smoother paths, while lowering it yields faster, more aggressive maneuvers, as shown in the ablation study.","The same double-quintic formulation generalizes from a single lane change to overtaking, modeled as two consecutive lane changes, and to partial or half-lane maneuvers.","The optimization converges reliably within roughly 20 iterations, suggesting the method is light enough for embedded or real-time deployment on resource-constrained hardware.","Because the penalty is differentiable and smooth, the approach can be grafted onto other polynomial or spline trajectory families, not just quintics."],"supporting_citations":[{"why":"Supplies the quintic polynomial lane-changing baseline that the proposed method extends and compares against.","marker":"[50]"},{"why":"Provides the Bezier-curve trajectory model used as one of the comparison baselines.","marker":"[61]"},{"why":"Provides the B-spline trajectory planning approach used as another comparison baseline.","marker":"[62]"},{"why":"A prior TTC-aware lane-change strategy using cubic polynomials, which the proposed method improves on by embedding TTC analytically in a double-quintic solver.","marker":"[49]"},{"why":"Supports the TTC estimation methodology for autonomous driving, grounding the safety metric used in the optimization.","marker":"[47]"},{"why":"Supplies real-traffic NGSIM trajectory data used to validate the planner against non-synthetic HDV behaviors.","marker":"[60]"}],"fun_headline_variants":["TTC penalty built into quintic lane-change solver","Lane-change planner embeds TTC in quintic path","Quintic solver with TTC safety for lane changes","Zero sub-second TTC violations via TTC-aware quintics","Safe lane changes: TTC inside quintic optimizer"],"cache_read_input_tokens":2688,"weakest_assumption_plain":"The surrounding vehicles are partly generated by applying a time delay and lateral offset to the ego's own planned trajectory (Eq. 44), so avoiding them is easier than avoiding truly independent human-driven vehicles; if real HDVs do not follow the ego's path, the claimed TTC guarantees may not transfer.","fun_headline_variants_meta":{"raw":{"variants":["TTC penalty built into quintic lane-change solver","Lane-change planner embeds TTC in quintic path","Quintic solver with TTC safety for lane changes","Zero sub-second TTC violations via TTC-aware quintics","Safe lane changes: TTC inside quintic optimizer"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000154,"raw_usage":{"total_tokens":1074,"prompt_tokens":799,"completion_tokens":275,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":543,"completion_tokens_details":{"reasoning_tokens":195}},"tokens_in":543,"tokens_out":275,"duration_ms":4185,"temperature":1.0,"reasoning_tokens":195,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-05T13:26:15.005697+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run the same planner in closed loop against pre-recorded NGSIM trajectories or an independent car-following model that does not depend on the ego vehicle's planned path, then count sub-second TTC violations and minimum gaps. If any sub-second TTC violation appears or the minimum gap drops below 10 m in those scenarios, the central safety claim is refuted.","supporting_citations":[{"cited_title":"Journal of advanced transportation 2023(1), 6926304 (2023)","cited_arxiv_id":null,"evidence_quote":"Supplies the quintic polynomial lane-changing baseline that the proposed method extends and compares against."},{"cited_title":"In: 2023 IEEE Intelligent Vehicles Symposium (IV), pp","cited_arxiv_id":null,"evidence_quote":"A prior TTC-aware lane-change strategy using cubic polynomials, which the proposed method improves on by embedding TTC analytically in a double-quintic solver."},{"cited_title":"In: European Conference on Computer Vision, pp","cited_arxiv_id":null,"evidence_quote":"Supports the TTC estimation methodology for autonomous driving, grounding the safety metric used in the optimization."},{"cited_title":"Transportation Research Part C: Emerging Technologies 19(6), 1243–1262 (2011)","cited_arxiv_id":null,"evidence_quote":"Supplies real-traffic NGSIM trajectory data used to validate the planner against non-synthetic HDV behaviors."}],"review_version":1}