Date of Award

Spring 2023

Document Type

Restricted Thesis

Terms of Use

© 2023 Minh D. Nguyen. All rights reserved. Access to this work is restricted to users within the Swarthmore College network and may only be used for non-commercial, educational, and research purposes. Sharing with users outside of the Swarthmore College network is expressly prohibited. For all other uses, including reproduction and distribution, please contact the copyright holder.

Degree Name

Bachelor of Arts

Department

Engineering

First Advisor

Matthew A. Zucker

Abstract

This project aims to implement a path planning algorithm called Rapidly-exploring Random Tree (RRT) in the Rust programming language. The main goal is to create a working program that supports 2D visualization for the users. Because Rust is a fairly new language and has state-of-the-art memory safety checks, we want to use Rust to achieve better speed and performance than another programming language like Python. The report will focus on the theory of RRT, background of Rust, methods of how I tackled this project, what I accomplished, the findings after successfully implementing RRT in Rust, and discussions of unfinished goals for future developments.

Share

COinS