PhD Thesis Poppinga: RRT - Jacobs University
PhD Thesis Poppinga: RRT - Jacobs University
PhD Thesis Poppinga: RRT - Jacobs University
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
LIST OF FIGURES<br />
3.6 The data returned by the SwissRanger (left) and the stereo camera (right) for the<br />
scenes from the Outdoor 1 dataset. Photos in figure 3.5. . . . . . . . . . . . . . . . . 55<br />
3.7 Photos of the robotics lab with a locomotion test arena in form of a high bay rack. . . 56<br />
3.8 ALRF range image from the lab dataset . . . . . . . . . . . . . . . . . . . . . . . . 57<br />
3.9 The Crashed Car Park in Disaster City in Texas where one of the datasets used in the<br />
experiments was recorded. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57<br />
3.10 Perspective view of two point clouds from the Dwelling dataset from Disaster City . 58<br />
3.11 The Hannover ’09 Hall . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59<br />
3.12 Two views of a point cloud containing 78528 points from the Hannover ’09 Arena<br />
dataset . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 60<br />
3.13 An overview of the Lesumsperrwerk as seen from the river’s surface. . . . . . . . . . 61<br />
3.14 Two views of a sonar point cloud from the Lesumsperrwerk dataset . . . . . . . . . . 61<br />
4.1 The definition for the angles ρ x and ρ y . . . . . . . . . . . . . . . . . . . . . . . . . 67<br />
4.2 An example scene where the stereo camera delivers few data points; especially ground<br />
information is missing. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70<br />
4.3 Two-dimensional depictions of the three dimensional parameter (Hough-)space for<br />
several example snapshots . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 72<br />
4.4 Mean processing time and cardinality of point clouds . . . . . . . . . . . . . . . . . 73<br />
5.1 Applying a 3D transform to a 2D polygon . . . . . . . . . . . . . . . . . . . . . . . 80<br />
5.2 Different methods of projecting the point of a sub point cloud to the optimal plane<br />
fitted to them . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 85<br />
5.3 Problems with the two types of projection . . . . . . . . . . . . . . . . . . . . . . . 85<br />
5.4 Differences between orthogonal projection and projection along the beam . . . . . . 86<br />
5.5 Late projection can cause intersections when applied to ALRF data . . . . . . . . . . 87<br />
5.6 An α-shape (grey) of a 2D point cloud (orange) . . . . . . . . . . . . . . . . . . . . 88<br />
5.7 Some examples for convex polygons on a grid . . . . . . . . . . . . . . . . . . . . . 89<br />
5.8 An example iteration of the algorithm . . . . . . . . . . . . . . . . . . . . . . . . . 89<br />
5.9 Triangulation of convex grid polygons . . . . . . . . . . . . . . . . . . . . . . . . . 91<br />
5.10 Comparison of triangulation with/without the restriction to the area covered by the<br />
naive triangulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 92<br />
5.11 Triangles with annotated spikyness . . . . . . . . . . . . . . . . . . . . . . . . . . . 92<br />
5.12 Time taken, number of polygons and spikyness for the different triangulation algorithms<br />
on the German Open ’09 Arena dataset. . . . . . . . . . . . . . . . . . . . . 93<br />
5.13 Time taken, number of polygons and spikyness for the different triangulation algorithms<br />
on the German Open ’09 Hall dataset. . . . . . . . . . . . . . . . . . . . . . 94<br />
5.14 Time taken, number of polygons and spikyness for the different triangulation algorithms<br />
on the Planar/Round/Holes dataset. . . . . . . . . . . . . . . . . . . . . . . . 96<br />
5.15 An example of outlining . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97<br />
5.16 Class structure of the different variants of the patch map framework . . . . . . . . . 98<br />
5.17 One dimensional case of bounding box based broad phase intersection test . . . . . . 102<br />
5.18 A run of the kD-tree based collision detection algorithm detecting no collision. . . . 104<br />
5.19 Map used in preliminary experiments . . . . . . . . . . . . . . . . . . . . . . . . . 108<br />
6.1 Real-world example for an explored volume . . . . . . . . . . . . . . . . . . . . . . 116<br />
6.2 Using explored volume to compare different map types . . . . . . . . . . . . . . . . 117<br />
12