Title page for ETD etd-05142009-153456

Type of Document Master's Thesis
Author Bitzer, Matthew Scott
Author's Email Address msbitz@vt.edu
URN etd-05142009-153456
Title Optimal Electrodynamic Tether Phasing and Orbit-Raising Maneuvers
Degree Master of Science
Department Aerospace and Ocean Engineering
Advisory Committee
Advisor Name Title
hall, Christopher D. Committee Chair
Cliff, Eugene M. Committee Member
Woolsey, Craig A. Committee Member
  • Optimal Control
  • Electrodynamic Tethers
  • Orbit Transfers
Date of Defense 2009-04-30
Availability unrestricted
We present optimal solutions for a point-mass electrodynamic tether (EDT) performing phasing and orbit-raising maneuvers. An EDT is a conductive tether on the order of 20 km in length and uses a Lorentz force to provide propellantless thrust. We develop the optimal equations of motion using Pontryagin's Minimum Principle. We find numerical solutions using a global, stochastic optimization method called Adaptive Simulated Annealing. The method uses Markov chains and the system's cost function to narrow down the search space. Newton's Method brings the error in the residual to below a specific tolerance. We compare the EDT solutions to similar constant-thrust solutions and investigate the patterns in the solution space. The EDT phasing maneuver has invariance properties similar to constant-thrust phasing maneuvers. Analyzing the solution space reveals that the EDT is faster at performing phasing maneuvers but slower at performing orbit-raising maneuvers than constant-thrust spacecraft. Also several bifurcation lines occur in the solution spaces for all maneuvers studied.

  Filename       Size       Approximate Download Time (Hours:Minutes:Seconds) 
 28.8 Modem   56K Modem   ISDN (64 Kb)   ISDN (128 Kb)   Higher-speed Access 
  MattBitzerThesisFinal.pdf 2.79 Mb 00:12:55 00:06:38 00:05:49 00:02:54 00:00:14

Browse All Available ETDs by ( Author | Department )

dla home
etds imagebase journals news ereserve special collections
virgnia tech home contact dla university libraries

If you have questions or technical problems, please Contact DLA.