Metraipolis › archive › dc_dbbc4b1d95fa

Optimization-based lane-changing trajectory planning in mixed traffic with embedded input convex neural networks — arXiv:2610.38939

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.38939
License (as archived)
CC0-1.0
Archived
2026-11-01T02:27:02.985Z
SHA-256 of the archived text
136233252c2391a2418fc16922f6357da3bfc4ddf53b7fead6ab682b3eccb5e7
Stable URL of this page
https://metraipolis.com/documento/dc_dbbc4b1d95fa

How to cite

Optimization-based lane-changing trajectory planning in mixed traffic with embedded input convex neural networks — arXiv:2610.38939 — arXiv (en), https://arxiv.org/abs/2610.38939 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_dbbc4b1d95fa (Metraipolis archive dc_dbbc4b1d95fa, sha256 136233252c2391a2418fc16922f6357da3bfc4ddf53b7fead6ab682b3eccb5e7)
BibTeX
@misc{dcdbbc4b1d95fa,
  title = {Optimization-based lane-changing trajectory planning in mixed traffic with embedded input convex neural networks — arXiv:2610.38939},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.38939},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_dbbc4b1d95fa; sha256 136233252c2391a2418fc16922f6357da3bfc4ddf53b7fead6ab682b3eccb5e7},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.38939. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Lane-changing (LC) maneuvers are highly challenging vehicle interactions, with substantial implications for traffic safety and efficiency. Developing effective LC strategies for connected and automated vehicles in mixed traffic is complicated by the uncertainty associated with surrounding-vehicle behavior and the computational burden of embedding realistic prediction models within optimization schemes. To capture these complex interactions while retaining tractability, this study proposes a data-driven optimization framework that embeds neural network (NN) surrogates for safety and lateral comfort within a Bézier-curve-based trajectory planner. Specifically, the safety cost during the LC process is quantified via a surrogate composed of an input convex recurrent neural network (ICRNN) encoding the planned trajectory, a fully input convex neural network (FICNN) embedding the LC duration, and a partially input convex neural network (PICNN) decoder fusing them with historical traffic states; separately, another FICNN surrogate approximates the optimal lateral comfort cost as a function of the LC duration. Both surrogates are embedded via linear programming (LP) formulations, avoiding the binary variables required by conventional mixed-integer programming (MIP) approaches for NN-embedded optimization. We further theoretically establish their exactness at optimality and extend the framework to problems with additional analytical objective terms and multiple surrogates. Experiments on a hybrid dataset combining real-world and simulated trajectories demonstrate that the proposed method achieves surrogate accuracy competitive with unconstrained baselines while substantially improving optimization efficiency over conventional MIPs. Closed-loop simulations further show that the proposed planners markedly reduce the weighted planning cost and consistently outperform baseline methods.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno).
Categorie arXiv: Optimization and Control (math.OC) ; Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2610.38939 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-01T02:12:44.275Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).