Sökning: "map matching"
Visar resultat 11 - 15 av 41 avhandlingar innehållade orden map matching.
11. Robust self-localization of mobile robots in dynamic environments using scan matching algorithms
Sammanfattning : The most fundamental task for any mobile robot is to perform self-localization in the world in which it is currently active, i.e. determine its position relative its world. Encoders that count wheel rotations are often used, which can be turned into relative position estimates by mean of integration. LÄS MER
12. Mobile robot navigation and map generation using range measurements
Sammanfattning : This thesis is on mobile robot navigation using range sensors. The two sensors types used are time-of-flight lasers and sheet-of-light range cameras, both giving densely spaced range measurements. Map generation and navi gation are achieved in indoor environments, even when there are lots of disturbing objects giving cluttered range measurements. LÄS MER
13. Digital model-driven retail supply chain management
Sammanfattning : The purpose of this thesis is to increase the understanding of how matching of digital models of products and customers can be used to shift the performance frontier in retail supply chains. This thesis puts forward the matching of digital models as an operational practice used by retail supply chains. LÄS MER
14. Bayesian Inference in Terrain Navigation
Sammanfattning : Terrain navigation is a concept for autonomous aircraft navigation. If measurements of the terrain height over mean sea-level are collected along the aircraft flight path, an estimate of the aircraft position can be formed by matching these measurements with a digital reference terrain map. This matching is a recursive nonlinear estimation problem. LÄS MER
15. Optimization, Matroids and Error-Correcting Codes
Sammanfattning : The first subject we investigate in this thesis deals with optimization problems on graphs. The edges are given costs defined by the values of independent exponential random variables. We show how to calculate some or all moments of the distributions of the costs of some optimization problems on graphs. LÄS MER