论文中文题名: | 移动机器人SLAM后端优化算法研究 |
姓名: | |
学号: | 19207205086 |
保密级别: | 公开 |
论文语种: | chi |
学科代码: | 085208 |
学科名称: | 工学 - 工程 - 电子与通信工程 |
学生类型: | 硕士 |
学位级别: | 工程硕士 |
学位年度: | 2022 |
培养单位: | 西安科技大学 |
院系: | |
专业: | |
研究方向: | 人工智能 |
第一导师姓名: | |
第一导师单位: | |
论文提交日期: | 2022-06-23 |
论文答辩日期: | 2022-06-10 |
论文外文题名: | Research on Back-end Optimization Algorithm of Mobile Robot SLAM |
论文中文关键词: | |
论文外文关键词: | SLAM Back-end O ptimization ; Bundle Adjustment ; LM algorithm ; Robustness Optimization |
论文中文摘要: |
即时定位与地图构建(SLAM)作为机器人发展的重要技术受到研究者们的广泛关注,后端优化作为SLAM的重要组成部分也被广泛研究。由于后端优化面对大量的待优化数据,优化过程中存在计算不稳定、效率低、系统鲁棒性差等问题,导致优化效果不理想。为了进一步提高优化精度,促进机器人的智能化应用和发展,本文对SLAM后端优化算法进行研究。 本文研究了SLAM后端图优化方法中的光束平差法(BA)。BA求解过程中的LM迭代算法在计算过程中产生的雅可比矩阵可能是奇异的,导致算法存在奇异或病态问题。针对该问题,本文提出一种改进的LM算法,通过定义迭代参数的计算方式,将前一次的迭代结果引入到后一次的迭代计算中,可有效减小因当前解远离解集时函数较大产生的影响,同时可在不假设雅可比矩阵是非奇异的条件下具有二阶收敛性,保证算法稳定的前提下提高计算效率。经实验验证,改进LM算法可有效提高计算效率,在达到相同结果的情况下,其迭代次数相较于LM和C-LM算法减少23.53%和13.33%;与LM-BA和C-LM-BA相比,I-LM-BA对轨迹图优化的误差最小,且优化中的轨迹图毛刺明显减少,稳定性更高。 由于待优化的数据中存在因错误识别等原因造成的异常值,降低优化精度,本文对后端鲁棒性的优化算法进行研究。针对典型算法中存在计算复杂和优化精度低的问题,本文提出一种具有自适应性的动态协方差缩放(ADCS)算法。ADCS算法只需要对节点进行计算,然后根据推导出的计算公式和每次的迭代结果动态更新参数S和Ø的值,可以在简化计算的同时,有效减弱错误闭环对整体优化的影响,实现后端鲁棒性。将ADCS算法应用到不同的数据集上进行仿真实验。结果表明,ADCS算法对添加错误闭环的数据集仍可以完成高精度估计图优化,实现后端鲁棒性;且能够简化计算过程,运行时间相对于DCS和CPS算法,分别减少28.05%和7.65%;并能完成对不同数据集的高精度轨迹图优化,相较于更精确的CPS算法,该算法对RingCity和Manhattan数据集优化误差分别减少11.36%和22.18%。 |
论文外文摘要: |
Simultaneous localization and mapping (SLAM) has received extensive attention from researchers as an important technology for robot development, and back-end optimization as an important component of SLAM has also been widely studied. Since back-end optimization faces a large amount of data to be optimized, the optimization process suffers from computational instability, low efficiency, and poor system robustness, leading to unsatisfactory results. In order to further improve the accuracy and promote the intelligent application and development of robots, this paper investigates the SLAM back-end optimization algorithm. This paper investigates the bundle adjustment (BA) in the SLAM back-end graph optimization method. The Jacobi matrix generated by the LM iterative method in BA solving process may be singular, resulting in singular or ill-conditioned algorithms. To address this problem, an improved LM algorithm is proposed in this paper. By defining the calculation of the iterative parameters, the previous iteration result is introduced into the next iteration calculation, which can reduce the problem that the function is large when the current solution is far away from the solution set. And at the same time, it can have second-order convergence without assuming that the Jacobi matrix is non-singular, and the computational efficiency is improved while ensuring the stability of the algorithm. Experimental results show that the improved LM algorithm can effectively improve the computational efficiency. Under the condition of achieving the same result, the number of iterations is reduced by 23.53% and 13.33% compared with the LM and C-LM algorithms; Compared with LM-BA and C-LM-BA, I-LM-BA has the smallest error for trajectory map optimization, and the burr of the trajectory graph in optimization is significantly reduced and more stable. Since there are outliers in the data to be optimized due to misidentification and other reasons, which reduces the optimization accuracy, the optimization algorithm for back-end robustness is investigated in this paper. Aiming at the problems of computational complexity and low optimization accuracy in typical algorithms, an adaptive dynamic covariance scaling (ADCS) algorithm is proposed. The ADCS algorithm only needs to calculate the nodes, and then dynamically update the value of the parameter S and Ø based on the derived calculation formula and each iteration result, which can simplify the calculation while effectively attenuating the impact of the error closed loop on the overall optimization and achieving the robustness of the back end. The ADCS algorithm is applied to different datasets for simulation experiments. The results show that the ADCS algorithm can still complete the high-precision estimation graph optimization for the datasets with error closed loop added, and realize the back-end robustness. It can simplify the calculation process and reduce the running time by 28.05% and 7.65% compared with the DCS and CPS algorithms. It also can complete the high-precision trajectory graph optimization for different datasets, and compared with the more accurate CPS algorithm, this algorithm reduces the optimization errors of RingCity and Manhattan datasets by 11.36% and 22.18%. |
参考文献: |
[3]吴建清, 宋修广. 同步定位与建图技术发展综述[J]. 山东大学学报(工学版), 2021, 51(05): 16-31. [6]高翔, 张涛, 刘毅. 视觉SLAM十四讲: 从理论到实践[M]. 电子工业出版社, 2017. [9]赵挽东. 复杂场景下机器人SLAM算法研究[D]. 哈尔滨: 哈尔滨工程大学, 2019. [12]邓琳蔚, 王治, 张梦梦, 等. 一种基于光束平差法的相机标定方法[J]. 兵工自动化, 2020, 39(02): 8-13. [13]周治国, 曹江微, 邸顺帆. 3D激光雷达SLAM算法综述[J]. 仪器仪表学报, 2021, 42(09): 13-27. [14]张毅, 陈起, 罗元. 室内环境下移动机器人三维视觉SLAM[J]. 智能系统学报, 2015, 10(4): 615-619. [16]王录涛, 吴林峰. 基于图优化的视觉SLAM研究进展与应用分析[J]. 计算机应用研究, 2020, 37(01): 9-15. [17]王柯赛, 姚锡凡, 黄宇, 等. 动态环境下的视觉SLAM研究评述[J]. 机器人, 2021, 43(06): 715-732. [25]周彦, 李雅芳, 王冬丽, 等. 视觉同时定位与地图创建综述[J]. 智能系统学报, 2018, 13(1): 97-106. [28]芦宝娟, 赵大磊, 徐广允. 改进卡尔曼滤波的井下组合导航定位算法[J]. 计算机应用与软件, 2022, 39(03): 139-145. [30]杨傲雷, 金宏宙, 陈灵, 等. 融合深度学习与粒子滤波的移动机器人重定位方法[J]. 仪器仪表学报, 2021, 42(07): 226-233. [32]罗景文, 秦世引. 基于智能优化箱粒子滤波的移动机器人FastSLAM[J]. 北京航空航天大学学报, 2022, 48(01): 53-66. [34]李二超, 高振磊. 改进粒子速度和位置更新公式的粒子群优化算法[J]. 南京师大学报(自然科学版), 2022, 45(01): 118-126. [37]崔昊杨, 张宇, 周坤, 等. 基于仿生算法改进粒子滤波的SLAM算法精度预测[J]. 控制与决策, 2021, 36(01): 166-172. [38]李维刚, 李阳, 赵云涛, 等. 基于改进灰狼算法的粒子滤波算法研究[J]. 系统仿真学报, 2021, 33(01): 37-45. [39]周宁亚, 黄友锐, 韩涛. 基于狮群优化的FastSLAM算法[J]. 计算机应用与软件, 2020, 37(07): 206-211. [40]孙弋,张笑笑.结合退火优化和遗传重采样的RBPF算法[J].西安科技大学学报, 2020, 40(2): 349-355. [41]王忠立, 赵杰, 蔡鹤皋. 大规模环境下基于图优化SLAM的图构建方法[J]. 哈尔滨工业大学学报, 2015, 47(01): 75-85. [47]赵帅华, 李言言, 曹健, 等. 基于BFGS修正的高斯牛顿光束法平差解算方法[J]. 北京大学学报(自然科学版), 2020, 56(06): 1013-1019. [48]朱子健, 张贵阳, 杨明, 等. 基于法化矩阵降维的多相机快速光束法平差算法[J]. 红外与激光工程, 2021, 50(02): 263-271. [53]王丽星, 曹付元. 基于Huber损失的非负矩阵分解算法[J]. 计算机科学, 2020, 47(11): 80-87. [54]段菲, 王慧敏, 张超. 面向数据表示的Cauchy非负矩阵分解[J]. 计算机科学, 2021, 48(06): 96-102. [63]史加荣, 王丹, 尚凡华, 等. 随机梯度下降算法研究进展[J]. 自动化学报, 2021, 47(09): 2103-2119. [64]万琴, 颜金娥, 李智, 等. 基于改进RANSAC算法的全景图像拼接技术[J]. 光电子·激光, 2021, 32(12): 1253-1261. |
中图分类号: | TP301.6 |
开放日期: | 2022-06-23 |