In this paper, we propose a method to use semantic information to improve the use of map priors in a sparse, feature-based MonoSLAM system. To incorporate the priors, the features in the prior and SLAM maps must be associated with one another. Most existing systems build a map using SLAM and then align it with the prior map. However, this approach assumes that the local map is accurate, and the majority of the features within it can be constrained by the prior. We use the intuition that many prior maps are created to provide semantic information. Therefore, valid associations only exist if the features in the SLAM map arise from the same kind of semantic object as the prior map. Using this intuition, we extend ORB-SLAM2 using an open source pre-trained semantic segmentation network (DeepLabV3+) to incorporate prior information from Open Street Map building footprint data. We show that the amount of drift, before loop closing, is significantly smaller than that for original ORB-SLAM2. Furthermore, we show that when ORB-SLAM2 is used as a prior-aided visual odometry system, the tracking accuracy is equal to or better than the full ORB-SLAM2 system without the need for global mapping or loop closure.

In this paper we present a general method for exploiting prior information to constrain the location of land marks in GraphSLAM. Prior information can be obtained for many environments in many different ways. However, this information can be incomplete, out-of-date, or presented in a different form than that used by the robot. Therefore, we argue that prior information is most naturally modelled as sets of potential constraints that act between landmarks. We present an extension of GraphSLAM that incorporates these constraints. We illustrate the results in an experiment with a 3D laser scanner and demonstrate a significant improvement in performance.

We consider how prior information can be exploited to improve the quality of SLAM. Prior information, such as aerial imagery, can be readily obtained for many environments. However, this information is often collected at a different time, using different sensors, different representations and from different vantage points than those used by the robot undertaking SLAM. In this paper, we describe a general probabilistic framework to overcome these difficulties. Our framework models the environment as a random set of latent structures which are observed by a set of sensing systems. Each sensing system gives rise to a different kind of map and, by associating features from the same structure across the different maps, parameterised constraints between the sets of features can be constructed. These parameterised constraints make it possible to transfer information between map representations. We demonstrate the use of the framework in a simulated environment to illustrate how geometric features of different dimensions can be fused together.

This paper presents the common state filter (CSF), a novel and efficient suboptimal multiple hypothesis slam (MHSLAM) method for Kalman Filter-based SLAM algorithms. Conventional MHSLAM algorithms require the entire vehicle and map state to be copied for each hypothesis. The CSF, by contrast, maintains a single, common instance of the vast majority of the map and only copies the map portion that varies substantially across different hypotheses. We demonstrate the performance of the algorithm on the Victoria Park data set.

In this paper we consider ways to alleviate negative estimated depth for the inverse depth parameterisation of bearing-only SLAM. This problem, which can arise even if the beacons are far from the platform, can cause catastrophic failure of the filter.We consider three strategies to overcome this difficulty: applying inequality constraints, the use of truncated second order filters, and a reparameterisation using the negative logarithm of depth. We show that both a simple inequality method and the use of truncated second order filters are successful. However, the most robust performance is achieved using the negative log parameterisation.