移动机器人初始未知区域的几何映射

Shashank Rao Marpally, M. S. Nagarakshith, Arjun Sadananda, K. Guruprasad
{"title":"移动机器人初始未知区域的几何映射","authors":"Shashank Rao Marpally, M. S. Nagarakshith, Arjun Sadananda, K. Guruprasad","doi":"10.1109/DISCOVER47552.2019.9008095","DOIUrl":null,"url":null,"abstract":"In this paper, we address a problem of mapping an unknown region of interest by a mobile robot. Unlike the conventional exploration and mapping techniques where the occupancy map of a spatially discretized environment is obtained, in the proposed Geometric Mapping (G-Mapping) strategy, the map is obtained in the form of geometric models of the obstacles, in a continuous space. For simplicity, we consider convex polygonal obstacles within a convex region. The proposed exploration strategy is implemented using MATLAB. The simulation results are presented to illustrate and demonstrate the G-Mapping strategy.","PeriodicalId":274260,"journal":{"name":"2019 IEEE International Conference on Distributed Computing, VLSI, Electrical Circuits and Robotics (DISCOVER)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Geometrical Mapping of an Initially Unknown Region by a Mobile Robot\",\"authors\":\"Shashank Rao Marpally, M. S. Nagarakshith, Arjun Sadananda, K. Guruprasad\",\"doi\":\"10.1109/DISCOVER47552.2019.9008095\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we address a problem of mapping an unknown region of interest by a mobile robot. Unlike the conventional exploration and mapping techniques where the occupancy map of a spatially discretized environment is obtained, in the proposed Geometric Mapping (G-Mapping) strategy, the map is obtained in the form of geometric models of the obstacles, in a continuous space. For simplicity, we consider convex polygonal obstacles within a convex region. The proposed exploration strategy is implemented using MATLAB. The simulation results are presented to illustrate and demonstrate the G-Mapping strategy.\",\"PeriodicalId\":274260,\"journal\":{\"name\":\"2019 IEEE International Conference on Distributed Computing, VLSI, Electrical Circuits and Robotics (DISCOVER)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE International Conference on Distributed Computing, VLSI, Electrical Circuits and Robotics (DISCOVER)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DISCOVER47552.2019.9008095\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Conference on Distributed Computing, VLSI, Electrical Circuits and Robotics (DISCOVER)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DISCOVER47552.2019.9008095","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在本文中,我们解决了移动机器人绘制未知感兴趣区域的问题。与传统的勘探和测绘技术不同,在空间离散环境中获得占用地图,在提出的几何映射(G-Mapping)策略中,地图以障碍物的几何模型的形式在连续空间中获得。为简单起见,我们考虑凸区域内的凸多边形障碍物。利用MATLAB实现了所提出的勘探策略。仿真结果说明了G-Mapping策略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Geometrical Mapping of an Initially Unknown Region by a Mobile Robot
In this paper, we address a problem of mapping an unknown region of interest by a mobile robot. Unlike the conventional exploration and mapping techniques where the occupancy map of a spatially discretized environment is obtained, in the proposed Geometric Mapping (G-Mapping) strategy, the map is obtained in the form of geometric models of the obstacles, in a continuous space. For simplicity, we consider convex polygonal obstacles within a convex region. The proposed exploration strategy is implemented using MATLAB. The simulation results are presented to illustrate and demonstrate the G-Mapping strategy.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信