MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Analysis of relative navigation architectures for formation flying spacecrafts

Author(s)
Lefebvre de Plinval-Salgues, Henry Jacques
Thumbnail
DownloadFull printable version (9.391Mb)
Other Contributors
Massachusetts Institute of Technology. Dept. of Aeronautics and Astronautics.
Advisor
Jonathan P. How.
Terms of use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582
Metadata
Show full item record
Abstract
Many future space missions will involve fleets with a large number of satellites flying in formation. Indeed, such fleets provably offer more reliability, redundancy, scalability and repeatability. However, large fleets also represent a challenge, especially for the navigation algorithms, which must provide an accurate estimate of the state of the fleet, with minimum requirements. Furthermore, as the number of satellites in the fleet increases, the computations to be performed increase dramatically, as well as the synchronization and communication requirements, making the design of efficient algorithms a difficult challenge. Based on previous studies, Decentralized Algorithms were designed to spread the computational task. Hierarchic Algorithms were also studied in order to reduce the synchronization requirements. This thesis presents both analytical and numerical comparisons of these algorithms in terms of accuracy, computational complexity, synchronization, and communication. The Decentralized and Hierarchic Algorithms were shown to have good performance in terms of accuracy, while involving far fewer computations than the Centralized Algorithm. As a result, they can be used as scalable algorithms for large formation flying fleets.
 
(cont.) The thesis investigated two additional problems often associated with navigation filters. The first study considers the problem of processing delayed measurements. Three strategies are analyzed, and compared in terms of the accuracy of the estimate they perform, and the memory and computations they require. One of these approach is shown to be efficient, being accurate without requiring heavy computations nor memory. The second study analyzes a particular instability of the Extended Kalman Filter, encountered when two sensors have very different accuracies. The instability is explained and a method to fix it is proposed. In the example analyzed the method proves to be efficient in addressing the instability.
 
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2006.
 
Includes bibliographical references (p. 191-194).
 
Date issued
2006
URI
http://hdl.handle.net/1721.1/35575
Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Publisher
Massachusetts Institute of Technology
Keywords
Aeronautics and Astronautics.

Collections
  • Graduate Theses

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.