可移动机器人在中心对称环境中的自定位算法

可移动机器人的自定位问题是智能机器人研究中的重要课题，它包含许多传感器技术和定位算法，马尔可夫定位算法的优点是可以使机器人在全局不确定的情况下估计它的位置。这种方法采用概率分布描述机器人的位置信度，机器人通过在运动过程中所获得的传感器数据和运动记录来更新信度分布，然后采用最高信度值来估计它所在的位置。对于只有距离测量传感器的机器人在中心对称环境中仅仅采用马尔可夫自定位法还是无法确定其位置，为了解决中心对称的环境中所存在的问题，建议在机器人上装上陀螺仪或指南针，定义一个角度高斯分布函数，并利用这个函数建立新的机器人感知模型来扩展马尔可夫定位算法，通过仿真程序对多种对称情况进行实验，验证了这一新算法的可行性，这个扩展马尔可夫自定位算法不仅可使机器人在中心对称环境中很快地确定自己的位置，而且可以加快非对称环境中信度分布收敛到真实位置的速度。     

基于红外传感器的移动微机器人定位研究

综合概率论的思想,采用基于红外传感器的微机器人粒子滤波定位方法在已知环境中实现微机器人的自定位.因微机器人受尺寸效应影响无法安装位置传感器,故采用计步的方法存储机器人的运动信息.观测模型采用适合小尺寸微型机器人的红外测距地图匹配方式.因微机器人的存储能力有限,故采用分块存储地图的方法,便于微机器人快速加载地图而完成地图匹配,从而加速其定位过程.实验验证了微机器人的定位性能.     

多传感器信息融合在移动机器人定位中的应用

机器人自定位是实现自主导航的关键问题之一。为了满足机器人在导航时精确定位的要求,提出一种基于多传感器信息融合的自定位算法。根据对机器人运动机构的分析和运动机构间的刚体约束,建立起机器人的运动学模型;由传感器的工作原理建立里程计和超声波传感器的观测模型;利用扩展卡尔曼滤波(EKF)算法将里程计和超声波传感器采集的数据进行融合;最后,由匹配的环境特征对机器人的位置进行修正,得到精确的位置估计。实验结果表明:该算法明显地消除了里程计的累计误差,有效地提高了定位精度。     

分布式感知协作的扩展Monte Carlo定位算法

针对移动机器人难以单纯依赖自身传感器定位的问题,提出了一种分布式感知协作的扩展Monte Carlo定位方法.在定位过程中,机器人根据感知更新前后采样分布信息熵、有效采样数目及采样分布均匀性的变化,适时地从环境传感器的检测模型进行重采样,从而有效减少其位姿估计的不确定性.在算法的具体实现过程中,采用彩色摄像头作为环境传感器,摄像头的参数由机器人进行在线标定;然后依据标定的参数获得摄像头的检测模型.实验验证了该算法在解决全局定位和机器人绑架问题时的有效性.     

激光测距在移动机器人自主导航中的应用

移动机器人在运动范围内需要有足够的传感器信息可供利用来进行自主导航,在完全未知的环境中,由机器人依靠其自身携带的传感器所提供的信息建立环境模型是机器人进行自主定位和导航的前提之一。介绍了激光测距在移动机器人自主导航中的应用研究;通过二维测距传感器对其周围环境进行扫描,提出了自主导航中地图创建、定位如何用二维扫描获得三维数据流的算法描述,并实验验证该算法的运用使机器人获得一个很好的三维视觉结构图。     

基于激光雷达机器人的目标人跟踪方法研究

针对机器人的目标人跟踪问题,提出一种利用目标人腿部信息自适应跟踪的方法。该方法利用激光雷达作为环境感知传感器,实时获取环境的二维激光扫描数据;然后采用设计的激光相邻点聚类算法对激光扫描数据进行分割和聚类;再利用人腿圆弧状特征设计的类圆弧人腿形状识别算法从分割的数据中识别腿部数据,获得目标人腿部相对于机器人的位置信息;最后利用Kalman滤波算法对目标人的位置和速度进行跟踪,使机器人能够平稳地跟踪目标人运动。该算法在iRobot机器人平台上进行实验,实验结果验证了算法的有效性。     

基于蒙特卡罗算法煤矿井下人员定位研究

对比分析几种常用的无线传感器网络节点定位方法.针对煤矿井下节点移动性可能导致普通的定位算法变得不精确,提出了蒙特卡罗定位(Monte Carlo Localization)算法.该方法利用物体运动的连续性,通过选取合适的模型完成移动节点位置预测与定位.经仿真验证在低密度锚节点环境下,蒙特卡罗方法位置估计误差明显低于其它方法,提高了移动节点定位算法的准确性.     

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

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

基于多传感器信息融合的移动机器人快速精确自定位

通过分析全向视觉、电子罗盘和里程计等传感器的感知模型,设计并实现了一种给定环境模型下移动机器人全局自定位算法.该算法利用蒙特卡罗粒子滤波,融合多个传感器在不同观测点获取的观测数据完成机器人自定位.与传统的、采用单一传感器自定位的方法相比,它把多个同质或异质传感器所提供的不完整测量及相关联数据库中的信息加以综合,降低单个...     

SLAM 问题中机器人定位误差分析与控制

移动机器人同步定位与建图问题 (Simultaneous localization and mapping, SLAM) 是机器人能否在未知环境中实现完全自主的关键问题之一. 其中, 机器人定位估计对于保持地图的一致性非常重要. 本文分析了 SLAM 问题中机器人定位误差的收敛特性. 分析表明随着机器人的运动,机器人定位误差总体上逐渐增大; 在完全未知环境中无法预测机器人定位误差的上限. 根据理论分析, 本文提出了一种控制机器人定位误差在单位距离上增长速度的算法. 该算法通过搜索获得满足定位误差限制的最佳的机器人运动速度, 从而控制机器人定位误差的增长.     

Active Markov localization for mobile robots

Localization is the problem of determining the position of a mobile robot from sensor data. Most existing localization approaches are passive, i.e., they do not exploit the opportunity to control the robot's effectors during localization. This paper proposes an active localization approach. The approach is based on Markov localization and provides rational criteria for (1) setting the robot's motion direction (exploration), and (2) determining the pointing direction of the sensors so as to most efficiently localize the robot. Furthermore, it is able to deal with noisy sensors and approximative world models. The appropriateness of our approach is demonstrated empirically using a mobile robot in a structured office environment.     

A Probabilistic Approach to Collaborative Multi-Robot Localization

This paper presents a statistical algorithm for collaborative mobile robot localization. Our approach uses a sample-based version of Markov localization, capable of localizing mobile robots in an any-time fashion. When teams of robots localize themselves in the same environment, probabilistic methods are employed to synchronize each robot's belief whenever one robot detects another. As a result, the robots localize themselves faster, maintain higher accuracy, and high-cost sensors are amortized across multiple robot platforms. The technique has been implemented and tested using two mobile robots equipped with cameras and laser range-finders for detecting other robots. The results, obtained with the real robots and in series of simulation runs, illustrate drastic improvements in localization speed and accuracy when compared to conventional single-robot localization. A further experiment demonstrates that under certain conditions, successful localization is only possible if teams of heterogeneous robots collaborate during localization.     

Localization With Limited Sensing

Localization is a fundamental problem for many kinds of mobile robots. Sensor systems of varying ability have been proposed and successfully used to solve the problem. This paper probes the lower limits of this range by describing three extremely simple robot models and addresses the active localization problem for each. The robot, whose configuration is composed of its position and orientation, moves in a fully-known, simply connected polygonal environment. We pose the localization task as a planning problem in the robot's information space, which encapsulates the uncertainty in the robot's configuration. We consider robots equipped with: 1) angular and linear odometers; 2) a compass and contact sensor and; 3) an angular odometer and contact sensor. We present localization algorithms for models 1 and 2 and show that no algorithm exists for model 3. An implementation with simulation examples is presented.     

不完整地图中移动机器人蒙特卡罗定位研究*

针对移动机器人在不完整地图中定位的问题,提出了一种改进的粒子聚类蒙特卡罗定位(Monte Carlo localization, MCL)算法。在定位过程中,将机器人的位姿分为六种状态,每一种状态对应一个粒子簇。在机器人运动的过程中,这六种状态之间可以相互转移,在计算状态转移概率的基础上,实现了不完整地图中移动机器人蒙特卡罗定位算法。实验验证了该算法在解决移动机器人在不完整地图中定位问题的有效性。     

Selecting Landmarks for Localization in Natural Terrain

We describe techniques to optimally select landmarks for performing mobile robot localization by matching terrain maps. The method is based upon a maximum-likelihood robot localization algorithm that efficiently searches the space of possible robot positions. We use a sensor error model to estimate a probability distribution over the terrain expected to be seen from the current robot position. The estimated distribution is compared to a previously generated map of the terrain and the optimal landmark is selected by minimizing the predicted uncertainty in the localization. This approach has been applied to the generation of a sensor uncertainty field that can be used to plan a robot's movements. Experiments indicate that landmark selection improves not only the localization uncertainty, but also the likelihood of success. Examples of landmark selection are given using real and synthetic data.     

Mobile Robot Self-Localization without Explicit Landmarks

Localization is the process of determining the robot's location within its environment. More precisely, it is a procedure which takes as input a geometric map, a current estimate of the robot's pose, and sensor readings, and produces as output an improved estimate of the robot's current pose (position and orientation). We describe a combinatorially precise algorithm which performs mobile robot localization using a geometric model of the world and a point-and-shoot ranging device. We also describe a rasterized version of this algorithm which we have implemented on a real mobile robot equipped with a laser rangefinder we designed. Both versions of the algorithm allow for uncertainty in the data returned by the range sensor. We also present experimental results for the rasterized algorithm, obtained using our mobile robots at Cornell. Received November 15, 1996; revised January 13, 1998.     

Sonar mapping of a mobile robot considering position uncertainty

This paper suggests a new sonar mapping method considering the position uncertainty of a mobile robot. Sonar mapping is used for recognizing the unknown environment for a mobile robot during navigation. Usually accumulated position error of a mobile robot causes considerable deterioration of the quality of a constructed map. In this paper, therefore, a new Bayesian probability map construction method is proposed, which considers estimation of the position error of a mobile robot. In this method, we applied approximation transformation theory to estimate the position uncertainty of a real mobile robot, and introduced cell ordering uncertainty caused by the position uncertainty of a robot in cell-based map updating. Through simulation we showed the effect of a robot's position uncertainty on the quality of a reconstructed map. Also, the developed methods were implemented on a real mobile robot, AMROYS-II, which was built in our laboratory and shown to be useful enough in a real environment.     

输电线路除冰机器人行为控制研究

介绍了输电线路除冰机器人的研究现状.针对其工作环境恶劣、不确定因素多的特点,提出了基于马尔可夫决策的行为控制器的设计方法.该方法首先定义了输电线除冰机器人的马尔可夫模型,然后给出了相应的最优方针搜索策略,还给控制器添加了概率调节机制,以达到执行效果反馈的目的.为解决机器人作业中的突发情况,在该方法中还引入了人工辅助和行...