Essays about: "Shortest Path Algorithms"
Showing result 1 - 5 of 31 essays containing the words Shortest Path Algorithms.
-
1. Customizable Contraction Hierarchies for Mixed Fleet Vehicle Routing : Fast weight customization when not adhering to triangle inequality
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : 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. READ MORE
-
2. Reproducibility and Applicability of a Fuzzy-based Routing Algorithm in Wireless Sensor Networks
University essay from Stockholms universitet/Institutionen för data- och systemvetenskapAbstract : 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. Memory efficient Monte Carlo methods for computing shortest paths in stochastic graphs
University essay from Linköpings universitet/Programvara och systemAbstract : 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
-
4. UAV Navigation using Local Computational Resources : Keeping a target in sight
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)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
-
5. Warehouse Optimization by Multi-Agent Rollout Algorithms
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Systems consisting of multiple robots are traditionallydifficult to optimize. This project considers such a systemin a simulated warehouse setting, where the robots are todeliver boxes while avoiding collisions. Adding such collisionconstraints complicates the problem. READ MORE