Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Cooperative localization algorithms in ultra-wideband systems for indoor positioning
KTH, School of Electrical Engineering (EES), Signal Processing.
2012 (English)Student paper other, 20 credits / 30 HE creditsStudent thesis
Abstract [en]

Indoor positioning has become an important research field in recent years. This is due to the potential services or products that can be offered, which would be very useful for users in several applications, and the interesting commercialization possibilities. But nowadays the most developed positioning systems are used outdoors, and for example GNSSs do not provide indoor coverage, so the efforts are focused on other local radio technologies. In particular, ultra-wideband is the object of this thesis.

In this thesis a set of cooperative algorithms are presented and intended for use in the localization phase of an ultra-wideband positioning system. Different approaches and points of view are shown in the literature related to the localization problem. Here there is a revision of the main concepts as well as some software implementations and their results in MATLAB, always trying to evaluate which is the best option in each situation.

The Ultra-Wideband system considered in this thesis consists of a set of nodes, some of which have unknown positions that have to be estimated by the algorithms. These nodes have the ability of calculating distances between each other by measuring the round-triptime of ultra-wideband pulse signals. The distances are used as inputs to the algorithms to calculate the estimated positions of the nodes as outputs. The most remarkable detail is the cooperation, which means that the distances between any pair of nodes is used even when both have unknown positions, taking advantage of that information.

The results show that using the cooperation, the algorithms can be very precise even in very demanding conditions when nodes can not communicate with the whole network due to a range limitation of the technology or physical obstacles. Therefore, cooperative algorithms represent a way to further investigate and improve the solutions for indoor positioning.

Place, publisher, year, edition, pages
2012. , 74 p.
Series
EES Examensarbete / Master Thesis, XR-EE-SB 2012:016
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
URN: urn:nbn:se:kth:diva-102358OAI: oai:DiVA.org:kth-102358DiVA: diva2:552447
Uppsok
Technology
Examiners
Available from: 2012-09-14 Created: 2012-09-14 Last updated: 2012-09-14Bibliographically approved

Open Access in DiVA

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

By organisation
Signal Processing
Electrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 275 downloads
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

urn-nbn

Altmetric score

urn-nbn
Total: 215 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf