Chiayang Lin, Kejia Sun, Tianrui Zhao, Zhengwen Nie, Yanzheng Zhao
{"title":"采用稀疏增量哈希象素的轻量级高带宽激光雷达-惯性测距仪","authors":"Chiayang Lin, Kejia Sun, Tianrui Zhao, Zhengwen Nie, Yanzheng Zhao","doi":"10.1088/1742-6596/2795/1/012006","DOIUrl":null,"url":null,"abstract":"\n This work introduces a lightweight LIO framework employing incremental voxels for enhanced efficiency. We leverage a sparse voxel data structure, replacing the tree structure in the Point-LIO open-source framework. Through hash table-managed voxel indexes, we achieve rapid K nearest neighbor search within nearly one voxel size with constant complexity query speed. This approach significantly reduces the time cost associated with tree nodes construction, balancing, and iteration compared to the tree-like structures. Experimental results demonstrate that our proposed enhancement achieves an average speed-up of 21.5% compared to Point-LIO in publicly available datasets. Moreover, it reduces drift by an average of approximately 20(m) and ATE by 1.41(m) under sparse point cloud input conditions.","PeriodicalId":506941,"journal":{"name":"Journal of Physics: Conference Series","volume":"22 19","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Lightweight High-Bandwidth LiDAR-Inertial Odometry Employing Sparse Incremental Hash-Voxels\",\"authors\":\"Chiayang Lin, Kejia Sun, Tianrui Zhao, Zhengwen Nie, Yanzheng Zhao\",\"doi\":\"10.1088/1742-6596/2795/1/012006\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\\n This work introduces a lightweight LIO framework employing incremental voxels for enhanced efficiency. We leverage a sparse voxel data structure, replacing the tree structure in the Point-LIO open-source framework. Through hash table-managed voxel indexes, we achieve rapid K nearest neighbor search within nearly one voxel size with constant complexity query speed. This approach significantly reduces the time cost associated with tree nodes construction, balancing, and iteration compared to the tree-like structures. Experimental results demonstrate that our proposed enhancement achieves an average speed-up of 21.5% compared to Point-LIO in publicly available datasets. Moreover, it reduces drift by an average of approximately 20(m) and ATE by 1.41(m) under sparse point cloud input conditions.\",\"PeriodicalId\":506941,\"journal\":{\"name\":\"Journal of Physics: Conference Series\",\"volume\":\"22 19\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Physics: Conference Series\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1088/1742-6596/2795/1/012006\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Physics: Conference Series","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1088/1742-6596/2795/1/012006","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This work introduces a lightweight LIO framework employing incremental voxels for enhanced efficiency. We leverage a sparse voxel data structure, replacing the tree structure in the Point-LIO open-source framework. Through hash table-managed voxel indexes, we achieve rapid K nearest neighbor search within nearly one voxel size with constant complexity query speed. This approach significantly reduces the time cost associated with tree nodes construction, balancing, and iteration compared to the tree-like structures. Experimental results demonstrate that our proposed enhancement achieves an average speed-up of 21.5% compared to Point-LIO in publicly available datasets. Moreover, it reduces drift by an average of approximately 20(m) and ATE by 1.41(m) under sparse point cloud input conditions.