Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 13 of 13 for “"Dijkstra's algorithm"”.
-
Fuel minimization of a moving vehicle in suburban traffic
… to obtain analytical results. Therefore, we use Dijkstra's shortest path algorithm to discretize our decision problem. By ""setting nodes"" at each distance where there is a traffic light, we can model a realistic situation with an equivalent discrete graph with non negative edge costs. Each node …
-
Explaining the Performance of Bidirectional Dijkstra and A* on Road Networks
… community traditionally uses A* as the baseline algorithm for their research methods. Research papers in the road networks community, however, often build upon Dijkstra's algorithm and use Bidirectional Dijkstra's algorithm as their baseline. This thesis investigates the performance of A* and …
-
Alternate path routing algorithm for traffic engineering in the Internet
… avoid this problem is to use efficient routing algorithm that efficiently maps the flow of data onto the network; The most often used routing algorithm in the internet is the shortest path algorithm (Dijkstra's algorithm). This algorithm is simple and easy to implement. But this algorithm leads …
-
Data Procurement for Shortest Paths on Random Graphs
While Dijkstra's algorithm finds the shortest path between two nodes on a graph with known edge weights, we approach the shortest paths problem for graphs with random edge weights described by known probability distributions. We introduce the idea of a budget of size k which allows us to replace k …
-
SMARTGUIDE: Revolutionizing the Depth and Dependability of Vision-Impaired Navigation
… through the shortest path calculated by Dijkstra's algorithm; and (3) Obstacle Detection and Alerts, where YOLO identifies obstacles, and ZoeDepth estimates their distance to inform users of potential hazards. By adapting its responses based on user feedback, SmartGuide provides …
-
Online Unmanned Ground Vehicle Mission Planning using Active Aerial Vehicle Exploration
… sensors for obstacle detection. Two exploration algorithms were developed to guide the exploration of the UAV. Both identify frontiers for exploration with the Dijkstra Frontier method using Dijkstra's Algorithm to identify a frontier with unknown space, and the other uses a bi-directional RRT to …
-
Path Planning for a UAV in an Agricultural Environment to Tour and Cover Multiple Neighborhoods
… to achieve this goal - a TSP - Greedy and TSP - Dijkstra's. Both of them use a TSP solution to determine the optimal order of touring. They also use the same back and forth motion to cover each region. However, while the first approach uses a brute force to determine the the next closest node of …
-
Application of shortest path algorithms to find paths of minimum radiation dose
… here is the use of two path-optimization algorithms, Dijkstra's Algorithm, and the Bellman-Ford Algorithm, to find paths through radiologically contaminated environments such that the accumulated dose is minimal. Such paths will be very useful for personnel whose job requires them to …
-
Route Optimization for Automated Bridge Inspection with Genetic Algorithm
We develop a Genetic Algorithm (GA) to generate efficient routes for a robotic bridge inspection team. Using robots to automate the process of bridge inspection will improve human safety and reduce time and money allocated to bridge inspections. To do this, we attack the problem of minimizing and …
-
Building Maze Solutions with Computational Dreaming
… computing, such as neural networks and genetic algorithms, lend themselves well to massively parallel systems but come with other drawbacks that can limit their usefulness such as the requirement of a training phase and/or sensitivity to randomness. This thesis investigates the feasibility of a …
-
Geodesic Problems for Mobile Robots
… of the configuration space and any graph search algorithm, such as Dijkstra's algorithm, extracts the solution. In the second problem, we introduce a new kinematic airplane model. Our airplane is a natural extention of the Dubins car, and extends it with an additional configuration variable for …
-
ALGORITHMS FOR ROUTING AND CHANNEL ASSIGNMENT IN WIRELESS INFRASTRUCTURE NETWORKS
… spatial throughput. This dissertation develops algorithms forrouting and broadcasting with channel assignment in such networks. First, we com-pute the minimum cost path between a given source-destination pair with channelassignment on each link in the path such that no two transmissions …
-
Spatial-Temporal Stochasticity of Electric Vehicles in Integrated Traffic and Power System
… system. In this thesis, a state transition algorithm is designed to determine a stochastic model of electric vehicles to simulate electric vehicle movement in an integrated traffic and power network. Dijkstra’s algorithm is used to determine the shortest distance between end-user residential …