基于在线优化的多辆无人车协调

R. Fierro, C. Branca, J. Spletzer
{"title":"基于在线优化的多辆无人车协调","authors":"R. Fierro, C. Branca, J. Spletzer","doi":"10.1109/ICNSC.2005.1461278","DOIUrl":null,"url":null,"abstract":"The objective of this work is to investigate on-line optimization-based coordination strategies for robot teams to efficiently accomplish a mission (e.g., reach a set of assigned targets) while avoiding collisions. The multi-robot coordination problem is addressed by solving an on-line receding-horizon mixed-integer program to find some suitable inputs for the vehicles. Simulations results verify the feasibility of our approach.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"On-line optimization-based coordination of multiple unmanned vehicles\",\"authors\":\"R. Fierro, C. Branca, J. Spletzer\",\"doi\":\"10.1109/ICNSC.2005.1461278\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The objective of this work is to investigate on-line optimization-based coordination strategies for robot teams to efficiently accomplish a mission (e.g., reach a set of assigned targets) while avoiding collisions. The multi-robot coordination problem is addressed by solving an on-line receding-horizon mixed-integer program to find some suitable inputs for the vehicles. Simulations results verify the feasibility of our approach.\",\"PeriodicalId\":313251,\"journal\":{\"name\":\"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-03-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNSC.2005.1461278\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNSC.2005.1461278","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

这项工作的目的是研究基于在线优化的机器人团队协调策略,以有效地完成任务(例如,到达一组指定的目标),同时避免碰撞。多机器人协调问题是通过求解一个在线的地平线后退混合整数规划来寻找合适的车辆输入。仿真结果验证了该方法的可行性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
On-line optimization-based coordination of multiple unmanned vehicles
The objective of this work is to investigate on-line optimization-based coordination strategies for robot teams to efficiently accomplish a mission (e.g., reach a set of assigned targets) while avoiding collisions. The multi-robot coordination problem is addressed by solving an on-line receding-horizon mixed-integer program to find some suitable inputs for the vehicles. Simulations results verify the feasibility of our approach.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Stochastic robust stability analysis for Markovian jumping neural networks with time delays Modeling and performance evaluation of collision resolution algorithms for LonWorks control networks The organization model research of SM crowd Forced and constrained consensus among cooperating agents Routing in stochastic networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1