Searcharxiv⌕ Search

arXiv · 2611.19679

A discontinuous time to collision feedback: well posedness, regularity of the collision-time map, and residual stability of its Hamilton Jacobi approximations

Abstract

We analyze a finite-horizon time-to-collision map generated by an optimal-velocity prediction with bounded measurable leader acceleration and a feedback law that uses this map. The prediction describes nominal motion without the additional collision-avoidance feedback. Its first-contact geometry can produce discontinuities of the capped collision time at grazing, so smooth-feedback theory does not apply globally. For a prescribed leader--follower pair, we prove existence of Filippov solutions and exclusion of contact with negative relative velocity for every solution; a zero-speed touch is not excluded. Under explicit nondegeneracy hypotheses, trajectories cross the grazing set and uniqueness persists through the crossing. On the domain of transversal first contacts, the collision-time map is locally Lipschitz, continuously differentiable in the state, and differentiable in time outside a common null set. We quantify its sensitivity to the transversality margin and to jumps of the forcing. Characteristic and coarea arguments give boundary-plus-interior residual estimates for Hamilton--Jacobi approximations. An endpoint/age change of variables yields a stability coefficient controlled by flight time and terminal normal velocity, without inverse-transversality blowup. The estimates imply convergence conditional on vanishing continuum loss and pointwise identification under the stated trace and regularity assumptions. Numerical experiments on thirteen prescribed forcing profiles investigate boundary-error transport, sampling effects, and regularity predictions; a separate first-contact experiment numerically demonstrates post-threshold sensitivity sign changes. The guarantees concern the exact feedback and value-function approximation. Learned-feedback safety and convergence of a training algorithm remain open.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hossein Nick Zinat Matin, Yuneil Yeo, Maria Laura Delle Monache. 2026-11-15. A discontinuous time to collision feedback: well posedness, regularity of the collision-time map, and residual stability of its Hamilton Jacobi approximations. https://searcharxiv.com/abs/2611.19679

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

First-order methods for stochastic and finite-sum convex optimization with deterministic constraints

In this paper, we study a class of stochastic and finite-sum convex optimization problems with deterministic constraints. Existing methods typically aim to find an $ε$-$expected\ feasible\ stochastic\ optimal$ solution, in which both the expected constraint violation and the expected optimality gap are within a prescribed tolerance $ε$. However, in many practical applications, constraints must be nearly satisfied with certainty, rendering such solutions potentially unsuitable due to the risk of substantial violations. To address this issue, we propose stochastic first-order methods for finding an $ε$-$surely\ feasible\ stochastic\ optimal$ ($ε$-SFSO) solution, where the constraint violation is deterministically bounded by $ε$ and the expected optimality gap is at most $ε$. Our methods apply an accelerated stochastic gradient (ASG) scheme or a modified variance-reduced ASG scheme $only\ once$ to a sequence of quadratic penalty subproblems with appropriately chosen penalty parameters. We establish first-order oracle complexity bounds for the proposed methods in computing an $ε$-SFSO solution. Preliminary numerical results are presented to illustrate the performance of the proposed methods.

math.OC↗

Attention's forward pass and Frank-Wolfe

We study the hardmax limit of self-attention dynamics for token embeddings obtained in the zero-temperature ($β\to+\infty$) regime, and relate it to the finite-$β$ setting. In this limit, the update rule can be viewed as a Frank-Wolfe step for a quadratic objective over the convex hull of the current token embeddings. When the key-query matrix is negative semidefinite, the method linearly contracts all tokens to a single cluster at the origin. When it is positive semidefinite, extending the hardmax rule to the entire convex hull induces a Voronoi diagram: vertices are stationary, interior points remain in their initial cells, and each token moves along a straight line toward its cell's vertex, yielding (super-)exponential convergence. As a byproduct, we also establish well-posedness of the associated ODE limit in this regime. Returning to the finite-$β$ regime, we model self-attention dynamics as a Markov chain and prove dynamic metastability: with high probability, interior tokens reach near-vertex configurations in a constant number of steps and remain within a small neighborhood for times that grow exponentially in the inverse temperature $β$, before ultimately collapsing to the origin. Thus, the hardmax dynamics accurately approximate the finite-$β$ process over exponentially long time horizons.

math.OC↗

Finite de Finetti for convex bodies and Polynomial Optimization

We study polynomial optimization over convex bodies with separately affine objectives and local affine equality and inequality constraints. We construct a convergent hierarchy of conic relaxations with explicit finite-level error bounds of order $n^{-1/2}$ at level $n$, complemented by a constructive rounding scheme that produces feasible points. The relaxation bounds and rounded objective values bracket the optimum at the same rate. The analytic ingredient is a finite de Finetti representation theorem for arbitrary proper cones: bipartite marginals of symmetric extensions in maximal tensor products are $O(n^{-1/2})$-close, in base norm, to points of the minimal tensor product. Its proof combines a uniform, monogamy-type bound on a variational mutual information based on Frenkel's relative entropy with classical conditioning and informationally complete measurements. We apply the framework to the assemblage relaxation of two-player non-local games in general probabilistic theories. For polytopic state spaces, the hierarchy consists of linear programs, and experiments on the Clauser--Horne--Shimony--Holt (CHSH) game provide a numerical proof of concept for the outer approximations and feasible rounding procedure.

math.OC↗