基于最优控制的网联自动车辆协同变道在线运动规划

Bai Li, Youmin Zhang, Yuming Ge, Zhijiang Shao, Pu Li
{"title":"基于最优控制的网联自动车辆协同变道在线运动规划","authors":"Bai Li, Youmin Zhang, Yuming Ge, Zhijiang Shao, Pu Li","doi":"10.1109/IROS.2017.8206215","DOIUrl":null,"url":null,"abstract":"This work formulates the multi-vehicle lane change motion planning task as a centralized optimal control problem, which is beneficial in being generic and complete. However, a direct solution to this optimal control problem is numerically intractable due to the dimensionality of the collision-avoidance constraints and nonlinearity of the vehicle kinematics. A progressively constrained dynamic optimization (PCDO) method is proposed to facilitate the numerical solving process of this complicated problem. PCDO guarantees to efficiently obtain an optimum to the original optimal control problem via solving a sequence of simplified problems which gradually judge and reserve only the active collision-avoidance constraints. A first-regularization-then-action strategy, together with the look-up table technique, is developed for online solutions. At the regularization stage, the vehicles form a standard formation by linear acceleration/deceleration only. At the action stage, the vehicles execute lane change motions computed offline and recorded in the look-up table. This makes online motion planning feasible because 1) the computational complexity at the regularization stage scales linearly rather than exponentially with the vehicle number; and 2) online computation at the action stage is fully avoided through data extraction from the look-up table.","PeriodicalId":6658,"journal":{"name":"2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","volume":"8 12 1","pages":"3689-3694"},"PeriodicalIF":0.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"32","resultStr":"{\"title\":\"Optimal control-based online motion planning for cooperative lane changes of connected and automated vehicles\",\"authors\":\"Bai Li, Youmin Zhang, Yuming Ge, Zhijiang Shao, Pu Li\",\"doi\":\"10.1109/IROS.2017.8206215\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This work formulates the multi-vehicle lane change motion planning task as a centralized optimal control problem, which is beneficial in being generic and complete. However, a direct solution to this optimal control problem is numerically intractable due to the dimensionality of the collision-avoidance constraints and nonlinearity of the vehicle kinematics. A progressively constrained dynamic optimization (PCDO) method is proposed to facilitate the numerical solving process of this complicated problem. PCDO guarantees to efficiently obtain an optimum to the original optimal control problem via solving a sequence of simplified problems which gradually judge and reserve only the active collision-avoidance constraints. A first-regularization-then-action strategy, together with the look-up table technique, is developed for online solutions. At the regularization stage, the vehicles form a standard formation by linear acceleration/deceleration only. At the action stage, the vehicles execute lane change motions computed offline and recorded in the look-up table. This makes online motion planning feasible because 1) the computational complexity at the regularization stage scales linearly rather than exponentially with the vehicle number; and 2) online computation at the action stage is fully avoided through data extraction from the look-up table.\",\"PeriodicalId\":6658,\"journal\":{\"name\":\"2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)\",\"volume\":\"8 12 1\",\"pages\":\"3689-3694\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"32\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IROS.2017.8206215\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IROS.2017.8206215","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 32

摘要

本文将多车变道运动规划任务表述为集中最优控制问题,有利于通用性和完全性。然而,由于避碰约束的维度和车辆运动学的非线性,直接求解这一最优控制问题在数值上是难以解决的。为了简化这一复杂问题的数值求解过程,提出了一种渐进约束动态优化方法。PCDO通过求解一系列简化的问题,逐步判断并保留主动避碰约束,保证有效地获得对原最优控制问题的最优解。提出了一种先正则化后行动的策略,并结合查找表技术对在线解决方案进行了研究。在正则化阶段,车辆仅通过线性加减速形成标准队形。在动作阶段,车辆执行脱机计算的变道动作,并记录在查找表中。这使得在线运动规划变得可行,因为1)正则化阶段的计算复杂度随车辆数量呈线性增长,而不是呈指数增长;2)通过从查找表中提取数据,完全避免了动作阶段的在线计算。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal control-based online motion planning for cooperative lane changes of connected and automated vehicles
This work formulates the multi-vehicle lane change motion planning task as a centralized optimal control problem, which is beneficial in being generic and complete. However, a direct solution to this optimal control problem is numerically intractable due to the dimensionality of the collision-avoidance constraints and nonlinearity of the vehicle kinematics. A progressively constrained dynamic optimization (PCDO) method is proposed to facilitate the numerical solving process of this complicated problem. PCDO guarantees to efficiently obtain an optimum to the original optimal control problem via solving a sequence of simplified problems which gradually judge and reserve only the active collision-avoidance constraints. A first-regularization-then-action strategy, together with the look-up table technique, is developed for online solutions. At the regularization stage, the vehicles form a standard formation by linear acceleration/deceleration only. At the action stage, the vehicles execute lane change motions computed offline and recorded in the look-up table. This makes online motion planning feasible because 1) the computational complexity at the regularization stage scales linearly rather than exponentially with the vehicle number; and 2) online computation at the action stage is fully avoided through data extraction from the look-up table.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信