Sökning: "Shortest Path Algorithms"

Visar resultat 1 - 5 av 33 uppsatser innehållade orden Shortest Path Algorithms.

  1. 1. Customizable Contraction Hierarchies for Mixed Fleet Vehicle Routing : Fast weight customization when not adhering to triangle inequality

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Martin Larsson; [2023]
    Nyckelord :Contraction Hierarchies; Customizable Contraction Hierarchies; Vehicle Routing Problem; Battery Electric Vehicles; Mixed Fleet; Kontraktionshierarkier; Anpassningsbara Kontraktionshierarkier; Ruttplanering; Batteridrivna elfordon; Blandad fordonsflotta;

    Sammanfattning : As the transport industry shifts towards Battery Electric Vehicles (BEVs) the need for accurate route planning rises. BEVs have reduced range compared to traditional fuel based vehicles, and the range can vary greatly depending on ambient conditions and vehicle load. LÄS MER

  3. 2. Reproducibility and Applicability of a Fuzzy-based Routing Algorithm in Wireless Sensor Networks

    Kandidat-uppsats, Stockholms universitet/Institutionen för data- och systemvetenskap

    Författare :Hannes Rönningen; Erik Olofsson; [2023]
    Nyckelord :End-to-end delay; Energy-efficiency; Fuzzy logic; Lifetime maximization; Multi-hop network; Multiobjective optimization; Reinforcement learning; Routing; Routing-protocol; Shortest path; Wireless sensor networks; WSN localization;

    Sammanfattning : Wireless sensor networks is a broad subject with many applications and interesting research areas, such as optimization within connectivity and energy efficiency. One problem is that most published articles in this field use customized simulation environments and do not provide source code of their implementation. LÄS MER

  4. 3. Implementation av centraliserad Multihop Routing med High Level Architecture : En empirisk undersökning av kontextspecifika heuristiker för effektiv grafsökning

    Kandidat-uppsats, Linköpings universitet/Institutionen för datavetenskap

    Författare :Lukas Pohlman; [2021]
    Nyckelord :Distributed simulations; High Level Architecture; Routing algorithms; Graphsearch; Distribuerade simuleringar; High Level Architecture; Routingalgoritmer; Grafsökning;

    Sammanfattning : I detta arbete har en trådad simulator tagits fram enligt standarden High Level Architecture (HLA). Simulatorn är kapabel att avgöra den kortaste vägen från alla noder till alla andra noder i ett radionätverk med 200 noder på i genomsnitt 263 millisekunder. LÄS MER

  5. 4. Memory efficient Monte Carlo methods for computing shortest paths in stochastic graphs

    Master-uppsats, Linköpings universitet/Programvara och system

    Författare :Simon Wrede; [2021]
    Nyckelord :graph; shortest path; memory efficient; monte carlo;

    Sammanfattning : Threat modeling for information technology infrastructure can be done using shortest path algorithms in stochastic graphs. By modeling the infrastructure as a graph, potential vulnerabilities may be presented by computing what paths an attacker might take. LÄS MER

  7. 5. UAV Navigation using Local Computational Resources : Keeping a target in sight

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Magnus Cardell; [2021]
    Nyckelord :Unmanned aerial vehicle; Path planning; On-board computation; Autonomy; Obemannade drönare; Vägplanering; Lokala beräkningar; Autonomi;

    Sammanfattning : When tracking a moving target, an Unmanned Aerial Vehicle (UAV) mustkeep the target within its sensory range while simultaneously remaining awareof its surroundings. However, small flight computers must have sufficientenvironmental knowledge and computational capabilities to provide real-timecontrol to function without a ground station connection. LÄS MER