{"title":"Topological place recognition based on long-term memory retrieval","authors":"H. Karaoğuz, H. I. Bozma","doi":"10.1109/ICAR.2015.7251459","DOIUrl":null,"url":null,"abstract":"Topological place recognition is related to the retrieval of previously learned places from long-term memory. In this paper, we consider this problem and present a novel approach - based on the previously proposed bubble descriptor semantic tree (BDST) memory model. In the proposed approach, the robot combines decision-making at each searched node of the BDST along with a BDST traversal strategy in order to find the most related previous knowledge. In case the robot is kidnapped or has no knowledge of where it is coming from, the traversal uses top-down depth-first search. If the robot has been navigating and knows where it is coming from, it uses this knowledge to initiate its search in an integrated bottom-up and top-down manner. The experimental results indicate that the proposed approach generally improves recognition performance significantly in comparison to purely top-down traversal.","PeriodicalId":432004,"journal":{"name":"2015 International Conference on Advanced Robotics (ICAR)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2015-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Advanced Robotics (ICAR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAR.2015.7251459","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
Topological place recognition is related to the retrieval of previously learned places from long-term memory. In this paper, we consider this problem and present a novel approach - based on the previously proposed bubble descriptor semantic tree (BDST) memory model. In the proposed approach, the robot combines decision-making at each searched node of the BDST along with a BDST traversal strategy in order to find the most related previous knowledge. In case the robot is kidnapped or has no knowledge of where it is coming from, the traversal uses top-down depth-first search. If the robot has been navigating and knows where it is coming from, it uses this knowledge to initiate its search in an integrated bottom-up and top-down manner. The experimental results indicate that the proposed approach generally improves recognition performance significantly in comparison to purely top-down traversal.