Sökning: "Dijkstra algorithm"

Visar resultat 1 - 5 av 24 uppsatser innehållade orden Dijkstra 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 comparison between mapless and pre-mapped path planning : Towards open-source Autonomous Mobile Robots in a dynamic industrial setting

    Kandidat-uppsats, Högskolan i Skövde/Institutionen för informationsteknologi

    Författare :Linus Aspholm; Michael Rolén; [2023]
    Nyckelord :Autonomous Mobile Robot AMR ; Path planning; Open-Source; Dynamic path planning;

    Sammanfattning : Since their introduction in the 1950s, industrial Automated Guided Vehicles (AGV) have gone from automatic machinery limited by hardware to complex robots limited by software, called Autonomous Mobile Robots. Small and medium businesses need to be able to utilize cutting-edge technology. LÄS MER

  4. 3. A comparison of algorithms for the purpose of path-finding in a 3D grid

    Kandidat-uppsats, Blekinge Tekniska Högskola/Institutionen för datavetenskap

    Författare :Oscar Östberg; [2022]
    Nyckelord :;

    Sammanfattning : Both AI and robotics are rapidly growing fields in today's society, however a digital mind is not inherently able to navigate the world around it, regardless of if that world is a virtual world or the real world. In order to solve this problem path-finding algorithms were created, these algorithms allow a digital mind to navigate a space as long as it is given enough information to properly calculate what path it should take. LÄS MER

  5. 4. A Scalability and Performance Evaluation of Precomputed Flow FieldMaps for Multi-Agent Pathfinding

    Kandidat-uppsats, Blekinge Tekniska Högskola/Institutionen för datavetenskap

    Författare :Jonathan Helsing; Alexander Bruce; [2022]
    Nyckelord :pathfinding; flow field; multi-agent; precomputed; dijkstra maps;

    Sammanfattning : Background. The A* algorithm is a well-established pathfinding technique frequently used in video game development. However, a disadvantage of the A* algorithm is that it becomes computationally inefficient and impractical to utilize whenthousands of agents demand an optimal path. LÄS MER

  7. 5. 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