地面机器人在可移动障碍物之间的空中导航

Elias Mueggler, Matthias Faessler, Flavio Fontana, D. Scaramuzza
{"title":"地面机器人在可移动障碍物之间的空中导航","authors":"Elias Mueggler, Matthias Faessler, Flavio Fontana, D. Scaramuzza","doi":"10.1109/SSRR.2014.7017662","DOIUrl":null,"url":null,"abstract":"We demonstrate the fully autonomous collaboration of an aerial and a ground robot in a mock-up disaster scenario. Within this collaboration, we make use of the individual capabilities and strengths of both robots. The aerial robot first maps an area of interest, then it computes the fastest mission for the ground robot to reach a spotted victim and deliver a first-aid kit. Such a mission includes driving and removing obstacles in the way while being constantly monitored and commanded by the aerial robot. Our mission-planning algorithm distinguishes between movable and fixed obstacles and considers both the time for driving and removing obstacles. The entire mission is executed without any human interaction once the aerial robot is launched and requires a minimal amount of communication between the robots. We describe both the hardware and software of our system and detail our mission-planning algorithm. We present exhaustive results of both simulation and real experiments. Our system was successfully demonstrated more than 20 times at a trade fair.","PeriodicalId":267630,"journal":{"name":"2014 IEEE International Symposium on Safety, Security, and Rescue Robotics (2014)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"64","resultStr":"{\"title\":\"Aerial-guided navigation of a ground robot among movable obstacles\",\"authors\":\"Elias Mueggler, Matthias Faessler, Flavio Fontana, D. Scaramuzza\",\"doi\":\"10.1109/SSRR.2014.7017662\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We demonstrate the fully autonomous collaboration of an aerial and a ground robot in a mock-up disaster scenario. Within this collaboration, we make use of the individual capabilities and strengths of both robots. The aerial robot first maps an area of interest, then it computes the fastest mission for the ground robot to reach a spotted victim and deliver a first-aid kit. Such a mission includes driving and removing obstacles in the way while being constantly monitored and commanded by the aerial robot. Our mission-planning algorithm distinguishes between movable and fixed obstacles and considers both the time for driving and removing obstacles. The entire mission is executed without any human interaction once the aerial robot is launched and requires a minimal amount of communication between the robots. We describe both the hardware and software of our system and detail our mission-planning algorithm. We present exhaustive results of both simulation and real experiments. Our system was successfully demonstrated more than 20 times at a trade fair.\",\"PeriodicalId\":267630,\"journal\":{\"name\":\"2014 IEEE International Symposium on Safety, Security, and Rescue Robotics (2014)\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"64\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE International Symposium on Safety, Security, and Rescue Robotics (2014)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SSRR.2014.7017662\",\"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 Symposium on Safety, Security, and Rescue Robotics (2014)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSRR.2014.7017662","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 64

摘要

我们在模拟灾难场景中演示了空中和地面机器人的完全自主协作。在这次合作中,我们利用了两个机器人的个人能力和优势。空中机器人首先绘制出一个感兴趣的区域,然后计算出地面机器人到达被发现的受害者并运送急救箱的最快速度。这样的任务包括驾驶和清除路上的障碍物,同时受到空中机器人的持续监控和指挥。我们的任务规划算法区分了可移动障碍物和固定障碍物,并考虑了行驶和清除障碍物的时间。一旦空中机器人发射,整个任务在没有任何人类互动的情况下执行,并且需要机器人之间最少的通信。我们描述了我们的系统的硬件和软件,并详细介绍了我们的任务规划算法。我们给出了模拟和实际实验的详尽结果。我们的系统已经在展会上成功展示了20多次。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Aerial-guided navigation of a ground robot among movable obstacles
We demonstrate the fully autonomous collaboration of an aerial and a ground robot in a mock-up disaster scenario. Within this collaboration, we make use of the individual capabilities and strengths of both robots. The aerial robot first maps an area of interest, then it computes the fastest mission for the ground robot to reach a spotted victim and deliver a first-aid kit. Such a mission includes driving and removing obstacles in the way while being constantly monitored and commanded by the aerial robot. Our mission-planning algorithm distinguishes between movable and fixed obstacles and considers both the time for driving and removing obstacles. The entire mission is executed without any human interaction once the aerial robot is launched and requires a minimal amount of communication between the robots. We describe both the hardware and software of our system and detail our mission-planning algorithm. We present exhaustive results of both simulation and real experiments. Our system was successfully demonstrated more than 20 times at a trade fair.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信