A decomposition algorithm for Nash equilibria in intersection management
DOI10.1080/02331934.2020.1786088zbMath1478.49001OpenAlexW3038179179MaRDI QIDQ5015993
Andreas Britzelmeier, Axel Dreves
Publication date: 10 December 2021
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2020.1786088
optimal controlgeneralized Nash equilibrium problemsgeneralized potential gamesnonconvex state constraintspartial penalization
Applications of optimal control and differential games (49N90) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Dynamic programming (90C39) Methods involving semicontinuity and convergence; relaxation (49J45) Existence theories for optimal control problems involving ordinary differential equations (49J15) Traffic problems in operations research (90B20) Decomposition methods (49M27) Existence theories for optimal control problems involving relations other than differential equations (49J21) Potential and congestion games (91A14)
Cites Work
- Decomposition algorithms for generalized potential games
- Control parameterization for optimal control problems with continuous inequality constraints: New convergence results
- Minimizing control variation in nonlinear optimal control
- Semianalytical minimum-time solution for the optimal control of a vehicle subject to limited acceleration
- Optimization and nonsmooth analysis
- A generalized Nash equilibrium approach for optimal control problems of autonomous cars
- A general Hamilton-Jacobi framework for non-linear state-constrained control problems
- Experimental validation of a semi‐distributed sequential quadratic programming method for optimal coordination of automated vehicles at intersections
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A decomposition algorithm for Nash equilibria in intersection management
