检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Shoudong Huang
出 处:《Journal of Control and Decision》2019年第1期61-74,共14页控制与决策学报(英文)
摘 要:This paper provides a brief review of the different optimisation strategies used in mobile robot simultaneous localisation and mapping(SLAM)problem.The focus is on the optimisation-based SLAM back end.The strategies are classified based on their purposes such as reducing the computational complexity,improving the convergence and improving the robustness.It is clearly pointed out that some approximations are made in some of the methods and there is always a trade-off between the computational complexity and the accuracy of the solution.The local submap joining is a strategy that has been used to address both the computational complexity and the convergence and is a flexible tool to be used in the SLAM back end.Although more research is needed to further improve the SLAM back end,nowadays there are quite a few relatively mature SLAM back end algorithms that can be used by SLAM researchers and users.
关 键 词:SLAM optimisation SPARSENESS dimension reduction submap joining
分 类 号:TP2[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.21.126.184