Hegedűs, Tamás and Németh, Balázs and Gáspár, Péter (2020) Design of a Low-complexity Graph-Based Motion-Planning Algorithm for Autonomous Vehicles. APPLIED SCIENCES-BASEL, 10 (21). ISSN 2076-3417 10.3390/app10217716

Preview

Text Hegedus_1_31708559_ny.pdf Download (1MB) | Preview

Abstract

In the development of autonomous vehicles, the design of real-time motion-planning is a crucial problem. The computation of the vehicle trajectory requires the consideration of safety, dynamic and comfort aspects. Moreover, the prediction of the vehicle motion in the surroundings and the real-time planning of the autonomous vehicle trajectory can be complex tasks. The goal of this paper is to present low-complexity motion-planning for overtaking scenarios in parallel traffic. The developed method is based on the generation of a graph, which contains feasible vehicle trajectories. The reduction of the complexity in the real-time computation is achieved through the reduction of the graph with clustering. In the motion-planning algorithm, the predicted motion of the surrounding vehicles is taken into consideration. The prediction algorithm is based on density functions of the surrounding vehicle motion, which are developed through real measurements. The resulted motion-planning algorithm is able to guarantee a safe and comfortable trajectory for the autonomous vehicle. The effectiveness of the method is illustrated through simulation examples using a high-fidelity vehicle dynamic simulator.

Item Type:	Article
Uncontrolled Keywords:	Autonomous Vehicles; Trajectory design; motion-planning;
Subjects:	Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions:	Systems and Control Lab
SWORD Depositor:	MTMT Injector
Depositing User:	MTMT Injector
Date Deposited:	17 Dec 2020 09:18
Last Modified:	17 Nov 2021 13:50
URI:	https://eprints.sztaki.hu/id/eprint/10017

Update Item