{"title":"网络移动机器人避碰的分布式连通性最大化","authors":"Yinyan Zhang, Shuai Li, Y. Wu, Qingyun Deng","doi":"10.1109/CCDC52312.2021.9601425","DOIUrl":null,"url":null,"abstract":"For networked mobile robots, it is important to have a good initial configuration before executing given tasks, such as cooperative tracking. In this paper, based on our recent work on the distributed estimation of algebraic connectivity for undirected graphs, we present a novel approach to realize autonomous connectivity maximization for networked mobile robots with collision avoidance. The performance of the presented approach is tested via simulations, which substantiate its effectiveness.","PeriodicalId":143976,"journal":{"name":"2021 33rd Chinese Control and Decision Conference (CCDC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Distributed Connectivity Maximization for Networked Mobile Robots with Collision Avoidance\",\"authors\":\"Yinyan Zhang, Shuai Li, Y. Wu, Qingyun Deng\",\"doi\":\"10.1109/CCDC52312.2021.9601425\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For networked mobile robots, it is important to have a good initial configuration before executing given tasks, such as cooperative tracking. In this paper, based on our recent work on the distributed estimation of algebraic connectivity for undirected graphs, we present a novel approach to realize autonomous connectivity maximization for networked mobile robots with collision avoidance. The performance of the presented approach is tested via simulations, which substantiate its effectiveness.\",\"PeriodicalId\":143976,\"journal\":{\"name\":\"2021 33rd Chinese Control and Decision Conference (CCDC)\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-05-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 33rd Chinese Control and Decision Conference (CCDC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCDC52312.2021.9601425\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 33rd Chinese Control and Decision Conference (CCDC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCDC52312.2021.9601425","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Distributed Connectivity Maximization for Networked Mobile Robots with Collision Avoidance
For networked mobile robots, it is important to have a good initial configuration before executing given tasks, such as cooperative tracking. In this paper, based on our recent work on the distributed estimation of algebraic connectivity for undirected graphs, we present a novel approach to realize autonomous connectivity maximization for networked mobile robots with collision avoidance. The performance of the presented approach is tested via simulations, which substantiate its effectiveness.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
