Time optimal control of ground vehicles

G. Max, B. Lantos
{"title":"Time optimal control of ground vehicles","authors":"G. Max, B. Lantos","doi":"10.1109/SISY.2014.6923594","DOIUrl":null,"url":null,"abstract":"The paper deals with the time optimal control of automatically driven cars modeled with gear shift as discrete control input beside the continuous ones in a test path between corridors. The car is required to avoid a static obstacle or performing double lane change. The problem can be formulated as a mixed-integer optimal control problem (MIOCP). The resulting MIOCP is solved by reformulating it to static mixed-integer nonlinear program (MINLP) using time discretization and direct multiple shooting method. Non-commercial open software packages are applied that substantially use the gradients of the objective function and the Jacobians of the constraints exploiting sparsity. A novel algorithm and implementation is presented for computing the derivatives of the complex state trajectory joining equations. This algorithm was given in the form of matrix differential equations whose structure allowed to compute their solution using RK4 in matrix form. The elaborated method can be applied both for combustion engine and electric driven cars. It can form the basis to generate an offline database of a central general collision avoidance system (CAS) for varying path parameters on a grid which can support real time applications.","PeriodicalId":277041,"journal":{"name":"2014 IEEE 12th International Symposium on Intelligent Systems and Informatics (SISY)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 12th International Symposium on Intelligent Systems and Informatics (SISY)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SISY.2014.6923594","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

The paper deals with the time optimal control of automatically driven cars modeled with gear shift as discrete control input beside the continuous ones in a test path between corridors. The car is required to avoid a static obstacle or performing double lane change. The problem can be formulated as a mixed-integer optimal control problem (MIOCP). The resulting MIOCP is solved by reformulating it to static mixed-integer nonlinear program (MINLP) using time discretization and direct multiple shooting method. Non-commercial open software packages are applied that substantially use the gradients of the objective function and the Jacobians of the constraints exploiting sparsity. A novel algorithm and implementation is presented for computing the derivatives of the complex state trajectory joining equations. This algorithm was given in the form of matrix differential equations whose structure allowed to compute their solution using RK4 in matrix form. The elaborated method can be applied both for combustion engine and electric driven cars. It can form the basis to generate an offline database of a central general collision avoidance system (CAS) for varying path parameters on a grid which can support real time applications.
地面车辆时间最优控制
本文研究了在走廊间试验路径上,除连续控制输入外,以换挡为离散控制输入的自动驾驶汽车时间最优控制问题。车辆必须避开静态障碍物或进行双变道。该问题可表述为一个混合整数最优控制问题(MIOCP)。利用时间离散化和直接多次射击法,将得到的MIOCP重新表述为静态混合整数非线性程序(MINLP)进行求解。非商业开放软件包的应用基本上使用了目标函数的梯度和利用稀疏性的约束的雅可比矩阵。提出了一种计算复杂状态轨迹联接方程导数的新算法和实现方法。该算法以矩阵微分方程的形式给出,其结构允许使用矩阵形式的RK4计算其解。该方法既适用于内燃机汽车,也适用于电动汽车。它可以为网格上不同路径参数的中央通用避碰系统(CAS)离线数据库的生成提供基础,支持实时应用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信