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}
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.