Shashank Rao Marpally, M. S. Nagarakshith, Arjun Sadananda, K. Guruprasad
{"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}
引用次数: 0
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.