Show simple item record

dc.contributor.advisorJonathan P. How.en_US
dc.contributor.authorGarcía, Ian Miguelen_US
dc.contributor.otherMassachusetts Institute of Technology. Dept. of Aeronautics and Astronautics.en_US
dc.date.accessioned2006-03-29T18:45:24Z
dc.date.available2006-03-29T18:45:24Z
dc.date.copyright2005en_US
dc.date.issued2005en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/32448
dc.descriptionThesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2005.en_US
dc.descriptionIncludes bibliographical references (p. 115-120).en_US
dc.description.abstractFuture space assembly and science missions (e.g., Terrestrial Planet Finder) will typically require complex reconfiguration maneuvers involving well coordinated 6 DOF motions of the entire fleet of spacecraft. The motions must also satisfy constraints such as collision avoidance and pointing restrictions on some of the instruments. This problem is particularly difficult due to the nonlinearity of the attitude dynamics and the non-convexity of some of the constraints. The coupling of the positions and attitudes of the N spacecraft by some of the constraints adds a significant complication because it requires that the trajectory optimization be solved as a single 6N DOF problem. This thesis presents a method to solve this problem by first concentrating on finding a feasible solution, then developing improvements to it. The first step is posed as a path planning problem without differential constraints and solved using Rapidly-exploring Random Trees (RRT's). The improvement step is posed as a feasible nonlinear optimization problem and solved by an iterative optimization similar to a sequential linear programming method. The primary contribution of the thesis is an improvement to the basic RRT algorithm that replaces the connection step with a more complex function that takes into account local information about the constraints. Two functions are proposed, one based on artificial potential functions, and another based on a random search. The results show that the new RRT with either of these connection functions is faster and more reliable for a difficult sample problem.en_US
dc.description.abstract(cont.) The combination of an RRT with the new connection functions, and the improvement step, is also demonstrated on several challenging spacecraft reconfiguration problems with up to 16 spacecraft (96 DOF). The solution technique is shown to be robust and with computation times fast enough to embed in a real-time optimization algorithm as part of an autonomous onboard control system.en_US
dc.description.statementofresponsibilityby Ian Miguel García.en_US
dc.format.extent120 p.en_US
dc.format.extent6099443 bytes
dc.format.extent6106773 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/pdf
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsM.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.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582
dc.subjectAeronautics and Astronautics.en_US
dc.titleNonlinear trajectory optimization with path constraints applied to spacecraft reconfiguration maneuversen_US
dc.typeThesisen_US
dc.description.degreeS.M.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Aeronautics and Astronautics
dc.identifier.oclc61719895en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record