Search arXiv⌕ Search

arXiv · 2610.37275

A heuristic for optimal coordination of autonomous vehicles: static problems

Abstract

We consider the coordination of autonomous vehicles at unsignalized intersections, where trajectory planning and crossing-order decisions are intrinsically coupled, thereby making their simultaneous optimization intractable in practice. To this end, we propose a heuristic based on a hierarchical structure consisting of a series of nonlinear programs (NLP) in the lower level, which optimizes trajectories of each vehicle for a given crossing order, and a high-level heuristic to design new crossing schedules that exploits sensitivity information from the lower-level NLPs. Extensive numerical simulations across a broad range of traffic scenarios demonstrate that our strategy achieves substantially improved scheduling with respect to first-in-first-out ordering while preserving computational tractability.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Saugat Shahi, Filippo Fabiani, Mario Zanon. 2026-10-27. A heuristic for optimal coordination of autonomous vehicles: static problems. https://arxiv.org/abs/2610.37275

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

KEEP EXPLORING

Related papers

Action-Increment-Constrained Policy Optimization for Smooth Online Adaptive Critic Flight Control with Actuator Rate Constraints and Low Computational Complexity (extended version with Ultimate Uniform Boundedness analysis)

Approximate Dynamic Programming (ADP) enables online control-law adaptation through adaptive critic methods. A safety challenge in applying ADP to angle-of-attack (AoA) tracking control is that an overly sensitive neural network (NN) controller may generate oscillatory or saturated control actions under nonlinear dynamics, potentially compromising flight stability and increasing actuator stress. To address this challenge, this paper proposes two innovations: (1) the actuator rate constraints are enforced within a an Action-Increment-Constrained Policy Optimization (AI-CPO) framework inspired by safe reinforcement learning (RL), in which a primal-dual approach adaptively adjusts the penalty weight to address actuator rate constraints. This optimization is solved online using adaptive Temporally Smoothed Incremental Model-Based Heuristic Dynamic Programming (TS-IHDP) for smooth and computationally efficient online adaptive control; and (2) a low-pass filter integrated into the cascaded NN architecture to attenuate high-frequency pitch-rate commands while preserving the Markov property during online learning by exploiting the hierarchical actor structure. Compared with the IHDP baseline, simulations using a longitudinal air vehicle dynamics model demonstrate that TS-IHDP improves control smoothness and tracking performance, reduces system oscillations, and enhances the trained policy's robustness to model uncertainties.

eess.SY↗

Control and Stability of a Multilevel Power System for a Future Distribution Network

The growing integration of renewable energy sources into distribution networks poses significant challenges to frequency and voltage stability due to their intermittent nature and low-inertia dynamics. This paper proposes a multilevel control framework for a future decarbonized power system, using energy storage systems as power buffers to mitigate frequency and voltage fluctuations. A nonlinear interconnected model is formulated to describe the multilevel aggregated dynamics of the distribution network. To reduce the operational complexity and communication overhead of the control system, a distributed linear quadratic regulator strategy is developed based on bottom-up information exchange, where each level implements local feedback control over a short time horizon. Local stability conditions are established for the open-loop nonlinear model, and the closed-loop stability is characterized by the Hurwitz property of the system matrix. Performance bounds are also derived to quantify the gap between the distributed and centralized control strategies.

eess.SY↗

Stealthy bias injection attack detection based on Kullback-Leibler divergence in noisy linear systems

This paper studies the design of observer gains to enhance the detectability of stealthy bias injection attacks (BIAs) in linear systems driven by Gaussian noise, where adversaries compromise a subset of sensors and exploit system dynamics and noise to remain stealthy. We formulate the observer-gain design as a max-min optimization problem that enhances the detectability of the least detectable BIAs, with detectability measured by the Kullback-Leibler divergence (KLD) subject to a prescribed attack impact. To reduce the computational complexity of the derived non-convex design problem, we consider attack onset, one-step, and steady-state detectability. We show that the Kalman filter is optimal at attack onset regardless of the subset of attacked sensors. For the one-step and steady-state cases, the observer gain design problems are approximated by bi-convex optimization problems, which can be efficiently solved using alternating optimization (AO) and alternating direction method of multipliers (ADMM). Moreover, more tractable linear matrix inequality (LMI) relaxations are developed. Finally, the effectiveness of the proposed stealth-aware detection framework is demonstrated through an application to a thermal system.

eess.SY↗