10.2514/6.2018-0867">
 

Optimal guidance for relative teardrops with lighting and collision constraints

Document Type

Conference Proceeding

Publication Date

1-7-2018

Abstract

Static optimization problems are formulated and solved to find both minimum time and minimum fuel solutions for an inspector satellite to maneuver into a prescribed three dimensional teardrop relative to a resident space object in geosynchronous orbit. An analytic expression for the final six Hill-Clohessy-Wiltshire states after a coast-burn-coast- burn sequence is developed, where the acceleration magnitude and relative direction of each burn is held constant. The finite nature of the burns are accounted for, and mass loss is accounted for at the end of each burn. Both a genetic algorithm and a nonlinear programming problem solver are used to find the optimal burn angles and durations, where the genetic algorithm provides a good initial guess to the nonlinear programming problem solver. Sun and Moon lighting constraints are incorporated into the optimization problem, in addition to active and passive collision avoidance constraints. Due to the analytic expression of the developed sequence, exact analytic derivatives can be generated for the cost function and constraint equations, providing a way to supply derivative information to gradient-based optimization solvers and possibly enhancing their performance. Teardrop geometry options are reviewed, and different options for cross-track motion is presented. Finally, a range of optimal solutions can be generated while satisfying sunlight constraints, allowing mission planners to choose the best time vs. fuel solution.

Comments

This conference paper is available from the publisher, AIAA, through subscription or purchase using the DOI link below.

Conference Session: Spacecraft Formation Control and RPO

Author note: Eric Prince was an AFIT PhD candidate at the time of this conference. (AFIT-ENY-DS-18-S-071, September 2018)

Source Publication

2018 AIAA Guidance, Navigation, and Control Conference

This document is currently not available here.

Share

COinS