Extraterrestrial prospecting missions will be an important first step in preparation of the harvesting and extraction of natural resources in space. Additionally, knowledge from a prospecting mission will allow the subsequent harvesting or mining mission to efficiently extract resources. Due to the risk and cost of manned space-flight, these prospecting missions will be robotic in nature, and will enable investors to weigh risk and return of a harvesting mission.
The research presented here explores a hypothetical automated prospecting mission on the Martian surface using landscapes simulated from the Mars Global Surveyor satellite. In this mission, a swarm of autonomous exploration rovers have been sent to the Martian surface to cooperatively search for some natural resource. This study examines optimization and path planning algorithms that would enable such an autonomous mission to accomplish its goals. (Abstract shortened by ProQuest.)
|Advisor:||Thein, May-Win L.|
|Commitee:||Fussell, Barry, Ruml, Wheeler|
|School:||University of New Hampshire|
|School Location:||United States -- New Hampshire|
|Source:||MAI 56/03M(E), Masters Abstracts International|
|Subjects:||Mechanical engineering, Robotics, Computer science|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be