First Advisor
Marc Goodman
Date of Award
5-24-2019
Document Type
Thesis
Degree Name
Bachelor of Science (B.S.) in Computer Science and University Honors
Department
Computer Science
Subjects
Computer algorithms, Stochastic systems
DOI
10.15760/honors.737
Abstract
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.
Rights
In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/ This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).
Persistent Identifier
https://archives.pdx.edu/ds/psu/28871
Recommended Citation
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.
https://doi.org/10.15760/honors.737