Matching Evaluation of 2D Laser Scan Points using Observed Probability in Unstable Measurement Environment

Similar documents
Scan-point Planning and 3-D Map Building for a 3-D Laser Range Scanner in an Outdoor Environment

Localization algorithm using a virtual label for a mobile robot in indoor and outdoor environments

IROS 05 Tutorial. MCL: Global Localization (Sonar) Monte-Carlo Localization. Particle Filters. Rao-Blackwellized Particle Filters and Loop Closing

Basics of Localization, Mapping and SLAM. Jari Saarinen Aalto University Department of Automation and systems Technology

USING 3D DATA FOR MONTE CARLO LOCALIZATION IN COMPLEX INDOOR ENVIRONMENTS. Oliver Wulf, Bernardo Wagner

Revising Stereo Vision Maps in Particle Filter Based SLAM using Localisation Confidence and Sample History

Probabilistic Robotics

Ball tracking with velocity based on Monte-Carlo localization

Introduction to Mobile Robotics SLAM Grid-based FastSLAM. Wolfram Burgard, Cyrill Stachniss, Maren Bennewitz, Diego Tipaldi, Luciano Spinello

NERC Gazebo simulation implementation

A High Dynamic Range Vision Approach to Outdoor Localization

Mobile Robot Mapping and Localization in Non-Static Environments

AUTONOMOUS SYSTEMS. LOCALIZATION, MAPPING & SIMULTANEOUS LOCALIZATION AND MAPPING Part V Mapping & Occupancy Grid Mapping

Using Artificial Landmarks to Reduce the Ambiguity in the Environment of a Mobile Robot

Mobile Robot Localization Using Stereo Vision in Outdoor Environments under Various Illumination Conditions

Today MAPS AND MAPPING. Features. process of creating maps. More likely features are things that can be extracted from images:

Mapping Contoured Terrain Using SLAM with a Radio- Controlled Helicopter Platform. Project Proposal. Cognitive Robotics, Spring 2005

3D Magnetic Field Mapping in Large-Scale Indoor Environment Using Measurement Robot and Gaussian Processes

HOG-Based Person Following and Autonomous Returning Using Generated Map by Mobile Robot Equipped with Camera and Laser Range Finder

Simultaneous Localization and Mapping

Detection of Parked Vehicles from a Radar Based Occupancy Grid

Efficient SLAM Scheme Based ICP Matching Algorithm Using Image and Laser Scan Information

Localization and Map Building

Simulation of a mobile robot with a LRF in a 2D environment and map building

Multi-Resolution Surfel Mapping and Real-Time Pose Tracking using a Continuously Rotating 2D Laser Scanner

Probabilistic Robotics. FastSLAM

Vehicle Localization. Hannah Rae Kerner 21 April 2015

Where s the Boss? : Monte Carlo Localization for an Autonomous Ground Vehicle using an Aerial Lidar Map

Mapping and Exploration with Mobile Robots using Coverage Maps

A Framework for Bearing-Only Sparse Semantic Self-Localization for Visually Impaired People

Using the ikart mobile platform

Real Time Face Detection using Geometric Constraints, Navigation and Depth-based Skin Segmentation on Mobile Robots

Localization and Road Boundary Recognition in Urban Environments Using Digital Street Maps

Construction of Semantic Maps for Personal Mobility Robots in Dynamic Outdoor Environments

Implementation of Odometry with EKF for Localization of Hector SLAM Method

Normal Distributions Transform Monte-Carlo Localization (NDT-MCL)

Indoor Positioning System Based on Distributed Camera Sensor Networks for Mobile Robot

Ensemble of Bayesian Filters for Loop Closure Detection

Grid-Based Models for Dynamic Environments

W4. Perception & Situation Awareness & Decision making

Aerial and Ground-based Collaborative Mapping: An Experimental Study

CONNECT-THE-DOTS IN A GRAPH AND BUFFON S NEEDLE ON A CHESSBOARD: TWO PROBLEMS IN ASSISTED NAVIGATION

Monte Carlo Localization for Mobile Robots

Monte Carlo Localization using Dynamically Expanding Occupancy Grids. Karan M. Gupta

3D Terrain Sensing System using Laser Range Finder with Arm-Type Movable Unit

Particle Filters. CSE-571 Probabilistic Robotics. Dependencies. Particle Filter Algorithm. Fast-SLAM Mapping

AUTONOMOUS SYSTEMS. PROBABILISTIC LOCALIZATION Monte Carlo Localization

Probabilistic Path Planning for Cooperative Target Tracking Using Aerial and Ground Vehicles

NAVIGATION SYSTEM OF AN OUTDOOR SERVICE ROBOT WITH HYBRID LOCOMOTION SYSTEM

Online Simultaneous Localization and Mapping in Dynamic Environments

Stereo vision SLAM: Near real-time learning of 3D point-landmark and 2D occupancy-grid maps using particle filters.

2D localization of outdoor mobile robots using 3D laser range data

Autonomous Navigation of Humanoid Using Kinect. Harshad Sawhney Samyak Daga 11633

Localization Assistance for Multiple Mobile Robots using Target Tracking Techniques

Tracking Multiple Moving Objects with a Mobile Robot

Probabilistic Robotics

Multiple People Detection from a Mobile Robot using Double Layered Laser Range Finders

Lost! Leveraging the Crowd for Probabilistic Visual Self-Localization

IN recent years, NASA s Mars Exploration Rovers (MERs)

Overview. EECS 124, UC Berkeley, Spring 2008 Lecture 23: Localization and Mapping. Statistical Models

Planning for Simultaneous Localization and Mapping using Topological Information

Kaijen Hsiao. Part A: Topics of Fascination

MTRX4700: Experimental Robotics

Particle-Filter-Based Self-Localization Using Landmarks and Directed Lines

Robotics. Lecture 5: Monte Carlo Localisation. See course website for up to date information.

Geometrical Feature Extraction Using 2D Range Scanner

Fusion of Laser and Vision for Multiple Targets Tracking via On-line Learning

A New Omnidirectional Vision Sensor for Monte-Carlo Localization

Glass Confidence Maps Building Based on Neural Networks Using Laser Range-finders for Mobile Robots

Localization, Mapping and Exploration with Multiple Robots. Dr. Daisy Tang

Jurnal Teknologi PARTICLE FILTER IN SIMULTANEOUS LOCALIZATION AND MAPPING (SLAM) USING DIFFERENTIAL DRIVE MOBILE ROBOT. Full Paper

Autonomous Navigation of Nao using Kinect CS365 : Project Report

RoboCup Rescue Summer School Navigation Tutorial

Robot Mapping. A Short Introduction to the Bayes Filter and Related Models. Gian Diego Tipaldi, Wolfram Burgard

Visual Bearing-Only Simultaneous Localization and Mapping with Improved Feature Matching

Localisation using Automatically Selected Landmarks from Panoramic Images

Practical Course WS12/13 Introduction to Monte Carlo Localization

Humanoid Robotics. Monte Carlo Localization. Maren Bennewitz

A Genetic Algorithm for Simultaneous Localization and Mapping

Spring Localization II. Roland Siegwart, Margarita Chli, Martin Rufli. ASL Autonomous Systems Lab. Autonomous Mobile Robots

A Lightweight SLAM algorithm using Orthogonal Planes for Indoor Mobile Robotics

Localization and Map Building

How to Learn Accurate Grid Maps with a Humanoid

Environment Identification by Comparing Maps of Landmarks

Building Reliable 2D Maps from 3D Features

Localization of Multiple Robots with Simple Sensors

Preliminary Results in Tracking Mobile Targets Using Range Sensors from Multiple Robots

Robust Laser Scan Matching in Dynamic Environments

Scan Matching. Pieter Abbeel UC Berkeley EECS. Many slides adapted from Thrun, Burgard and Fox, Probabilistic Robotics

Efficient Techniques for Dynamic Vehicle Detection

AN INCREMENTAL SLAM ALGORITHM FOR INDOOR AUTONOMOUS NAVIGATION

Moving Objects Detection and Classification Based on Trajectories of LRF Scan Data on a Grid Map

Robotics and Autonomous Systems

Outdoor Localization using Stereo Vision under Various Illumination Conditions

Filtering and mapping systems for underwater 3D imaging sonar

ECE276A: Sensing & Estimation in Robotics Lecture 11: Simultaneous Localization and Mapping using a Particle Filter

People Tracking for Enabling Human-Robot Interaction in Large Public Spaces

Semantic Mapping and Reasoning Approach for Mobile Robotics

Vol. 21 No. 6, pp ,

Offline Simultaneous Localization and Mapping (SLAM) using Miniature Robots

Transcription:

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, the laser scanner measurement is unstable due to various noise such as moving object. The unstable measurement makes difficult for mobile robot localization. While, the stable measured object is effective as landmark. And, it is expect that around the stable measured object, the scan points is frequently obtained greater than unstable measurement with multiple scans. Hence, the observed probability of scan point allows to extract the features of stable measured object and decrease the influence of unstable measurement. This paper presents the calculation of the observed probability of laser scan point for mobile robot localization. The observed probability is statistically obtained from multiple scans when obtained in a priori. Using this localization method, our robot moves completely on the pedestrian environment of about 1.km at Tsukuba Challenge 11. I. INTRODUCTION Localization is an important function for mobile robots. Scan matching using laser scanner is widely used for localization methods. Scan matching estimate robot position by measuring the correlation of current scan with reference scan and arranging for the correlation to be greater. For autonomous navigation, usually, the reference scan is a priori scans in the environment or made from these scans. In scan matching scheme, hence, it is assumed that current and reference scan are similar. In the real environment such as urban areas sidewalk, however, laser scanner measurement is unstable due to moving objects, change of scanning area by tilt Intelligent Robot Laboratory, Graduate School of Systems and Information Engineering, University of Tsukuba, 1-1-1 Tennoudai, Tsukuba City Ibaraki Pref., 35-8573, Japan, +81-9-853-5155. {tyamada,ohya}@roboken.esys.tsukuba.ac.jp robot scan point (i) (ii) wall pedestrian (moving objects) A pedestrian moved Fig. 1. Unstable measurement by moving object: The scan data change by the postion of moving object. Stairs Laser Robot Pavement Laser reflection point is changed by tilting of robot Fig.. Unstable measurement by change of scan area: The measured object change due to robot tilt by slight slope of the pavement. or vibration of robot, and so on. By unstable measurement, miss correspondence between reference scan and current scan occurs, and the correlation

Branches of hedge: Thin and complex object 3.5 scan1 scan 1.5 1.5 robot position when took scan1 Branches of hedge: These scans changed by robot position because these branchs is slight and complex -.5 robot position when took scan -1-1 1 3 4 5 (a) Complex object: Branches of hedge (b) Unstable mesurement of complex object Fig. 3. Unstable measurement of complex object Stable measured object Current scan These scan points are high waighted Dense scan point area High observed probability Sparce scan point area Unstable measurements (a) Reference scan (multiple scans) Low observed probability (b) observed probability These scan points are low waighted (c) scoring using observed probability Fig. 4. The evaluation of current scan using the observed probability: (a) shows the multiple scans as reference scan. The wall is stably measured and the scan points around the wall is dense. While the walker is unstably and these scan points is sparce. (b) shows the observed probability of scan points that obtained from scans of (a). (c) shows the scoring how much the current scan match to the reference. The scan points around high observed probability area is waighted because scan points expect to observed around high observed probability area. of current scan and reference scan is reduced. As a consequence, unstable measurement makes difficult to estimate robot position. For stable measured objects (that is observed at approximately the fixed position) current scan is able to correspond easily reference scan. With multiple scans, the density of scan points around stable measured objects is greater than the density of unstable measurement area. In the dense scan points area, it is expected that a scan point observed with high probability. The observed probability of scan points allows to extract effective features for localization and decrease the influence of unstable measurement data for mobile robot localization. This paper describes to calculate the observed probability from the reference scans and the score of scan matching using the observed probability. II. APPROACH In the real environment such as urban areas sidewalk, the laser scanner measurement is unstable and it makes robot localization difficult. The cause of unstable measurement are various; moving objects such as walkers will change its position with time (Fig.1), the laser reflection point will be changed by tilting or vibration of robot (Fig.), the scan of complex objects is unstable measured (Fig.3), and so on. Unstable measurement is difficult to be solved due to variety of cause. Usually undesired

data is deleted manually from reference scan for avoiding miss correspondence. However, manual deletion of undesired data is the burden and the person is required to have enough knowledge about the environment. The feature-based scan matching [1],[] allows to extract reliable features for localization. Because thie method extracts the specific feature such as line from both reference and current scan, it is efficient method for noisy and unstable measurement. However, the feature-based scan matching needs the specific feature, and it is difficult to be applied to some outdoor environment having fe specific features. Many approaches for range sensor locaziation consider the occupancy or free area. These approach is robust for unstable measurement by moving object [4][5][6]. However, the cause of unstable measurement is not only moving objects. For example, the occupancy area and free area become less apparent due to the reflection point change by the slight slope of the pavement like shown in Fig.. The likelihood that the current scan is observed at the robot position can be used to estimate the robot position. This paper presents a method to caluculate statiscally the observed probability of scan points as the score from multiple scans obtained in a priori. Shown in Fig.4-(a), with multiple scans, scan points is dense around stable measured objects. While scan points of unstable measurement is sperce and low observed probability. The observed probability at dense scan point area will be greater than it at sparce area (Fig.4-(b)). Finally the observed probability allows to weight to the feature of stable measured objects and reduce the influence of unstable measurements. III. SCORING ROBOT POSITION USING OBSERVED PROBABILITY One of the localization method using laser scanner is to evaluate the robot position by the likelihood of current scan and to optimize the robot position evaluation. In this section, the scoring method using the observed probability obtained from reference scans M is presented. To obtain reference scans, the robot moves manually on the environment in a priori, and gathers self position and D laser scanner data. By associating the robot position and laser scanner data, the scan data around the enrivonment is obtained. Here, the current scan is described Z = z 1, z,...z m and a current scan point poition is z = (x z, y z ). The robot position on the reference scan coordinate is described p = (x p, y p, θ p ) T and the i th current scan point on the reference scan coordinate z i ( ) ( ) is z cos(θp ) sin(θ i = p ) xp z sin(θ p ) cos(θ p ) i + (1) y p We defined the score of robot position p as S(p, Z, M) = α i=m p(z i M) () p(z i M) is the observed probability of scan point of the position z i, and it obtained from the reference scan M. Here, α is given a positive value. The following of this section presents the calculation of the probability p(z i M). One of the simple method to obtain the observed probability is to divide the D space around the environment into grid pattern cells and count the number of scan points in each cells. In this simple method, however, the small cell is needed to accurately estimate the robot position, and many sample scans are needed to obtain the reliable data. While, the larger cell allows to be easy to collect sample scan points. For this reason, our method is with reference to NDT [7]. NDT is a scan matching method. NDT divide D space into grid pattern large cells of about 1m, and the distribution of scan points in each cells is used as reference of scan matching. In NDT, the normal distribution of scan point in each cell represent the shape feature of reference scan and the normal distribution is assumed the local observed probability of scan point in the cell. In our method, the observed probability is calculated using the nomal distribution as the local probability of scan point in the cell. For each cells, the following is calculated to obtain the observed probability. Here, a reference scan point position describes m = (x m, y m ) T n a : the number of scan point in cell a µ a = 1 n a m i a m i : the mean of scan point position in cell a

1 8 scan point 1 8 6 6 4 4 - - -4-4 -5 5 1 15 (a) raw scan data -5 5 1 15 (b) observed probability Fig. 5. Observed probability in a corridor environment where walkers exist: (a) shows the raw scans data. The points describes scan points. (b) shows the observed probability of scan points. The black area denotes the high observed probability area. 5 5 Hedge 15 Hedge 15 Hedge 1 1 5 5 (a) environment -5-1 -5 5 1 (b) raw scan data -5-1 -5 5 1 (c) observed probability Fig. 6. Observed probability in the environment where the ground surface is observed: (a) shows the picture in the environment. In this environment, the scan of ground surface is unstable and some hedges are observed as landmarks. (b) shows the raw scans data. The point describes scan point. (c) shows the observed probability of scan points. The black area denotes the high observed probability area. Σ a = 1 n a m i a (µ a m i )(µ a m i ) T : the covariance matrix in cell a The cell that contains a current scan point z i describes a i and the event that observed a scan point in the cell a i describes O(a i ). When scan point is observed at z i, O(a i) holds, and p(z i M) is indicated the following. p(z i M) = p(z i, O(a i ) M) = p(z i, O(a i) M) p(o(a i ) M) p(o(a i ) M) = p(z i O(a i ), M) p(o(a i ) M) (3) p(o(a i ) M) is the probability to observe a scan point in cell a i. It obtains from the observed

Laser Scanner Fig. 8. The robot used in the experiment Fig. 7. The route in the experiment frequency of scan point and solves the following. p(o(a i ) M) = n a i (4) N Here, N is the number of scan point in all of the reference scans. p(z i O(a i), M) is the local observed probability in the cell a i. It is assumed to follow a normal distribution. p(z 1 i O(a i ), M) ( π Σ ai exp (z i µ ai) T Σ 1 ai (z i µ ) ai) (5) Thus, the observed probability p(z i M) is obtained by the following. p(z i M) n ai N 1 ( π Σ ai exp (z i µ ai) T Σ 1 ai (z i µ ) ai) (6) Fig.5 and Fig.6 show the examples of the observed probability of scan point by our method. To visualize the observed probability, these bitmap is made by calculating the observed probability in each pixel s position by Equation.6. Fig.5 shows the corrider environment where walking persons exist. Fig.5-(a) shows the raw scan data. There are many scan point indicating the walking persons and walls. Fig.5-(b) shows the observed probability obtained from the scans shown in (a). The feature of walls is extracted because the wall is frequently observed from almost same position. Fig.6-(a) shows the picture of the environment, and (b) shows the scans in this environment. In this environment, the scans of the ground surface around this sidewalk are unstable due to the robot vibration caused by uneaven road surface, while there are some hedges as the landmark. Fig.6-(c) shows the observed probability that obtained from scans of (b). It is confirmed that the observed porbability around hedges is greater than the area where ground surface is observed. IV. EXPERIMENTAL USAGE IN REAL ENVIRONMENT In this section, the results of experimental usage of our method in a real environment Tsukuba Challenge 11 [8] is presented to evaluate the method. Tsukuba Challenge is a autonomous robot navigation challenge in the City of Tsukuba, Japan. In Tsukuba Challenge 11, the robot moved automatically on the 1.km pedestrian environment shown in Fig.7. Fig.8 shows our robot. This robot is horizontally equiped with laser scanner Hokuyo UTM-3LX for

localization. For localization, we used the particle filter [9]. The number of particles were 5, and each particles move according to odometry model. The particles are evaluated by our method (Equation.) every.1 second for resampling. The reference scans is obtained when the robot moved manually on the route in a priori. The robot moved on the instructed path. The path has several waypoint and the robot moves on the line between current waypoint and next one. When the robot detected obstacles using laser scanner, the robot plans an avoidance route using A* algrithm. This path made manually with reference to the trajectory when the robot moved manually in the route in a priori. In Tsukuba Challenge 11, there was a total 9 days trial and final runs, and the robot completely ran the route 5 times. Fig.9 shows snapshots during trials when the robot completely runs the route and the observed probability around each spot. The arrows in each figure shows the camera position. Fig.9-(a) and (b) shows the environment where are people. In the environment where the robot was prevented landmark observation by many moving object, the robot was able to estinamte self position. In these case, the area around wall had high observed probability and these feature is weighted greater than moving object. In Fig.9-(c), the robot observed ground surface on the front, and it s measurement is unstable. The observed probability indicates that the measurement of the ground surface is widely distributed. Hence, the ground surface feature is not used as a effective feature for localization. In Fig.9- (d), the robot ran on the narrow slope path and the complex objects in the left of robot is unstably measured. It indicate this locaization method allows to accurately estimante the robot position. From this experiment, this method is an effective for unstable measurement environment. V. CONCLUSION This paper presented the observed probability of laser scan points for mobile robot localization. In real environment such as urban sidewalks, the laser scanner measurement is unstable due to varius noise such as moving objects, change of scanning area by tilt or vibration of robot, and so on. And the unstable measurement makes difficult to estimate robot position. This method use the observed probability of scan points for mobile robot localization. The observed probability allows to extract the feature of static object. The observed probability is statistically obtained from multiple scans as reference scan. In the experiment, the robot ran in the pedestrian environment in Tsukuba Challenge 13 to verify the effectiveness of this method, and this robot moved completely the route of about 1.km. The future work is to compare with other method to verify the robustness for various case of unstable measurement. REFERENCES [1] Nguyen, Viet, et al: A comparison of line extraction algorithms using D laser rangefinder for indoor mobile robotics, Intelligent Robots and Systems, 5.(IROS 5). 5 IEEE/RSJ International Conference on. IEEE, 5. [] Choi, Young-Ho, Tae-Kyeong Lee, and Se-Young Oh: A line feature based SLAM with low grade range sensors using geometric constraints and active exploration for mobile robot, Autonomous Robots 4.1 (8): 13-7. [3] Thrun, Sebastian: A probabilistic on-line mapping algorithm for teams of mobile robots, The International Journal of Robotics Research.5 (1): 335-363. [4] Burgard, Wolfram, et al: Estimating the absolute position of a mobile robot using position probability grids, Proceedings of the national conference on artificial intelligence. 1996. [5] Yamauchi, Brian, Alan Schultz, and William Adams: Mobile robot exploration and map-building with continuous localization, Robotics and Automation, 1998. Proceedings. 1998 IEEE International Conference on. Vol. 4. IEEE, 1998. [6] Yamauchi, Brian, and Pat Langley: Place recognition in dynamic environments, Journal of Robotic Systems 14. (1997): 17-1. [7] P. Biber and W. StraBer: The Normal Distributions Transform: A New Approach to Laser Scan Matching, Proc. of IROS3, pp. 743-748, 3. [8] Tsukuba Challenge 11: http://www.ntf.or.jp/challenge/challenge11 (in Japanese) [9] F. Dellaet, D. Fox, W. Burgard and S. Thrun: Monte Carlo Localization for Mobile Robots, Proc. of ICRA-99, pp. 13-138 vol

(a) (b) groundsurface complex stairs at left of robot (c) (d) Fig. 9. Snapshots during trials and observed probability: This figure shows sevral snapthot in trial and the observed probability in each place. Each arrows shows the camera position when took the snapshot.