Essays about: "thesis in shortest path algorithm"

Showing result 1 - 5 of 26 essays containing the words thesis in shortest path algorithm.

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

    University essay from Stockholms universitet/Institutionen för data- och systemvetenskap

    Author : Hannes Rönningen; Erik Olofsson; [2023]
    Keywords : 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;

    Abstract : 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. READ MORE

  3. 2. Obstacle Detection and Avoidance for an Automated Guided Vehicle

    University essay from Linköpings universitet/Fordonssystem

    Author : Filip Berlin; Sebastian Granath; [2021]
    Keywords : AGV; Occupancy Grid; Path planning; Automated Guided Vehicle;

    Abstract : The need for faster and more reliable logistics solutions is rapidly increasing. This is due to higher demands on the logistical services to improve quality,  quantity, speed and reduce the error tolerance. An arising solution to these increased demands is automated solutions in warehouses, i.e. READ MORE

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

    University essay from KTH/Matematik (Avd.)

    Author : Viktor Ossmark; [2021]
    Keywords : 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;

    Abstract : 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. READ MORE

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

    University essay from Linköpings universitet/Programvara och system

    Author : Simon Wrede; [2021]
    Keywords : graph; shortest path; memory efficient; monte carlo;

    Abstract : 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. READ MORE

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

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

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

    Abstract : 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. READ MORE