{"title":"An Optimization-based Time-optimal Velocity Planning for Autonomous Driving","authors":"Hao HU, Weigang PAN, Song GAO, Xiangmeng TANG","doi":"10.24846/v32i3y202304","DOIUrl":null,"url":null,"abstract":": Velocity planning plays an important role in motion planning of automated driving as it must meet safety, comfort, and traffic regulation requirements. Therefore, it is necessary to consider Jerk constraint and dynamic obstacle constraint. However, the introduction of these constraints makes velocity planning a non-convex optimization problem, significantly increasing computational complexity. To address these challenges, this paper investigates an optimization-based time-optimal velocity planning method. The non-convex and non-linear problems caused by Jerk constraint and dynamic obstacle constraint are addressed by realizing constraint linearization through velocity filtering with acceleration as the threshold. The linear programming (LP) method is then used twice to calculate a time-optimal velocity profile that satisfies the given constraints. Furthermore, when hard constraints are unable to satisfy obstacle avoidance planning, a dynamic constraint frame strategy is proposed to relax the hard constraints and fully utilize the dynamic performance of the ego-vehicle to avoid obstacles. Finally, simulations are conducted in various driving scenarios to validate the effectiveness of the proposed approach. The simulation results demonstrate that the approach proposed in this paper can quickly generate velocity profiles that meet safety and comfort constraints, within a short planning period. Additionally, the dynamic constraint frame strategy can improve the dynamic adaptability of the","PeriodicalId":49466,"journal":{"name":"Studies in Informatics and Control","volume":"48 1","pages":"0"},"PeriodicalIF":1.2000,"publicationDate":"2023-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Studies in Informatics and Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.24846/v32i3y202304","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
: Velocity planning plays an important role in motion planning of automated driving as it must meet safety, comfort, and traffic regulation requirements. Therefore, it is necessary to consider Jerk constraint and dynamic obstacle constraint. However, the introduction of these constraints makes velocity planning a non-convex optimization problem, significantly increasing computational complexity. To address these challenges, this paper investigates an optimization-based time-optimal velocity planning method. The non-convex and non-linear problems caused by Jerk constraint and dynamic obstacle constraint are addressed by realizing constraint linearization through velocity filtering with acceleration as the threshold. The linear programming (LP) method is then used twice to calculate a time-optimal velocity profile that satisfies the given constraints. Furthermore, when hard constraints are unable to satisfy obstacle avoidance planning, a dynamic constraint frame strategy is proposed to relax the hard constraints and fully utilize the dynamic performance of the ego-vehicle to avoid obstacles. Finally, simulations are conducted in various driving scenarios to validate the effectiveness of the proposed approach. The simulation results demonstrate that the approach proposed in this paper can quickly generate velocity profiles that meet safety and comfort constraints, within a short planning period. Additionally, the dynamic constraint frame strategy can improve the dynamic adaptability of the
期刊介绍:
Studies in Informatics and Control journal provides important perspectives on topics relevant to Information Technology, with an emphasis on useful applications in the most important areas of IT.
This journal is aimed at advanced practitioners and researchers in the field of IT and welcomes original contributions from scholars and professionals worldwide.
SIC is published both in print and online by the National Institute for R&D in Informatics, ICI Bucharest. Abstracts, full text and graphics of all articles in the online version of SIC are identical to the print version of the Journal.