Aram Kawewong, Yutaro Honda, M. Tsuboyama, O. Hasegawa
{"title":"用于机器人导航的基于公共模式的映射","authors":"Aram Kawewong, Yutaro Honda, M. Tsuboyama, O. Hasegawa","doi":"10.1109/ROBIO.2009.4913071","DOIUrl":null,"url":null,"abstract":"Mobile Robot Navigation problem has been extensively studied for decades, but a general solution which suits to various environments remains a challenging topic. One of the popular methods is to build the map and then navigate based on such map. Although most of the map-building approaches, either metric or topological, can efficiently create the map in an unknown environment, they rely on coordinates so that the error in self-pose estimation is unavoidable. In this paper, we alternatively propose a new map-building approach which is especially suitable to mobile robot navigation and does not rely on coordinates. Two key ingredients of the proposed method are (i) the self-organized common-pattern and (ii) the reasoning technique. First the common-patterns are generated in an unsupervised manner by the Self-Organizing and Incremental Neural Networks (SOINN). These patterns are used to incrementally represent the map of environments. The map generated in this manner is called Common-Patterns Based Map (CPM). The CPM is incrementally generated while the robot wandering in the environment. The reasoning technique is proposed to optimize the CPM. The evaluation of the proposed method is done by the experiment of 3D-physical robot simulators (Webots). All environments are the maze. The results show that the CPM is suitable to the navigation with an impressive rate of memory consumption. The loop can be closed successfully. The navigating performance is superior to that of reinforcement learning as it always requires only two episodes.","PeriodicalId":321332,"journal":{"name":"2008 IEEE International Conference on Robotics and Biomimetics","volume":"89 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Common-patterns based mapping for robot navigation\",\"authors\":\"Aram Kawewong, Yutaro Honda, M. Tsuboyama, O. Hasegawa\",\"doi\":\"10.1109/ROBIO.2009.4913071\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mobile Robot Navigation problem has been extensively studied for decades, but a general solution which suits to various environments remains a challenging topic. One of the popular methods is to build the map and then navigate based on such map. Although most of the map-building approaches, either metric or topological, can efficiently create the map in an unknown environment, they rely on coordinates so that the error in self-pose estimation is unavoidable. In this paper, we alternatively propose a new map-building approach which is especially suitable to mobile robot navigation and does not rely on coordinates. Two key ingredients of the proposed method are (i) the self-organized common-pattern and (ii) the reasoning technique. First the common-patterns are generated in an unsupervised manner by the Self-Organizing and Incremental Neural Networks (SOINN). These patterns are used to incrementally represent the map of environments. The map generated in this manner is called Common-Patterns Based Map (CPM). The CPM is incrementally generated while the robot wandering in the environment. The reasoning technique is proposed to optimize the CPM. The evaluation of the proposed method is done by the experiment of 3D-physical robot simulators (Webots). All environments are the maze. The results show that the CPM is suitable to the navigation with an impressive rate of memory consumption. The loop can be closed successfully. The navigating performance is superior to that of reinforcement learning as it always requires only two episodes.\",\"PeriodicalId\":321332,\"journal\":{\"name\":\"2008 IEEE International Conference on Robotics and Biomimetics\",\"volume\":\"89 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-05-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 IEEE International Conference on Robotics and Biomimetics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ROBIO.2009.4913071\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE International Conference on Robotics and Biomimetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ROBIO.2009.4913071","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Common-patterns based mapping for robot navigation
Mobile Robot Navigation problem has been extensively studied for decades, but a general solution which suits to various environments remains a challenging topic. One of the popular methods is to build the map and then navigate based on such map. Although most of the map-building approaches, either metric or topological, can efficiently create the map in an unknown environment, they rely on coordinates so that the error in self-pose estimation is unavoidable. In this paper, we alternatively propose a new map-building approach which is especially suitable to mobile robot navigation and does not rely on coordinates. Two key ingredients of the proposed method are (i) the self-organized common-pattern and (ii) the reasoning technique. First the common-patterns are generated in an unsupervised manner by the Self-Organizing and Incremental Neural Networks (SOINN). These patterns are used to incrementally represent the map of environments. The map generated in this manner is called Common-Patterns Based Map (CPM). The CPM is incrementally generated while the robot wandering in the environment. The reasoning technique is proposed to optimize the CPM. The evaluation of the proposed method is done by the experiment of 3D-physical robot simulators (Webots). All environments are the maze. The results show that the CPM is suitable to the navigation with an impressive rate of memory consumption. The loop can be closed successfully. The navigating performance is superior to that of reinforcement learning as it always requires only two episodes.