Main menu

Post navigation

With respect to these previous works, a new laser scan data segme

With respect to these previous works, a new laser scan data segmentation based on curvature information is proposed. In order to improve the selleck chem JQ1 robustness against noise, this curvature is calculated using a triangle-area representation where the triangle side lengths at each range reading Inhibitors,Modulators,Libraries are adapted to Inhibitors,Modulators,Libraries the local variations of the laser scan, removing noise without missing relevant points. Besides, in this paper, the proposed environment representation has been used inside a SLAM approach based on the Extended Kalman Filter (EKF).This work has been organized as follows: Firstly, the most popular methods available in the literature for laser scan data segmentation are briefly described in Section 2. Next, a multi-scale method based on the curvature estimation of Inhibitors,Modulators,Libraries the scan data is presented in Section 3.

Section 4 describes some improvements to the proposed segmentation module of the approach which have been included in order to increase its robustness against noise and its invariance to translation and rotation. Experimental results and a brief discussion have been included in Sections 5 and 6, respectively. Finally, a brief glossary is given, which includes a list Inhibitors,Modulators,Libraries of words related to the robotics field.2.?Laser Scan Data Segmentation Algorithms2.1. Problem StatementScan data provided by 2D laser range finders are typically in the form (r, )i, on which (r, )i are the polar coordinates of the ith range reading (ri is the measured distance of an obstacle to the sensor rotating axis at direction i), and NR is the number of range readings. Figure 2(a) represents all these variables.

It can be assumed that the noise on both measurements, range and bearing, follows a Gaussian distribution with zero mean and variances ��r2 and �Ҧ�2, respectively. The aim of segmenting a laser scan is to divide it into clusters of range readings associated to different surfaces, planar or curves, of the environment. There are two main Cilengitide problems in laser scan segmentation:How many segments are there?Which range readings belong to which segment?In order to establish the limits of these segments, these problems can be stated as the search for the range readings associated to the discontinuities in the scanning process or to the changes in the orientation of the scan [see Figure 2(b)].Figure 2.(a) Scan reference frame variables. (b) Problem statement.

To detect these changes, two main types of techniques have been proposed in the literature. The most popular ones try to find specific geometric features in the scan. Specifically, polygonal approximation techniques originated from computer vision have been widely used to deal with office-like environments, which can be described using line segments. This segmentation process is achieved new by checking some heuristic line criteria (i.e., error bound) while concatenating consecutive points.