IN recent years, NASA s Mars Exploration Rovers (MERs)
|
|
- Dominic Elvin Bond
- 5 years ago
- Views:
Transcription
1 Robust Landmark Estimation for SLAM in Dynamic Outdoor Environment Atsushi SAKAI, Teppei SAITOH and Yoji KURODA Meiji University, Department of Mechanical Engineering, Higashimita, Tama-ku, Kawasaki, Kanagawa, Japan Abstract In this paper, we propose techniques which make SLAM accurate and practical in dynamic outdoor environment. In order to achieve the objective, stable feature detection by a laser range finder and efficient data management are introduced. The stable feature detection is used to select static and characteristic landmarks, it is possible to estimate every position of landmark accurately in the dynamic environment. The data management is introduced in order to decrease computational time and localization error of SLAM. Furthermore, for estimating landmark and robot s position accurately, unscented transformation based sampling technique is also adopted. As a result, it is shown that the computing time and the maximum position error of SLAM decreases by % compared with typical landmark estimation, and position error of SLAM with unscented transformation becomes more accurate compared with FastSLAM2. in the dynamic outdoor environment. Index Terms FastSLAM, Landmark estimation, Data association, Unscented Transformation. I. INTRODUCTION IN recent years, NASA s Mars Exploration Rovers (MERs) carried out various scientific discoveries in the surface of the Mars [1]. In the future, robots will operate in various environments, not only other planets but also such as undersea, underground, and so on. An important problem at the time of a exploration by a robot is estimation of localization and map. In the environment (e.g. other planets,underground), it is difficult to acquire globally accurate position (e.g. GPS) and information of ambient surrounding. In order for a robot to operate autonomously in the environment, it is required that technologys of the estimation of robot s position and map accurately. The Simultaneous Localization and Mapping, also known as SLAM, has gotten a lot of attention in the mobile robotics literature [2]. The problem of SLAM is building a map of an environment from landmark measurements obtained from a moving robot. But a robot motion involves error, the mapping problem must induce a robot localization problem. To solve this problems, various solutions to the SLAM problem have been studied, such as using the Extended Kalman Filter (EKF), the information filter, and the Graph SLAM [3][4][5]. In these algorithms, FastSLAM algorithm is one of the algorithms which succeed at doing accurate SLAM in outdoor environments[6]. The FastSLAM algorithm is a solution to stochastic SLAM that is based on a particle filter to approximate the ideal recursive the Bayesian filter. FastSLAM algorithm has two advantages: First, the timecomplexity of SLAM is small;hence the appelation Fast. Because FastSLAM is separated the mapping problem and the localization problem. Second, FastSLAM algorithm is robust to failure of data association. If observations are associated correctly in some particles and incorrectly the others, the incorrect particles will receive lower importance weight and being removed in future re-sampling step. Because of these advantages, FastSLAM made precise and robust SLAM possible. Besides, in order to do SLAM with more accurate, the new algorithm FastSLAM2. was proposed as developed alogorithm of FastSLAM [7]. In FastSLAM2., a proposal distribution relies not only on the motion estimation (as is the case in FastSLAM), but also on the most recent sensor measurement when proposing a new robot pose. The technique enable to estimate the true distribution. Alternatively, because the sampling accuracy is improved by this technique, the SLAM can be calculated with a few particles. The timecomplexity of SLAM is more small than using FastSLAM. FastSLAM2. can do SLAM with high accuracy and highspeed. However, using FastSLAM algorithm, it is difficult to excute SLAM with high accuracy and high speed in the environment where complicated like outdoor environment and have two or more moving objects. For example, failures of data association increase in outdoor environment compared with indoor environment. This is attributed to spurious landmark from sensor noise and dynamic objects. For this reason, error of localization and map increase, then the calculation of SLAM may diverge. Besides, it is known that calculation time of FastSLAM increase logarithmically observed landmarks increase [6]. The more a robot operate a long distance, the more the calculation cost of SLAM increase. In consequence, the SLAM can not be done on the fly. For these reason, with holding only static and characteristic landmarks on a map, failure of data association must be prevented and the calculation time must be reduced. Moreover, Localization and mapping are the same problems in SLAM. In order to create a more accurate map, we have to estimate robot s position accurately. The particle filter in the FastSLAM relies on the importance sampling. Therefore, the FastSLAM requires the design of proposal distributions that can approximate the ture posterior reasonably well. FastSLAM2. algorithm samples using the formula of EKF so that particles are sampled with high accurately. Although, there are problems in it: The first is that, in EKF, a nonlinear model is approximated with Jacobian matrices.
2 If the nonlinearity of the model is high, the accuracy of approximation becomes bad. The second is that we have to develop the expression for Jacobian matrices of motion and observation models. However, this derivation is difficult when each model is complicated. Uhlmann et al proposed the Unscented filter as an alternative to the EKF for recursive state estimation [8]. This approach is used to avoid the analytical linerization based on Taylor series expansion of both the motion and the measurement model. Merwe et al introduced the Unscented Particle Filter (UPF) algorithm [9]. This algorithm uses unscented transformation for a proposal distribution in the sampling step of a particle filter. Because of using unscented transform, they enabled to do precise estimations in the nonlinear models. In this paper, we propose a set of methods of landmark estimation for high-speed and accurately SLAM on the basis of FastSLAM algorithm. To estimate a landmark accurately and to decrease the time-complexity of SLAM, stable feature detection and data management are important. We introduce that stable feature detection with a laser range finder and efficient data management. The feature detection and the data management involved three techniques respectively. Firstly, we propose following methods in the feature detection: 1) Removing dynamic objects and sensor noise with difference processing 2) Detecting feature points sparsely and evenly 3) Adjusting a threshold value of data association with a landmark density Taking in these techniques, we show that detecting feature points becomes stable, then these feature points make easy to do data association. Secondly, we also propose these methods in the data management: 1) Calculating landmark s existence probability 2) Using the landmark exclusivity for data association 3) Predicting importance weights with observation range Because of these techniques, we show that the computational time and a position error are decreased and data association becomes robust. Furthermore, we take in a sampling method using unscented transformation. Because of introducing it and the landmark estimation we proposed, we show that the our SLAM is more accurate than FastSLAM2. algorithm. II. FASTSLAM ALGORITHM SLAM is the problem of determining robot poses x t and the position of all landmarks θ from measurements z t = z 1,,z t and robot s controls u t = u 1,,u t. In probabilistic terms, this is expressed by the posterior p(x t,θ z t,u t ), where we use the superscript to refer to a set of variables from time 1 to time t. If the correspondences of landmark each time are known, the SLAM posterior is : p(x t,θ z t,u t,n t ) (1) where n t is the correspondence variables. FastSLAM algorithm divides the problem of localization and mapping, and calculates each probability. The posterior (1) be factored as follows: p(x t,θ z t,u t,n t ) = p(x t z t,u t,n t ) N p(θ k x t,u t,z t,n t )(2) k=1 where k is a number of each landmarks, N is a total of landmarks. The FastSLAM algorithm implements the robot s position estimator p(x t z t,u t,n t ) using a particle filter, and each landmark position estimators p(θ k x t,u t,z t,n t ) using low dimension Kalman filters. Dividing problems of localization and mapping, the FastSLAM algorithm makes decreasing the time-complexity possible. Furthermore, each particle in the particle filter has its own local map, FastSLAM is robust to a failure of data association. FastSLAM2. was proposed as development algorithm of FastSLAM. In FastSLAM2. algorithm, robot s poses are sampled under a consideration of both the motion u t and the measurement z t. The i-th particle is sampled by a following probability expression: x [i] t p(x t x [i] t,z t,u t,θ [i] ) (3) where x [i] t is the variable which is the i-th particle s state, θ [k] is the variable that the i-th particle has the landmark map. The accuracy of localization improved by the use of this technique. Because of it, the number of particles could be held down to a small number, and the time-complexity of FastSLAM2. is small than FastSLAM. III. LANDMARK ESTIMATION In landmark based SLAM which uses LRF, the feature detection and the data association are very important problems. In this paper, we propose a set of techniques to solve these problems effectively. A. Feature detection In FastSLAM, a feature point are served as a candidate of a landmark. A camera can detect feature points using a color distribution of a picture. However, a LRF can detect a feature point only using distance information between a robot and obstacles. This problem makes data association with LRF adversity. In this paper, we use the extremum of the observation value of LRF as feature points. This section proposes three techniques of the feature detection for doing it stably. 1) Removing dynamic objects and sensor noise with difference processing: For accurate SLAM, it is necessary to remove dynamic objects and sensor noise from a measurement data of LRF. If they are reflected into a map, the timecomplexity of SLAM and an error of map estimation would increase. We presents a technique of removing dynamic objects and sensor noise to piling up the LRF measurement data for two times. With a curent observation value and a previous, each observations on same angle are assciated. Then, a distance
3 between the couple of accosiated observations is calculated. If the distance longer than a threshold distance determined in advance, it is removed. Because of this method, dynamic objects and sensor noises are removed. 2) Detecting feature points sparsely and evenly: We use Maximum Likelihood Estimation (MLE) for data association [1]. MLE selects data associations by maximizing a importance weight of each landmarks. The importance weight is calculated from the Mahalanobis distance between a observation and a landmark, and the function of Gaussians distribution: π j = 2πQ j 1 2 exp( 1 2 (z t ẑ j ) t Q 1 j (z t ẑ j )) (4) where, the variable π j is importance weight, Q j is covariance of landmark position, ẑ j is predicted observation value, and superscript j is a index of landmarks. Importance weights are calculated by (4) with respect to each observation. The landmark which has the most biggest importance weight in all landmarks is associated the observation. If all importance weights to all landmarks are below a threshold determined in advance, it is judged that the feature point is a new landmark. MLE associates individually all landmarks on each feature point. Therefore, it is one of the robust data association methods in the outdoor environment where a dynamic object exists. However, because data association of MLE uses Mahalanobis distance between each landmarks and a observation value, it tends to go wrong assciation where landmarks are dense. We propose that it makes a distance of feature points already detected into the conditions on the feature detection. If the distance between a observation and the most nearest feature is longer than the threshold value, the observation is not selected as the feature point. Put simply, in a adjacent place where a lot of feature are detected, it makes features detected sparsely. In a adjacent place where a few feature detected, it makes features detected thickly. Because of this, feature points are detected sparsely and evenly, a failure of data association decreases. 3) Adjusting a threshold value of data association with a landmark density: In data association using the distance between a observation and a landmark, it is necessary to adjust a threshold of data association with a landmark density. For example, when distance is long between one landmark and another landmark which is the nearest it, only the object exists around there. That is, the landmark should be associated even if some observation errors arise. On the contrary, in the place where landmarks exists closely, the failure of data association may be occured. In the situation like thies, the data association should be done when the association is really absolute. In this paper, we propose a method that a threshold value of data association is adjusted with the distance between two adjacent landmarks. The threshold value is calculated by following formula: M th = M c K d min (5) where the variable M c is basic threshold of importance weight, d min is the distance between two adjacent landmarks, and K is a constant. The threshold value is adjusted with respect to each observations. B. Data Management In this paper, three techniques are used for efficient data association. 1) landmark s existence probability: Failures of feature detection resulting from sensor noise or complicated environment becomes a problem in outdoor environment. Therefore, even if it is used methods of feature detection which described in the chapter 3-A, it could not prevent completely spurious features from geting mixed in the map. To solve the problem, we always have to execute the SLAM with removing spurious landmarks. Montemerlo et al calculated the probability of the landmark s existence using available r of two values to all the landmarks that each particles hold [1]: Γ = log p(r z t,x [k] t ) 1 p(r z t,x [k] t ) where the variable Γ the probability of the landmark s existence, it is updated in each observation. When the probability becomes below a threshold, it judges that the landmark is a spurious, and removes it from a map. By this, only a true landmark could be held on the map, and the number of handing landmarks is decrease. As a result, the timecomplexity becomes small and failure of data association decreases. 2) Using the landmark exclusivity for data association: When features are detected sparsely with the technique mentioned in the chapter 3.A.2, it can be figured out that each feature points are individual objects. Therefore, several observations which observed in the same time should not be associated simultaneously with one landmark. In this paper, when some observations are identified as one landmark by MLE, the observation of the highest importance weight is only associated, and other observations are judged as a new landmarks. As a result, failure of data association could be prevented. 3) Predicting importance weights with observation range: In order to deal with many landmarks on the fly, the timecomplexity has to be reduced. However, using MLE for data association, importance weights are calculated to all landmarks in a map. The more the number of landmarks in a map increases, the more calculation increases. Especially, it is well known that the calculation time increases logarithmically in proportion to the number of observed landmarks on FastSLAM algorithm [6]. Hence, the calculation time of importance weight is needed to be kept down much further. We propose that the obsevation range which is determined preliminarily is used for decresing the computational time. Observable landmarks at the next step is presumued from the information of robot s position and its observable range. And then, it is assumed that landmarks which are out of the range may not be observed, the landmark s importance weights are (6)
4 1 1 SLAM Landmark 1 1 (A) Normal landmark estimation Fig Simulation results of SLAM SLAM Landmark 1 1 (B) Proposed landmark estimation not calculated. Thus, the futile calculation of the importance weights would not be excuted. IV. SAMPLING USING UNSCENTED TRANSFORMATION The particle filter in the FastSLAM relies on the importance sampling and, as a result, requires the design of proposal distributions that can approximate the true posterior reasonably well. In this paper, the sampling technique using the unscented transformation which Merwe et al proposed is taken in [8]. The unscented transformation is a method for calculating the statistics of a random variable which undergoes a nonlinear transformation. It builds on the principle that it is easier to approximate a probability distribution than an arbitrary nonlinear function. The procedure which is to estimate mean and covariance with unscented transformation is following: Firstly, weighted samples, called sigma-points, are deterministically chosen. Secondly, each sigma points is propagated through the nonlinear function. At the end, mean and covariance are estimated with these points. Equation (7) is the formula of choosing sigma-points, (8) is the formula of calculating weights to sigma-points. x () = ˆx x (i) = ˆx +( (N + λ)p ) i =1,..., N (7) x (i) = ˆx ( (N + λ)p ) i = N +1,..., 2N ω m () = λ n + λ ω c () = λ + (1 α + β) n + λ (8) ω (i) m = ω (i) c = 1 2(n + λ) i =1,..., 2N where ˆx is the mean of robot s position on previous step, λ = α 2 (n + κ) n, n is state dimension, α, κ are scaling parameter of choosing sigma-points, and β is a parameter which minimizes the effects from high order terms. Comparing with EKF, the estimation with the unscented transformation does not need to develop the expression for Jacobian matrixes of models. This is a big advantage when using a complicated model. Additionally, as proved in the previous researches, the estimation of the mean and covariance are accurate to the third order of the Taylor series expansion of any nonlinear function, whereas the EKF estimation has a first order [13]. V. SIMULATION RESULTS SLAM simulations was performed, which used our landmark estimation. These simulations was done by MATLAB, the algorithm of SLAM was FastSLAM2. algorithm. MLE was adopted for data association. This simulator makes the noise of observation and input with respect to Gaussian distribution. Two kinds of simulations were done, which the one used the normal landmark estimation, the another took in our landmark estimation method. Same parameters(e.g. noise, robot s speed, etc) were used in both simulation. Fig. 1 shows the results of these simulations. (A) is result of the simulation using the normal landmark estimation, (B) is result of simulation using our landmark estimation. These figures show estimated trajectory of SLAM, Ground truth, true landmark position, and landmark position. Fig. 2 shows the position error of these simulations as a function of time. The figure indicates that our method allows maximum error of position to decrease by %. Because our methods makes possible to hold only true landmarks so that spurious landmarks were removed. As a result, the true landmark is updated frequently, the position of the landmark is converged in the true position. Meanwhile, in normal estimation, because of not to remove spurious landmarks, error of the map increase as the failure of data association. Table I compares the number of landmarks at the end of the simulation and the computational time. These simulations was done by the system that the CPU is Intel Core2 Duo 2.33GHz, the RAM is 3.25GB. Our method removed the
5 Fig. 2. Position Error Fig. 3. Infant TABLE I COMPUTATIONAL TIME Number of Landmark Computational Time Normal Estimation Proposed Estimation spurious landmark, so that the number of landmarks treated was reduced by more than %. As a result, the computational time was reduced by more than %. VI. RESULTS OF SLAM IN OUTDOOR ENVIRONMENT Fig. 4. Experiment field We simulated feature detection and SLAM with a set of sensor data that were taken in real outdoor environment. The experimental field were Tsukuba central park, Ibaraki. There were a number of other team s robots and many passers in this driving course (Fig. 4). This experimental field had objects static and dynamic objects. Additionally, This environment had many objects that are complicated shapes (e.g. grass, shrubbery, bicycle, building). Infant, which is our system for research of autonomic mobile robot (Fig. 3) and Table II is it s specification, was used for getting the sensor data. The experiments are performed with the LRF of TOP- URG UTM-X1S made in Hokuyo denki co, the sensor samples data at 1 Hz, and the robot was traveling at about.5 m/s. TABLE II SPECIFICATION OF INFANT Parameters [Unit] Value Length [m].9 Width [m].6 Height [m] 1.1 Tread [m].5 Wheel base [m].45 Climbable angle [m] 4.9 Weight [m] Radius of wheel [m].125 Maximum speed [km/h] 7 Range of continuous drive [km] A. Feature detection Fig. 5 shows detecting feature points with our methods stated in chapter 3-A. Fig. 5 also shows robot s position and LRF observations. This shows these features were detected sparsely. In this simulation, the threshold of the least distance between a observation and the most nearest feature were 1cm. As a result, feature points were detected with the more distance than 1cm each other. Moreover, Fig. 5 shows dynamic objects are not detected with the difference processing stated chapter in 3.A.1. These features were used for the our SLAM Robot Position LRF Observations Feature points Dynamic Objects B. Results of SLAM We simulated two SLAM algorithms, which the one was FastSLAM2. with our landmark estimation, the another was the one innovated the unscented transformation. These Fig. 5. Feature detection
6 FastSLAM2. Odometry Unscented SLAM Odometry (A) FastSLAM (B) Unscented FastSLAM Fig. 6. Results of SLAM in dynamic outdoor environment SLAM simulations only used sensor data of wheel odometry and LRF observations. Fig. 6 is results of SLAM simulations. (A) is the result of SLAM with FastSLAM2., (B) is the result of our SLAM with the sampling method of unscented transformation. These figures show the trajectory of wheel odometry, SLAM, Ground truth, and the feature map created with SLAM. Both results shows that the estimation of robot s position is more accurately than the trajectory of odometry. This is attributed to ourlandmark estimation methods, it enabled to construct map stably and accurately in dynamic environment. Finally, the result of SLAM using unscented transformation was compared with the result of SLAM using Fast- SLAM2.. Fig. 6 shows that the SLAM using unscented transformation is more accurate about localization than Fast- SLAM2.. Because the using unscented transformation is more accurate than the use of EKF in the aspect of approximation accuracy of nonlinear function. For this reason, it was shown that the accurately of localization was improved by introducing the unscented transformation. VII. CONCLUSION In this paper, we proposed the landmark estimation for high-speed and accurate SLAM. In landmark estimation, three techniques were taken in respectively in the category of the feature detection and the data management. In the feature detection, removing dynamic objects and sensor noise with difference processing, detecting feature points sparsely and evenly, and adjusting a threshold value of data association with a landmark density, were introduced. By using these techniques, it made possible to detect feature point stably in outdoor environment, we showed that accurate SLAM became possible under the complicated and dynamic environment. In the data management, calculating landmark s existence probability, using the landmark exclusivity for data association, and predicting a importance weight with observation range, are taken in. These techniques made it possible to decrease the time-complexity of SLAM. We showed that our method allowed maximum error of position estimation and computational time to decrease by %. We also proposed the sampling method using unscented transformation. With this method and our landmark estimation, we showed the our SLAM was more accurate than FastSLAM2.. REFERENCES [1] Li, R., K. Di, L.H. Matthies, R.E. Arvidson, W.M. Folkner and B.A. Archinal. Rover Localization and Landing Site Mapping Technology for 3 Mars Exploration Rover Mission. Journal of Photogrammetric Engineering and Remote Sensing, Vol.7(1): 77-9, 3. [2] H. Durrant-Whyte and T. Bailey, Simultaneous Localisation and Mapping (SLAM): Part I The Essential Algorithms, Robotics and Automation Magazine, vol. 13, pp. 99?11, 6. [3] G. Dissanayake, P. Newman, S. Clark, H.F. Durrant-Whyte,and M. Csorba. A solution to the simultaneous localisation and map building (SLAM) problem. IEEE Transactions of Robotics and Automation, 1. [4] Y. Liu and S. Thrun. Results for outdoor-slam using sparse extended information filters. Submitted to ICRA-3. [5] S. Thrun and M. Montemerlo, The graphslam algorithm with applications to large-scale mapping of urban structures, IJRR, vol. 25. [6] M. Montemerlo, S. Thrun, D. Koller, and B. Wegbreit. Fast-SLAM: A factored solution to the simultaneous localization andmapping problem. Proc. AAAI, 2. [7] M. Montemerlo, S. Thrun D. Koller, and B. Wegbreit. FastSLAM 2.: An improved particle filtering algorithm for simultaneous localization and mapping that provably converges. In Proc. of the Int. Conf. on Articial Intelligence (IJCAI), 3. [8] S. J. Julier, J. K. Uhlmann, and H. F. Durrant-Whyte, A new approach for filtering nonlinear systems, in Proc. Amer. Contr. Conf., Seattle,WA, June 1995, pp. 1628?1632. [9] R. Merwe, A. Doucet, N. Freitas and E. Wan, The Unscented Particle Filter, Technical Report CUED/F-INFENG/TR 3, Cambridge University Engineering Department,. [1] Avitzour, D. (1992) A maximum likelihood approach to data association.ieee Transactions on Aerospace and Electronics Systems, 28, 2 (Apr. 1992), 5?565. [11] M.Montemerlo,S.Thrun,Simultaneous localization and mapping with unknown data association using FastSLAM.Proc. ICRA, 3. [12] S. Thrun, W. Burgard, D. Fox, Probabilistic Robotics, MIT Press, 5. [13] C.Kim, R.Sakthivel, and W.K.Chung, Unscented FastSLAM: A robust algorithm for the simultaneous localization and mapping problem, in Proc. IEEE Int. Conf. Robot. Autom., 7, pp
Probabilistic 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 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 informationIROS 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 informationMatching Evaluation of 2D Laser Scan Points using Observed Probability in Unstable Measurement Environment
Matching Evaluation of D Laser Scan Points using Observed Probability in Unstable Measurement Environment Taichi Yamada, and Akihisa Ohya Abstract In the real environment such as urban areas sidewalk,
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 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 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 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 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 informationEfficient particle filter algorithm for ultrasonic sensor based 2D range-only SLAM application
Efficient particle filter algorithm for ultrasonic sensor based 2D range-only SLAM application Po Yang School of Computing, Science & Engineering, University of Salford, Greater Manchester, United Kingdom
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 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 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 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 informationGeometrical Feature Extraction Using 2D Range Scanner
Geometrical Feature Extraction Using 2D Range Scanner Sen Zhang Lihua Xie Martin Adams Fan Tang BLK S2, School of Electrical and Electronic Engineering Nanyang Technological University, Singapore 639798
More informationEKF Localization and EKF SLAM incorporating prior information
EKF Localization and EKF SLAM incorporating prior information Final Report ME- Samuel Castaneda ID: 113155 1. Abstract In the context of mobile robotics, before any motion planning or navigation algorithm
More informationGeneralizing Random-Vector SLAM with Random Finite Sets
Generalizing Random-Vector SLAM with Random Finite Sets Keith Y. K. Leung, Felipe Inostroza, Martin Adams Advanced Mining Technology Center AMTC, Universidad de Chile, Santiago, Chile eith.leung@amtc.uchile.cl,
More informationMobile robot localisation and navigation using multi-sensor fusion via interval analysis and UKF
Mobile robot localisation and navigation using multi-sensor fusion via interval analysis and UKF Immanuel Ashokaraj, Antonios Tsourdos, Peter Silson and Brian White. Department of Aerospace, Power and
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 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 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 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 informationL15. POSE-GRAPH SLAM. NA568 Mobile Robotics: Methods & Algorithms
L15. POSE-GRAPH SLAM NA568 Mobile Robotics: Methods & Algorithms Today s Topic Nonlinear Least Squares Pose-Graph SLAM Incremental Smoothing and Mapping Feature-Based SLAM Filtering Problem: Motion Prediction
More informationOptimization of the Simultaneous Localization and Map-Building Algorithm for Real-Time Implementation
242 IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, VOL. 17, NO. 3, JUNE 2001 Optimization of the Simultaneous Localization and Map-Building Algorithm for Real-Time Implementation José E. Guivant and Eduardo
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 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 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 informationStereo Vision as a Sensor for EKF SLAM
Stereo Vision as a Sensor for EKF SLAM Wikus Brink Electronic Systems Lab Electrical and Electronic Engineering University of Stellenbosch Email: 1483986@sun.ac.za Corné E. van Daalen Electronic Systems
More information3-D MAP GENERATION BY A MOBILE ROBOT EQUIPPED WITH A LASER RANGE FINDER. Takumi Nakamoto, Atsushi Yamashita, and Toru Kaneko
3-D AP GENERATION BY A OBILE ROBOT EQUIPPED WITH A LAER RANGE FINDER Takumi Nakamoto, Atsushi Yamashita, and Toru Kaneko Department of echanical Engineering, hizuoka Univerty 3-5-1 Johoku, Hamamatsu-shi,
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 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 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 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 informationHOG-Based Person Following and Autonomous Returning Using Generated Map by Mobile Robot Equipped with Camera and Laser Range Finder
HOG-Based Person Following and Autonomous Returning Using Generated Map by Mobile Robot Equipped with Camera and Laser Range Finder Masashi Awai, Takahito Shimizu and Toru Kaneko Department of Mechanical
More informationMonocular SLAM for a Small-Size Humanoid Robot
Tamkang Journal of Science and Engineering, Vol. 14, No. 2, pp. 123 129 (2011) 123 Monocular SLAM for a Small-Size Humanoid Robot Yin-Tien Wang*, Duen-Yan Hung and Sheng-Hsien Cheng Department of Mechanical
More informationAutonomous Mobile Robot Design
Autonomous Mobile Robot Design Topic: EKF-based SLAM Dr. Kostas Alexis (CSE) These slides have partially relied on the course of C. Stachniss, Robot Mapping - WS 2013/14 Autonomous Robot Challenges Where
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 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 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 informationHybridSLAM: Combining FastSLAM and EKF-SLAM for reliable mapping
HybridSLAM: Combining FastSLAM and EKF-SLAM for reliable mapping Alex Brooks 1 and Tim Bailey 1 Australian Centre for Field Robotics, University of Sydney {a.brooks,t.bailey}@acfr.usyd.edu.au Abstract:
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 informationEfficient SLAM Scheme Based ICP Matching Algorithm Using Image and Laser Scan Information
Proceedings of the World Congress on Electrical Engineering and Computer Systems and Science (EECSS 2015) Barcelona, Spain July 13-14, 2015 Paper No. 335 Efficient SLAM Scheme Based ICP Matching Algorithm
More informationLocalization of Multiple Robots with Simple Sensors
Proceedings of the IEEE International Conference on Mechatronics & Automation Niagara Falls, Canada July 2005 Localization of Multiple Robots with Simple Sensors Mike Peasgood and Christopher Clark Lab
More informationUSING 3D DATA FOR MONTE CARLO LOCALIZATION IN COMPLEX INDOOR ENVIRONMENTS. Oliver Wulf, Bernardo Wagner
USING 3D DATA FOR MONTE CARLO LOCALIZATION IN COMPLEX INDOOR ENVIRONMENTS Oliver Wulf, Bernardo Wagner Institute for Systems Engineering (RTS/ISE), University of Hannover, Germany Mohamed Khalaf-Allah
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 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 informationOn-line Convex Optimization based Solution for Mapping in VSLAM
On-line Convex Optimization based Solution for Mapping in VSLAM by Abdul Hafeez, Shivudu Bhuvanagiri, Madhava Krishna, C.V.Jawahar in IROS-2008 (Intelligent Robots and Systems) Report No: IIIT/TR/2008/178
More information2005 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media,
25 IEEE Personal use of this material is permitted Permission from IEEE must be obtained for all other uses in any current or future media including reprinting/republishing this material for advertising
More informationReal Time Simultaneous Localisation and Mapping for the Player Project
Real Time Simultaneous Localisation and Mapping for the Player Project Alan Y. Yang and Bruce A. MacDonald and Karl A. Stol School of Engineering, University of Auckland, New Zealand yyan087@gmail.com,
More information(W: 12:05-1:50, 50-N202)
2016 School of Information Technology and Electrical Engineering at the University of Queensland Schedule of Events Week Date Lecture (W: 12:05-1:50, 50-N202) 1 27-Jul Introduction 2 Representing Position
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 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 informationL12. EKF-SLAM: PART II. NA568 Mobile Robotics: Methods & Algorithms
L12. EKF-SLAM: PART II NA568 Mobile Robotics: Methods & Algorithms Today s Lecture Feature-based EKF-SLAM Review Data Association Configuration Space Incremental ML (i.e., Nearest Neighbor) Joint Compatibility
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 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 informationSurvey: Simultaneous Localisation and Mapping (SLAM) Ronja Güldenring Master Informatics Project Intellgient Robotics University of Hamburg
Survey: Simultaneous Localisation and Mapping (SLAM) Ronja Güldenring Master Informatics Project Intellgient Robotics University of Hamburg Introduction EKF-SLAM FastSLAM Loop Closure 01.06.17 Ronja Güldenring
More informationThe vslam Algorithm for Robust Localization and Mapping
Published in Proc. of Int. Conf. on Robotics and Automation (ICRA) 2005 The vslam Algorithm for Robust Localization and Mapping Niklas Karlsson, Enrico Di Bernardo, Jim Ostrowski, Luis Goncalves, Paolo
More informationMULTI-ROBOT research has gained a broad attention. A Novel Way to Implement Self-localization in a Multi-robot Experimental Platform
21 American Control Conference Marriott Waterfront, Baltimore, MD, USA June 3-July 2, 21 FrC16.5 A Novel Way to Implement Self-localization in a Multi-robot Experimental Platform Sheng Zhao and Manish
More informationNERC Gazebo simulation implementation
NERC 2015 - Gazebo simulation implementation Hannan Ejaz Keen, Adil Mumtaz Department of Electrical Engineering SBA School of Science & Engineering, LUMS, Pakistan {14060016, 14060037}@lums.edu.pk ABSTRACT
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 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 informationApplication of Robot Navigation Technology for Civil Robot Development
Safety, Reliability and Risk of Structures, Infrastructures and Engineering Systems Furuta, Frangopol & Shinozuka (eds) 2010 Taylor & Francis Group, London, ISBN 978-0-415-47557-0 Application of Robot
More informationRobotics. Chapter 25. Chapter 25 1
Robotics Chapter 25 Chapter 25 1 Outline Robots, Effectors, and Sensors Localization and Mapping Motion Planning Chapter 25 2 Mobile Robots Chapter 25 3 Manipulators P R R R R R Configuration of robot
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 informationElastic Correction of Dead-Reckoning Errors in Map Building
Elastic Correction of Dead-Reckoning Errors in Map Building Matteo Golfarelli Dario Maio Stefano Rizzi DEIS, Università di Bologna Bologna, Italy Abstract A major problem in map building is due to the
More informationData Association for SLAM
CALIFORNIA INSTITUTE OF TECHNOLOGY ME/CS 132a, Winter 2011 Lab #2 Due: Mar 10th, 2011 Part I Data Association for SLAM 1 Introduction For this part, you will experiment with a simulation of an EKF SLAM
More informationPath and Viewpoint Planning of Mobile Robots with Multiple Observation Strategies
Path and Viewpoint Planning of Mobile s with Multiple Observation Strategies Atsushi Yamashita Kazutoshi Fujita Toru Kaneko Department of Mechanical Engineering Shizuoka University 3 5 1 Johoku, Hamamatsu-shi,
More informationUNIVERSITÀ DEGLI STUDI DI GENOVA MASTER S THESIS
UNIVERSITÀ DEGLI STUDI DI GENOVA MASTER S THESIS Integrated Cooperative SLAM with Visual Odometry within teams of autonomous planetary exploration rovers Author: Ekaterina Peshkova Supervisors: Giuseppe
More informationPML-SLAM: a solution for localization in large-scale urban environments
PML-SLAM: a solution for localization in large-scale urban environments Zayed Alsayed, Guillaume Bresson, Fawzi Nashashibi and Anne Verroust-Blondet Institut VEDECOM Versailles, France firstname.name@vedecom.fr
More informationIBuILD: Incremental Bag of Binary Words for Appearance Based Loop Closure Detection
IBuILD: Incremental Bag of Binary Words for Appearance Based Loop Closure Detection Sheraz Khan and Dirk Wollherr Chair of Automatic Control Engineering Technische Universität München (TUM), 80333 München,
More informationScalable Monocular SLAM
Scalable Monocular SLAM Ethan Eade Tom Drummond Cambridge University {ee231, twd20}@cam.ac.uk Abstract Localization and mapping in unknown environments becomes more difficult as the complexity of the environment
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 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 informationStochastic Road Shape Estimation, B. Southall & C. Taylor. Review by: Christopher Rasmussen
Stochastic Road Shape Estimation, B. Southall & C. Taylor Review by: Christopher Rasmussen September 26, 2002 Announcements Readings for next Tuesday: Chapter 14-14.4, 22-22.5 in Forsyth & Ponce Main Contributions
More informationOnline Simultaneous Localization and Mapping in Dynamic Environments
To appear in Proceedings of the Intl. Conf. on Robotics and Automation ICRA New Orleans, Louisiana, Apr, 2004 Online Simultaneous Localization and Mapping in Dynamic Environments Denis Wolf and Gaurav
More informationIntegrated Sensing Framework for 3D Mapping in Outdoor Navigation
Integrated Sensing Framework for 3D Mapping in Outdoor Navigation R. Katz, N. Melkumyan, J. Guivant, T. Bailey, J. Nieto and E. Nebot ARC Centre of Excellence for Autonomous Systems Australian Centre for
More informationCollaborative Multi-Vehicle Localization and Mapping in Marine Environments
Collaborative Multi-Vehicle Localization and Mapping in Marine Environments Moratuwage M.D.P., Wijesoma W.S., Kalyan B., Dong J.F., Namal Senarathne P.G.C., Franz S. Hover, Nicholas M. Patrikalakis School
More informationSimultaneous Learning of Motion and Sensor Model Parameters for Mobile Robots
008 IEEE International Conference on Robotics and Automation Pasadena, CA, USA, May 19-3, 008 Simultaneous Learning of Motion and Sensor Model Parameters for Mobile Robots Teddy N. Yap, Jr. and Christian
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 informationTowards Gaussian Multi-Robot SLAM for Underwater Robotics
Towards Gaussian Multi-Robot SLAM for Underwater Robotics Dave Kroetsch davek@alumni.uwaterloo.ca Christoper Clark cclark@mecheng1.uwaterloo.ca Lab for Autonomous and Intelligent Robotics University of
More informationA MOBILE ROBOT MAPPING SYSTEM WITH AN INFORMATION-BASED EXPLORATION STRATEGY
A MOBILE ROBOT MAPPING SYSTEM WITH AN INFORMATION-BASED EXPLORATION STRATEGY Francesco Amigoni, Vincenzo Caglioti, Umberto Galtarossa Dipartimento di Elettronica e Informazione, Politecnico di Milano Piazza
More informationMotion Control Strategies for Improved Multi Robot Perception
Motion Control Strategies for Improved Multi Robot Perception R Aragues J Cortes C Sagues Abstract This paper describes a strategy to select optimal motions of multi robot systems equipped with cameras
More informationNavigation methods and systems
Navigation methods and systems Navigare necesse est Content: Navigation of mobile robots a short overview Maps Motion Planning SLAM (Simultaneous Localization and Mapping) Navigation of mobile robots a
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 informationHigh Accuracy Navigation Using Laser Range Sensors in Outdoor Applications
Proceedings of the 2000 IEEE International Conference on Robotics & Automation San Francisco, CA April 2000 High Accuracy Navigation Using Laser Range Sensors in Outdoor Applications Jose Guivant, Eduardo
More informationFast and Accurate SLAM with Rao-Blackwellized Particle Filters
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
More informationFinal Exam Practice Fall Semester, 2012
COS 495 - Autonomous Robot Navigation Final Exam Practice Fall Semester, 2012 Duration: Total Marks: 70 Closed Book 2 hours Start Time: End Time: By signing this exam, I agree to the honor code Name: Signature:
More informationDense Tracking and Mapping for Autonomous Quadrocopters. Jürgen Sturm
Computer Vision Group Prof. Daniel Cremers Dense Tracking and Mapping for Autonomous Quadrocopters Jürgen Sturm Joint work with Frank Steinbrücker, Jakob Engel, Christian Kerl, Erik Bylow, and Daniel Cremers
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 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 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 informationA Single-Step Maximum A Posteriori Update for Bearing-Only SLAM
A Single-Step Maximum A Posteriori Update for Bearing-Only SLAM Stephen ully Department of Electrical and Computer Engineering Carnegie Mellon University, Pittsburgh, PA stully@ece.cmu.edu George Kantor
More informationAUTONOMOUS SYSTEMS. LOCALIZATION, MAPPING & SIMULTANEOUS LOCALIZATION AND MAPPING Part V Mapping & Occupancy Grid Mapping
AUTONOMOUS SYSTEMS LOCALIZATION, MAPPING & SIMULTANEOUS LOCALIZATION AND MAPPING Part V Mapping & Occupancy Grid Mapping Maria Isabel Ribeiro Pedro Lima with revisions introduced by Rodrigo Ventura Instituto
More informationA FastSLAM Algorithm for Omnivision
A FastSLAM Algorithm for Omnivision Cristina Gamallo, Manuel Mucientes and Carlos V. Regueiro Abstract Omnidirectional cameras have a wide field of view, which makes them specially suitable for Simultaneous
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 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 informationThis is a repository copy of Robot Mapping and Localisation for Feature Sparse Water Pipes Using Voids as Landmarks.
This is a repository copy of Robot Mapping and Localisation for Feature Sparse Water Pipes Using Voids as Landmars. White Rose Research Online URL for this paper: http://eprints.whiterose.ac.u/95702/ Version:
More information5. Tests and results Scan Matching Optimization Parameters Influence
126 5. Tests and results This chapter presents results obtained using the proposed method on simulated and real data. First, it is analyzed the scan matching optimization; after that, the Scan Matching
More information