一种改进的粒子滤波SLAM算法

提出一种改进的粒子滤波SLAM（simultaneous localization and map building）同时定位和地图创建实现方法。改进方法让机器人大约行进10步完成基于局部已创建地图下的粒子滤波定位后,再利用激光传感器探测环境并更新创建的地图;同时在利用粒子滤波定位时,使粒子只分布在由航位推算法得出的机器人位姿附近,从而可有效地减少粒子的数量。实验结果表明,与标准的粒子滤波SLAM 算法比较,改进算法提高了机器人SLAM过程中定位和地图创建的精度和实时性,并为移动机器人在室外未知环境同时定位和地图创建提供了新方法。     

基于局部子地图方法的多机器人主动同时定位与地图创建

研究了多机器人在未知环境下以主动的方式协作完成同时定位与地图创建（SLAM）的问题．引入局部子地图方法,由每个机器人建立自身周围局部区域的子地图,使多个机器人之间的地图创建相互独立,从而对全局环境的SLAM问题进行分解．而每个机器人在建立局部子地图时将主动SLAM问题转化为多目标优化问题;机器人选取最优的控制输入,使定位与地图创建的准确性、信息增益以及多机器人之间的协调关系得到综合优化．最后,通过扩展的卡尔曼滤波器（EKF）对子地图进行融合得到全局地图．仿真结果验证了该方法的有效性．     

基于激光雷达的移动机器人定位和地图创建

针对未知环境下移动机器人定位和地图创建问题,提出了创建局部地图-机器人定位-更新全局地图的方法和步骤.利用激光雷达数据,采用"聚合-分割-聚合"的方法并运用动态阈值获得精确的局部地图.通过匹配局部地图和全局地图的线段关系,实现了机器人的定位,更新了机器人的位姿,减少了机器人的系统误差和环境误差,进而完成了全局地图的创建与更新.实验证明,此算法可以在实现机器人定位的同时获得精确的环境地图,并且有效的缩短了地图生成时间,可靠性高、实时性好.     

基于层次化SLAM的未知环境级联地图创建方法

针对大规模环境下障碍物、环境传感器、移动机器人自身位姿均未知的情况,提出层次化机器人同时定位与空间级联地图创建(SLAM)方法.首先建立子地图与拓扑节点两层结构环境模型,然后利用环境传感器感知信息辅助子地图局部坐标框架的在线创建和更新,同时在拓扑结构创建过程中,利用coupling summation公式推算节点间相对...     

基于EKF的全景视觉机器人SLAM算法

研究全景视觉机器人同时定位和地图创建（SLAM）问题。针对普通视觉视野狭窄, 对路标的连续跟踪和定位能力差的问题, 提出了一种基于改进的扩展卡尔曼滤波（EKF）算法的全景视觉机器人SLAM方法, 用全景视觉得到机器人周围的环境信息, 然后从这些信息中提取出环境特征, 定位出路标位置, 进而通过EKF算法同步更新机器人位姿和地图库。仿真实验和实体机器人实验结果验证了该算法的准确性和有效性, 且全景视觉比普通视觉定位精度更高。     

一种基于半直接视觉里程计的RGB-D SLAM算法

提出了一种新的基于半直接视觉里程计的RGB-D SLAM（同步定位与地图创建）算法,同时利用直接法和传统特征点法的优势,结合鲁棒的后端优化和闭环检测,有效提高了算法在复杂环境中的定位和建图精度．在定位阶段,采用直接法估计相机的初始位姿,然后通过特征点匹配和最小化重投影误差进一步优化位姿,通过筛选地图点并优化位姿输出策略,使算法能够处理稀疏纹理、光照变化、移动物体等难题．算法具有全局重定位的能力．在后端优化阶段,提出了一种新的关键帧选取策略,同时保留直接法选取的局部关键帧和特征点法选取的全局关键帧,并行地维护2种关键帧,分别在滑动窗口和特征地图中对它们进行优化．算法通过对全局关键帧进行闭环检测和优化,提高SLAM的全局一致性．基于标准数据集和真实场景的实验结果表明,算法的性能在许多实际场景中优于主流的RGB-D SLAM算法,对纹理稀疏和有移动物体干扰的环境的鲁棒性较强．     

基于VSLAM的自主移动机器人三维同时定位与地图构建

移动机器人在探索未知环境且没有外部参考系统的情况下,面临着同时定位和地图构建（SLAM）问题。针对基于特征的视觉SLAM（VSLAM）算法构建的稀疏地图不利于机器人应用的问题,提出一种基于八叉树结构的高效、紧凑的地图构建算法。首先,根据关键帧的位姿和深度数据,构建图像对应场景的点云地图;然后利用八叉树地图技术进行处理,构建出了适合于机器人应用的地图。将所提算法同RGB-D SLAM（RGB-Depth SLAM）算法、ElasticFusion算法和ORB-SLAM（Oriented FAST and Rotated BRIEF SLAM）算法通过权威数据集进行了对比实验,实验结果表明,所提算法具有较高的有效性、精度和鲁棒性。最后,搭建了自主移动机器人,将改进的VSLAM系统应用到移动机器人中,能够实时地完成自主避障和三维地图构建,解决稀疏地图无法用于避障和导航的问题。     

基于激光测距仪全局匹配扫描的SLAM算法研究

针对传统的SLAM(Simultaneous Localization and Mapping)算法构建地图时容易受环境因素和外界条件的的影响,在非线性系统状态下误差修正能力不足,且当机器人位姿都处于未知状态时,移动机器人位姿获取不精确,地图构建SLAM技术特征量的获取比较繁琐、不准确等问题。以电力巡检机器人为平台,研究了基于全局匹配的扫描算法,摒弃传统的栅格地图模型的插值方法,采用双线性滤波的插值方法,保证子栅格单元的精确性,估算栅格占用函数的概率和导数。最后采用此算法解决了SLAM地图构建的问题,并分别在室内室外环境进行实验。实验结果表明：基于激光测距仪的全局匹配扫描的SALM算法,在室内室外两种不同环境下,不受复杂背景的影响,准确地进行机器人位姿定位,以及环境地图的构建     

大范围环境中EKF-SLAM问题的改进算法

机器人同步定位与地图构建(SLAM)是指机器人在移动过程中以增量形式创建环境地图并通过所构建地图反复推断自身位置的过程.为实现上述功能,采用传统的扩展卡尔曼滤波(EKF)最优迭代估计方法,在大范围环境条件下,估计误差累积增大,且不能对已构建的环境地图进行更新.提出一种改进算法(KLM-EKF算法),用已知路标的信息对机器人位姿和协方差矩阵进行修正,并创建辅助系数矩阵修正已构建地图,从而实现路标的全局更新.仿真结果表明,在大范围环境中,改进后的算法使机器人自身定位和路标估计误差大幅度降低,并且能够自主地更新已构建地图,有效提高了定位和构图精度.     

基于多分辨率搜索与多点云密度匹配的快速ICP-SLAM方法

针对激光SLAM（同步定位与地图创建）的实时性和定位精度问题,为了克服初始位姿不准确情况下增大搜索范围和位姿匹配分辨率对实时性的影响,本文在传统ICP-SLAM（迭代最近邻SLAM）基础上进行改进,提出了一种分层搜索与匹配的快速ICP-SLAM方法．首先,在搜索范围内采用由粗到细的分辨率进行全局搜索,并通过逐渐增加待匹配点的密度进行分步匹配计算．点云匹配过程中,通过构建距离像计算待匹配点的最近邻距离值,其计算复杂度降低为O（1）．其次,通过对点云匹配结果进行优先排序和剪枝,快速排除非最优解．最后,以半数全局最优与全数局部最优原则作为搜索结束判断条件,提高搜索效率．SLAM Benchmark数据集上的测试结果表明,相比于流行的激光SLAM算法Cartographer,所提出的方法取得了更小的平均误差和平方误差,计算效率为Cartographer算法的2~5倍．同时,工业AGV（自动导引车）的实际应用实验验证了在初始位姿未知的情况下,可实现实时的位姿估计与建图,重复定位精度优于1.5 cm．因此,这种快速ICP-SLAM方法能够保证实现准确的定位估计,具有良好的实时性．     

Three-dimensional iterative closest point-based outdoor SLAM using terrain classification

To navigate in an unknown environment, a robot should build a model for the environment. For outdoor environments, an elevation map is used as the main world model. We considered the outdoor simultaneous localization and mapping (SLAM) method to build a global elevation map by matching local elevation maps. In this research, the iterative closest point (ICP) algorithm was used to match local elevation maps and estimate a robot pose. However, an alignment error is generated by the ICP algorithm due to false selection of corresponding points. Therefore, we propose a new method to classify environmental data into several groups, and to find the corresponding points correctly and improve the performance of the ICP algorithm. Different weights are assigned according to the classified groups because certain groups are very sensitive to the viewpoint of the robot. Three-dimensional (3-D) environmental data acquired by tilting a 2-D laser scanner are used to build local elevation maps and to classify each grid of the map. Experimental results in real environments show the increased accuracy of the proposed ICP-based matching and a reduction in matching time.     

Dual FastSLAM: Dual Factorization of the Particle Filter Based Solution of the Simultaneous Localization and Mapping Problem

The process of building a map with a mobile robot is known as the Simultaneous Localization and Mapping (SLAM) problem, and is considered essential for achieving true autonomy. The best existing solutions to the SLAM problem are based on probabilistic techniques, mainly derived from the basic Bayes Filter. A recent approach is the use of Rao-Blackwellized particle filters. The FastSLAM solution factorizes the Bayes SLAM posterior using a particle filter to estimate over the possible paths of the robot and several independent Kalman Filters attached to each particle to estimate the location of landmarks conditioned to the robot path. Although there are several successful implementations of this idea, there is a lack of applications to indoor environments where the most common feature is the line segment corresponding to straight walls. This paper presents a novel factorization, which is the dual of the existing FastSLAM one, that decouples the SLAM into a map estimation and a localization problem, using a particle filter to estimate over maps and a Kalman Filter attached to each particle to estimate the robot pose conditioned to the given map. We have implemented and tested this approach, analyzing and comparing our solution with the FastSLAM one, and successfully building feature based maps of indoor environments.     

Autonomous Salient Feature Detection through Salient Cues in an HSV Color Space for Visual Indoor Simultaneous Localization and Mapping

For successful simultaneous localization and mapping (SLAM), perception of the environment is important. This paper proposes a scheme to autonomously detect visual features that can be used as natural landmarks for indoor SLAM. First, features are roughly selected from the camera image through entropy maps that measure the level of randomness of pixel information. Then, the saliency of each pixel is computed by measuring the level of similarity between the selected features and the given image. In the saliency map, it is possible to distinguish the salient features from the background. The robot estimates its pose by using the detected features and builds a grid map of the unknown environment by using a range sensor. The feature positions are stored in the grid map. Experimental results show that the feature detection method proposed in this paper can autonomously detect features in unknown environments reasonably well.     

Sparse Local Submap Joining Filter for Building Large-Scale Maps

This paper presents a novel local submap joining algorithm for building large-scale feature-based maps: sparse local submap joining filter (SLSJF). The input to the filter is a sequence of local submaps. Each local submap is represented in a coordinate frame defined by the robot pose at which the map is initiated. The local submap state vector consists of the positions of all the local features and the final robot pose within the submap. The output of the filter is a global map containing the global positions of all the features as well as all the robot start/end poses of the local submaps. Use of an extended information filter (EIF) for fusing submaps makes the information matrix associated with SLSJF exactly sparse. The sparse structure together with a novel state vector and covariance submatrix recovery technique makes the SLSJF computationally very efficient. The SLSJF is a canonical and efficient submap joining solution for large-scale simultaneous localization and mapping (SLAM) problems that makes use of consistent local submaps generated by any reliable SLAM algorithm. The effectiveness and efficiency of the new algorithm is verified through computer simulations and experiments.      

基于扫描匹配的室外环境SLAM 方法

针对室外环境中的机器人“绑架”问题,提出了基于地图匹配的SLAM方法．该方法舍弃了机器人里程计信息, 只利用局部地图和全局地图的图形相关性进行机器人定位．方法的核心是多重估计数据关联,并将奇异值分解应用到机器人位姿计算中．利用Victoria Park数据集将本算法与基于扩展卡尔曼滤波器的方法进行比较,实验结果证明了本文提出的算法的有效性．     

基于深度强化学习的室内视觉局部路径规划

传统的机器人局部路径规划方法多为已有先验地图的情况设计,导致其在与视觉(simultaneous localization and mapping, SLAM)结合的导航中效果不佳。为此传统的机器人局部路径规划方法多为已有先验地图的情况设计,导致其在与视觉SLAM结合的导航中效果不佳。为此,本文提出一种基于深度强化学习的视觉局部路径规划策略。首先,基于视觉同时定位与建图(SLAM)技术建立周围环境的栅格地图,并使用A*算法规划全局路径;其次,综合考虑避障、机器人行走效率、位姿跟踪等问题,构建基于深度强化学习的局部路径规划策略,设计以前进、左转、右转为基本元素的离散动作空间,以及基于彩色图、深度图、特征点图等视觉观测的状态空间,利用近端策略优化(proximal policy optimization, PPO)算法学习和探索最佳状态动作映射网络。Habitat仿真平台运行结果表明,所提出的局部路径规划策略能够在实时创建的地图上规划出一条最优或次优路径。相比于传统的局部路径规划算法,平均成功率提高了53.9%,位姿跟踪丢失率减小了66.5%,碰撞率减小了30.1%。