An agent-based model for large scale parallel simulation of natural disasters in towns and cities : path finding and preprocessing
Loading...
Authors
Gallagher, Cody
Issue Date
2013-05
Type
Electronic thesis
Thesis
Thesis
Language
ENG
Keywords
Computer science
Alternative Title
Abstract
Path finding is a hard problem we face when dealing with discrete event simulation. The time required to perform searches and propagate the information back to the source is one of the biggest limiting factors in large scale computing. Here you will find research on different path finding techniques and how they hold up in different conditions. In the case of conservative runs, the A* algorithm beats out Ripple search, while Ripple search was faster in larger optimistic runs. Both the A* and Ripple Search techniques perform well in different circumstances, giving them both a reason to be used in large scale simulation. This proves that although an algorithm is not parallelized, there could be specific situations that it is preferred over another that is highly parallel.
Description
May 2013
School of Science
School of Science
Full Citation
Publisher
Rensselaer Polytechnic Institute, Troy, NY