Back to search
2112.09229

Generation of Wheel Lockup Attacks on Nonlinear Dynamics of Vehicle Traction

Alireza Mohammadi, Hafiz Malik, Masoud Abbaszadeh

incompletemedium confidence
Category
Not specified
Journal tier
Strong Field
Processed
Sep 28, 2025, 12:56 AM

Audit review

The paper’s Proposition 5.3 states that the attack policy Υ̂a = (v/gα) uan1(eL) + ν̂ µ̂(λ) with uan1(eL) = −(1/Tc + ka) Φ1(eL), ka ≥ k*, renders the lockup manifold WL_b globally finite-time stable with settling time Tc, but the proof is omitted and only attributed to a lemma in prior work, leaving key steps unstated (e.g., how the disturbance terms are absorbed into k*) . The candidate solution supplies those missing details: it writes the closed-loop slip-error dynamics directly from (5b) and (19) , selects U(e)=exp(|e|)−1 tied to Φ1, derives D+U ≤ −(1/Tc + ka)(U+1)^2 + (gα/v)·const·(U+1)^2, and then enforces ka ≥ k* (with k* exactly matching (16)) to obtain D+U ≤ −(1/Tc)(U+1)^2 and the comparison ζ=1/(U+1), yielding t* ≤ Tc for all initial conditions . The only caveats are standard assumptions also made in the paper—continuity/boundedness of µ, µ̂ on Λ, uniform disturbance bounds (4), and the speed staying in [vmin, vmax] during the attack (13) . Thus the model’s proof fills the gap and aligns with the paper’s statement and constants.

Referee report (LaTeX)

\textbf{Recommendation:} minor revisions

\textbf{Journal Tier:} strong field

\textbf{Justification:}

The paper makes a timely contribution at the intersection of control and automotive cybersecurity by constructing finite-time wheel lockup attack policies for a nonlinear traction model with limited adversarial knowledge. The modeling choices are standard, the propositions are well-formulated, and the simulation study is informative. However, the proof of the key Proposition 5.3 is omitted; adding a concise Lyapunov proof (as sketched here) would complete the paper's logical arc. Clarifying assumptions around the speed lower bound and post-lock invariance would also improve rigor.