Planning and scheduling proximity operations for autonomous orbital rendezvous

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.

Department dc:contributor.department

Massachusetts Institute of Technology. Dept. of Aeronautics and Astronautics.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2003

Author dc:creator

• Guerra, Christopher J., 1978-

Advisor dc:contributor.advisor

• Lance A. Page and John J. Deyst, Jr.

• Aeronautics and Astronautics.

Statement dc:rights

• 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.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/30280

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/30280