Sökning: "Dynamic Algorithm"

Visar resultat 1 - 5 av 371 avhandlingar innehållade orden Dynamic Algorithm.

  1. 1. Robust self-localization of mobile robots in dynamic environments using scan matching algorithms

    Författare :Ola Bengtsson; Christian Schlegel; Chalmers University of Technology; []
    Nyckelord :ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Mobile robot; Self-localization; Scan matching algorithm; Changed environments; Dynamic environments; o-variance matrix; Kalman filter; Signal processing; Signalbehandling; scan matching algorithm; dynamic environments; self-localization; co-variance matrix; changed environments;

    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

  2. 2. Slab track optimisation considering dynamic train–track interaction

    Författare :Emil Aggestam; Chalmers University of Technology; []
    Nyckelord :Modelling; Genetic algorithm; Slab track; Transition zones; Dynamic vehicle–track interaction; Optimisation; Measurement; Ballastless track;

    Sammanfattning : Slab track is a type of railway track that is frequently used e.g. in high-speed applications as an alternative to ballasted track. Slab track is also well suited on bridges and in tunnels since no ballast is required and the cross-section of tunnels can be reduced. LÄS MER

  3. 3. Dynamic Matrix Algorithms and Applications in Convex and Combinatorial Optimization

    Författare :Jan van den Brand; Danupon Na Nongkai; Santosh Vempala; KTH; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; NATURAL SCIENCES; Dynamic Algorithm; Data Structure; Optimization; Linear Program; Bipartite Matching; Shortest Path; Maximum Flow; Minimum Cost Flow; Diameter; Computer Science; Datalogi;

    Sammanfattning : Dynamic algorithms are used to efficiently maintain solutions to problems where the input undergoes some changes.This thesis studies dynamic algorithms that maintain solutions to linear algebra problems and we explore their applications and implications for dynamic graphs and optimization problems. LÄS MER

  4. 4. Simulation of vertical dynamic interaction between railway vehicle and slab track

    Författare :Emil Aggestam; Chalmers University of Technology; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; transition zones; genetic algorithm; dynamic vehicle–track interaction; Slab track; modelling; ballasteless track;

    Sammanfattning : The usage of slab track for high-speed railway lines has increased in recent decades. In Sweden, the building of new railway lines for higher speed and the selection of track design for such lines are currently being debated. LÄS MER

  5. 5. Dynamic Cloud Resource Management : Scheduling, Migration and Server Disaggregation

    Författare :Petter Svärd; Erik Elmroth; Odej Kao; Umeå universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Cloud computing; virtualization; distributed infrastructure; live migration; scheduling;

    Sammanfattning : A key aspect of cloud computing is the promise of infinite, scalable resources, and that cloud services should scale up and down on demand. This thesis investigates methods for dynamic resource allocation and management of services in cloud datacenters, introducing new approaches as well as improvements to established technologies. LÄS MER