2022 IEEE 25th International Conference on Intelligent Transportation Systems (ITSC) 2022
DOI: 10.1109/itsc55140.2022.9922180
|View full text |Cite
|
Sign up to set email alerts
|

Optimization based coordination of autonomous vehicles in confined areas

Abstract: Confined areas present an opportunity for early deployment of autonomous vehicles (AV) due to the absence of non-controlled traffic participants. In this paper, we present an approach for coordination of multiple AVs in confined sites. The method computes speed-profiles for the AVs such that collisions are avoided in cross-intersection and merge crossings. Specifically, this is done through the solution of an optimal control problem where the motion of all vehicles is optimized jointly. The order in which the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 21 publications
0
2
0
Order By: Relevance
“…In our previous work [31] and [32], we proposed optimization-based heuristics to coordinate vehicles in confined sites, ensuring conflict avoidance in all MUTEX zones. This paper introduces a control strategy that extends the optimal control formulation from [32] to address the inclusion of charging zone MUTEX constraints.…”
Section: B Contributionsmentioning
confidence: 99%
See 1 more Smart Citation
“…In our previous work [31] and [32], we proposed optimization-based heuristics to coordinate vehicles in confined sites, ensuring conflict avoidance in all MUTEX zones. This paper introduces a control strategy that extends the optimal control formulation from [32] to address the inclusion of charging zone MUTEX constraints.…”
Section: B Contributionsmentioning
confidence: 99%
“…As explained in [31], [32], finding a solution to MINLP problems is known to be difficult, especially when the constraints or the objective function are non-convex [37]. Therefore, a common procedure is to apply an approach where the integer part of the solution is obtained first using a heuristic, and the continuous part of the solution thereafter is obtained by solving the nonlinear program (NLP) that results from fixing the integers to the values found with the heuristic.…”
Section: B Decomposition Strategymentioning
confidence: 99%