2022
DOI: 10.1049/itr2.12234
|View full text |Cite
|
Sign up to set email alerts
|

QPNet: Lane‐changing trajectory planning combining quadratic programming and neural network under the convex optimization framework

Abstract: Lane-changing is a basic driving behaviour, which largely impacts on traffic safety and efficiency. With the development of technology, the automated lane-changing system has attracted extensive attention. Among it, the trajectory planning part is a challenging problem owing to the complexity and diversity of the driving situations. The planner requires the real-time capability to produce safe and comfortable trajectories for coping with the dynamically changing environment. Based on this, the paper proposes a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 50 publications
(113 reference statements)
0
2
0
Order By: Relevance
“…In contrast to algorithms such as graph search and sampling, numerical optimization describes trajectory planning as a multi-objective optimization problem, which is solved by quadratic programming to obtain the optimal trajectory [10]. The biggest advantage of this algorithm is that the optimal solution space is continuous and there is no large jump in the optimal solution between adjacent frames [11], [12]. However, the long time required for trajectory point optimization iterations leads to a slow solution speed for some frames, which cannot meet the real-time requirements in autonomous driving scenarios.…”
Section: Introductionmentioning
confidence: 99%
“…In contrast to algorithms such as graph search and sampling, numerical optimization describes trajectory planning as a multi-objective optimization problem, which is solved by quadratic programming to obtain the optimal trajectory [10]. The biggest advantage of this algorithm is that the optimal solution space is continuous and there is no large jump in the optimal solution between adjacent frames [11], [12]. However, the long time required for trajectory point optimization iterations leads to a slow solution speed for some frames, which cannot meet the real-time requirements in autonomous driving scenarios.…”
Section: Introductionmentioning
confidence: 99%
“…These algorithms encompass parameterized curves, including but not limited to, circular curves, spiral curves, trigonometric curves, and polynomial curves. Key merits of these algorithms encompass their computational efficiency, intuitive design, and high precision [22]. Such algorithms are prevalently employed in studies focused on obstacle avoidance trajectory planning for intelligent driving vehicles.…”
Section: Introductionmentioning
confidence: 99%