Change search
ReferencesLink to record
Permanent link

Direct link
Some geometric localization problems with applications in robotics
1998 (English)Independent thesis Advanced level (professional degree), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

In this survey, two different kinds of geometrical localization problems with applications in robotics are studied. First, the Robot Localization Problem, which is the problem of determining a robot's unknown position in a known environment, is studied. Then, the Robot Search Problem, in which the position of a hidden item in an unknown environment is searched for, is considered. Throughout the survey mainly two different kinds of sensors are used to gather data about the robot's surrounding, namely Angle Meters and Range Meters. Both problems are formulated as geometrical problems, and are solved using algorithms and data structures from the field of Computational Geometry. Some aspects crucial to implementing robust algorithms in practical applications are also considered.

Place, publisher, year, edition, pages
Keyword [en]
Technology, Algorithms, Data structures, Computational geometry, Robot, localization
Keyword [sv]
URN: urn:nbn:se:ltu:diva-45865ISRN: LTU-EX--98/169--SELocal ID: 385493d2-60a0-4332-b8cd-1b988c906eceOAI: diva2:1019163
Subject / course
Student thesis, at least 30 credits
Educational program
Civil Engineering programmes 1997-2000, master's level
Validerat; 20101217 (root)Available from: 2016-10-04 Created: 2016-10-04Bibliographically approved

Open Access in DiVA

fulltext(477 kB)0 downloads
File information
File name FULLTEXT01.pdfFile size 477 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

ReferencesLink to record
Permanent link

Direct link