{"title":"机器人编队的可伸缩路径和时间协调","authors":"H. Chwa, Andrii Shyshkalov, Kilho Lee, I. Shin","doi":"10.1109/CPSNA.2014.23","DOIUrl":null,"url":null,"abstract":"In this paper, we consider several CPS challenges (e.g., responsiveness, scalability, adaptability) in multi-robot formation. In general, the response time of multi-robot formation task involves two parts: the computation time for path and time coordination to avoid any collision among robots and the actuation time for the control of the robots to actually move to their destinations. In terms of responsiveness, a shorter response time provides a higher quality of responsiveness. However, it is complicated to reduce the response time since reducing computation time and reducing robot actuation time are conflicting objectives, and such a trade-off varies over environment. We present a scalable optimization framework that explores such a trade-off dynamically and exploits it in a feedback manner to find efficient trajectory schedules. Our simulation results show that our framework successfully finds a shorter response time by adapting to various environments compared to a commercial optimization tool, and it is scalable for a large number of robots.","PeriodicalId":254175,"journal":{"name":"2014 IEEE International Conference on Cyber-Physical Systems, Networks, and Applications","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Scalable Path and Time Coordination for Robot Formation\",\"authors\":\"H. Chwa, Andrii Shyshkalov, Kilho Lee, I. Shin\",\"doi\":\"10.1109/CPSNA.2014.23\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we consider several CPS challenges (e.g., responsiveness, scalability, adaptability) in multi-robot formation. In general, the response time of multi-robot formation task involves two parts: the computation time for path and time coordination to avoid any collision among robots and the actuation time for the control of the robots to actually move to their destinations. In terms of responsiveness, a shorter response time provides a higher quality of responsiveness. However, it is complicated to reduce the response time since reducing computation time and reducing robot actuation time are conflicting objectives, and such a trade-off varies over environment. We present a scalable optimization framework that explores such a trade-off dynamically and exploits it in a feedback manner to find efficient trajectory schedules. Our simulation results show that our framework successfully finds a shorter response time by adapting to various environments compared to a commercial optimization tool, and it is scalable for a large number of robots.\",\"PeriodicalId\":254175,\"journal\":{\"name\":\"2014 IEEE International Conference on Cyber-Physical Systems, Networks, and Applications\",\"volume\":\"46 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-08-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE International Conference on Cyber-Physical Systems, Networks, and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CPSNA.2014.23\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE International Conference on Cyber-Physical Systems, Networks, and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CPSNA.2014.23","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Scalable Path and Time Coordination for Robot Formation
In this paper, we consider several CPS challenges (e.g., responsiveness, scalability, adaptability) in multi-robot formation. In general, the response time of multi-robot formation task involves two parts: the computation time for path and time coordination to avoid any collision among robots and the actuation time for the control of the robots to actually move to their destinations. In terms of responsiveness, a shorter response time provides a higher quality of responsiveness. However, it is complicated to reduce the response time since reducing computation time and reducing robot actuation time are conflicting objectives, and such a trade-off varies over environment. We present a scalable optimization framework that explores such a trade-off dynamically and exploits it in a feedback manner to find efficient trajectory schedules. Our simulation results show that our framework successfully finds a shorter response time by adapting to various environments compared to a commercial optimization tool, and it is scalable for a large number of robots.