Sensor Planning for Mobile Robot Localization---A Hierarchical Approach Using a Bayesian Network and a Particle Filter

In this paper, we propose a hierarchical approach to solving sensor planning for the global localization of a mobile robot. Our system consists of two subsystems: a lower layer and a higher layer. The lower layer uses a particle filter to evaluate the posterior probability of the localization. When the particles converge into clusters, the higher layer starts particle clustering and sensor planning to generate an optimal sensing action sequence for the localization. The higher layer uses a Bayesian network for probabilistic inference. The sensor planning takes into account both localization belief and sensing cost. We conducted simulations and actual robot experiments to validate our proposed approach.     

一个基于全景视觉的移动机器人导航系统的设计与实现

针对移动机器人路径规划与导航的实际应用,设计了一个基于全景视觉的移动机器人路径规划导航系统．首先,对导航系统的体系结构和功能进行描述．然后,分别就如何采用全景视觉传感器进行环境探索与地图创建,基于回归神经网络的广度优先搜索法和Voronoi骨架图法两种路径规划算法原理,以及如何实现按规划路径实施导航这三个方面进行了详细阐述．最后,结合实际机器人进行导航实验,评估导航系统的性能和路径规划算法的有效性．     

Path planning in GPS-denied environments via collective intelligence of distributed sensor networks

This paper proposes a framework for reactive goal-directed navigation without global positioning facilities in unknown dynamic environments. A mobile sensor network is used for localising regions of interest for path planning of an autonomous mobile robot. The underlying theory is an extension of a generalised gossip algorithm that has been recently developed in a language-measure-theoretic setting. The algorithm has been used to propagate local decisions of target detection over a mobile sensor network and thus, it generates a belief map for the detected target over the network. In this setting, an autonomous mobile robot may communicate only with a few mobile sensing nodes in its own neighbourhood and localise itself relative to the communicating nodes with bounded uncertainties. The robot makes use of the knowledge based on the belief of the mobile sensors to generate a sequence of way-points, leading to a possible goal. The estimated way-points are used by a sampling-based motion planning algorithm to generate feasible trajectories for the robot. The proposed concept has been validated by numerical simulation on a mobile sensor network test-bed and a Dubin’s car-like robot.     

移动机器人导航技术现状与展望

移动机器人导航涉及到路径规划，传感器的选择及传感器信息的融合等技术．本文综述了自主式移动机器人的导航技术，对其中的定位、路径规划及多传感器信息融合等技术进行了较详细的分析．同时对移动机器人导航技术的发展趋势作了进一步的阐述．     

A parallel processing architecture for sensor-based control of intelligent mobile robots

Parallel processing plays an important role in sensor-based control of intelligent mobile robots. This paper describes the design and implementation of a parallel processing architecture used for real-time, sensor-based control of mobile robots. This architecture takes the form of a network of sensing and control nodes, based on a novel module that we call Locally Intelligent Control Agent (LICA). It is a hybrid control architecture containing low-level feedback control loops and high-level decision making components. All the sensing, planning, and control tasks for intelligent control of a mobile robot are distributed across such a network, and operate in parallel. It has been used successfully in many experiments to perform planning and navigation tasks in real-time. Such a generic architecture can be readily applied to many diverse applications.     

Information-theoretic Approaches Based on Sequential Monte Carlo to Collaborative Distributed Sensors for Mobile Robot Localization

We consider the Sequential Monte Carlo (SMC) method for Bayesian inference applied to the problem of information-theoretic distributed sensor collaboration in complex environments. The robot kinematics and sensor observation under consideration are described by nonlinear models. The exact solution to this problem is prohibitively complex due to the nonlinear nature of the system. The SMC method is, therefore, employed to track the probabilistic kinematics of the robot and to make the corresponding Bayesian estimates and predictions. To meet the specific requirements inherent in distributed sensors, such as low-communication consumption and collaborative information processing, we propose a novel SMC solution that makes use of the particle filter technique for data fusion, and the density tree representation of the a posterior distribution for information exchange between sensor nodes. Meanwhile, an efficient numerical method is proposed for approximating the information utility in sensor selection. A further experiment, obtained with a real robot in an indoor environment, illustrates that under the SMC framework, the optimal sensor selection and collaboration can be implemented naturally, and significant improvement in localization accuracy is achieved when compared to conventional methods using all sensors.     

Deliberative On-Line Local Path Planning for Autonomous Mobile Robots

This paper describes a method for local path planning for mobile robots that combines reactive obstacle avoidance with on-line local path planning. Our approach is different to other model-based navigation approaches since it integrates both global and local planning processes in the same architecture while other methods only combine global path planning with a reactive method to avoid non-modelled obstacles. Our local planning is only triggered when an unexpected obstacle is found and reactive navigation is not able to regain the initial path. A new trajectory is then calculated on-line using only proximity sensor information. This trajectory can be improved during the available time using an anytime algorithm. The proposed method complements the reactive behaviour and allows the robot to navigate safely in a partially known environment during a long time period without human intervention.     

Algorithms for acoustic localization based on microphone array in service robotics

This paper deals with the development of acoustic source localization algorithms for service robots working in real conditions. One of the main utilizations of these algorithms in a mobile robot is that the robot can localize a human operator and eventually interact with him/herself by means of verbal commands. The location of a speaking operator is detected with a microphone array based algorithm; localization information is passed to a navigation module which sets up a navigation mission using knowledge of the environment map. In fact, the system we have developed aims at integrating acoustic, odometric and collision sensors with the mobile robot control architecture. Good performance with real acoustic data have been obtained using neural network approach with spectral subtraction and a noise robust voice activity detector. The experiments show that the average absolute localization error is about 40 cm at 0 dB and about 10 cm at 10 dB of SNR for the named localization. Experimental results describing mobile robot performance in a talker following task are reported.     

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.     

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.

     

A Bayesian exploration-exploitation approach for optimal online sensing and planning with a visually guided mobile robot

We address the problem of online path planning for optimal sensing with a mobile robot. The objective of the robot is to learn the most about its pose and the environment given time constraints. We use a POMDP with a utility function that depends on the belief state to model the finite horizon planning problem. We replan as the robot progresses throughout the environment. The POMDP is high-dimensional, continuous, non-differentiable, nonlinear, non-Gaussian and must be solved in real-time. Most existing techniques for stochastic planning and reinforcement learning are therefore inapplicable. To solve this extremely complex problem, we propose a Bayesian optimization method that dynamically trades off exploration (minimizing uncertainty in unknown parts of the policy space) and exploitation (capitalizing on the current best solution). We demonstrate our approach with a visually-guide mobile robot. The solution proposed here is also applicable to other closely-related domains, including active vision, sequential experimental design, dynamic sensing and calibration with mobile sensors.     

A New Mobile Robot Toolbox for Matlab

In this study, a wheeled mobile robot navigation toolbox for Matlab is presented. The toolbox includes algorithms for 3D map design, static and dynamic path planning, point stabilization, localization, gap detection and collision avoidance. One can use the toolbox as a test platform for developing custom mobile robot navigation algorithms. The toolbox allows users to insert/remove obstacles to/from the robot’s workspace, upload/save a customized map and configure simulation parameters such as robot size, virtual sensor position, Kalman filter parameters for localization, speed controller and collision avoidance settings. It is possible to simulate data from a virtual laser imaging detection and ranging (LIDAR) sensor providing a map of the mobile robot’s immediate surroundings. Differential drive forward kinematic equations and extended Kalman filter (EKF) based localization scheme is used to determine where the robot will be located at each simulation step. The LIDAR data and the navigation process are visualized on the developed virtual reality interface. During the navigation of the robot, gap detection, dynamic path planning, collision avoidance and point stabilization procedures are implemented. Simulation results prove the efficacy of the algorithms implemented in the toolbox.     

基于多传感器信息融合的移动机器人导航系统

介绍了多传感器信息融合的基本原理,给出了基于多传感器信息融合的移动机器人导航系统结构。建立了移动机器人数学模型,运用基于扩展卡尔曼滤波的信息融合方法实现了移动机器人导航算法。通过实验验证了基于多传感器信息融合的移动机器人导航系统和导航算法的有效性。     

Navigation integration of a mobile robot in dynamic environments

This article presents a design and experimental study of navigation integration of an intelligent mobile robot in dynamic environments. The proposed integration architecture is based on the virtual‐force concept, by which each navigation resource is assumed to exert a virtual force on the robot. The resultant force determines how the robot will move. Reactive behavior and proactive planning can both be handled in a simple and uniform manner using the proposed integration method. A real‐time motion predictor is employed to enable the mobile robot to deal in advance with moving obstacles. A grid map is maintained using on‐line sensory data for global path planning, and a bidirectional algorithm is proposed for planning the shortest path for the robot by using updated grid‐map information. Therefore, the mobile robot has the capacity to both learn and adapt to variations. To implement the whole navigation system efficiently, a blackboard model is used to coordinate the computation on board the vehicle. Simulation and experimental results are presented to verify the proposed design and demonstrate smooth navigation behavior of the intelligent mobile robot in dynamic environments. ©1999 John Wiley & Sons, Inc.     

Using roadmaps to classify regions of space for autonomous robot navigation

The roadmap approach to robot path planning is one of the earliest methods. Since then, many different algorithms for building roadmaps have been proposed and widely implemented in mobile robots but their use has always been limited to planning in static, totally known environments. In this paper we combine the use of dynamic analogical representations of the environment with an efficient roadmap extraction method, to guide the robot navigation and to classify the different regions of space in which the robot moves. The paper presents the general reference architecture for the robotic system and then focuses on the algorithms for the construction of the roadmap, the classification of the regions of space and their use in robot navigation. Experimental results indicate the applicability and robustness of this approach in real situations.     

Probabilistic Road Map sampling strategies for multi-robot motion planning

This paper presents a Probabilistic Road Map (PRM) motion planning algorithm to be queried within Dynamic Robot Networks—a multi-robot coordination platform for robots operating with limited sensing and inter-robot communication.

First, the Dynamic Robot Networks (DRN) coordination platform is introduced that facilitates centralized robot coordination across ad hoc networks, allowing safe navigation in dynamic, unknown environments. As robots move about their environment, they dynamically form communication networks. Within these networks, robots can share local sensing information and coordinate the actions of all robots in the network.

Second, a fast single-query Probabilistic Road Map (PRM) to be called within the DRN platform is presented that has been augmented with new sampling strategies. Traditional PRM strategies have shown success in searching large configuration spaces. Considered here is their application to on-line, centralized, multiple mobile robot planning problems. New sampling strategies that exploit the kinematics of non-holonomic mobile robots have been developed and implemented. First, an appropriate method of selecting milestones in a PRM is identified to enable fast coverage of the configuration space. Second, a new method of generating PRM milestones is described that decreases the planning time over traditional methods. Finally, a new endgame region for multi-robot PRMs is presented that increases the likelihood of finding solutions given difficult goal configurations.

Combining the DRN platform with these new sampling strategies, on-line centralized multi-robot planning is enabled. This allows robots to navigate safely in environments that are both dynamic and unknown. Simulations and real robot experiments are presented that demonstrate: (1) speed improvements accomplished by the sampling strategies, (2) centralized robot coordination across Dynamic Robot Networks, (3) on-the-fly motion planning to avoid moving and previously unknown obstacles and (4) autonomous robot navigation towards individual goal locations.     

全局环境未知时机器人导航和避障的一种新方法

研究了全局环境未知情况下的移动机器人实时导航问题．将栅格法描述环境与基于滚动窗口的路径规划相结合，提出了一种新的移动机器人导航方法．将超声传感阵列探测到的环境信息以基于栅格的概率值进行表示，利用不确定性证据推理对其进行数据融合，得到机器人的局部环境信息；在此基础上，采用基于滚动窗口的方法进行机器人路径规划，实现机器人的实时导航．仿真与实验结果表明了该方法的有效性．     

Adaptive behaviors of reactive mobile robot with Bayesian inference in nonstationary environments

This paper presents a technique for a reactive mobile robot to adaptively behave in unforeseen and dynamic circumstances. A robot in nonstationary environments needs to infer how to adaptively behave to the changing environment. Behavior-based approach manages the interactions between the robot and its environment for generating behaviors, but in spite of its strengths of fast response, it has not been applied much to more complex problems for high-level behaviors. For that reason many researchers employ a behavior-based deliberative architecture. This paper proposes a 2-layer control architecture for generating adaptive behaviors to perceive and avoid moving obstacles as well as stationary obstacles. The first layer is to generate reflexive and autonomous behaviors with behavior network, and the second layer is to infer dynamic situations of the mobile robot with Bayesian network. These two levels facilitate a tight integration between high-level inference and low-level behaviors. Experimental results with various simulations and a real robot have shown that the robot reaches the goal points while avoiding stationary or moving obstacles with the proposed architecture.