机器人编队的可伸缩路径和时间协调

H. Chwa, Andrii Shyshkalov, Kilho Lee, I. Shin
{"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}
引用次数: 1

摘要

在本文中,我们考虑了多机器人编队中的几个CPS挑战(例如,响应性,可扩展性,适应性)。一般来说,多机器人编队任务的响应时间包括两个部分:路径计算时间和避免机器人之间碰撞的协调时间,以及控制机器人实际移动到目的地的驱动时间。在响应性方面,更短的响应时间提供更高质量的响应性。然而,由于减少计算时间和减少机器人驱动时间是相互冲突的目标,并且这种权衡随环境的变化而变化,因此减少响应时间是复杂的。我们提出了一个可扩展的优化框架,动态地探索这种权衡,并以反馈的方式利用它来找到有效的轨迹调度。我们的仿真结果表明,与商业优化工具相比,我们的框架通过适应各种环境成功地找到了更短的响应时间,并且对于大量机器人具有可扩展性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信