隐蔽机器人路径规划的快速可见性评估

M. Marzouqi, R. Jarvis
{"title":"隐蔽机器人路径规划的快速可见性评估","authors":"M. Marzouqi, R. Jarvis","doi":"10.1109/SSRR.2005.1501241","DOIUrl":null,"url":null,"abstract":"In previous publications we have presented a promising new idea on covert path planning. The aim is to allow a robot to plan a path with minimum exposure to known or unknown hostile sentries within the same environment. An important element of our approach is to create what we have called a visibility risk map. In case of unknown sentries' locations, the visibility risk map is produced by measuring the exposure value of each free space cell. The early method for this process suffers from high computation time when dealing with high resolution maps. This drawback appears clearly in the case of unknown environments where the visibility risk map needs to be updated continuously as the environment's map is updated online. In this paper, a faster method is presented that based on triangulation geometry to find an approximated exposure value of each cell. The new method has been tested on a simulated environment which has shown its speed improvement over the previous method, as well as generating a smoother covert path.","PeriodicalId":173715,"journal":{"name":"IEEE International Safety, Security and Rescue Rototics, Workshop, 2005.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Fast visibility evaluation for covert robotics path planning\",\"authors\":\"M. Marzouqi, R. Jarvis\",\"doi\":\"10.1109/SSRR.2005.1501241\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In previous publications we have presented a promising new idea on covert path planning. The aim is to allow a robot to plan a path with minimum exposure to known or unknown hostile sentries within the same environment. An important element of our approach is to create what we have called a visibility risk map. In case of unknown sentries' locations, the visibility risk map is produced by measuring the exposure value of each free space cell. The early method for this process suffers from high computation time when dealing with high resolution maps. This drawback appears clearly in the case of unknown environments where the visibility risk map needs to be updated continuously as the environment's map is updated online. In this paper, a faster method is presented that based on triangulation geometry to find an approximated exposure value of each cell. The new method has been tested on a simulated environment which has shown its speed improvement over the previous method, as well as generating a smoother covert path.\",\"PeriodicalId\":173715,\"journal\":{\"name\":\"IEEE International Safety, Security and Rescue Rototics, Workshop, 2005.\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-06-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE International Safety, Security and Rescue Rototics, Workshop, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SSRR.2005.1501241\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Safety, Security and Rescue Rototics, Workshop, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSRR.2005.1501241","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

在以前的出版物中,我们提出了一个很有前途的隐蔽路径规划的新想法。其目的是让机器人在同一环境中以最小的暴露于已知或未知的敌对哨兵的方式规划路径。我们方法的一个重要元素是创建我们称之为可见性风险图的东西。在哨兵位置未知的情况下,通过测量每个空闲空间单元的暴露值生成能见度风险图。早期的方法在处理高分辨率地图时计算时间长。在未知环境中,可见性风险地图需要随着环境地图的在线更新而不断更新,这个缺点就会明显地显现出来。本文提出了一种基于三角几何的快速求出每个单元的近似曝光值的方法。在仿真环境中对该方法进行了测试,结果表明该方法的速度比以前的方法有所提高,并且产生了更平滑的隐蔽路径。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Fast visibility evaluation for covert robotics path planning
In previous publications we have presented a promising new idea on covert path planning. The aim is to allow a robot to plan a path with minimum exposure to known or unknown hostile sentries within the same environment. An important element of our approach is to create what we have called a visibility risk map. In case of unknown sentries' locations, the visibility risk map is produced by measuring the exposure value of each free space cell. The early method for this process suffers from high computation time when dealing with high resolution maps. This drawback appears clearly in the case of unknown environments where the visibility risk map needs to be updated continuously as the environment's map is updated online. In this paper, a faster method is presented that based on triangulation geometry to find an approximated exposure value of each cell. The new method has been tested on a simulated environment which has shown its speed improvement over the previous method, as well as generating a smoother covert path.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Urban flood simulation as a component of integrated earthquake disaster simulation Sequential sensing with biosonar for natural landmark classification Parking-vehicles recognition using spatial temporal data (a study of mobile robot surveillance system using spatial temporal GIS part 2) Experimental study of traction robot system for rescue against nuclear disaster Tele-presence methods supporting cooperation of robots and humans
×
引用
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