基于激光传感器的移动机器人地图创建研究

主要研究了室内自主移动机器人基于激光传感器在未知环境下的地图创建的问题.分析了目前地图创建的方法,采用一种"聚合-分割-聚合"的方法提取线段用以表示环境信息,分为区域分割、线段提取和线段拟合三步骤.在区域分割和线段提取中提出动态阈值的方法,使得分割更为精确,能在较短的时间内获得一个精确的地图,最后采用最小二乘线段拟合方法获得线段参数.通过与当前全局地图比较,创建和更新全局地图.     

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

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

基于粒子滤波的移动机器人SLAM改进算法

针对未知环境中移动机器人同时定位和地图创建（Simultaneous Localization and Map Building,SLAM）由于机器人位姿和环境地图都不确定导致定位和地图创建变得更加复杂,提出一种局部最优（全局次优）参数法,即通过局部最优的位姿创建局部最优的环境地图,再通过局部最优的环境地图寻求局部最优的位姿,如此交替进行,直到得到全局确定性的位姿和确定性的环境地图。实验结果表明,同标准的基于粒子滤波的SLAM 算法（Particle Filtering-SLAM,PF-SLAM）比较,改进的算法提高了机器人SLAM过程中定位的准确度和地图创建的精确度,为机器人在未知的室外大环境同时定位和地图创建提供新的方法。     

越野环境下自主车辆导航地图自动创建方法研究*

针对越野环境下的地图创建问题,提出了一种自动创建自主车导航地图的方法。首先将车载摄像机获得的图像投影到车体坐标系,然后结合车辆行驶轨迹信息采用基于标记的分水岭算法判定可通行区域,最后融合局部俯视图信息生成全局一致地图,并在实时导航需求下对地图进行优化得到最终的导航地图。自主车实车实验结果表明,该方法生成的地图满足自主车实时导航需求,提高了路径规划效率。     

一种基于特征地图的移动机器人SLAM方案

设计了一种结构化环境中基于特征地图的地图创建方案;采用激光测距仪进行特征地图创建,利用"聚合-分害虫-聚合"的方法来提取线段表示环境信息实现局部地图创建;为了实现移动机器人的同时定位与地图创建,采用扩展卡尔曼滤波方法对机器人的位姿与地图信息进行预测及更新,结合状态估计和数据关联理论,实验显示x的校正量保持在±0.9cm之内;y的校正量保持在±2.5cm之内;θ的校正量在±1.2之内,实现了基于扩展卡尔曼滤波器的SLAM.     

基于Voronoi地图表示方法的同步定位与地图创建

针对基于混合米制地图机器人同步定位与地图创建 (Simultaneous localization and mapping, SLAM)中地图划分方法不完善的问题, 提出了基于Voronoi地图表示方法的同步定位与地图创建算法VorSLAM. 该算法在全局坐标系下创建特征地图, 并根据此特征地图使用Voronoi图唯一地划分地图空间, 在每一个划分内部创建一个相对于特征的局部稠密地图. 特征地图与各个局部地图最终一起连续稠密地描述了环境. Voronoi地图表示方法解决了地图划分的唯一性问题, 理论证明局部地图可以完整描述该划分所对应的环境轮廓. 该地图表示方法一个基本特点是特征与局部地图一一对应, 每个特征都关联一个定义在该特征上的局部地图. 基于该特点, 提出了一个基于形状匹配的数据关联算法, 用以解决传统数据关联算法出现的多重关联问题. 一个公寓弧形走廊的实验验证了VorSLAM算法和基于形状匹配的数据关联方法的有效性.     

基于分治法的同步定位与环境采样地图创建

在不使用几何参数描述大规模环境的前提下, 提出了基于分治法的同步定位与环境采样地图创建 (Simultaneous localization and sampled environment mapping, SLASEM)算法来同时进行定位与地图创建. 该算法采用环境采样地图(Sampled environment map, SEM)描述环境, 使算法不局限于用几何参数描述的规则环境. 同时该算法实时地创建局部地图, 并基于分治法合并局部地图, 保证了算法的实时性. 在合并两个子地图时, 算法首先从环境采样地图中提取出角点, 利用角点约束初步更新子地图; 然后利用符号正交距离函数作为虚拟测量函数, 再次细微地更新子地图; 最后将两个子地图合并到一个大地图, 约简冗余的环境采样粒子, 以提高地图的紧凑性. 两个实验的结果验证了所提算法的有效性和实时性.     

基于分布式感知的移动机器人同时定位与地图创建

为了创建大规模环境的精确栅格地图,提出一种基于分布式感知的两层同时定位与地图创建（SLAM）算法．在局部层,机器人一旦进入了一个新的摄像头视野,便依据机器人本体上的激光和里程计信息,采用Rao-Blackwellized粒子滤波方法创建一个新的局部栅格地图．与此同时,带有检测标志的机器人在摄像头视野内以曲线方式运动,以解决该摄像头的标定问题．在全局层,一系列的局部地图组成一个连接图,局部地图间的约束对应于连接图的边．为了生成一个准确且全局一致的环境地图,采用随机梯度下降法对连接图进行优化．实验结果验证了所提算法的有效性．     

基于声纳传感器的移动机器人地图创建方法研究*

提出了一种改进的基于声纳传感器信息进行栅格地图创建的方法。将Bayes法则用于移动机器人地图创建,对多个声纳传感器信息进行融合,解决信息间的冲突问题,并根据声纳模型将测量数据集成到局部地图中,改变栅格被障碍物占有的概率。经过坐标变换后,利用Bayes法则更新全局地图中的栅格信息,实现从局部地图到全局地图的更新。实验验证了该算法的可行性与有效性。     

基于多摄像头的AGV全局导航地图创建

为了创建AGV大范围全局导航地图,论文提出一种基于多摄像头的全局导航地图创建方法.首先,在AGV活动区域上方垂直安装多个摄像头采集大范围区域的局部图像;其次,通过相位相关法和改进的SURF特征匹配相结合的算法对四幅局部图像进行拼接;最后,采用基于粒子群的模糊C均值聚类算法对全局图像进行分割提取障碍物信息,并建立室内环境全局导航地图.实验表明该方法与现有算法相比具有更好的实时性,能够快速建立全局导航地图.     

基于激光传感器的移动机器人地图的创建

未知环境下地图的建立,是移动机器人导航技术的关键。研究了室内环境地图的创建方法,探讨了室内环境特征直线提取方法,详细论述了地图创建面临的问题与解决方法。采用SICK公司生产的LMS100激光传感器获取环境深度信息,通过室内环境直线特征提取和局部到全局匹配的方法,获得室内环境地图信息,解决了里程计给机器人带来不确定误差。最后在机器人平台上进行实验,得到了良好的效果。实验表明,该方法具有实现容易、精确高、复杂度低等特点。     

一种动态未知环境中自主机器人的导航方法

提出一种动态未知环境中机器人自主导航方法,利用少量的人类辅助避免了繁琐的地图描述．该方法分两个阶段：用户引导阶段和自主导航阶段．在用户引导阶段,利用多种传感器信息融合生成局部环境的粗略的极坐标地图,利用它可以得到全局地图,还给出了消除传感器数据误差的方法;在自主导航阶段,利用引导阶段得到的地图在动态环境中进行运动,并给出了运动控制的约束条件以及动态避障的方法．机器人利用该方法可以处理突发的障碍物,还能对路径进行优化,实验结果证明了其有效性．     

A global localization approach based on Line-segment Relation Matching technique

This paper presents a novel global localization approach for mobile robots by exploring line-segment features in any structured environment. The main contribution of this paper is an effective data association approach, the Line-segment Relation Matching (LRM) technique, which is based on a generation and exploration of an Interpretation Tree (IT). A new representation of geometric patterns of line-segments is proposed for the first time, which is called as Relation Table. It contains relative geometric positions of every line-segment respect to the others (or itself) in a coordinate-frame independent sense. Based on that, a Relation-Table-constraint is applied to minimize the searching space of IT therefore greatly reducing the processing time of LRM. The Least Square algorithm is further applied to estimate the robot pose using matched line-segment pairs. Then a global localization system can be realized based on our LRM technique integrated with a hypothesis tracking framework which is able to handle pose ambiguity. Sufficient simulations were specially designed and carried out indicating both pluses and minuses of our system compared with former methods. We also presented the practical experiments illustrating that our approach has a high robustness against uncertainties from sensor occlusions and extraneous observation in a highly dynamic environment. Additionally our system was demonstrated to easily deal with initialization and have the ability of quick recovery from a localization failure.     

分布式多维标度定位算法的研究

针对经典MDS-MAP定位算法在定位精度和算法复杂度方面的不足,提出一种分布式多维标度定位算法。改进后的算法加入了分簇的思想,将大规模网络分成多个具有簇首的局部网络。局部定位时,引入Hop-Euclidean算法,计算簇内节点间距离,再用局部网络融合算法将局部相对坐标图合并成全局相对坐标图。仿真分析表明,提出的算法在各向同性和各向异性网络中都有很好的定位精度,而且在定位精度提高的情况下可用于不规则网络,有利于网络的扩展,更适用于大规模密集型网络。     

Fuzzy integral-based gaze control architecture incorporated with modified-univector field-based navigation for humanoid robots

When a humanoid robot moves in a dynamic environment, a simple process of planning and following a path may not guarantee competent performance for dynamic obstacle avoidance because the robot acquires limited information from the environment using a local vision sensor. Thus, it is essential to update its local map as frequently as possible to obtain more information through gaze control while walking. This paper proposes a fuzzy integral-based gaze control architecture incorporated with the modified-univector field-based navigation for humanoid robots. To determine the gaze direction, four criteria based on local map confidence, waypoint, self-localization, and obstacles, are defined along with their corresponding partial evaluation functions. Using the partial evaluation values and the degree of consideration for criteria, fuzzy integral is applied to each candidate gaze direction for global evaluation. For the effective dynamic obstacle avoidance, partial evaluation functions about self-localization error and surrounding obstacles are also used for generating virtual dynamic obstacle for the modified-univector field method which generates the path and velocity of robot toward the next waypoint. The proposed architecture is verified through the comparison with the conventional weighted sum-based approach with the simulations using a developed simulator for HanSaRam-IX (HSR-IX).     

Real-time building of a thinning-based topological map

An accurate and compact map is essential to an autonomous mobile robot system. A topological map, one of the most popular map types, can be used to represent the environment in terms of discrete nodes with edges connecting them. It is usually constructed by Voronoi-like graphs, but in this paper the topological map is incrementally built based on the local grid map by using a thinning algorithm. This algorithm, when combined with the application of the C-obstacle, can easily extract only the meaningful topological information in real-time and is robust to environment change, because this map is extracted from a local grid map generated based on the Bayesian update formula. In this paper, position probability is defined to evaluate the quantitative reliability of the end node extracted by the thinning process. Since the thinning process builds only local topological maps, a global topological map should be constructed by merging local topological maps according to nodes with high position probability. For real and complex environments, experiments showed that the proposed map building method based on the thinning process can accurately build a local topological map in real-time, with which an accurate global topological map can be incrementally constructed.     

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.     

基于时间栅格法和免疫算法的机器人动态路径规划

提出了一种机器人动态路径规划方法。该方法首先采用时间栅格法采标识动态障碍物。建立机器人的环境信息,然后使用免疫算法实现在动态环境下机器人的全局和局部路径规划,达到避障和避碰的目的。文中定义了免疫算法的多因素适应度函数由碰撞系数、距离、转角和安全系数决定。实验表明所提方法可以提高路径规划的效率,满足机器人实时导航要求。     

A two level real-time path planning method inspired by cognitive map and predictive optimization in human brain

A biologically inspired two level method is proposed for real-time path planning in a complex and dynamic environment, employable in ground vehicles. This method takes the advantage of both global and local path finding procedures. In the first level, i.e., global level, the planner utilizes a neural network architecture as a sensory-motor map, similar to the cognitive map used by humans, and an optimization algorithm to produce a coarse path. In the second level, i.e., local level, the global path is improved by employing a model-based prediction method with a finite prediction horizon in a way that future information about the environment is involved in the planner's decision making. In the suggested method, the prediction horizon is variable and is adjusted in each step of the planning in agreement with the kinematic features of the closest obstacle in the visual field of the planner. We considered four different path planning tasks in a virtual dynamic environment to evaluate the performance of the proposed method against the human path planning strategy. The results demonstrate the ability of the method to plan a strategy comparable to the driving scenarios chosen by most subjects and to generate a real-time collision-free path in a dynamic environment with obstacles.