{"title":"基于三角形特征的二维图SLAM地图匹配与闭环","authors":"Binqian Jiang, Yilong Zhu, Ming Liu","doi":"10.1109/ROBIO49542.2019.8961777","DOIUrl":null,"url":null,"abstract":"The loop closure problem in 2D LiDAR simultaneous localization and mapping (SLAM) is interesting yet to be solved efficiently, as it suffers from a lack of information in 2D laser rangefinder readings. For this reason, we compare two grid submaps, where features and constraints are enriched, to find loops. We propose a geometric environment descriptor called a Triangle Feature (TF). It exploits the Euclidean distance constraint any three feature points in a submap can form. A 2D graph SLAM system using TF to close loops is also developed. The global maps we build outperform some popular open-source SLAM solutions, and the system can run up to 2.4 times of real-time in our experiments.","PeriodicalId":121822,"journal":{"name":"2019 IEEE International Conference on Robotics and Biomimetics (ROBIO)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A Triangle Feature Based Map-to-map Matching and Loop Closure for 2D Graph SLAM\",\"authors\":\"Binqian Jiang, Yilong Zhu, Ming Liu\",\"doi\":\"10.1109/ROBIO49542.2019.8961777\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The loop closure problem in 2D LiDAR simultaneous localization and mapping (SLAM) is interesting yet to be solved efficiently, as it suffers from a lack of information in 2D laser rangefinder readings. For this reason, we compare two grid submaps, where features and constraints are enriched, to find loops. We propose a geometric environment descriptor called a Triangle Feature (TF). It exploits the Euclidean distance constraint any three feature points in a submap can form. A 2D graph SLAM system using TF to close loops is also developed. The global maps we build outperform some popular open-source SLAM solutions, and the system can run up to 2.4 times of real-time in our experiments.\",\"PeriodicalId\":121822,\"journal\":{\"name\":\"2019 IEEE International Conference on Robotics and Biomimetics (ROBIO)\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE International Conference on Robotics and Biomimetics (ROBIO)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ROBIO49542.2019.8961777\",\"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 Robotics and Biomimetics (ROBIO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ROBIO49542.2019.8961777","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Triangle Feature Based Map-to-map Matching and Loop Closure for 2D Graph SLAM
The loop closure problem in 2D LiDAR simultaneous localization and mapping (SLAM) is interesting yet to be solved efficiently, as it suffers from a lack of information in 2D laser rangefinder readings. For this reason, we compare two grid submaps, where features and constraints are enriched, to find loops. We propose a geometric environment descriptor called a Triangle Feature (TF). It exploits the Euclidean distance constraint any three feature points in a submap can form. A 2D graph SLAM system using TF to close loops is also developed. The global maps we build outperform some popular open-source SLAM solutions, and the system can run up to 2.4 times of real-time in our experiments.