Papers
Topics
Authors
Recent
Search
2000 character limit reached

Parasitic actuation delay limits the minimum employable time headway in connected and autonomous vehicles

Published 25 Sep 2025 in eess.SY and cs.SY | (2509.20722v1)

Abstract: Adaptive andcooperative adaptive cruise control (ACC and CACC) and next generation CACC (CACC+) systems usually employ a constant time headway policy (CTHP) for platooning of connected and autonomous vehicles (CAVs). In ACC, the ego vehicle uses onboard sensors to measure the position and velocity of the predecessor vehicle to maintain a desired spacing. The CACC and CACC+systems use additional information, such as acceleration(s) communicated through vehicle-to-vehicle (V2V) communication of the predecessor vehicle(s); these systems have been shown to result in improved spacing performance, throughput, and safety over ACC. Parasitic dynamics are generally difficult to model and the parasitic parameters (delay, lag, etc.) are difficult to obtain. Parasitic actuation delays can have deleterious effects and impose limits on the mobility and safety of CAVs. It is reasonable to assume that the bounds on parasitic actuation delays are known a priori. For CAVs, we need to address both internal stability and string stability in the presence of parasitic actuation delays. This requires robustness of string and internal stability for all values of parasitic actuation delays that are within the specified upper bound. In this paper, we provide the minimum employable time headway for ACC, CACC, and CACC+ (`r' predecessors look-ahead), respectively. The inclusion of the internal stability in the string stability condition is analyzed based on Pontryagin's interlacing theorem for time delay systems. We provide comparative numerical results to corroborate the achieved theoretical results.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.