OpenAlex ·
A heuristic for optimal coordination of autonomous vehicles: real-time algorithms
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2610.37632
- Original
- Read it at the publisher
- Topics
Abstract
When coordinating connected and automated vehicles at an unsignalized intersection, the crossing order and the vehicle trajectories must be decided jointly. For a fixed crossing order, the problem can be formulated conveniently in a bi-level form where each vehicle solves its own optimal control problem, whose optimal value is a function of its entry and exit times, and a coordinator optimizes these times subject to precedence constraints. We compute the first and second order sensitivities of lower-level problems, which are required to solve the upper-level problem, by means of algorithmic differentiation using the real-time software package \texttt{acados}. This implementation exploits tailored algorithms to obtain a computationally efficient implementation of the optimal coordination algorithm. We validate our implementation in numerical simulations that demonstrate both real-time feasibility and effectiveness of our algorithm.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Systems & Control
A Singularity Avoiding Track Model for Race Car Optimization
Same Label, Different Interface: Beyond Action-Space Labels in Robot Learning
Feedback autocratic strategies in stochastic games
LLM-PowerTrace: A Dataset of Time-Resolved GPU Power Traces for AI Compute
Gradient flow of magnetic inclination and intensity as a GPS-free guidance mechanism
Get the few papers worth your time in Systems & Control every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.