2020
DOI: 10.1109/tiv.2019.2955361
|View full text |Cite
|
Sign up to set email alerts
|

Trajectory Optimization and Situational Analysis Framework for Autonomous Overtaking With Visibility Maximization

Abstract: In this paper we present a trajectory generation method for autonomous overtaking of unexpected obstacles in a dynamic urban environment. In these settings, blind spots can arise from perception limitations. For example when overtaking unexpected objects on the vehicle's ego lane on a two-way street. In this case, a human driver would first make sure that the opposite lane is free and that there is enough room to successfully execute the maneuver, and then it would cut into the opposite lane in order to execut… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 25 publications
(7 citation statements)
references
References 25 publications
0
7
0
Order By: Relevance
“…The purpose of MPC is to compute the optimal control sequence []boldukk=0H1$$ {\left[{\mathbf{u}}_k^{\ast}\right]}_{k=0}^{H-1} $$, where H$$ H $$ is the prediction horizon (prediction time steps). Given the initial state boldx0$$ {\mathbf{x}}_0 $$ of the prediction horizon, the optimal control sequence []boldukk=0H1$$ {\left[{\mathbf{u}}_k^{\ast}\right]}_{k=0}^{H-1} $$ in this horizon can be obtained according to the receding horizon principle, which can be solved as follows [17]: minJ()center centerarrayηkk=0H,arrayukk=0H1,$$ \min J\left({\left[{\boldsymbol{\eta}}_k\right]}_{k=0}^H,\kern0.5em {\left[{\mathbf{u}}_k\right]}_{k=0}^{H-1}\right), $$ subject to rightηk+1=gdtηk,ukleftrightλminλknλmaxleftrightxk…”
Section: Architecture Of the Proposed Obstacle Avoidance Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…The purpose of MPC is to compute the optimal control sequence []boldukk=0H1$$ {\left[{\mathbf{u}}_k^{\ast}\right]}_{k=0}^{H-1} $$, where H$$ H $$ is the prediction horizon (prediction time steps). Given the initial state boldx0$$ {\mathbf{x}}_0 $$ of the prediction horizon, the optimal control sequence []boldukk=0H1$$ {\left[{\mathbf{u}}_k^{\ast}\right]}_{k=0}^{H-1} $$ in this horizon can be obtained according to the receding horizon principle, which can be solved as follows [17]: minJ()center centerarrayηkk=0H,arrayukk=0H1,$$ \min J\left({\left[{\boldsymbol{\eta}}_k\right]}_{k=0}^H,\kern0.5em {\left[{\mathbf{u}}_k\right]}_{k=0}^{H-1}\right), $$ subject to rightηk+1=gdtηk,ukleftrightλminλknλmaxleftrightxk…”
Section: Architecture Of the Proposed Obstacle Avoidance Methodsmentioning
confidence: 99%
“…in this horizon can be obtained according to the receding horizon principle, which can be solved as follows [17]:…”
Section: Mpc For Obstacle Avoidancementioning
confidence: 99%
See 1 more Smart Citation
“…Lacking the environmental perception, this approach requires complete knowledge of the environment, thus not applicable in real applications. Andersen et al [10] consider OE in trajectory planning to get more information for vehicle overtaking. They generate motions by maximizing the visibility ahead of obstacles with an MPC receding horizon planner.…”
Section: A Local Control Based Methodsmentioning
confidence: 99%
“…The trajectory optimization method is formulating the motion planning as an optimization problem. Model Predictive control (MPC) has been proven well suited for formulating the problem [13]. MPC can take the updating of the environment into account during the planning process, because of its ability to handle multi-constraints [14].…”
Section: B Overall Optimization Methodsmentioning
confidence: 99%