On pareto-optimal fronts for diminishment of lane-changing impact in mixed traffic

In order to minimize the impact of LC (lane-changing) maneuver, this research proposes a novel LC algorithm in mixed traffic. The LC maneuver is parsed into two stages: one is from the decision point to the execution point (finding a suitable gap), and the other is from the execution point to the end point (performing the LC maneuver). Thereafter, a multiobjective optimization problem integrating these two stages is constructed, in which the comfort, efficiency and safety of the LC vehicle and the surrounding vehicles are simultaneously considered. Through introducing the NSGA-II (Non-dominated Sorting Genetic Algorithm), the pareto-optimal frontier and pareto-optimal solution of this problem is obtained. The nearest point of the frontier to the origin is used as the final solution. Through the micro-level analysis of the operating status of each vehicle, macro-level analysis of the traffic flow state within the LC area, and the sensitivity analysis of pareto-optimal frontier, we verify the performance of our proposed algorithm. Results demonstrate that compared with the existing algorithm, our algorithm could provide the optimal execution point and trajectory with the least impact on surroundings. The operation status of the traffic flow within the LC area has been significantly improved. We anticipate that this research could provide valuable insights into autonomous driving technology.