{"title":"基于分布式邻居选择的多车系统速度协调","authors":"Haibin Shao, Lulu Pan, Y. Xi, Dewei Li, Shu Lin","doi":"10.1109/ITSC.2019.8917166","DOIUrl":null,"url":null,"abstract":"In this paper, we examine a data-driven control approach to coordination of multi-vehicle systems based on the distributed neighbor selection. The core of the proposed approach is to utilize a recently developed metric called relative tempo for distributed coordination which is computable from local measurable data for each vehicle in the network. The relative tempo between each agent and its neighbors is shown to be closely related to the directed spanning tree of the underlying network in a quantitative manner. Based on this fact, a local neighbor selection protocol is subsequently provided to construct the global refined communication structure which can both maintain the connectivity and increase the efficiency of the multi-vehicle coordination. The numerical study is finally provided to demonstrate the effectiveness of our approach.","PeriodicalId":6717,"journal":{"name":"2019 IEEE Intelligent Transportation Systems Conference (ITSC)","volume":"45 1","pages":"2938-2943"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Velocity Coordination of Multi-vehicle Systems via Distributed Neighbor Selection\",\"authors\":\"Haibin Shao, Lulu Pan, Y. Xi, Dewei Li, Shu Lin\",\"doi\":\"10.1109/ITSC.2019.8917166\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we examine a data-driven control approach to coordination of multi-vehicle systems based on the distributed neighbor selection. The core of the proposed approach is to utilize a recently developed metric called relative tempo for distributed coordination which is computable from local measurable data for each vehicle in the network. The relative tempo between each agent and its neighbors is shown to be closely related to the directed spanning tree of the underlying network in a quantitative manner. Based on this fact, a local neighbor selection protocol is subsequently provided to construct the global refined communication structure which can both maintain the connectivity and increase the efficiency of the multi-vehicle coordination. The numerical study is finally provided to demonstrate the effectiveness of our approach.\",\"PeriodicalId\":6717,\"journal\":{\"name\":\"2019 IEEE Intelligent Transportation Systems Conference (ITSC)\",\"volume\":\"45 1\",\"pages\":\"2938-2943\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE Intelligent Transportation Systems Conference (ITSC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITSC.2019.8917166\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Intelligent Transportation Systems Conference (ITSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITSC.2019.8917166","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Velocity Coordination of Multi-vehicle Systems via Distributed Neighbor Selection
In this paper, we examine a data-driven control approach to coordination of multi-vehicle systems based on the distributed neighbor selection. The core of the proposed approach is to utilize a recently developed metric called relative tempo for distributed coordination which is computable from local measurable data for each vehicle in the network. The relative tempo between each agent and its neighbors is shown to be closely related to the directed spanning tree of the underlying network in a quantitative manner. Based on this fact, a local neighbor selection protocol is subsequently provided to construct the global refined communication structure which can both maintain the connectivity and increase the efficiency of the multi-vehicle coordination. The numerical study is finally provided to demonstrate the effectiveness of our approach.