Planning and scheduling proximity operations for autonomous orbital rendezvous
Name
60849410-MIT.pdf
Description
Full printable version
Size
4.8 MB
Format
Adobe PDF
Checksum (MD5)
a403ee8ea034837889e7f71a3954246f
Author(s)
Guerra, Christopher J., 1978-
Advisor(s)
Lance A. Page and John J. Deyst, Jr.
Date Issued
2003
Publisher
Massachusetts Institute of Technology
Abstract
This thesis develops a mixed integer programming formulation to solve the proximity operations scheduling problem for autonomous orbital rendezvous. The algorithm of this thesis allows the operator to specify planned modes, which encode the chase satellite's operations. The scheduler optimally places these modes in the midst of the environmental conditions that fall out of the chase satellite's orbit parameters. The algorithm manages resources, i. e. battery state of charge, and observes temporal constraints. Experiments show that the scheduler responds to changes in a variety of situations. It accommodates changes to the constraints in the modes. Relaxing or tightening the restrictions on the resources illuminates the algorithm's responsiveness to practical resource demands. Changes to the definition of optimality via a cost function indicate that the scheduler reacts to a diverse set of parameters.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2003.
Includes bibliographical references (p. 115-117).
Subjects
Aeronautics and Astronautics.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
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.
Persistent DSpace Link
