2026-09-19T05:19:00Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/355752022-01-13T07:54:11Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023

Jonathan P. How. Lefebvre de Plinval-Salgues, Henry Jacques Massachusetts Institute of Technology. Dept. of Aeronautics and Astronautics. Massachusetts Institute of Technology. Department of Aeronautics and Astronautics 2007-01-10T16:41:26Z 2007-01-10T16:41:26Z 2006 2006 http://hdl.handle.net/1721.1/35575 74278487 Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2006. Includes bibliographical references (p. 191-194). 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. by Henry Jacques Lefebvre de Plinval-Salgues. S.M. 194 p. 8032390 bytes 8551946 bytes application/pdf application/pdf eng Massachusetts Institute of Technology 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 Aeronautics and Astronautics. Analysis of relative navigation architectures for formation flying spacecrafts Thesis application/pdf false Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="3ffc475d-65ce-443b-a648-778b35e214f2"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Language>eng</Language> <Title>Analysis of relative navigation architectures for formation flying spacecrafts</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2006</PublicationDate> <Authors> <Author> <DisplayName>Lefebvre de Plinval-Salgues, Henry Jacques</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Massachusetts Institute of Technology</DisplayName> <OrgUnit /> </Publisher> </Publishers> <License>http://dspace.mit.edu/handle/1721.1/7582</License> <Keyword>Aeronautics and Astronautics.</Keyword> <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.</Abstract> <Abstract>(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.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>