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

First Advisor

Marc Goodman

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.

Persistent Identifier

https://archives.pdx.edu/ds/psu/28871

Share

COinS