{"title":"非凸约束下多辆自动驾驶汽车的约束一致性","authors":"Mengmeng Duan, Hongqiu Zhu","doi":"10.1109/ICIRT.2018.8641653","DOIUrl":null,"url":null,"abstract":"In this paper, we investigate the consensus problem for multiple autonomous vehicles with nonconvex constraints. We propose a distributed control algorithm and prove that consensus can be reached if the communication network jointly has a spanning tree. The analysis approach is based on the model transformation and the properties of the Metzler matrix and the stochastic matrix.","PeriodicalId":202415,"journal":{"name":"2018 International Conference on Intelligent Rail Transportation (ICIRT)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Constrained Consensus of Multiple Autonomous Vehicles with Nonconvex Constraints\",\"authors\":\"Mengmeng Duan, Hongqiu Zhu\",\"doi\":\"10.1109/ICIRT.2018.8641653\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we investigate the consensus problem for multiple autonomous vehicles with nonconvex constraints. We propose a distributed control algorithm and prove that consensus can be reached if the communication network jointly has a spanning tree. The analysis approach is based on the model transformation and the properties of the Metzler matrix and the stochastic matrix.\",\"PeriodicalId\":202415,\"journal\":{\"name\":\"2018 International Conference on Intelligent Rail Transportation (ICIRT)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 International Conference on Intelligent Rail Transportation (ICIRT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIRT.2018.8641653\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Intelligent Rail Transportation (ICIRT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIRT.2018.8641653","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Constrained Consensus of Multiple Autonomous Vehicles with Nonconvex Constraints
In this paper, we investigate the consensus problem for multiple autonomous vehicles with nonconvex constraints. We propose a distributed control algorithm and prove that consensus can be reached if the communication network jointly has a spanning tree. The analysis approach is based on the model transformation and the properties of the Metzler matrix and the stochastic matrix.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
