With the evolution of spacecraft systems, we see the growing need for smaller, more affordable, and robust spacecrafts that can be jettisoned with ease and sent to sites to perform a myriad of operations that a larger craft would prohibit, or that can be quickly manipulated from performing one task into another. The developing requirements have led to the creation of Nano-Satellites, or CubeSats. The question then remains, how to navigate the expanse of space with such a minute spacecraft? A solution to this is using the stars themselves as a means of navigation. This can be accomplished by measuring the distance between stars in a camera image and determining the stars' identities. Once identified, the spacecraft can obtain its position and facing. A series of star identification algorithms called Lost in Space Algorithms (LISAs) are used to recognize the stars in an image and assess the accuracy and error associated with each algorithm. This is done by creating various images from a simulated camera, using a program called MATLAB, along with images of actual stars with uncompensated errors. It is shown how suitable these algorithms are for use in space navigation, what constraints and impediments each have, and if low quality cameras using these algorithms can solve the Lost in Space problem.
| Identifer | oai:union.ndltd.org:UTAHS/oai:digitalcommons.usu.edu:etd-2723 |
| Date | 01 May 2013 |
| Creators | Brätt, Steven Paul |
| Publisher | DigitalCommons@USU |
| Source Sets | Utah State University |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | All Graduate Theses and Dissertations |
| Rights | Copyright for this work is held by the author. Transmission or reproduction of materials protected by copyright beyond that allowed by fair use requires the written permission of the copyright owners. Works not in the public domain cannot be commercially exploited without permission of the copyright owner. Responsibility for any use rests exclusively with the user. For more information contact Andrew Wesolek (andrew.wesolek@usu.edu). |
Page generated in 0.0106 seconds