This article presents and studies a recursive information consensus filter for decentralized dynamic state estimation under circumstances in which the communication network is unreliable. Local estimators are assumed to have access only to local information, and no structure is assumed about the topology of the communication network, which need not be connected at all times. The filter is a hybrid approach: it uses iterative covariance intersection to reach consensus over priors, which might become correlated, while consensus over new information is handled using weights based on a Metropolis–Hastings Markov chain. We establish bounds for estimation performance and show that this hybrid method produces unbiased conservative estimates that are better than covariance intersection. The performance of the hybrid method is evaluated extensively, including comparisons with competing algorithms, with a hypothetical “full history” yardstick, and centralized performance. We conduct an assessment on a realistic atmospheric dispersion problem and also on more carefully crafted settings to help characterize particular aspects of the performance.

Planning under process and measurement uncertainties is a challenging problem. In its most general form, it can be modeled as a Partially Observed Markov Decision Process (POMDP) problem. However POMDPs are generally difficult to solve when the underlying spaces are continuous, particularly when beliefs are non-Gaussian, and the difficulty is further exacerbated when there are also non-convex constraints on states. Existing algorithms to address such challenging POMDPs are expensive in terms of computation and memory. In this paper, we provide a feedback policy in non-Gaussian belief space by solving a convex program for common non-linear observation models. The solution involves a Receding Horizon Control strategy using particle filters for the non-Gaussian belief representation. We develop a way of capturing non-convex constraints in the state space and adapt the optimization to incorporate such constraints, as well. A key advantage of this method is that it does not introduce additional variables in the optimization problem and is therefore more scalable than existing constrained problems in belief space. We demonstrate the performance of the method on different scenarios.

This paper presents a new recursive information consensus filter for decentralized dynamic-state estimation. Local estimators are assumed to have access only to local information and no structure is assumed about the topology of the communication network, which need not be connected at all times. Iterative Covariance Intersection (ICI) is used to reach consensus over priors which might become correlated, while consensus over new information is handled using weights based on a Metropolis Hastings Markov Chain (MHMC). We establish bounds for estimation performance and show that our method produces unbiased conservative estimates that are better than CI. The performance of the proposed method is evaluated and compared with competing algorithms on an atmospheric dispersion problem.

coordinate. Experimental results demonstrate that the proposed method results in accurate pose estimates for positioning the RNA in indoor environments. Based on the PE method, a wayfinding system is developed for localization of the RNA in a home environment. The system uses the estimated pose and the floorplan to locate the RNA user in the home environment and announces the points of interest and navigational commands to the user through a speech interface. NOTE TO PRACTITIONERS: This work was motivated by the limitations of the existing navigation technology for the visually impaired. Most of the existing methods use a point/line measurement sensor for indoor object detection. Therefore, they lack capability in detecting 3D objects and positioning a blind traveler. Stereovision has been used in recent research. However, it cannot provide reliable depth data for object detection. Also, it tends to produce a lower localization accuracy because its depth measurement error quadratically increases with the true distance. This paper suggests a new approach for navigating a blind traveler. The method uses a single 3D time-of-flight camera for both 6-DOF PE and 3D object detection and thus results in a small-sized but powerful RNA. Due to the camera's constant depth accuracy, the proposed egomotion estimation method results in a smaller error than that of existing methods. A new EKF method is proposed to integrate the egomotion into the RNA's 6-DOF pose in the world coordinate system by tracking both visual and geometric features of the operating environment. The proposed method substantially reduces the pose error of a standard EKF method and thus supports a longer range navigation task. One limitation of the method is that it requires a feature-rich environment to work well.

This paper proposes a method for mobile robot exploration based on the idea of frontier exploration which suggests navigating the robot toward the boundaries between free and unknown areas in the map. A global occupancy grid map of the environment is constantly updated, based on which a global frontier map is calculated. Then, a histogram based approach is adopted to cluster frontier cells and score these clusters based on their distance from the robot as well as the number of frontier cells they contain. In each stage of the algorithm, a sub-goal is set for the robot to navigate. A combination of distance transform and A* search algorithms is utilized to generate a plausible path toward the sub-goal through the free space. This way keeping a reliable distance from obstacles is guaranteed while searching for the shortest path toward the sub-goal. When such a path is generated, a B-spline interpolated and smoothed trajectory is produced as the control reference for the mobile robot to follow. The whole process is iterated until no unexplored area remains in the map. The efficiency of the method is shown through simulated and real experiments.

In this paper a new strategy for handling the observation information of a bearing-range sensor throughout the filtering process of EKF-SLAM is proposed. This new strategy is advised based on a thorough consistency analysis and aims to improve the process consistency while reducing the computational cost. At first, three different possible observation models are introduced for the EKF-SLAM solution for a robot equipped with a bearing-range sensor. General form of the covariance matrix and the level of inconsistency in the robot orientation estimate is then calculated for these variants, and based on the numerical comparison of the estimation results, it is proposed to use the bearing and range information of a feature in the initialization step of EKF-SLAM. However, it is recommended to use only the bearing information to perform other iteration steps. The simulation observations verify that the new strategy yields to more consistent estimates both for the robot and the features. Moreover, through the proposed consistency analysis, it is shown that since the source of consistency improvement is independent from the choice of the motion model, it gives us an advantage over other existing methods that assume a specific motion models for consistency improvement.

This paper proposes a method for augmenting the information of a monocular camera and a range finder. This method is a valuable step towards solving the SLAM problem in unstructured environments free from problems of using encoderspsila data. Proposed algorithm causes the robot to benefit from a feature-based map for filtering purposes, while it exploits an accurate motion model, based on point-wise raw range scan matching rather than unreliable feature-based range scan matching, in unstructured environments. Moreover, robust loop closure detection procedure is the other consequence of this method. Experiments with a low-cost IEEE 1394 webcam and a range finder illustrate the effectiveness of the proposed method in drift-free SLAM at loop closing motions in unstructured environments.