Sensor planning for mobile robot localization using Bayesian network inference

We propose a new method of sensor planning for mobile robot localization using Bayesian network inference. Since we can model causal relations between situations of the robot's behavior and sensing events as nodes of a Bayesian network, we can use the inference of the network for dealing with uncertainty in sensor planning and thus derive appropriate sensing actions. In this system we employ a multi-layered-behavior architecture for navigation and localization. This architecture effectively combines mapping of local sensor information and the inference via a Bayesian network for sensor planning. The mobile robot recognizes the local sensor patterns for localization and navigation using a learned regression function. Since the environment may change during the navigation and the sensor capability has limitations in the real world, the mobile robot actively gathers sensor information to construct and reconstruct a Bayesian network, and then derives an appropriate sensing action which maximizes a utility function based on inference of the reconstructed network. The utility function takes into account belief of the localization and the sensing cost. We have conducted some simulation and real robot experiments to validate the sensor planning system.     

可应用于气体泄漏源搜寻的融合算法

多源信息融合算法主要应用于移动机器人对有害气体泄漏源的搜寻。为提高搜寻效率,用视觉传感器和嗅觉传感器共同获取环境信息,其中 嗅觉传感器 采用多气体传感器代替单气体传感器以提高测量的可靠性,测量位置也由单点向多点转变,并选用合适的算法分别实现各级数据的融合,最终决策移动机器人的搜寻方向。数据表明, 加权平均法用于融合同类气体传感器的数据,可减小噪声和仪器故障的影响;最小二乘法可最优估计未知参数,用于反求泄漏源信息,可初步估计泄漏源的位置和流量;概率赋值方式可容纳多种信息途径共同判断泄漏源,从而更合理地确定搜寻目标。     

基于语义建图的室内机器人实时场景分类

针对室内环境下的机器人场景识别问题,重点研究了场景分类策略的自主性、实时性和准确性,提出了一种语义建图方法.映射深度信息构建二维栅格地图,自主规划场景识别路径;基于卷积网络建立场景分类模型,实时识别脱离特定训练;利用贝叶斯框架融合先验知识,修正了错误分类并完成语义建图.实验结果表明:机器人能够进行全局自主探索,实时判断场景类别,并创建满足要求的语义地图.同时,实际路径规划中,机器人可以根据语义信息改善导航行为,验证了方法的可行性.     

Simultaneous localization of multiple unknown CSMA-based wireless sensor network nodes using a mobile robot with a directional antenna

We use a single mobile robot equipped with a directional antenna to simultaneously localize unknown carrier sensing multiple access (CSMA)-based wireless sensor network nodes. We assume the robot can only sense radio transmissions at the physical layer. The robot does not know network configuration such as size and protocol. We formulate this new localization problem and propose a particle filter-based localization approach. We combine a CSMA model and a directional antenna model using multiple particle filters. The CSMA model provides network configuration data while the directional antenna model provides inputs for particle filters to update. Based on the particle distribution, we propose a robot motion planning algorithm that assists the robot to efficiently traverse the field to search radio source. The final localization scheme consists of two algorithms: a sensing algorithms that runs in O(n) time for n particles and a motion planning algorithm that runs in O(nl) time for l radio sources. We have implemented the algorithm, and the results show that the algorithms are capable of localizing unknown networked radio sources effectively and robustly.     

Autonomous Exploration with Exact Inverse Sensor Models

This paper is focused on probabilistic occupancy grid mapping and motion planning such that a robot may build a map and explore a target area autonomously in real time. The desired path of the robot is developed in an optimal fashion to maximize the information gain from the sensor measurements on its path, thereby increasing the accuracy and efficiency of mapping, while explicitly considering the sensor limitations such as the maximum sensing range and viewing angle. Most current exploration techniques require frequent human intervention, often developed for omnidirectional sensors with infinite range. The proposed research is based on realistic assumptions on sensor capabilities. The unique contribution is that the mapping and autonomous exploration techniques are systematically developed in a rigorous, probabilistic formulation. The mapping approach exploits the probabilistic properties of the sensor and map explicitly, and the autonomous exploration is designed to maximize the expected map information gain, thereby improving the efficiency of the mapping procedure and the quality of the map substantially. The efficacy of the proposed optimal approach is illustrated by both numerical simulations and experimental results.     

Bayesian modeling of uncertainty in low-level vision

The need for error modeling, multisensor fusion, and robust algorithms is becoming increasingly recognized in computer vision. Bayesian modeling is a powerful, practical, and general framework for meeting these requirements. This article develops a Bayesian model for describing and manipulating the dense fields, such as depth maps, associated with low-level computer vision. Our model consists of three components: a prior model, a sensor model, and a posterior model. The prior model captures a priori information about the structure of the field. We construct this model using the smoothness constraints from regularization to define a Markov Random Field. The sensor model describes the behavior and noise characteristics of our measurement system. We develop a number of sensor models for both sparse and dense measurements. The posterior model combines the information from the prior and sensor models using Bayes' rule. We show how to compute optimal estimates from the posterior model and also how to compute the uncertainty (variance) in these estimates. To demonstrate the utility of our Bayesian framework, we present three examples of its application to real vision problems. The first application is the on-line extraction of depth from motion. Using a two-dimensional generalization of the Kalman filter, we develop an incremental algorithm that provides a dense on-line estimate of depth whose accuracy improves over time. In the second application, we use a Bayesian model to determine observer motion from sparse depth (range) measurements. In the third application, we use the Bayesian interpretation of regularization to choose the optimal smoothing parameter for interpolation. The uncertainty modeling techniques that we develop, and the utility of these techniques in various applications, support our claim that Bayesian modeling is a powerful and practical framework for low-level vision.     

基于ROS与Kinect的移动机器人同时定位与地图构建

同时定位与地图构建(SLAM)技术一直以来都是移动机器人实现自主导航和避障的核心问题,移动机器人需要借助传感器来探测周围的物体同时构建出相应区域的地图。由于传统的1D和2D传感器,如超声波传感器、声呐和激光测距仪等在建图过程中无法检测出Z轴(垂直方向)上的信息,易增加机器人发生碰撞的概率,同时影响建图结果的精确度。本文利用Kinect作为机器人SLAM的传感器,将其采集到的三维信息转化成二维的激光数据进行地图构建,同时借助机器人操作系统(robot operating system,ROS)进行仿真分析和实际测试。结果表明Kinect可以弥补1D和2D传感器采集信息的不足,同时能够较好的保持建图的完整性和可靠性,适用于室内的移动机器人SLAM实现。     

Robot navigation in an unexplored terrain

Navigation planning is one of the most vital aspects of an autonomous mobile robot. Robot navigation for completely known terrain has been solved in many cases. Comparatively less research dealing with robot navigation in unexplored obstacle terrain has been reported in the literature. In recent times this problem has been addressed by adding learning capability to a robot. The robot explores terrain using sensors as it navigates, and builds a terrain model in an incremental manner. In this article we present concurrent algorithms for robot navigation in unexplored terrain. The performance of the concurrent algorithms is analyzed in terms of planning time, travel time, scanning time, and update time. The analysis reveals the need for an efficient data structure to store an obstacle terrain model in order to reduce traversal time, and also to incorporate learning. A modified adjacency list is proposed as a data structure for storing a spatial graph that represents an obstacle terrain. The time complexities of the algorithms that access, maintain, and update the spatial graph are estimated, and the effectiveness of the implementation is illustrated.     

基于激光测距的环境地图动态创建技术研究

本文主要研究完全未知结构化环境下的移动机器人二维地图构建与标图技术。本文以激光测距仪为环境探测传感器,采用几何特征法创建地图。对局部地图创建中的区域分割方法进行了改进,提出了基于线性阈值法的区域分割方法;给出了基于相关线段和线段缓冲区的全局地图创建方法。实验结果表明：本方法实现了基于实时的激光测距数据的局部地图动态创建和全局地图的实时更新,算法有效且可行。     

A multilevel relaxation algorithm for simultaneous localization and mapping

This paper addresses the problem of simultaneous localization and mapping (SLAM) by a mobile robot. An incremental SLAM algorithm is introduced that is derived from multigrid methods used for solving partial differential equations. The approach improves on the performance of previous relaxation methods for robot mapping, because it optimizes the map at multiple levels of resolution. The resulting algorithm has an update time that is linear in the number of estimated features for typical indoor environments, even when closing very large loops, and offers advantages in handling nonlinearities compared with other SLAM algorithms. Experimental comparisons with alternative algorithms using two well-known data sets and mapping results on a real robot are also presented.     

Active object tracking using context estimation: handling occlusions and detecting missing targets

When performing visual servoing or object tracking tasks, active sensor planning is essential to keep targets in sight or to relocate them when missing. In particular, when dealing with a known target missing from the sensor’s field of view, we propose using prior knowledge related to contextual information to estimate its possible location. To this end, this study proposes a Dynamic Bayesian Network that uses contextual information to effectively search for targets. Monte Carlo particle filtering is employed to approximate the posterior probability of the target’s state, from which uncertainty is defined. We define the robot’s utility function via information theoretic formalism as seeking the optimal action which reduces uncertainty of a task, prompting robot agents to investigate the location where the target most likely might exist. Using a context state model, we design the agent’s high-level decision framework using a Partially-Observable Markov Decision Process. Based on the estimated belief state of the context via sequential observations, the robot’s navigation actions are determined to conduct exploratory and detection tasks. By using this multi-modal context model, our agent can effectively handle basic dynamic events, such as obstruction of targets or their absence from the field of view. We implement and demonstrate these capabilities on a mobile robot in real-time.

     

Cooperative multi-robot systems:: A study of vision-based 3-D mapping using information theory

Building cooperatively 3-D maps of unknown environments is one of the application fields of multi-robot systems. This article addresses that problem through a probabilistic approach based on information theory. A distributed cooperative architecture model is formulated whereby robots exhibit cooperation through efficient information sharing. A probabilistic model of a 3-D map and a statistical sensor model are used to update the map upon range measurements, with an explicit representation of uncertainty through the definition of the map’s entropy. Each robot is able to build a 3-D map upon measurements from its own range sensor and is committed to cooperate with other robots by sharing useful measurements. An entropy-based measure of information utility is used to define a cooperation strategy for sharing useful information, without overwhelming communication resources with redundant or unnecessary information. Each robot reduces the map’s uncertainty by exploring maximum information viewpoints, by using its current map to drive its sensor to frontier regions having maximum entropy gradient. The proposed framework is validated through experiments with mobile robots equipped with stereo-vision sensors.     

Using occupancy grids for mobile robot perception and navigation

An approach to robot perception and world modeling that uses a probabilistic tesselated representation of spatial information called the occupancy grid is reviewed. The occupancy grid is a multidimensional random field that maintains stochastic estimates of the occupancy state of the cells in a spatial lattice. To construct a sensor-derived map of the robot's world, the cell state estimates are obtained by interpreting the incoming range readings using probabilistic sensor models. Bayesian estimation procedures allow the incremental updating of the occupancy grid, using readings taken from several sensors over multiple points of view. The use of occupancy grids from mapping and for navigation is examined. Operations on occupancy grids and extensions of the occupancy grid framework are briefly considered     

基于椭圆动态限制和免疫机理的路径规划算法

为更好地解决机器人路径规划问题,基于椭圆动态限制和免疫机理提出一种路径规划算法。首先,在全向空间内依据疫苗启发因子生成初始抗体种群。其次,将节点作为基本计算单元构建节点存储结构,避免局部路径信息重复计算,节点变异的同时更新节点信息。然后,根据路径值构建100%置信水平下的椭圆搜索区域,在不影响最优路径求解的同时动态缩小搜索区域,通过节点删除的两层限制不断删除无效节点,提高算法搜索效率。最后,将本文算法与其他3种算法对比,仿真结果表明本文算法搜索时间平均减少了77.24%,搜索的节点数量平均减少了55.54%。     

Evolving controllers for autonomous robot search teams

Deploying autonomous robot teams instead of humans in hazardous search and rescue missions could provide immeasurable benefits. In such operations, rescue workers often face environments where information about the physical conditions is impossible to obtain, which not only hampers the efficiency and effectiveness of the effort, but also places the rescuers in life-threatening situations. These types of risk promote the potential for using robot search teams in place of humans. This article presents the design and implementation of controllers to provide robots with appropriate behavior. The effective utilization of genetic algorithms to evolve controllers for teams of homogeneous autonomous robots for area coverage in search and rescue missions is described, along with a presentation of a robotic simulation program which was designed and developed. The main objective of this study was to contribute to efforts which attempt to implement real-world robotic solutions for search and rescue missions.     

Intensity-based navigation with global guarantees

This article introduces simple, information-feedback plans that guide a robot through an unknown obstacle course using the sensed information from a single intensity source. The framework is similar to the well-known family of bug algorithms; however, our plans require less sensing information than any others. The robot is unable to access precise information regarding position coordinates, angular coordinates, time, or odometry, but is nevertheless able to navigate itself to a goal among unknown piecewise-analytic obstacles in the plane. The only sensor providing real values is an intensity sensor, which measures the signal strength emanating from the goal. The signal intensity function may or may not be symmetric; the main requirement is that the level sets are concentric images of simple closed curves. Convergence analysis and distance bounds are established for the presented plans. Furthermore, they are experimentally demonstrated using a differential drive robot and an infrared beacon.     

Sensor Fault Tolerance Method by Using a Bayesian Network for Robot Behavior

This paper presents FTBN, a new framework that performs learning autonomous mobile robot behavior and fault tolerance simultaneously. For learning behavior in the presence of a robot sensor fault this framework uses a Bayesian network. In the proposed framework, sensor data are used to detect a faulty sensor. Fault isolation is accomplished by changing the Bayesian network structure using interpreted evidence from robot sensors. Experiments including both simulation and a real robot are performed for door-crossing behavior using prior knowledge and sensor data at several maps. This paper explains the learning behavior, optimal tracking, exprimental setup and structure of the proposed framework. The robot uses laser and sonar sensors for door-crossing behavior, such that each sensor can be corrupted during the behavior. Experimental results show FTBN leads to robust behavior in the presence of a sensor fault as well as performing better compared to the conventional Bayesian method.     

基于STM32的球形机器人设计与实现

为了提升灾后救援的侦测能力,解决信息获取问题,给救援人员搜集提供更多更具体的救援信息,以制定科学高效的救援方案。通过对比地面废墟搜救机器人通用技术要求,设计了基于STM32单片机为控制核心的球形救援侦测机器人。球形机器人根据自适应搜索和人机配合辅助搜索,结合摄像头以及5.8 G图传模块将图像信息传输给用户终端,实现用户人机交互使用,通过摇杆控制机器人完成高难度的动作。同时装设的TCRT5000红外探头可以自动追寻黑色轨迹,当机器人的超声波传感器检测到障碍物时,蜂鸣器以及报警灯会动作,发出报警信号,提醒调整侦测方向,完成救援侦测任务。     

Improved occupancy grid mapping in specular environment

This paper addresses the improved method for sonar sensor modeling which reduces the specular reflection uncertainty in the occupancy grid. Such uncertainty reduction is often required in the occupancy grid mapping where the false sensory information can lead to poor performance. Here, a novel algorithm is proposed which is capable of discarding the unreliable sonar sensor information generated due to specular reflection. Further, the inconsistency estimation in sonar measurement has been evaluated and eliminated by fuzzy rules based model. To achieve the grid map with improved accuracy, the sonar information is further updated by using a Bayesian approach. In this paper the approach is experimented for the office environment and the model is used for grid mapping. The experimental results show 6.6% improvement in the global grid map and it is also found that the proposed approach is consuming nearly 16.5% less computation time as compared to the conventional approach of occupancy grid mapping for the indoor environments.