Open Source
A heuristic for optimal coordination of autonomous vehicles: static problems
arXiv eess.SY0 views
arXiv:2610.37275v1 Announce Type: new 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.
Source:https://arxiv.org/abs/2610.37275PreviousCo-Optimization of Network Topology and Variable Impedance Devices under Dynamic Line Ratings Using Iterative McCormick RelaxationNextA heuristic for optimal coordination of autonomous vehicles: dynamic problems
Related posts
Distillation didn't help our small model until we took the labels away
0dev.to Machine Learning

462. Minimum Moves to Equal Array Elements II
0dev.to PHP
MUSBRIC: LEGO-Compatible Pneumatic Muscle Bricks for Reconfigurable Musculoskeletal Robots
0arXiv cs.RO
OpenFlyV2: An onboard vision-language-action model for aerial perception and navigation
0arXiv cs.RO
Show HN: Open Bot Avatars – a spec and renderer for interactive bot avatars
0Hacker News New
Show HN: Elections Archive: every election in the US, citable and open source
0Hacker News New