Robust Navigation and Mapping Architecture for Large Environments

This paper addresses the problem of Simultaneous Localization and Mapping (SLAM) for very large environments. A hybrid architecture is presented that makes use of the Extended Kalman Filter to perform SLAM in a very efficient form and a Monte Carlo localizer to resolve data association problems potentially present when returning to a known location after a large exploration period. Algorithms to improve the convergence of the Monte Carlo filter are presented that consider vehicle and sensor uncertainty. The proposed algorithm incorporates significant integrity to the standard SLAM algorithms by providing the ability to handle multimodal distributions over robot pose in real time during the re‐localization process. Experimental results in outdoor environments are presented to demonstrate the performance of the algorithm proposed. © 2003 Wiley Periodicals, Inc.     

Active Visual Perception for Mobile Robot Localization

Localization is a key issue for a mobile robot, in particular in environments where a globally accurate positioning system, such as GPS, is not available. In these environments, accurate and efficient robot localization is not a trivial task, as an increase in accuracy usually leads to an impoverishment in efficiency and viceversa. Active perception appears as an appealing way to improve the localization process by increasing the richness of the information acquired from the environment. In this paper, we present an active perception strategy for a mobile robot provided with a visual sensor mounted on a pan-tilt mechanism. The visual sensor has a limited field of view, so the goal of the active perception strategy is to use the pan-tilt unit to direct the sensor to informative parts of the environment. To achieve this goal, we use a topological map of the environment and a Bayesian non-parametric estimation of robot position based on a particle filter. We slightly modify the regular implementation of this filter by including an additional step that selects the best perceptual action using Monte Carlo estimations. We understand the best perceptual action as the one that produces the greatest reduction in uncertainty about the robot position. We also consider in our optimization function a cost term that favors efficient perceptual actions. Previous works have proposed active perception strategies for robot localization, but mainly in the context of range sensors, grid representations of the environment, and parametric techniques, such as the extended Kalman filter. Accordingly, the main contributions of this work are: i) Development of a sound strategy for active selection of perceptual actions in the context of a visual sensor and a topological map; ii) Real time operation using a modified version of the particle filter and Monte Carlo based estimations; iii) Implementation and testing of these ideas using simulations and a real case scenario. Our results indicate that, in terms of accuracy of robot localization, the proposed approach decreases mean average error and standard deviation with respect to a passive perception scheme. Furthermore, in terms of efficiency, the active scheme is able to operate in real time without adding a relevant overhead to the regular robot operation.     

Differential evolution solution to the SLAM problem

A new solution to the Simultaneous Localization and Modelling problem is presented in this paper. The algorithm is based on the stochastic search for solutions in the state space to the global localization problem by means of a differential evolution algorithm. This non linear evolutive filter, called Evolutive Localization Filter (ELF), searches stochastically along the state space for the best robot pose estimate. The set of pose solutions (the population) focuses on the most likely areas according to the perception and up to date motion information. The population evolves using the log-likelihood of each candidate pose according to the observation and the motion errors derived from the comparison between observed and predicted data obtained from the probabilistic perception and motion model.The proposed SLAM algorithm operates in two steps: in the first step the ELF filter is used at local level to re-localize the robot based on the robot odometry, the laser scan at a given position and a local map where only a low number of the last scans have been integrated. In the second step, the aligned laser measures and the corrected robot poses are used to detect whether the robot is revisiting a previously crossed area (i.e., a cycle in the robot trajectory exists). Once a cycle is detected, the Evolutive Localization Filter is used again to estimate the accumulated residual drift in the detected loop and then to re-estimate the robot poses in order to integrate the sensor measures in the global map of the environment.The algorithm has been tested in different environments to demonstrate the effectiveness, robustness and computational efficiency of the proposed approach.     

Multirobot Localization in Highly Symmetrical Environments

The paper addresses and solves the problem of multirobot collaborative localization in highly symmetrical 2D environments, such as the ones encountered in logistic applications. Because of the environment symmetry, the most common localization algorithms may fail to provide a correct estimate of the position and orientation of the robot, if its initial position is not known, no specific landmark is introduced, and no absolute information (e.g., GPS) is available: the robot can estimate its position with respect to the walls of the corridor, but it could be critical to determine in which corridor it is actually moving. The proposed algorithm is based upon a particle filter cooperative Monte Carlo Localization (MCL) and implements a three-stage procedure for the global localization and the accurate position tracking of each robot of the team. Online simulations and experimental tests, which investigate different situations with respect to the number of robots involved and their initial positions, show how the proposed solution can lead to the global localization of each robot, with a precision sufficient to be used as starting point for the subsequent robot tracking.     

自主移动机器人的室内结构化环境地图创建

定位与地图创建是自主移动机器人领域研究的重要课题.本文阐述了一种以扩展卡尔曼滤波算法为主要框架,运用直接位姿控制模型描述机器人运动的算法,实现了机器人在室内结构化环境中的同时定位和地图创建.仿真与实验结果表明,里程计信息无法满足定位和创建环境地图的要求,本文算法则能够实现机器人的精确定位.并生成满足一致性要求的地图.     

基于Bayes滤波的移动机器人定位方法

对基于贝叶斯滤波原理的机器人定位方法提出了一个通用框架,进行了贝叶斯滤波方法的推导,理顺了贝叶斯总体框架以及卡尔曼滤波定位、多假设定位、马尔可夫定位、蒙特卡罗定位方法之间的内在逻辑关系。回顾了基于概率推理框架的各种机器人定位方法的发展过程、目前发展水平,并针对各自的利弊进行了比较。基于采样的蒙特卡罗定位算法能够描述多峰分布,可近似大范围的概率分布,能够有效解决定位过程中出现的歧义情况以及绑架情况等,因此重点对蒙特卡罗定位算法的实现过程以及存在的问题进行了详细的阐述,同时对研究难点和未来的发展趋势做了展望。     

新的室内移动机器人自定位方法

针对现有室内移动机器人自定位方法中存在的定位精度不高,随时间积累定位误差增大,复杂室内环境下信号存在多径效应和非视距效应等问题,提出了一种基于蒙特卡罗定位(MCL)的新的移动机器人自定位方法。首先,通过分析基于无线射频识别(RFID)技术的移动机器人自定位系统,建立机器人运动模型;然后,通过分析基于接收信号强度指示(RSSI)的移动机器人自定位系统,提出机器人移动过程的观测模型;最后,针对粒子滤波定位执行效率不高的问题,提出粒子剔除策略和依据粒子方位赋予粒子权值策略,提高系统的定位精度和执行效率。仿真实验表明,机器人在移动过程中的自定位误差在X轴和Y轴方向上为3 cm,传统定位算法误差为6cm,新算法定位精度提高近1倍,且算法具有很好的鲁棒性。     

移动机器人的改进无迹粒子滤波蒙特卡罗定位算法

粒子滤波是移动机器人蒙特卡罗定位(Monte Carlo localization, MCL)的核心环节. 首先, 针对粒子滤波过程的粒子退化问题, 利用迭代Sigma点卡尔曼滤波来精确设计粒子滤波器的提议分布, 以迭代更新方式将当前观测信息融入顺序重要性采样过程, 提出IUPF (Improved unscented particle filter)算法. 然后, 将IUPF与移动机器人MCL相结合, 给出IUPF-MCL定位算法的实现细节. 仿真结果表明, IUPF-MCL是一种精确鲁棒的移动机器人定位算法.     

Guaranteed interval analysis localization for mobile robots

This paper presents a set membership method (named Interval Analysis Localization (IAL)) to deal with the global localization problem of mobile robots. By using a LIDAR (LIght Detection And Ranging) range sensor, the odometry and a discrete map of an indoor environment, a robot has to determine its pose (position and orientation) in the map without any knowledge of its initial pose. In a bounded error context, the IAL algorithm searches a set of boxes (interval vector), with a cardinality as small as possible that includes the robot’s pose. The localization process is based on constraint propagation and interval analysis tools, such as bisection and relaxed intersection. The proposed method is validated using real data recorded during the CAROTTE challenge, organized by the French ANR (National Research Agency) and the French DGA (General Delegation of Armament). IAL is then compared with the well-known Monte Carlo Localization showing weaknesses and strengths of both algorithms. As it is shown in this paper with the IAL algorithm, interval analysis can be an efficient tool to solve the global localization problem.     

Mobile robot localization based on PSO estimator

Localization is fundamental to autonomous operation of the mobile robot. A particle filter (PF) is widely used in mobile robot localization. However, the robot localization based PF has several limitations, such as sample impoverishment and a degeneracy problem, which reduce significantly its performance. Evolutionary algorithms, and more specifically their optimization capabilities, can be used in order to overcome PF based on localization weaknesses. In this paper, mobile robot localization based on a particle swarm optimization (PSO) estimator is proposed. In the proposed method, the robot localization converts dynamic optimization to find the best robot pose estimate, recursively. Unlike the localization based on PF, the resampling step is not required in the proposed method. Moreover, it does not require noise distribution. It searches stochastically along the state space for the best robot pose estimate. The results show that the proposed method is effective in terms of accuracy, consistency, and computational cost compared with localization based on PF and EKF.     

Correlation-Based Scan Matching Using Ultrasonic Sensors for EKF Localization

This paper presents a localization method for a mobile robot equipped with only low-cost ultrasonic sensors. Correlation-based Hough scan matching was used to obtain the robot’s pose without any predefined geometric features. A local grid map and a sound pressure model of ultrasonic sensors were used to acquire reliable scan results from uncertain and noisy ultrasonic sensor data. The robot’s pose was measured using correlation-based Hough scan matching, and the covariance was calculated. Localization was achieved by fusing the measurements from scan matching with the robot’s motion model through the extended Kalman filter. Experimental results verified the performance of the proposed localization method in a real home environment.     

分布式视觉机器人导航中的定位算法研究

生物启发的无线复眼导航技术是新型的机器人导航方案,将分布在环境中的分布式智能代替了传统的集中式智能。蒙特卡洛定位是近来流行的机器人自主定位算法,将这种算法应用在分布式视觉传感器机器人的定位中,并针对多视觉传感器观测值的最优选择,提出了一种分布式的基于熵的观测量选择方法,目的是选择那些对提高定位精度更有效的观测信息,在保证定位精度的前提下,提高了定位的实时性和可靠性。仿真实验结果证明了这种算法的可行性。     

分布式视觉机器人导航中的定位算法研究

生物启发的无线复眼导航技术是新型的机器人导航方案,将分布在环境中的分布式智能代替了传统的集中式智能。蒙特卡洛定位是近来流行的机器人自主定位算法,将这种算法应用在分布式视觉传感器机器人的定位中,并针对多视觉传感器观测值的最优选择,提出了一种分布式的基于熵的观测量选择方法,目的是选择那些对提高定位精度更有效的观测信息,在保证定位精度的前提下,提高了定位的卖时性和可靠性。仿真实验结果证明了这种算法的可行性。     

一种低计算量移动机器人自定位方法

移动机器人定位问题就是通过传感器数据来确定自己的位姿。本文介绍了几种基于概率的自定位算法。针对蒙特卡罗定位算法需要精确概率模型以及计算量大的问题,本文提出了一种均匀蒙特卡罗算法。该算法假设运动模型和感知模型都是均匀分布的,采样点在运动过程中不变,而且不需要精确的概率模型,计算量小,稳定性高。试验表朗,该算法能在室内环境下很好的对机器人定位。     

无线传感器网络环境下基于粒子滤波的移动机器人SLAM算法

定位问题是移动机器人研究领域中最基本的问题,在Bayes的框架下研究了机器人与无线传感器网络(WSN)组成系统中的同时建图与定位问题(SLAM).针对该系统中只存在距离测量信息可用的情况提出了一种基于粒子滤波的SLAM算法.该方法将机器人状态和节点位置估计设置为一组全局估计粒子,通过对粒子及其权重的更新来计算整个系统的状态.算法将WSN节点的位置估计在机器人的路径上分解为相互独立的估计,从而将全局粒子的计算转化为使用一个机器人状态滤波器和对应于每个机器人粒子的节点位置滤波器进行计算.针对观测信息低维的特点,设计了处理低维观测信息的方法,使得观测信息可以在滤波阶段得到合理利用.并且详细介绍了提出的SLAM算法原理和计算过程,并通过仿真实验证明了算法的有效性和实用性.     

Efficient autonomous global localization for service robots using dual laser scanners and rotational motion

This study presents an alternative global localization scheme that uses dual laser scanners and the pure rotational motion of a mobile robot. The proposed method extracts the initial state of the robot’s surroundings to select robot pose candidates, and determines the sample distribution based on the given area map. Localization success is determined by calculating the similarity of the robot’s sensor state compared to that which would be expected at the estimated pose on the given map. In both simulations and experiments, the proposed method shows sufficient efficiency and speed to be considered robust to real-world conditions and applications.

     

Cooperative localization for disconnected sensor networks and a mobile robot in friendly environments

Localization for a disconnected sensor network is highly unlikely to be achieved by its own sensor nodes, since accessibility of the information between any pair of sensor nodes cannot be guaranteed. In this paper, a mobile robot (or a mobile sensor node) is introduced to establish correlations among sparsely distributed sensor nodes which are disconnected, even isolated. The robot and the sensor network operate in a friendly manner, in which they can cooperate to perceive each other for achieving more accurate localization, rather than trying to avoid being detected by each other. The mobility of the robot allows for the stationary and internally disconnected sensor nodes to be dynamically connected and correlated. On one hand, the robot performs simultaneous localization and mapping (SLAM) based on the constrained local submap filter (CLSF). The robot creates a local submap composed of the sensor nodes present in its immediate vicinity. The locations of these nodes and the pose (position and orientation angle) of the robot are estimated within the local submap. On the other hand, the sensor nodes in the submap estimate the pose of the robot. A parallax-based robot pose estimation and tracking (PROPET) algorithm, which uses the relationship between two successive measurements of the robot's range and bearing, is proposed to continuously track the robot's pose with each sensor node. Then, tracking results of the robot's pose from different sensor nodes are fused by the Kalman filter (KF). The multi-node fusion result are further integrated with the robot's SLAM result within the local submap to achieve more accurate localization for the robot and the sensor nodes. Finally, the submap is projected and fused into the global map by the CLSF to generate localization results represented in the global frame of reference. Simulation and experimental results are presented to show the performances of the proposed method for robot-sensor network cooperative localization. Especially, if the robot (or the mobile sensor node) has the same sensing ability as the stationary sensor nodes, the localization accuracy can be significantly enhanced using the proposed method.     

基于单目视觉的机器人Monte Carlo自定位方法

针对单目视觉机器人定位问题,提出一种基于改进的尺度不变特征变换(SIFT)的Monte Carlo自定位方法.应用改进的SIFT方法提取特征,既能保证对图像光强变化、尺度缩放、三维视角和噪声具有不变性,又能减少SIFT算法产生的特征点及其抽取和匹配的时间.在机器人移动过程中,环境特征点的观测信息和里程计信息通过粒子滤波相融合,获得了更准确的环境标志点坐标.仿真实验结果验证了该方法的有效性.     

Simultaneous Localization and Mapping Using Rao-Blackwellized Particle Filters in Multi Robot Systems

In this paper we investigate the problem of Simultaneous Localization and Mapping (SLAM) for a multi robot system. Relaxing some assumptions that characterize related work we propose an application of Rao-Blackwellized Particle Filters (RBPF) for the purpose of cooperatively estimating SLAM posterior. We consider a realistic setup in which the robots start from unknown initial poses (relative locations are unknown too), and travel in the environment in order to build a shared representation of the latter. The robots are required to exchange a small amount of information only when a rendezvous event occurs and to measure relative poses during the meeting. As a consequence the approach also applies when using an unreliable wireless channel or short range communication technologies (bluetooth, RFId, etc.). Moreover it allows to take into account the uncertainty in relative pose measurements. The proposed technique, which constitutes a distributed solution to the multi robot SLAM problem, is further validated through simulations and experimental tests.