2026-09-18T23:39:04Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/302802022-01-13T07:54:11Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Lance A. Page and John J. Deyst, Jr.
Guerra, Christopher J., 1978-
Massachusetts Institute of Technology. Dept. of Aeronautics and Astronautics.
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
2006-03-24T18:36:26Z
2006-03-24T18:36:26Z
2003
2003
http://hdl.handle.net/1721.1/30280
60849410
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2003.
Includes bibliographical references (p. 115-117).
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.
by Christopher J. Guerra.
S.M.
143 p.
5014381 bytes
5031913 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.
Planning and scheduling proximity operations for autonomous orbital rendezvous
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="07ed64fc-86a4-4696-a1d2-de175296aefb">
<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>Planning and scheduling proximity operations for autonomous orbital rendezvous</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2003</PublicationDate>
<Authors>
<Author>
<DisplayName>Guerra, Christopher J., 1978-</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>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.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>