Date of Award
Bachelor of Science (B.S.) in Computer Science and University Honors
tochastic systems, Computer algorithms, Artificial intelligence, Querying (Computer science)
In this paper, I compare the performance of various A*-based search algorithms in a search space where the assumption that goal states must be static is removed. I provide a basic overview of the algorithms used and explain how I created the environment in which the agents will move. Both off-line/incremental and real-time A*-based searches are compared to their original published versions in a grid-based environment similar to those described in each. I explain my results and make suggestions for future research.
Harvey, Kallen M., "Performance of A* Based Search Algorithms in Grid-Based Stochastic Multi-Agent Systems with Static Obstacles and Non-Static Goal States" (2019). University Honors Theses. Paper 720.