Search arXiv⌕ Search

arXiv · 2609.28676

The r-Safety Reserve and Adaptive Kinematic Smoothing for Car-Following Transitions

Abstract

Longitudinal spacing models describe the speed--spacing states that vehicles maintain, while longitudinal controllers regulate vehicle motion through spacing and speed errors. Less explicit is how one spacing state should be connected to another through a finite, physically meaningful vehicle transition. This paper develops such a connection through r-Safety and Adaptive Kinematic Smoothing (AKS). The r-Safety relation represents speed-dependent spacing through a braking-normalized reserve, whose change, together with leader motion, determines the follower displacement required during a transition. AKS then converts this displacement into a low-dimensional analytical trajectory with consistent position, speed, spacing, and acceleration. Experiments using controlled platoons and NGSIM trajectories identify r-Safety values of 0.307 and 0.249--0.281, respectively, and show that AKS can both represent observed transitions and generate prospective references under prescribed endpoint states, transition horizons, and leader motion. In same-controller ablations, adding AKS reduces integrated acceleration effort by 21--47% and integrated squared jerk by 73--81% across the controlled and naturalistic datasets. FHWA ACC/CACC trajectories further provide an empirical illustration of finite-horizon execution under automated following, showing how spacing adjustment can continue beyond the prescribed speed transition. The framework therefore provides a direct path from a speed--spacing relation to an analytical finite transition and its use as a longitudinal control reference.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xuesong, Zhou, Ziyi Zhang. 2026-09-23. The r-Safety Reserve and Adaptive Kinematic Smoothing for Car-Following Transitions. https://arxiv.org/abs/2609.28676

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Discreteness to Convexity: Promotion Planning via Simplotope Triangulation

Price promotion optimization is a computationally challenging problem central to supermarket operations, requiring simultaneous pricing decisions across multiple products and periods. This paper introduces a new formulation for price promotion by developing convex hull results for supermodular compositions of univariate functions over a simplotope. Leveraging this reformulation with Gurobi, we achieve substantial performance gains: instances with up to 125 products, 20 periods, and 5 price levels are solved in an average of 7 minutes, demonstrating the potential to handle even larger instances. Our exact solution methods extract 25--48\% additional profit from promotion planning relative to state-of-the-art heuristic approaches. Additionally, we extend the polynomially solvable cases from two to multiple price levels and expand our results to allow for multiplicative historical effects. Our core methodological innovation applies to a broad class of nonlinear discrete optimization problems. Specifically, our results convexify a class of nonlinear functions that includes monomials and the widely studied L natural function structure.

math.OC↗

Deterministic Mean Field Games on Networks and Related Optimal Control Problems

We study a class of deterministic mean field games and related optimal control problems, with a finite time horizon and in which the state space is a network. An agent controls her velocity, and, when she occupies a vertex, she can either remain still or enter any adjacent edge. The running and terminal costs are assumed to be continuous in each edge, but may jump at the vertices. Compared to the companion paper [4], we make more general assumptions about the costs and consider networks with an arbitrary number of vertices; this higher degree of generality brings new difficulties. For the optimal control problems mentioned above, we obtain in particular the existence of optimal trajectories and regularity results concerning the optimal trajectories and the value function. These control theoretic results make it possible to address a class of mean field games on networks, with costs that do not depend separately on the control and on the distribution of states, and that are non-local with respect to the latter. Focusing on a Lagrangian formulation, we obtain the existence of relaxed equilibria consisting of probability measures on admissible trajectories. To any relaxed equilibrium corresponds a mild solution, i.e. a pair $(u, m)$ made of the value function $u$ of a related optimal control problem and a family $m = (m(t))_t$ of probability measures on the network. Given $m$, the value function $u$ is a viscosity solution of a Hamilton-Jacobi problem on the network. We then investigate the regularity properties of $u$ and a weak form of a Fokker-Planck equation satisfied by $m$.

math.OC↗

Disjunctive Submodular Functions: Envelopes and Applications to Inventory and 0-1 Quadratic Optimization

This paper considers convex envelopes of disjunctive submodular functions---functions that are lattice family submodular over faces of a hypercube---and constructs the first strongly polynomial algorithm for their separation when there are two facial disjunctions. Submodular functions, whose convex envelopes are characterized by the Lovász extension, have occupied a fundamental role in constructing relaxations for combinatorial and nonlinear optimization problems. However, disjunctive submodular function envelopes have not been explored besides the use of ellipsoid algorithm, which remains practically intractable. Our algorithm is derived in three steps by expressing the disjunctive function as a minimum of two extended submodular functions, introducing a variable lifting technique, and constructing the sublinear envelope in the lifted space. The paper also makes several other contributions. First, we provide a disjunctive formulation for the case where each submodular function admits a linear programming formulation. Second, we derive the closed-form sublinear envelope characterization for intersecting submodular functions, yielding new structural insights into a multi-product inventory sales maximization problem. Third, we fully characterize the convex envelope of a bilinear function defined over a cycle graph in the original variable space. Finally, we show computationally that the cycle inequalities close approximately 60\% of the gap for complete and Hadamard graphs, over 30\% of the gap for complete bipartite graphs, and over 80\% of the gap for sparse graphs such as cactus and Halin graphs. The resulting relaxations are also more efficient to solve than previous extended space formulations.

math.OC↗