Planar ray shooting for robot localization using laser range finders

Examensarbete för masterexamen

Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.12380/176456
Download file(s):
There are no files associated with this item.
Type: Examensarbete för masterexamen
Master Thesis
Title: Planar ray shooting for robot localization using laser range finders
Authors: Bergroth, Fredrik
Abstract: The purpose of this study has been improve a localization technique used in a robot developed at the Adaptive systems group at Chalmers University of Technology. Currently, the robot uses a simple algorithm to compute laser ray shooting queries among line segments representing a map, rather than preprocessing the set of line segments into a data structure that answers queries more quickly. Two different algorithms are presented that answer such queries, as well as the data structures upon which they are built. Persistent search trees and some core concepts of computational geometry are used in the first algorithm, while the second algorithm stores its information in a binary space partitioning tree. The latter technique was implemented and shown to outperform the simple algorithm for the particular case when the maps consisted of axis{parallel line segments. In maps when the number of segments was on the order of 200, the algorithm was shown to be twice as fast, and nearly three times as fast when the number of segments reached 500. Finally, some suggestions are presented regarding improvements of the algorithm.
Keywords: Fysik;Physical Sciences
Issue Date: 2011
Publisher: Chalmers tekniska högskola / Institutionen för teknisk fysik
Chalmers University of Technology / Department of Applied Physics
URI: https://hdl.handle.net/20.500.12380/176456
Collection:Examensarbeten för masterexamen // Master Theses



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.