Optimal Lane Change Path Planning Based on the NSGA-II and TOPSIS Algorithms
Among so many autonomous driving technologies, autonomous lane changing is an important application scenario, which has been gaining increasing amounts of attention from both industry and academic communities because it can effectively reduce traffic congestion and improve road safety. However, most...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-01-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/13/2/1149 |
| _version_ | 1797446401656881152 |
|---|---|
| author | Dongyi Wang Guoli Wang Hang Wang |
| author_facet | Dongyi Wang Guoli Wang Hang Wang |
| author_sort | Dongyi Wang |
| collection | DOAJ |
| description | Among so many autonomous driving technologies, autonomous lane changing is an important application scenario, which has been gaining increasing amounts of attention from both industry and academic communities because it can effectively reduce traffic congestion and improve road safety. However, most of the existing researchers transform the multi-objective optimization problem of lane changing trajectory into a single objective problem, but how to determine the weight of the objective function is relatively fuzzy. Therefore, an optimization method based on the combination of the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) and the Technique for Order Preference by Similarity to Ideal Solution (TOPSIS), which provides a new idea for solving the multi-objective optimization problem of lane change trajectory algorithm, is proposed in this paper. Firstly, considering the constraints of lane changing and combining with the collision detection algorithm, the feasible lane changing trajectory cluster is obtained based on the quintic polynomial. In order to ensure the comfort, stability and high efficiency of the lane changing process, the NSGA-II Algorithm is used to optimize the longitudinal displacement and time of lane changing. The continuous ordered weighted averaging (COWA) operator is introduced to calculate the weights of three objective optimization functions. Finally, the TOPSIS Algorithm is applied to obtain the optimal lane change trajectory. The simulations are conducted, and the results demonstrate that the proposed method can generate a satisfactory trajectory for automatic lane changing actions. |
| first_indexed | 2024-03-09T13:40:59Z |
| format | Article |
| id | doaj.art-0fed8eac844447b382cd461d4e844773 |
| institution | Directory Open Access Journal |
| issn | 2076-3417 |
| language | English |
| last_indexed | 2024-03-09T13:40:59Z |
| publishDate | 2023-01-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Applied Sciences |
| spelling | doaj.art-0fed8eac844447b382cd461d4e8447732023-11-30T21:06:53ZengMDPI AGApplied Sciences2076-34172023-01-01132114910.3390/app13021149Optimal Lane Change Path Planning Based on the NSGA-II and TOPSIS AlgorithmsDongyi Wang0Guoli Wang1Hang Wang2School of Mechanical Engineering, Beijing Institute of Technology, Beijing 100081, ChinaSchool of Mechanical Engineering, Beijing Institute of Technology, Beijing 100081, ChinaSchool of Mechanical Engineering, Beijing Institute of Technology, Beijing 100081, ChinaAmong so many autonomous driving technologies, autonomous lane changing is an important application scenario, which has been gaining increasing amounts of attention from both industry and academic communities because it can effectively reduce traffic congestion and improve road safety. However, most of the existing researchers transform the multi-objective optimization problem of lane changing trajectory into a single objective problem, but how to determine the weight of the objective function is relatively fuzzy. Therefore, an optimization method based on the combination of the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) and the Technique for Order Preference by Similarity to Ideal Solution (TOPSIS), which provides a new idea for solving the multi-objective optimization problem of lane change trajectory algorithm, is proposed in this paper. Firstly, considering the constraints of lane changing and combining with the collision detection algorithm, the feasible lane changing trajectory cluster is obtained based on the quintic polynomial. In order to ensure the comfort, stability and high efficiency of the lane changing process, the NSGA-II Algorithm is used to optimize the longitudinal displacement and time of lane changing. The continuous ordered weighted averaging (COWA) operator is introduced to calculate the weights of three objective optimization functions. Finally, the TOPSIS Algorithm is applied to obtain the optimal lane change trajectory. The simulations are conducted, and the results demonstrate that the proposed method can generate a satisfactory trajectory for automatic lane changing actions.https://www.mdpi.com/2076-3417/13/2/1149lane changequintic polynomialNSGA-IIoptimizationTOPSIS |
| spellingShingle | Dongyi Wang Guoli Wang Hang Wang Optimal Lane Change Path Planning Based on the NSGA-II and TOPSIS Algorithms Applied Sciences lane change quintic polynomial NSGA-II optimization TOPSIS |
| title | Optimal Lane Change Path Planning Based on the NSGA-II and TOPSIS Algorithms |
| title_full | Optimal Lane Change Path Planning Based on the NSGA-II and TOPSIS Algorithms |
| title_fullStr | Optimal Lane Change Path Planning Based on the NSGA-II and TOPSIS Algorithms |
| title_full_unstemmed | Optimal Lane Change Path Planning Based on the NSGA-II and TOPSIS Algorithms |
| title_short | Optimal Lane Change Path Planning Based on the NSGA-II and TOPSIS Algorithms |
| title_sort | optimal lane change path planning based on the nsga ii and topsis algorithms |
| topic | lane change quintic polynomial NSGA-II optimization TOPSIS |
| url | https://www.mdpi.com/2076-3417/13/2/1149 |
| work_keys_str_mv | AT dongyiwang optimallanechangepathplanningbasedonthensgaiiandtopsisalgorithms AT guoliwang optimallanechangepathplanningbasedonthensgaiiandtopsisalgorithms AT hangwang optimallanechangepathplanningbasedonthensgaiiandtopsisalgorithms |