Date of Award:
12-2023
Document Type:
Thesis
Degree Name:
Master of Science (MS)
Department:
Computer Science
Committee Chair(s)
Mario Harper
Committee
Mario Harper
Committee
Curtis Dyreson
Committee
Steve Petruzza
Abstract
Limited resources and uncertainty pose a substantial problem for multi-robot exploration of unknown environments. This research paper looks to determine the optimal time to terminate robot exploration while maximizing information gathered. Whilst making this determination, the system's resources and capabilities must be taken into account. To see if our strategy works, we ran many simulations in varying environments. The results of this research are important for real-world uses like robot exploration, search and rescue missions, and automated surveillance. Determining when to stop exploring can help the system save resources, explore faster, and make better decisions.
Checksum
e3375eff1b3eb826e44f4907e9694b71
Recommended Citation
Crowther, Trey D., "Optimal Stopping of Multi-Robot Exploration for Unknown, Bounded Environments" (2023). All Graduate Theses and Dissertations, Fall 2023 to Present. 76.
https://digitalcommons.usu.edu/etd2023/76
Included in
Copyright for this work is retained by the student. If you have any questions regarding the inclusion of this work in the Digital Commons, please email us at .