2021 American Control Conference (ACC) 2021
DOI: 10.23919/acc50511.2021.9483020
|View full text |Cite
|
Sign up to set email alerts
|

TDR-OBCA: A Reliable Planner for Autonomous Driving in Free-Space Environment

Abstract: This paper presents an optimization-based collision avoidance trajectory generation method for autonomous driving in free-space environments, with enhanced robustness, driving comfort and efficiency. Starting from the hybrid optimization-based framework, we introduces two warm start methods, temporal and dual variable warm starts, to improve the efficiency. We also reformulates the problem to improve the robustness and efficiency. We name this new algorithm TDR-OBCA. With these changes, compared with original … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 15 publications
(9 citation statements)
references
References 19 publications
(28 reference statements)
0
8
0
Order By: Relevance
“…As a result, the warm start problem takes an average of 13ms to solve, and the NLP problem takes 1.39s to solve. Overall, TDR-OBCA achieves an 11.5% efficiency improvement over H-OBCA in the parallel parking scenarios, and the time consumption of H-OBCA and TDR-OBCA are similar to that in [8] [23].…”
Section: A Benchmark Simulation Resultsmentioning
confidence: 86%
See 2 more Smart Citations
“…As a result, the warm start problem takes an average of 13ms to solve, and the NLP problem takes 1.39s to solve. Overall, TDR-OBCA achieves an 11.5% efficiency improvement over H-OBCA in the parallel parking scenarios, and the time consumption of H-OBCA and TDR-OBCA are similar to that in [8] [23].…”
Section: A Benchmark Simulation Resultsmentioning
confidence: 86%
“…And ( 16) is equivalent to (15). Note that (11h) is a second order cone constraint, and to simplify the warm start problem, [8] put the constraint A T m λ m,k 2 ≤ 1 into objective function. Then the warm start problem is given by min…”
Section: A Parallel Computationmentioning
confidence: 99%
See 1 more Smart Citation
“…Paths calculated by the above algorithms usually have cusps and are not smooth, and many numerical optimization algorithms (e.g., He et al., 2020; Kogan et al., 2006) were developed to solve these problems. Besides, algorithms in the four groups can be combined to achieve better performance.…”
Section: Literature Reviewmentioning
confidence: 99%
“…For example, He et al. (2020) developed a numerical optimization method named Temporal and DualWarm Starts with Reformulated Optimization‐based Collisio Avoidance (TDR‐OBCA) that utilizes Hybrid A* to generate an initialization state.…”
Section: Literature Reviewmentioning
confidence: 99%