Sökning: "Dijkstra’s algorithm"

Visar resultat 1 - 5 av 17 uppsatser innehållade orden Dijkstra’s algorithm.

  1. 1. Segment Routing Based Traffic Engineering : A QoS adaptive rerouting using segment routing approach based on IPv6 to mitigate network congestion

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

    Författare :Sepehr Javid; [2023]
    Nyckelord :Segment Routing with IPv6; Quality of Service; Congestion; Extended Berkeley Packet Filter; Segmentering av vägval med IPv6; Tjänstekvalitet; Överbelastning; Utökad Berkeley Packet Filter;

    Sammanfattning : In modern networks, the increasing volume of network traffic and the diverse range of services with varying requirements necessitate the implementation of more advanced routing decisions and traffic engineering. This academic study proposes a QoS adaptive mechanism called "Sepitto", which utilizes Segment routing protocols, specifically SRv6, to address network-traffic control and congestion avoidance. LÄS MER

  3. 2. A GPU Implementation of Kinodynamic Path Planning in Large Continuous Costmap Environments : Using Dijkstra's Algorithm and Simulated Annealing

    Master-uppsats, Karlstads universitet/Institutionen för ingenjörsvetenskap och fysik (from 2013)

    Författare :Robin Larsson; [2023]
    Nyckelord :;

    Sammanfattning : Path planning that takes kinodynamic constraints into account is a crucial part of critical missions where autonomous vehicles must function independently without communication from an operator as this ensures that the vehicle will be able to follow the planned path. In this thesis, an algorithm is presented that can plan kinodynamically feasible paths through large scale continuous costmap environments for different constraints on the maximum allowed acceleration and jerk along the path. LÄS MER

  4. 3. How to make the most of open data? A travel demand and supply model for regional bicycle paths

    Master-uppsats, KTH/Transport och systemanalys

    Författare :Laurent Cazor; [2021]
    Nyckelord :Planning Support System PSS ; Four-Step Model; Gravity Model; Distance-Decay function; Binary Logit Model; Level of Traffic Stress LTS ; Geographic Information System GIS ;

    Sammanfattning : Detta examensarbete syftar till att svara på ett av Trafikverket fastställt problem: en gemensam regional cykelplanerings process skulle göra dem billigare och mer jämförbara. De erbjuder för närvarande planerarna en modell som utvecklades av Kågeson 2007. LÄS MER

  5. 4. Road Segmentation and Optimal Route Prediction using Deep Neural Networks and Graphs

    Master-uppsats, KTH/Matematik (Avd.)

    Författare :Viktor Ossmark; [2021]
    Nyckelord :statistics; applied mathematics; machine learning; computer vision; deep learning; satellite data; remote sensing; image segmentation; optimal routing; deep neural networks; graphs; AI; statistik; tillämpad matematik; maskininlärning; djup inlärning; datorseende; satellitdata; bildsegmentering; optimala rutter; grafer; AI;

    Sammanfattning : Observing the earth from above is a great way of understanding our world better. From space, many complex patterns and relationships on the ground can be identified through high-quality satellite data. LÄS MER

  7. 5. Exploration Strategies for Robotic Vacuum Cleaners

    Master-uppsats, KTH/Mekatronik

    Författare :Sofia Navarro Heredia; [2018]
    Nyckelord :grid maps; frontier-based exploration strategies; NBV; node graph; path planning algorithm; Rutnätskartor; front-baserade strategier för utforskning; nästa bästa utsiktspunkt; nod-graf; algoritm för banplanering;

    Sammanfattning : In this thesis, an exploration mode for the PUREi9 robotic vacuum cleaner is implemented. This exploration would provide information for optimizing the cleaning path beforehand, and would allow the robot to relocalize itself or the charger more easily in case it gets lost. LÄS MER