Fast and Accurate SLAM with Rao-Blackwellized Particle Filters
|
|
- Shanna Gaines
- 6 years ago
- Views:
Transcription
1 Fast and Accurate SLAM with Rao-Blackwellized Particle Filters Giorgio Grisetti a,b Gian Diego Tipaldi b Cyrill Stachniss c,a Wolfram Burgard a Daniele Nardi b a University of Freiburg, Department of Computer Science, D Freiburg, Germany b Dipartimento Informatica e Sistemistica, Universitá La Sapienza, I Rome, Italy c Swiss Federal Institute of Technology (ETH) Zurich, CH-8092 Zurich, Switzerland Abstract Rao-Blackwellized particle filters have become a popular tool to solve the simultaneous localization and mapping problem. This technique applies a particle filter in which each particle carries an individual map of the environment. Accordingly, a key issue is to reduce the number of particles and/or to make use of compact map representations. This paper presents an approximative but highly efficient approach to mapping with Rao-Blackwellized particle filters. Moreover, it provides a compact map model. A key advantage is that the individual particles can share large parts of the model of the environment. Furthermore, they are able to reuse an already computed proposal distribution. Both techniques substantially speed-up the overall filtering process and reduce the memory requirements. Experimental results obtained with mobile robots in large-scale indoor environments and based on published standard datasets illustrate the advantages of our methods over previous mapping approaches using Rao-Blackwellized particle filters. Key words: SLAM, Rao-Blackwellized particle filter, grid map, informed proposal PACS: 1 Introduction Learning maps is a fundamental task of mobile robots and a lot of researchers focused on this problem. In the literature, the mobile robot mapping problem is often referred to as the simultaneous localization and mapping (SLAM) problem [1, 2, 3, 4, 5, 6, 7, 8]. In general, SLAM is a complex problem because for learning a map the robot requires a good pose estimate while at the same time a consistent map is needed to localize the robot. This dependency between the pose and the map estimate makes the SLAM problem hard and requires to search for a solution in a high-dimensional space. Preprint submitted to Elsevier Science October 10, 2006
2 Murphy, Doucet, and colleagues [7, 9] introduced Rao-Blackwellized particle filters (RBPFs) as an effective means to solve the SLAM problem. The main problem of Rao-Blackwellized particle filters lies in their complexity, measured in terms of the number of particles required to learn an accurate map. Reducing this quantity is one of the major challenges for this family of algorithms. The contribution of this paper is a technique that reduces the computational and the memory requirements in the context of mapping with Rao-Blackwellized particle filters. In this way, it becomes feasible to maintain a comparably large set of particles online. This is achieved by enabling a subset of samples to share large parts of the map and to use the same proposal distribution. Our system allows a standard laptop computer to perform all computations necessary to learn accurate maps with more than one thousand samples online. This paper is organized as follows. After the discussion of related work, we briefly introduce mapping with RBPFs. We then describe our technique for efficiently drawing particles from a proposal distribution. After this, we present our map representation and the concept of particle clusters. Finally, we show experiments illustrating the improvements of our approach to map learning with RBPFs. 2 Related Work The estimation techniques for the SLAM problem can be classified according to their underlying basic principle. The most popular approaches are extended Kalman filters (EKFs), maximum likelihood techniques, sparse extended information filters (SEIFs), and Rao Blackwellized particle filters (RBPFs). The effectiveness of the EKF approaches comes from the fact that they estimate a fully correlated posterior over landmark maps and robot poses [10, 11]. Their weakness lies in the strong assumptions that have to be made on the robot motion model and the sensor noise. Moreover, in the basic framework the landmarks are assumed to be uniquely identifiable. There exist techniques [12] to deal with unknown data association in the SLAM context, however, if certain assumptions are violated, the filter is likely to diverge [13]. Thrun et al. [8] proposed a SEIF method which is based on the inverse of the covariance matrix. In this way, measurements can be integrated efficiently. Eustice et al. [14] presented an improved technique to accurately compute the error-bounds within the SEIF framework and thus reduces the risk of becoming overly confident. Paskin [15] presented a solution to the SLAM problem using thin junction trees. This reduces the complexity compared to EKF-based approaches since thinned junction trees provide a linear-time filtering operation. An alternative approach is to use a maximum likelihood algorithm that computes a map by constructing a network of relations. The relations represent the spatial 2
3 constraints between the poses of the robot [3, 16]. The main difference to RBPFs is that the maximum likelihood approach can only track a single mode of the distribution about the trajectory of the robot. It computes the solution by minimizing the least square error introduced by the constraints. Lisien et al. [17] realized an hierarchical map model in the context of SLAM and reported that this improves loop-closing. Bosse et al. [18] describe a generic framework for SLAM in large-scale environments. They use a graph structure of local maps with relative coordinate frames similar to the work described in [19]. This approach is able to reduce the complexity of the overall problem and it better deals with the linearizations in the context of EKF-SLAM. Our approach is related to this framework since we also use local maps attached to a graph structure to model the environment. However, our motivation to use such a map representation is to allow multiple particles to share local maps and to compute the proposal distributions in an efficient way. Murphy [7] introduced Rao-Blackwellized particle filters as an effective means to solve the SLAM problem. Each particle in a RBPF represents a potential trajectory of the robot and a map of the environment. The framework has been subsequently extended by Montemerlo et al. [5, 6] for approaching the SLAM problem with landmarks. To learn accurate grid maps, Hähnel et al. [4] presented an improved motion model that reduces the number of required particles. A combination of the approach of Hähnel et al. and Montemerlo et al. as been presented by Grisetti et al. [2], which extends the ideas of FastSLAM-2 [5] to the grid map case. We present in this paper an approximative solution to RBPF-based mapping which describes how to draw particles and how to represent the maps of the particles so that the system can be executed significantly faster and needs less memory resources. There exist other approaches to mapping with RBPFs like DP-SLAM [1] that provide a compact map representation. This approach stores an ancestry tree of particles. Furthermore, each cell of their grid map maintains a tree of poses from which that cell has been observed. This allows the system to store the map hypotheses in an compact manner. Additionally, the resampling can be carried out more efficiently. In contrast to that, our map representation enables us to reuse already computed proposal distributions for multiple samples. This is done by carrying out a coordinate transformation between the reference frames stored in our graph structure. The contribution of this paper is a computational and memory efficient Rao-Blackwellized particle filter for SLAM. Our approach allows the robot to efficiently determine the proposal distributions to sample the next generation of particles in an approximative manner. Additionally, we present a compact map model in which multiple particles share local maps. This enables us to maintain substantially more samples with less memory and computational requirements compared to state-ofthe-art mapping approach using Rao-Blackwellized particle filters. 3
4 3 Learning Maps with Rao-Blackwellized Particle Filters The key idea of the Rao-Blackwellized particle filter for SLAM is to estimate the joint posterior p(x 1:t, m z 1:t, u 1:t 1 ) about the trajectory x 1:t = x 1,...,x t of the robot and the map m of the environment given the observations z 1:t = z 1,...,z t and odometry measurements u 1:t 1 = u 1,...,u t 1. It does so by using the following factorization: p(x 1:t, m z 1:t, u 1:t 1 ) = p(x 1:t z 1:t, u 1:t 1 )p(m x 1:t, z 1:t ) (1) In this equation, the posterior p(x 1:t z 1:t, u 1:t 1 ) is similar to the localization problem, since only the trajectory of the vehicle needs to be estimated. This estimation is performed using a particle filter which incrementally processes the observations and the odometry readings as they are available. The second term p(m x 1:t, z 1:t ) can be computed efficiently since the poses x 1:t of the robot are known when estimating the map m. Therefore, a Rao-Blackwellized particle filter for SLAM maintains an individual map for each sample and updates this map based on the trajectory estimate of the sample upon mapping with known poses. A mapping system that applies a RBPF requires a proposal distribution in order to draw the next generation of samples. The general framework leaves open which proposal should be used and how it should be computed. A proposal distribution typically used in the context of Monte-Carlo localization is the motion model p(x t x t 1, u t 1 ). This proposal, however, is sub-optimal since it does not consider the observations of the robot to predict its motion. As pointed out by several authors [20, 5], problem-specific proposal distributions are needed in order to build an efficient mapping system. The approach presented in this paper, makes use of our previously defined [2] proposal distribution. It transfers the ideas of FastSLAM- 2 [5] to the grid map case. Under the Markov assumption, the optimal proposal distribution [20] is p(x t m (i) t 1, x (i) t 1, z t, u t 1 ) = p(z t m (i) t 1, x t )p(x t x (i) t 1, u t 1 ) (2) p(zt m (i) t 1, x )p(x x (i) t 1, u t 1 ) dx. Whenever a laser range finder is used, one can observe that the observation likelihood p(z t m t 1, x t ) is much more peaked than the motion model p(x t x t 1, u t 1 ). The observation likelihood dominates the product in Eq. (2) in the meaningful area of the distribution. Therefore, we approximate p(x t x t 1, u t 1 ) by a constant k within this meaningful area L (i). Under this approximation, the proposal turns into [ ] 1 p(x t m (i) t 1, x (i) t 1, z t, u t 1 ) p(z t m (i) t 1, x t ) p(z t m (i) t 1, x ) dx. x L (i) (3) Eq. (3) can be computed by evaluating p(z t m (i) t 1, x t ) on a grid which is bounded by the maximum odometry error. Alternatively, one can use a set of sampled points 4
5 {x j } and then evaluate point-wise the observation likelihood. In order to efficiently sample the next generation of particles, one can approximate this distribution by a Gaussian. For each particle i, the parameters µ (i) t and Σ (i) t of the Gaussian are computed as µ (i) t = 1 η (i) Σ (i) t = 1 η (i) K j=1 K j=1 x j p(z t m (i) t 1, x j ) (4) p(z t m (i) t 1, x j ) (x j µ (i) t )(x j µ (i) t ) T. (5) Here η = K j=1 p(z t m (i) t 1, x j ) is a normalizer. Note that µ (i) t and Σ (i) t are calculated for each particle individually which is computationally expensive but leads to an informed proposal distribution. This allows us to draw particles in an more accurate manner which seriously reduces the number of required samples. 4 Speeding Up the Computation of the Proposal The problem of the method presented above is the computational complexity of the informed proposal distribution since it has to be done for each sample individually. As a result, such a mapping system runs online only for small particle sets. Furthermore, each particle maintains a full grid map which requires to store large grid structures in the memory. To overcome this limitation, we present a way to utilize intermediate results in order to efficiently determine the proposal for the individual samples. Our implementation extends the open-source implementation [21] of the mapping system of Grisetti et al. [2] which originally makes use of the proposal distribution presented in the previous section. The proposal distribution is needed to model the relative movement of the vehicle under uncertainty. In most situations, this uncertainty is similar for all samples within one movement. It therefore makes sense to use the same uncertainty to propagate the particles. We derive a way to sample multiple particles from the same proposal. As a result, the time consuming computation of the proposal distribution can be carried out for a few particles that are representatives for groups of similar samples. Furthermore, we observed that local maps which are represented in a particlecentered coordinate frame look similar for many samples. We therefore present a compact map model in which multiple particles can share their local maps. Instead of storing a full grid map, each sample maintains only a set of reference frames for the different local maps. This substantially reduces the memory requirements of the mapping algorithm. 5
6 4.1 Different Situations During Mapping Before we derive our new proposal distributions, we start with a brief analysis of the behavior of a RBPF. One can distinguish three different types of situations during mapping: The robot is moving through unknown areas, is moving through known areas, or is closing a loop. Here, closing a loop means that the robot first moves through unknown areas and then reenters known terrain. It can be seen as moving along a so far non traversed shortcut from current pose of the robot to an already known area (see also [22]). In each of those situations, the filter behaves differently. Whenever the robot is moving through unknown terrain, the uncertainty about the pose of the robot grows. This is due to the fact that the errors are accumulated along the trajectory. The resulting uncertainty can only be bounded by observations which cover a (partially) known region. In the second case, a map of the surroundings of the robot is known and in this way the SLAM problem turns into a localization problem which is typically easier to handle. Whenever the robot is closing a loop, the particle cloud is often widely spread. By reentering known areas, the filter can typically determine which particles are consistent with their own map and which are not. As a result, such a situation leads to an unbalanced distribution of particle weights. The next resampling action then eliminates a series of unlikely hypotheses and the uncertainty decreases. For each of these three situations, we will present a proposal distribution that needs to be computed only for a small set of representatives rather than for all particles. Throughout this paper, we make the following three assumptions. Assumption 1 The current situation is known, which means that the robot can determine whether it is moving through unknown terrain, within a known area, or is closing a loop. Assumption 2 The corresponding local maps of two samples are similar if considered in a particle-centered reference frame. In the following, we refer to this property as local similarity of the maps. Assumption 3 An accurate algorithm for pose tracking is used and the observations are affected by a limited sensor noise. 4.2 Computing the Proposal for Unknown Terrain For proximity sensors like laser range finders, the observations of the robot cover only a local area around the robot. As a result, we only need to consider the sur- 6
7 (a) (b) (c) (d) Figure 1. Image (a) depicts the pose of a particle, its local map, and the computed proposal which represented by the blue/dashed ellipse. Image (b) illustrates the proposal distribution represented in the ego-centric reference frame of that sample. Image (c) shows a second particle and its map. By carrying out a coordinate transform, the proposal of the first particle can be used by the second particle as long as their maps are (locally) similar (d). roundings of the robot when computing the proposal distribution. Let m (i) t 1 refer to the local map of particle i around its previous pose x (i) t 1. In the surroundings of the robot, we can approximate p(x t m (i) t 1, x (i) t 1, z t, u t 1 ) p(x t m (i) t 1, x (i) t 1, z t, u t 1 ). (6) Let and be the standard pose compounding operators (see [16]): a b is an operator that translates all the points in the domain of the function a so that the new origin of the domain of a is b and is its inverse. The local similarity between maps (Assumption 2) allows us to write m (i) t 1 x (i) t 1 m (j) t 1 x (j) t 1. In this case, the proposal distribution for different particles are similar if transformed to an egocentric reference frame p(x t x (j) t 1 m (j) t 1, x (j) t 1, z t, u t 1 ) p(x t x (i) t 1 m (i) t 1, x (i) t 1, z t, u t 1 ). (7) As a result, we can determine the proposal for a particle j by computing the proposal in the reference frame of particle i and then translating it to the reference frame of particle j p(x t m (j) t 1, x (j) t 1, z t, u t 1 ) p(x (j) t 1 (x t x (i) t 1) m (i) t 1, x (i) t 1, z t, u t 1 ). (8) This computation is illustrated in Figure 1. It shows how to transform a proposal between particles. The complex proposal computation needs to be performed only once and can then be translated to the reference frame of the other particles. 4.3 Computing the Proposal for Already Visited Areas Whenever the robot moves through known areas, each particle stays localized in its own map according to Assumption 3. To update the new pose of each particle while the robot moves, we choose the pose x t that maximizes the likelihood of the observation around the pose predicted by odometry x (i) t = argmaxp(x t m (i) t 1, x t 1, (i) z t, u t 1 ). (9) x t 7
8 Analog to Eq. (6)-(8), we can express the proposal of particle j using the one of particle i. The only difference is that we do not apply the and operators based on the poses of the samples. Instead, the operators are applied based on the particle dependent reference frames l (i) and l (j) of the local maps. These reference frames were established whenever the robot visits the corresponding area for the first time. This results in p(x t m (j) t 1, x (j) t 1, z t, u t 1 ) p(l (j) (x t l (i) ) m (i) t 1, x (i) t 1, z t, u t 1 ). (10) Combining Eq. (9) and Eq. (10) leads to x (j) t = argmaxp(x t m (j) t 1, x (j) t 1, z t, u t 1 ) (11) x t argmaxp(l (j) (x t l (i) ) m (i) t 1, x (i) t 1, z t, u t 1 ) = l (j) (x (i) t l (i) ).(12) x t Under the Assumptions 2 and 3, we can estimate the poses of all samples according to Eq. (12) (while moving through known areas). In this way, the complex computation of an informed proposal needs to be done only once. 4.4 Computing the Proposal When Closing a Loop In contrast to the two situations described before, the computation of the proposal is more complex in case of a loop-closure. This is due to the fact that Assumption 2 (local similarity) is typically violated even for subsets of particles. Let us assume that the particle cloud is widely spread when the loop is closed. Typically, the individual samples reenter the previously mapped terrain at different locations. This results in different hypotheses about the topology of the environment and definitively violates Assumption 2. Dealing with such a situation, requires additional effort in the estimation process. Whenever a particle i closes a loop, we consider that the map m (i) t 1 of its surroundings consists of two components. Let m (i) loop refer to the map of the area, the robot seeks to reenter. Then, m (i) local is the map constructed from the most recent measurements without the part of the map that overlaps with m (i) loop. Since those two maps are disjoint and under the assumption that the individual grid cells are independent, we can use a factorized form for our likelihood function p(z t x t, m (i) local, m(i) loop ) p(z t x t, m (i) local ) p(z t x t, m (i) loop ). (13) For efficiency reasons, we use only the local map m (i) local to compute the proposal and do not consider m (i) loop. This procedure is valid but requires to adapt the weight computation. According to the importance sampling principle, this leads to 8
9 w (i) t = w (i) t 1 p(x(i) t p(x (i) t z t, x (i) t 1, m (i) local, m(i) loop, u t 1) z t, x (i) t 1, m (i) local, u t 1) (14) = w (i) t 1 η(i) 1 p(z t x (i) t, m (i) local )p(z t x (i) t, m (i) loop ) η (i) 2 p(z t x (i) t, m (i) local ) (15) = w (i) t 1 p(z t x (i) t, m (i) )η(i) 1 loop η (i) 2, (16) where η 1 and η 2 are normalization factors resulting from Bayes rule. Note that the computation of the proposal in case of a loop-closure is more expensive than in the two other situations. Fortunately, loop-closing situations occur rarely. The robot has to travel through unknown and eventually known terrain for a comparably long period of time before a loop-closure can occur. 4.5 Approximative Importance Weight Computation We observed in practical experiments that the normalizing factors η 1 and η 2 in Eq. (16) have only a minor influence on the overall weight. In order to speed up the computation of the importance weights, we approximate Eq. (16) by w (i) t w (i) t 1 p(z t x (i), m (i) loop ) (17) in which the normalizing factors are neglected. This is significantly faster to compute and as we will demonstrate in the experiments leads to almost identical importance weights. 5 Achieving Situation Estimation, Local Similarity, and Pose Tracking All of the derivations made in the previous section require that the robot knows whether it is moving through unknown terrain, through a previously mapped area, or is currently closing a loop (Assumption 1). Here, we describe how to distinguish the different cases. Detecting the first two situations can be done in a straightforward way by comparing the area covered by the current observation given the particle pose and the map constructed so far. In general, it is more difficult to decide whether or not the robot is closing a loop. To detect loop closures, we apply the approach proposed by Stachniss et al. [22]. We use a dual representation consisting of a topologic map that models the trajectory of the vehicle and a grid map. By comparing both representations, one is able to accurately determine whether or not a robot is closing a loop. Assumption 2 (local similarity) typically holds only up to the first loop closure but is then violated. By explicitly modeling the different topological hypotheses, it is 9
10 uncertainty robot original cluster newly created particle clusters Figure 2. The left image depicts a cluster while the robot is approaching a loop-closure. The shown particle cluster splits up into three different clusters (topology hypotheses) as depicted in the right image. still possible to represent the posterior in an appropriate way. To achieve local similarity, we introduce the notion of a particle cluster which describes a subset of particles for which the assumption of local similarity between maps holds. Ambiguities in the posterior can then be modeled using multiple particle clusters. In the beginning of the mapping process, we start with a single cluster, but after closing a loop, multiple topology hypotheses typically occur. In this situation, the cluster needs to be split up. Therefore, we determine which particle belongs to which topological hypothesis in order to form new clusters. In our current implementation, we group the samples according to their Euclidian distance to the different nodes in their own graph structure of reference frames. For each particle, we first determine the list of nodes in the field of view of that sample. We order this list according to the Euclidian distance from the pose represented by the sample to the corresponding node. Then, a cluster is given by the samples which have the same list of nodes. An example which illustrates how new clusters arise in case of a loop-closure is depicted in Figure 2. Note that we currently do not merge clusters. Throughout our experiments, we observed that multiple particle clusters are created when closing a loop. The actual number ranges up to 50. However, after a few iterations only a small number of clusters (typically up to five) survive. In our current implementation, we represent a map as a set of local maps also called patches. A global map for a given particle can be obtained by specifying the location of each patch within a global reference frame. Each sample therefore has to store only a list of reference frames l n (i) for the patches. In this way, the individual patches P 1,...,P N need to be stored only once per cluster. The map of particle i can be computed by m (i) = n l n (i) P n. Within one particle cluster, the local maps of each particle fulfills the assumption of local similarity. Therefore, they can share their patches. This results in a more compact representation compared to storing individual grid maps. In our current mapping system, we used a graph structure where each node is a reference to the corresponding patch. Furthermore, the state vector s (i) t and the clusters C k are rep- 10
11 Figure 3. Learned map of the MIT Killian Court, the Intel Research lab, and the ACES dataset using our approach. resented as s (i) t = x (i) t }{{} robot pose, k }{{} cluster ID, l (i) 1,...,l (i) N }{{ k } patch locations C k = P 1,..., P Nk, {e l,m } }{{}}{{} pointers to patches graph edges (18) Note that the number N k of patches does not grow with the length of the trajectory traveled by the robot. It grows with the number of relevant patches which is related to the size of the environment. To fulfill Assumption 3, we apply an incremental scan alignment technique based on laser range finder data. The experiments presented in this paper indicate that this setup/implementation is sufficient to satisfy the three assumptions. As a result, we obtain a mapping system which provides highly accurate maps in a fast and memory efficient manner.. 6 Experiments In this section, we present experiments performed on real robot datasets which are commonly used within the robotics community. In the first experiment, we corrected several log files using our approach. The left image of Figure 3 depicts the resulting map of the MIT Killian Court. This is a challenging dataset, since the environment is large (it took 2.5h to record this log file) and contains several nested loops which can rise the problem of particle depletion. As shown in the figure, the map does not contain any inconsistencies like for example double walls. Comparable results have been obtained using the Intel Research, the Austin ACES dataset, shown in the same figure. 11
12 Table 1 Comparison of memory and computational resources for the MIT dataset using a PC with a 1.3 GHz CPU. #particles execution time max. memory our approach 2, min 210 MB our approach 1, min 180 MB our approach min 165 MB RBPF of [21] 150 (memory swapping) 2.9 GB RBPF of [21] min 1.5 GB RBPF of [21] min 1 GB The second experiment is designed to show the advantages of our approach compared to a RBPF-based mapper without our optimizations. For this comparison, we used the open-source mapper provided in [21]. We compared the overall time, needed to correct the MIT Killian Court dataset and the memory used to store the maps. This was done using a (comparably slow) PC with a 1.3 GHz CPU and 1.5 GB RAM. The results of both mapping approaches are summarized in Table 1. In our current implementation, the filter update for each cluster takes in average 20 ms when moving through known terrain and 200 ms when moving through unknown terrain. When actually closing a loop, each particle requires approximatively 2 ms of execution time while the check for the closure takes around 0.3 ms per sample. Since the approximated proposal is not as accurate as the original one, we need more particles to achieve the same robustness in filter convergence and quality of the resulting maps. However, we can maintain more than one order of magnitude more particles while requiring less runtime and memory. In all our experiments, this sufficiently accounted for the less accurately drawn samples. The savings on runtime are mainly caused by transforming an already computed proposal distribution so that it can be used for several particles instead of computing it from scratch each time. The memory savings are due to the fact that all particles within a cluster can share a their local grid maps. Furthermore, the memory usage and runtime of our approach grows comparably slow when increasing the number of particles. The reason is that the complexity of our filter grows mainly with the number of topological hypotheses (particle clusters) which need to be maintained and only indirectly with the number of samples. Note that the maximum memory required by our approach is considerably higher than the amount of memory typically used. There exist a few peaks in the memory usage which arise from a loop closure where several clusters are temporarily created but deleted after a few steps (compare Figure 4). The typical memory usage is around 20% of the maximum usage. 12
13 number of patches patches clusters number of clusters 0 time 0 Figure 4. This plot depicts the number of patches in the memory and the number of clusters over time for the MIT dataset using particles. importance weight approximated exact time approximated exact time approximated exact time Figure 5. Difference in the particle weights caused the approximative computation for three different samples during a loop-closure. The left and middle image show typical results, the right one depicts the one of the worst results during our experiments. Figure 4 depicts the number of patches that need to be stored and the number of clusters during the estimation process of the MIT dataset with 1,500 particles. As can be seen, the number of clusters is typically small until a loop closure occurs. At this point, the number of clusters increases. However, after a short period of time most of the clusters vanish. The last experiment evaluates the error introduced by our approximative importance weight computation when closing a loop. As presented in Eq. (17), we ignore the normalization factors to achieve a faster estimation. We analyzed the loopclosing actions and in most situations the approximation error was small. Figure 5 depicts the differences between the sound computation and our approximation for three different particles during a loop closure. For a more quantitative evaluation between both methods, we computed the KL-divergence (KLD) between the distribution of the importance weights in both cases. It turned out, that the average KLD was only 0.02 (a KLD of 0 means that the distributions are equal and the higher the value the more different are the distributions). Substantiated by the good approximation quality, we ignore the evaluation of η 1 and η 2 when computing the particle importance weight. 7 Conclusion In this paper, we presented efficient optimizations for Rao-Blackwellized particle filters applied to solve the SLAM problem on grid maps. We are able to update the complex posterior requiring substantially less computational and memory re- 13
14 sources. This is achieved by performing the computations only for a set of representatives instead of for all particles. We extended a state-of-the-art mapping system in a way that the computation of the proposal distribution is significantly faster and needs only a fraction of the memory resources. The key idea is that clusters of particles can share large parts of their map model as well as an informed proposal distribution used to draw the next generation of particles. With our optimizations, we are able to maintain more than one order of magnitude more samples and at the same time require less memory and computational resources compared to other state-of-the-art mapping techniques using Rao-Blackwellized particle filters. With this comparably high number of particles that we are able to maintain, we can compensate for the errors introduced by our approximations. Our approach has been implemented, tested, and evaluated based on real robots and standard log files used within the SLAM community to demonstrate the accuracy and benefits of our system. Acknowledgment This work has partly been supported by the German Research Foundation (DFG) under contract number SFB/TR-8 (A3), and by the EC under contract number FP CoSy and FP6-IST BACS. The authors would like to acknowledge Mike Bosse and John Leonard for providing us the dataset of the MIT Killian Court, Patrick Beeson for the ACES dataset, and Dirk Hähnel for the Intel Research Lab. References [1] A. Eliazar, R. Parr, DP-SLAM: Fast, robust simultainous localization and mapping without predetermined landmarks, in: Proc. of the Int. Conf. on Artificial Intelligence (IJCAI), Acapulco, Mexico, 2003, pp [2] G. Grisetti, C. Stachniss, W. Burgard, Improving grid-based slam with Rao- Blackwellized particle filters by adaptive proposals and selective resampling, in: Proc. of the IEEE Int. Conf. on Robotics & Automation (ICRA), Barcelona, Spain, 2005, pp [3] J.-S. Gutmann, K. Konolige, Incremental mapping of large cyclic environments, in: Proc. of the IEEE Int. Symposium on Computational Intelligence in Robotics and Automation (CIRA), Monterey, CA, USA, 1999, pp [4] D. Hähnel, W. Burgard, D. Fox, S. Thrun, An efficient FastSLAM algorithm for generating maps of large-scale cyclic environments from raw laser range measurements, in: Proc. of the IEEE/RSJ Int. Conf. on Intelligent Robots and Systems (IROS), Las Vegas, NV, USA, 2003, pp
15 [5] M. Montemerlo, S. T. D. Koller, B. Wegbreit, FastSLAM 2.0: An improved particle filtering algorithm for simultaneous localization and mapping that provably converges, in: Proc. of the Int. Conf. on Artificial Intelligence (IJCAI), Acapulco, Mexico, 2003, pp [6] M. Montemerlo, S. Thrun, D. Koller, B. Wegbreit, FastSLAM: A factored solution to simultaneous localization and mapping, in: Proc. of the National Conference on Artificial Intelligence (AAAI), Edmonton, Canada, 2002, pp [7] K. Murphy, Bayesian map learning in dynamic environments, in: Proc. of the Conf. on Neural Information Processing Systems (NIPS), Denver, CO, USA, 1999, pp [8] S. Thrun, Y. Liu, D. Koller, A. Ng, Z. Ghahramani, H. Durrant-Whyte, Simultaneous localization and mapping with sparse extended information filters, Int. Journal of Robotics Research 23 (7/8). [9] A. Doucet, J. de Freitas, K. Murphy, S. Russel, Rao-Blackwellized partcile filtering for dynamic bayesian networks, in: Proc. of the Conf. on Uncertainty in Artificial Intelligence (UAI), Stanford, CA, USA, 2000, pp [10] J. Leonard, H. Durrant-Whyte, Mobile robot localization by tracking geometric beacons, IEEE Transactions on Robotics and Automation 7 (4) (1991) [11] R. Smith, M. Self, P. Cheeseman, Estimating uncertain spatial realtionships in robotics, in: I. Cox, G. Wilfong (Eds.), Autonomous Robot Vehicles, Springer Verlag, 1990, pp [12] J. Neira, J. Tardós, Data association in stochastic mapping using the joint compatibility test, IEEE Transactions on Robotics and Automation 17 (6) (2001) [13] U. Frese, G. Hirzinger, Simultaneous localization and mapping - a discussion, in: Proc. of the IJCAI Workshop on Reasoning with Uncertainty in Robotics, Seattle, WA, USA, 2001, pp [14] R. Eustice, M. Walter, J. Leonard, Sparse extended information filters: Insights into sparsification, in: Proc. of the IEEE/RSJ Int. Conf. on Intelligent Robots and Systems (IROS), Edmonton, Cananda, 2005, pp [15] M. Paskin, Thin junction tree filters for simultaneous localization and mapping, in: Proc. of the Int. Conf. on Artificial Intelligence (IJCAI), Acapulco, Mexico, 2003, pp [16] F. Lu, E. Milios, Globally consistent range scan alignment for environment mapping, Journal of Autonomous Robots 4 (1997) [17] B. Lisien, D. S. D. Morales, G. Kantor, I. Rekleitis, H. Choset, Hierarchical simultaneous localization and mapping, in: Proc. of the IEEE/RSJ Int. Conf. on Intelligent Robots and Systems (IROS), Las Vegas, NV, USA, 2003, pp [18] M. Bosse, P. Newman, J. Leonard, S. Teller, An ALTAS framework for scalable mapping, in: Proc. of the IEEE Int. Conf. on Robotics & Automation (ICRA), Taipei, Taiwan, 2003, pp
16 [19] C. Estrada, J. Neira, J. Tardós, Hierachical slam: Real-time accurate mapping of large environments, IEEE Transactions on Robotics 21 (4) (2005) [20] A. Doucet, On sequential simulation-based methods for bayesian filtering, Tech. rep., Signal Processing Group, Dept. of Engeneering, University of Cambridge (1998). [21] C. Stachniss, G. Grisetti, Mapping results obtained with Rao-Blackwellized particle filters, stachnis/research/rbpfmapper/ (2004). [22] C. Stachniss, D. Hähnel, W. Burgard, G. Grisetti, On actively closing loops in gridbased fastslam, Advanced Robotics 19 (10) (2005)
IROS 05 Tutorial. MCL: Global Localization (Sonar) Monte-Carlo Localization. Particle Filters. Rao-Blackwellized Particle Filters and Loop Closing
IROS 05 Tutorial SLAM - Getting it Working in Real World Applications Rao-Blackwellized Particle Filters and Loop Closing Cyrill Stachniss and Wolfram Burgard University of Freiburg, Dept. of Computer
More informationIntroduction to Mobile Robotics SLAM Grid-based FastSLAM. Wolfram Burgard, Cyrill Stachniss, Maren Bennewitz, Diego Tipaldi, Luciano Spinello
Introduction to Mobile Robotics SLAM Grid-based FastSLAM Wolfram Burgard, Cyrill Stachniss, Maren Bennewitz, Diego Tipaldi, Luciano Spinello 1 The SLAM Problem SLAM stands for simultaneous localization
More informationRecovering Particle Diversity in a Rao-Blackwellized Particle Filter for SLAM After Actively Closing Loops
Recovering Particle Diversity in a Rao-Blackwellized Particle Filter for SLAM After Actively Closing Loops Cyrill Stachniss University of Freiburg Department of Computer Science D-79110 Freiburg, Germany
More informationProbabilistic Robotics. FastSLAM
Probabilistic Robotics FastSLAM The SLAM Problem SLAM stands for simultaneous localization and mapping The task of building a map while estimating the pose of the robot relative to this map Why is SLAM
More informationProbabilistic Robotics
Probabilistic Robotics FastSLAM Sebastian Thrun (abridged and adapted by Rodrigo Ventura in Oct-2008) The SLAM Problem SLAM stands for simultaneous localization and mapping The task of building a map while
More informationMobile Robot Mapping and Localization in Non-Static Environments
Mobile Robot Mapping and Localization in Non-Static Environments Cyrill Stachniss Wolfram Burgard University of Freiburg, Department of Computer Science, D-790 Freiburg, Germany {stachnis burgard @informatik.uni-freiburg.de}
More informationParticle Filters. CSE-571 Probabilistic Robotics. Dependencies. Particle Filter Algorithm. Fast-SLAM Mapping
CSE-571 Probabilistic Robotics Fast-SLAM Mapping Particle Filters Represent belief by random samples Estimation of non-gaussian, nonlinear processes Sampling Importance Resampling (SIR) principle Draw
More informationA Tree Parameterization for Efficiently Computing Maximum Likelihood Maps using Gradient Descent
A Tree Parameterization for Efficiently Computing Maximum Likelihood Maps using Gradient Descent Giorgio Grisetti Cyrill Stachniss Slawomir Grzonka Wolfram Burgard University of Freiburg, Department of
More informationFinal project: 45% of the grade, 10% presentation, 35% write-up. Presentations: in lecture Dec 1 and schedule:
Announcements PS2: due Friday 23:59pm. Final project: 45% of the grade, 10% presentation, 35% write-up Presentations: in lecture Dec 1 and 3 --- schedule: CS 287: Advanced Robotics Fall 2009 Lecture 24:
More informationAnnouncements. Recap Landmark based SLAM. Types of SLAM-Problems. Occupancy Grid Maps. Grid-based SLAM. Page 1. CS 287: Advanced Robotics Fall 2009
Announcements PS2: due Friday 23:59pm. Final project: 45% of the grade, 10% presentation, 35% write-up Presentations: in lecture Dec 1 and 3 --- schedule: CS 287: Advanced Robotics Fall 2009 Lecture 24:
More informationParticle Filter in Brief. Robot Mapping. FastSLAM Feature-based SLAM with Particle Filters. Particle Representation. Particle Filter Algorithm
Robot Mapping FastSLAM Feature-based SLAM with Particle Filters Cyrill Stachniss Particle Filter in Brief! Non-parametric, recursive Bayes filter! Posterior is represented by a set of weighted samples!
More informationSimultaneous Localization and Mapping
Sebastian Lembcke SLAM 1 / 29 MIN Faculty Department of Informatics Simultaneous Localization and Mapping Visual Loop-Closure Detection University of Hamburg Faculty of Mathematics, Informatics and Natural
More informationL17. OCCUPANCY MAPS. NA568 Mobile Robotics: Methods & Algorithms
L17. OCCUPANCY MAPS NA568 Mobile Robotics: Methods & Algorithms Today s Topic Why Occupancy Maps? Bayes Binary Filters Log-odds Occupancy Maps Inverse sensor model Learning inverse sensor model ML map
More informationHow to Learn Accurate Grid Maps with a Humanoid
How to Learn Accurate Grid Maps with a Humanoid Cyrill Stachniss Maren Bennewitz Giorgio Grisetti Sven Behnke Wolfram Burgard Abstract Humanoids have recently become a popular research platform in the
More informationUsing the Topological Skeleton for Scalable Global Metrical Map-Building
Using the Topological Skeleton for Scalable Global Metrical Map-Building Joseph Modayil, Patrick Beeson, and Benjamin Kuipers Intelligent Robotics Lab Department of Computer Sciences University of Texas
More informationThis chapter explains two techniques which are frequently used throughout
Chapter 2 Basic Techniques This chapter explains two techniques which are frequently used throughout this thesis. First, we will introduce the concept of particle filters. A particle filter is a recursive
More informationLazy localization using the Frozen-Time Smoother
28 IEEE International Conference on Robotics and Automation Pasadena, CA, USA, May 19-23, 28 Lazy localization using the Frozen-Time Smoother Andrea Censi and Gian Diego Tipaldi Abstract We present a new
More informationRobust Monte-Carlo Localization using Adaptive Likelihood Models
Robust Monte-Carlo Localization using Adaptive Likelihood Models Patrick Pfaff 1, Wolfram Burgard 1, and Dieter Fox 2 1 Department of Computer Science, University of Freiburg, Germany, {pfaff,burgard}@informatik.uni-freiburg.de
More informationIntroduction to Mobile Robotics SLAM Landmark-based FastSLAM
Introduction to Mobile Robotics SLAM Landmark-based FastSLAM Wolfram Burgard, Cyrill Stachniss, Maren Bennewitz, Diego Tipaldi, Luciano Spinello Partial slide courtesy of Mike Montemerlo 1 The SLAM Problem
More informationImproved Simultaneous Localization and Mapping using a Dual Representation of the Environment
Improved Simultaneous Localization and Mapping using a Dual Representation o the Environment Kai M. Wurm Cyrill Stachniss Giorgio Grisetti Wolram Burgard University o Freiburg, Dept. o Computer Science,
More informationJurnal Teknologi PARTICLE FILTER IN SIMULTANEOUS LOCALIZATION AND MAPPING (SLAM) USING DIFFERENTIAL DRIVE MOBILE ROBOT. Full Paper
Jurnal Teknologi PARTICLE FILTER IN SIMULTANEOUS LOCALIZATION AND MAPPING (SLAM) USING DIFFERENTIAL DRIVE MOBILE ROBOT Norhidayah Mohamad Yatim a,b, Norlida Buniyamin a a Faculty of Engineering, Universiti
More informationL10. PARTICLE FILTERING CONTINUED. NA568 Mobile Robotics: Methods & Algorithms
L10. PARTICLE FILTERING CONTINUED NA568 Mobile Robotics: Methods & Algorithms Gaussian Filters The Kalman filter and its variants can only model (unimodal) Gaussian distributions Courtesy: K. Arras Motivation
More informationKaijen Hsiao. Part A: Topics of Fascination
Kaijen Hsiao Part A: Topics of Fascination 1) I am primarily interested in SLAM. I plan to do my project on an application of SLAM, and thus I am interested not only in the method we learned about in class,
More informationWhat is the SLAM problem?
SLAM Tutorial Slides by Marios Xanthidis, C. Stachniss, P. Allen, C. Fermuller Paul Furgale, Margarita Chli, Marco Hutter, Martin Rufli, Davide Scaramuzza, Roland Siegwart What is the SLAM problem? The
More informationVisual Bearing-Only Simultaneous Localization and Mapping with Improved Feature Matching
Visual Bearing-Only Simultaneous Localization and Mapping with Improved Feature Matching Hauke Strasdat, Cyrill Stachniss, Maren Bennewitz, and Wolfram Burgard Computer Science Institute, University of
More informationSLAM: Robotic Simultaneous Location and Mapping
SLAM: Robotic Simultaneous Location and Mapping William Regli Department of Computer Science (and Departments of ECE and MEM) Drexel University Acknowledgments to Sebastian Thrun & others SLAM Lecture
More informationGrid-Based Models for Dynamic Environments
Grid-Based Models for Dynamic Environments Daniel Meyer-Delius Maximilian Beinhofer Wolfram Burgard Abstract The majority of existing approaches to mobile robot mapping assume that the world is, an assumption
More informationEnvironment Identification by Comparing Maps of Landmarks
Environment Identification by Comparing Maps of Landmarks Jens-Steffen Gutmann Masaki Fukuchi Kohtaro Sabe Digital Creatures Laboratory Sony Corporation -- Kitashinagawa, Shinagawa-ku Tokyo, 4- Japan Email:
More informationIntroduction to Mobile Robotics. SLAM: Simultaneous Localization and Mapping
Introduction to Mobile Robotics SLAM: Simultaneous Localization and Mapping The SLAM Problem SLAM is the process by which a robot builds a map of the environment and, at the same time, uses this map to
More informationSimultaneous Localization and Mapping! SLAM
Overview Simultaneous Localization and Mapping! SLAM What is SLAM? Qualifying Oral Examination Why do SLAM? Who, When, Where?!! A very brief literature overview Andrew Hogue hogue@cs.yorku.ca How has the
More informationRobot Mapping. Hierarchical Pose-Graphs for Online Mapping. Gian Diego Tipaldi, Wolfram Burgard
Robot Mapping Hierarchical Pose-Graphs for Online Mapping Gian Diego Tipaldi, Wolfram Burgard 1 Graph-Based SLAM Measurements connect the poses of the robot while it is moving Measurements are inherently
More informationTracking Multiple Moving Objects with a Mobile Robot
Tracking Multiple Moving Objects with a Mobile Robot Dirk Schulz 1 Wolfram Burgard 2 Dieter Fox 3 Armin B. Cremers 1 1 University of Bonn, Computer Science Department, Germany 2 University of Freiburg,
More informationStereo vision SLAM: Near real-time learning of 3D point-landmark and 2D occupancy-grid maps using particle filters.
Stereo vision SLAM: Near real-time learning of 3D point-landmark and 2D occupancy-grid maps using particle filters. Pantelis Elinas and James J. Little University of British Columbia Laboratory for Computational
More informationGraph-Based SLAM (Chap. 15) Robot Mapping. Hierarchical Pose-Graphs for Online Mapping. Graph-Based SLAM (Chap. 15) Graph-Based SLAM (Chap.
Robot Mapping Hierarchical Pose-Graphs for Online Mapping Graph-Based SLAM (Chap. 15)! Constraints connect the poses of the robot while it is moving! Constraints are inherently uncertain Cyrill Stachniss
More informationProbabilistic Robotics
Probabilistic Robotics Sebastian Thrun Wolfram Burgard Dieter Fox The MIT Press Cambridge, Massachusetts London, England Preface xvii Acknowledgments xix I Basics 1 1 Introduction 3 1.1 Uncertainty in
More informationImplementation of Odometry with EKF for Localization of Hector SLAM Method
Implementation of Odometry with EKF for Localization of Hector SLAM Method Kao-Shing Hwang 1 Wei-Cheng Jiang 2 Zuo-Syuan Wang 3 Department of Electrical Engineering, National Sun Yat-sen University, Kaohsiung,
More informationGaussian Multi-Robot SLAM
Submitted to NIPS*2003 Gaussian Multi-Robot SLAM Yufeng Liu and Sebastian Thrun School of Computer Science Carnegie Mellon University Abstract We present an algorithm for the multi-robot simultaneous localization
More informationMapping and Exploration with Mobile Robots using Coverage Maps
Mapping and Exploration with Mobile Robots using Coverage Maps Cyrill Stachniss Wolfram Burgard University of Freiburg Department of Computer Science D-79110 Freiburg, Germany {stachnis burgard}@informatik.uni-freiburg.de
More informationHumanoid Robotics. Monte Carlo Localization. Maren Bennewitz
Humanoid Robotics Monte Carlo Localization Maren Bennewitz 1 Basis Probability Rules (1) If x and y are independent: Bayes rule: Often written as: The denominator is a normalizing constant that ensures
More informationPractical Course WS12/13 Introduction to Monte Carlo Localization
Practical Course WS12/13 Introduction to Monte Carlo Localization Cyrill Stachniss and Luciano Spinello 1 State Estimation Estimate the state of a system given observations and controls Goal: 2 Bayes Filter
More informationA Genetic Algorithm for Simultaneous Localization and Mapping
A Genetic Algorithm for Simultaneous Localization and Mapping Tom Duckett Centre for Applied Autonomous Sensor Systems Dept. of Technology, Örebro University SE-70182 Örebro, Sweden http://www.aass.oru.se
More informationProbabilistic Robotics
Probabilistic Robotics Discrete Filters and Particle Filters Models Some slides adopted from: Wolfram Burgard, Cyrill Stachniss, Maren Bennewitz, Kai Arras and Probabilistic Robotics Book SA-1 Probabilistic
More informationAN INCREMENTAL SLAM ALGORITHM FOR INDOOR AUTONOMOUS NAVIGATION
20th IMEKO TC4 International Symposium and 18th International Workshop on ADC Modelling and Testing Research on Electric and Electronic Measurement for the Economic Upturn Benevento, Italy, September 15-17,
More informationIntroduction to Mobile Robotics Bayes Filter Particle Filter and Monte Carlo Localization. Wolfram Burgard
Introduction to Mobile Robotics Bayes Filter Particle Filter and Monte Carlo Localization Wolfram Burgard 1 Motivation Recall: Discrete filter Discretize the continuous state space High memory complexity
More informationLocalization and Map Building
Localization and Map Building Noise and aliasing; odometric position estimation To localize or not to localize Belief representation Map representation Probabilistic map-based localization Other examples
More informationConstant/Linear Time Simultaneous Localization and Mapping for Dense Maps
Constant/Linear Time Simultaneous Localization and Mapping for Dense Maps Austin I. Eliazar Ronald Parr Department of Computer Science Duke University Durham, NC 27708 feliazar,parrg@cs.duke.edu Abstract
More informationRobot Mapping. A Short Introduction to the Bayes Filter and Related Models. Gian Diego Tipaldi, Wolfram Burgard
Robot Mapping A Short Introduction to the Bayes Filter and Related Models Gian Diego Tipaldi, Wolfram Burgard 1 State Estimation Estimate the state of a system given observations and controls Goal: 2 Recursive
More informationAUTONOMOUS SYSTEMS. PROBABILISTIC LOCALIZATION Monte Carlo Localization
AUTONOMOUS SYSTEMS PROBABILISTIC LOCALIZATION Monte Carlo Localization Maria Isabel Ribeiro Pedro Lima With revisions introduced by Rodrigo Ventura Instituto Superior Técnico/Instituto de Sistemas e Robótica
More informationImproving Simultaneous Mapping and Localization in 3D Using Global Constraints
Improving Simultaneous Mapping and Localization in 3D Using Global Constraints Rudolph Triebel and Wolfram Burgard Department of Computer Science, University of Freiburg George-Koehler-Allee 79, 79108
More informationPROGRAMA DE CURSO. Robotics, Sensing and Autonomous Systems. SCT Auxiliar. Personal
PROGRAMA DE CURSO Código Nombre EL7031 Robotics, Sensing and Autonomous Systems Nombre en Inglés Robotics, Sensing and Autonomous Systems es Horas de Horas Docencia Horas de Trabajo SCT Docentes Cátedra
More informationRobot Mapping. TORO Gradient Descent for SLAM. Cyrill Stachniss
Robot Mapping TORO Gradient Descent for SLAM Cyrill Stachniss 1 Stochastic Gradient Descent Minimize the error individually for each constraint (decomposition of the problem into sub-problems) Solve one
More informationA Comparison of SLAM Algorithms Based on a Graph of Relations
A Comparison of SLAM Algorithms Based on a Graph of Relations W. Burgard, C. Stachniss, G. Grisetti, B. Steder, R. Kümmerle, C. Dornhege, M. Ruhnke, Alexander Kleiner and Juan D. Tardós Post Print N.B.:
More informationPacSLAM Arunkumar Byravan, Tanner Schmidt, Erzhuo Wang
PacSLAM Arunkumar Byravan, Tanner Schmidt, Erzhuo Wang Project Goals The goal of this project was to tackle the simultaneous localization and mapping (SLAM) problem for mobile robots. Essentially, the
More informationRevising Stereo Vision Maps in Particle Filter Based SLAM using Localisation Confidence and Sample History
Revising Stereo Vision Maps in Particle Filter Based SLAM using Localisation Confidence and Sample History Simon Thompson and Satoshi Kagami Digital Human Research Center National Institute of Advanced
More informationProbabilistic Robotics
Probabilistic Robotics Bayes Filter Implementations Discrete filters, Particle filters Piecewise Constant Representation of belief 2 Discrete Bayes Filter Algorithm 1. Algorithm Discrete_Bayes_filter(
More informationMonte Carlo Localization using Dynamically Expanding Occupancy Grids. Karan M. Gupta
1 Monte Carlo Localization using Dynamically Expanding Occupancy Grids Karan M. Gupta Agenda Introduction Occupancy Grids Sonar Sensor Model Dynamically Expanding Occupancy Grids Monte Carlo Localization
More informationImprovements for an appearance-based SLAM-Approach for large-scale environments
1 Improvements for an appearance-based SLAM-Approach for large-scale environments Alexander Koenig Jens Kessler Horst-Michael Gross Neuroinformatics and Cognitive Robotics Lab, Ilmenau University of Technology,
More informationRobot Mapping. Grid Maps. Gian Diego Tipaldi, Wolfram Burgard
Robot Mapping Grid Maps Gian Diego Tipaldi, Wolfram Burgard 1 Features vs. Volumetric Maps Courtesy: D. Hähnel Courtesy: E. Nebot 2 Features So far, we only used feature maps Natural choice for Kalman
More informationarxiv: v1 [cs.ro] 18 Jul 2016
GENERATIVE SIMULTANEOUS LOCALIZATION AND MAPPING (G-SLAM) NIKOS ZIKOS AND VASSILIOS PETRIDIS arxiv:1607.05217v1 [cs.ro] 18 Jul 2016 Abstract. Environment perception is a crucial ability for robot s interaction
More informationAdapting the Sample Size in Particle Filters Through KLD-Sampling
Adapting the Sample Size in Particle Filters Through KLD-Sampling Dieter Fox Department of Computer Science & Engineering University of Washington Seattle, WA 98195 Email: fox@cs.washington.edu Abstract
More informationActive Monte Carlo Localization in Outdoor Terrains using Multi-Level Surface Maps
Active Monte Carlo Localization in Outdoor Terrains using Multi-Level Surface Maps Rainer Kümmerle 1, Patrick Pfaff 1, Rudolph Triebel 2, and Wolfram Burgard 1 1 Department of Computer Science, University
More informationRobotics and Autonomous Systems
Robotics and Autonomous Systems 58 (2010) 140 148 Contents lists available at ScienceDirect Robotics and Autonomous Systems journal homepage: www.elsevier.com/locate/robot Bridging the gap between eature-
More informationImproving Data Association in Vision-based SLAM
Proceedings of the 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems October 9-15 2006 Beijing China Improving Data Association in Vision-based SLAM Arturo Gil* Oscar Reinoso* Oscar
More informationOverview. EECS 124, UC Berkeley, Spring 2008 Lecture 23: Localization and Mapping. Statistical Models
Introduction ti to Embedded dsystems EECS 124, UC Berkeley, Spring 2008 Lecture 23: Localization and Mapping Gabe Hoffmann Ph.D. Candidate, Aero/Astro Engineering Stanford University Statistical Models
More informationExploring Unknown Environments with Mobile Robots using Coverage Maps
Exploring Unknown Environments with Mobile Robots using Coverage Maps Cyrill Stachniss Wolfram Burgard University of Freiburg Department of Computer Science D-79110 Freiburg, Germany * Abstract In this
More informationAn Experimental Comparison of Localization Methods Continued
An Experimental Comparison of Localization Methods Continued Jens-Steffen Gutmann Digital Creatures Laboratory Sony Corporation, Tokyo, Japan Email: gutmann@ieee.org Dieter Fox Department of Computer Science
More informationFast Randomized Planner for SLAM Automation
Fast Randomized Planner for SLAM Automation Amey Parulkar*, Piyush Shukla*, K Madhava Krishna+ Abstract In this paper, we automate the traditional problem of Simultaneous Localization and Mapping (SLAM)
More informationA Relative Mapping Algorithm
A Relative Mapping Algorithm Jay Kraut Abstract This paper introduces a Relative Mapping Algorithm. This algorithm presents a new way of looking at the SLAM problem that does not use Probability, Iterative
More informationD-SLAM: Decoupled Localization and Mapping for Autonomous Robots
D-SLAM: Decoupled Localization and Mapping for Autonomous Robots Zhan Wang, Shoudong Huang, and Gamini Dissanayake ARC Centre of Excellence for Autonomous Systems (CAS), Faculty of Engineering, University
More informationDesign and analysis of a framework for real-time vision-based SLAM using Rao-Blackwellised particle filters
Design and analysis of a framework for real-time vision-based SLAM using Rao-Blackwellised particle filters Robert Sim, Pantelis Elinas, Matt Griffin, Alex Shyr and James J. Little Department of Computer
More informationSimultaneous Localization and Mapping with Unknown Data Association Using FastSLAM
Simultaneous Localization and Mapping with Unknown Data Association Using FastSLAM Michael Montemerlo, Sebastian Thrun Abstract The Extended Kalman Filter (EKF) has been the de facto approach to the Simultaneous
More informationAutonomous vision-based exploration and mapping using hybrid maps and Rao-Blackwellised particle filters
Autonomous vision-based exploration and mapping using hybrid maps and Rao-Blackwellised particle filters Robert Sim and James J. Little Department of Computer Science University of British Columbia 2366
More informationHigh Quality Pose Estimation by Aligning Multiple Scans to a Latent Map
High Quality Pose Estimation by Aligning Multiple Scans to a Latent Map Qi-Xing Huang Stanford University 450 Serra Mall Stanford, CA 94305 Abstract We introduce a method for fast and accurate registration
More informationUsing Artificial Landmarks to Reduce the Ambiguity in the Environment of a Mobile Robot
Using Artificial Landmarks to Reduce the Ambiguity in the Environment of a Mobile Robot Daniel Meyer-Delius Maximilian Beinhofer Alexander Kleiner Wolfram Burgard Abstract Robust and reliable localization
More informationEfficient Failure Detection for Mobile Robots Using Mixed-Abstraction Particle Filters
Efficient Failure Detection for Mobile Robots Using Mixed-Abstraction Particle Filters Christian Plagemann, Cyrill Stachniss, and Wolfram Burgard University of Freiburg Georges-Koehler-Allee 7911 Freiburg,
More informationCombined Trajectory Planning and Gaze Direction Control for Robotic Exploration
Combined Trajectory Planning and Gaze Direction Control for Robotic Exploration Georgios Lidoris, Kolja Kühnlenz, Dirk Wollherr and Martin Buss Institute of Automatic Control Engineering (LSR) Technische
More informationD-SLAM: Decoupled Localization and Mapping for Autonomous Robots
D-SLAM: Decoupled Localization and Mapping for Autonomous Robots Zhan Wang, Shoudong Huang, and Gamini Dissanayake ARC Centre of Excellence for Autonomous Systems (CAS) Faculty of Engineering, University
More informationEfficient Estimation of Accurate Maximum Likelihood Maps in 3D
Efficient Estimation of Accurate Maximum Likelihood Maps in 3D Giorgio Grisetti Slawomir Grzonka Cyrill Stachniss Patrick Pfaff Wolfram Burgard Abstract Learning maps is one of the fundamental tasks of
More informationReal Time Data Association for FastSLAM
Real Time Data Association for FastSLAM Juan Nieto, Jose Guivant, Eduardo Nebot Australian Centre for Field Robotics, The University of Sydney, Australia fj.nieto,jguivant,nebotg@acfr.usyd.edu.au Sebastian
More informationPeople Tracking with Anonymous and ID-Sensors Using Rao-Blackwellised Particle Filters
People Tracking with Anonymous and ID-Sensors Using Rao-Blackwellised Particle Filters Dirk Schulz, Dieter Fox, and Jeffrey Hightower Dcpt. of Computer Science & Engineering University of Washington Seattle,
More informationSLAM using Visual Scan-Matching with Distinguishable 3D Points
SLAM using Visual Scan-Matching with Distinguishable 3D Points Federico Bertolli, Patric Jensfelt, and Henrik I. Christensen Centre for Autonomous Systems Royal Institute of Technology, Stockholm, Sweden
More informationAdapting the Sample Size in Particle Filters Through KLD-Sampling
Adapting the Sample Size in Particle Filters Through KLD-Sampling Dieter Fox Department of Computer Science & Engineering University of Washington Seattle, WA 98195 Email: fox@cs.washington.edu Abstract
More informationAppearance-based Concurrent Map Building and Localization
Appearance-based Concurrent Map Building and Localization Josep M. Porta and Ben J.A. Kröse IAS Group, Informatics Institute, University of Amsterdam Kruislaan 403, 1098SJ, Amsterdam, The Netherlands {porta,krose}@science.uva.nl
More informationParticle Filters for Robot Navigation
Particle Filters for Robot Navigation Cyrill Stachniss University of Freiburg stachnis@informatik.uni-freiburg.de Wolfram Burgard University of Freiburg burgard@informatik.uni-freiburg.de Boston Delft
More informationties of the Hough Transform for recognizing lines from a sets of points, as well as for calculating the displacement between the estimated and the act
Global Hough Localization for Mobile Robots in Polygonal Environments Giorgio Grisetti, Luca Iocchi, Daniele Nardi Dipartimento di Informatica e Sistemistica Universit a di Roma La Sapienza" Via Salaria
More informationResearch Article A Light-and-Fast SLAM Algorithm for Robots in Indoor Environments Using Line Segment Map
Journal of Robotics Volume 2011, Article ID 257852, 12 pages doi:10.1155/2011/257852 Research Article A Light-and-Fast SLAM Algorithm for Robots in Indoor Environments Using Line Segment Map Bor-Woei Kuo,
More informationRobot Localization based on Geo-referenced Images and G raphic Methods
Robot Localization based on Geo-referenced Images and G raphic Methods Sid Ahmed Berrabah Mechanical Department, Royal Military School, Belgium, sidahmed.berrabah@rma.ac.be Janusz Bedkowski, Łukasz Lubasiński,
More informationMobile Robot Map Learning from Range Data in Dynamic Environments
1 Mobile Robot Map Learning from Range Data in Dynamic Environments Wolfram Burgard 1 Cyrill Stachniss 1,2 Dirk Hähnel 1,3 1 University of Freiburg, Dept. of Computer Science, 79110 Freiburg, Germany 2
More informationA Markov Chain Monte Carlo Approach to Closing the Loop in SLAM
A arkov Chain onte Carlo Approach to Closing the Loop in SLA ichael Kaess and Frank Dellaert College of Computing Georgia Institute of Technology 801 Atlantic Drive, Atlanta, GA 30332, USA {kaess,dellaert}@cc.gatech.edu
More informationInformation-Theoretic Compression of Pose Graphs for Laser-Based SLAM
Information-Theoretic Compression of Pose Graphs for Laser-Based SLAM Henrik Kretzschmar Cyrill Stachniss Department of Computer Science, University of Freiburg, Germany Abstract In graph-based simultaneous
More informationEvaluation of Pose Only SLAM
The 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems October 18-22, 2010, Taipei, Taiwan Evaluation of Pose Only SLAM Gibson Hu, Shoudong Huang and Gamini Dissanayake Abstract In
More informationMulti-Agent Deterministic Graph Mapping via Robot Rendezvous
202 IEEE International Conference on Robotics and Automation RiverCentre, Saint Paul, Minnesota, USA May -8, 202 Multi-Agent Deterministic Graph Mapping via Robot Rendezvous Chaohui Gong, Stephen Tully,
More informationA scalable hybrid multi-robot SLAM method for highly detailed maps Pfingsthorn, M.; Slamet, B.; Visser, A.
UvA-DARE (Digital Academic Repository) A scalable hybrid multi-robot SLAM method for highly detailed maps Pfingsthorn, M.; Slamet, B.; Visser, A. Published in: Lecture Notes in Computer Science DOI: 10.1007/978-3-540-68847-1_48
More informationTORO - Efficient Constraint Network Optimization for SLAM
TORO - Efficient Constraint Network Optimization for SLAM Cyrill Stachniss Joint work with Giorgio Grisetti and Wolfram Burgard Special thanks to and partial slide courtesy of: Diego Tipaldi, Edwin Olson,
More informationGaussian Processes, SLAM, Fast SLAM and Rao-Blackwellization
Statistical Techniques in Robotics (16-831, F11) Lecture#20 (November 21, 2011) Gaussian Processes, SLAM, Fast SLAM and Rao-Blackwellization Lecturer: Drew Bagnell Scribes: Junier Oliva 1 1 Comments on
More informationAlgorithms for Simultaneous Localization and Mapping
Algorithms for Simultaneous Localization and Mapping Yuncong Chen February 3, 2013 Abstract Simultaneous Localization and Mapping (SLAM) is the problem in which a sensor-enabled mobile robot incrementally
More informationSegmented DP-SLAM I. INTRODUCTION
2013 I/RSJ International Conference on Intelligent Robots and Systems (IROS) November 3-7, 2013. okyo, Japan Segmented DP-SAM Renan Maffei, Vitor Jorge, Mariana Kolberg, dson Prestes Instituto de Informática
More informationSLAM With Sparse Sensing
To appear in the 2006 IEEE International Conference on Robotics & Automation (ICRA 2006) SLAM With Sparse Sensing Kristopher R. Beevers Wesley H. Huang Rensselaer Polytechnic Institute, Department of Computer
More informationExperimental Analysis of Dynamic Covariance Scaling for Robust Map Optimization Under Bad Initial Estimates
Experimental Analysis of Dynamic Covariance Scaling for Robust Map Optimization Under Bad Initial Estimates Pratik Agarwal Giorgio Grisetti Gian Diego Tipaldi Luciano Spinello Wolfram Burgard Cyrill Stachniss
More informationECE276A: Sensing & Estimation in Robotics Lecture 11: Simultaneous Localization and Mapping using a Particle Filter
ECE276A: Sensing & Estimation in Robotics Lecture 11: Simultaneous Localization and Mapping using a Particle Filter Lecturer: Nikolay Atanasov: natanasov@ucsd.edu Teaching Assistants: Siwei Guo: s9guo@eng.ucsd.edu
More information