Technical Papers
Jun 20, 2013

Safety-Optimal Linearized Impulsive Rendezvous with Trajectory Uncertainties

Publication: Journal of Aerospace Engineering
Volume 27, Issue 6

Abstract

Different from the current studies on the impulsive rendezvous which are mainly normal propellant-optimal or time-optimal designs, the safety-optimal impulsive rendezvous with consideration of practical trajectory uncertainties is investigated in this paper. An optimization model for safety-optimal rendezvous is established based on the Clohessy-Wiltshire (C-W) equations, which employs one new, recently proposed quantitative performance index of the rendezvous trajectory safety as the objective function. A real-coded genetic algorithm is adopted to locate the optimal solution. The safety index and the optimization approach are tested by several rendezvous problems with different numbers of impulses and different approach directions. The practical application value of the safety-optimal rendezvous trajectory is demonstrated by comparing with the traditional propellant-optimal and time-optimal rendezvous trajectories.

Get full access to this article

View all available purchase options and get full access to this article.

Acknowledgments

This work was supported by the National Natural Science Foundation of China (Nos. 10902121 and 11222215), the 973 Project (No. 2013CB733100), the Hunan Provincial Natural Science Foundation of China (No. 13JJ1001).

References

Breger, L., and How, J. P. (2008). “Safe trajectories for autonomous rendezvous of spacecraft.” J. Guid. Control Dyn., 31(5), 1478–1489.
Carter, T. E., and Alvarez, S. A. (2000). “Quadratic-based computation of four-impulse optimal rendezvous near circular orbit.” J. Guid. Control Dyn., 23(1), 109–117.
Carter, T. E., and Brient, J. (1995). “Linearized impulsive rendezvous problem.” J. Optim. Theory Appl., 86(3), 553–584.
Clohessy, W. H., and Wiltshire, R. S. (1960). “Terminal guidance system for satellite rendezvous.” J. Aerosp. Sci., 27(9), 653–658.
Eckstein, M. C. (1987). “Safe rendezvous approach to a space station by impulsive transfers and continuous thrust arcs.” Proc., 1st European In Orbit Operations Technology Symp., ESA, Darmstadt, W. Germany, 3–12.
Fehse, W. (2003). Automated rendezvous and docking of spacecraft, Cambridge University Press, Cambridge, U.K.
Goldberg, D. E. (1989). Genetic algorithms in search, optimization and machine learning, Addison Wesley, Reading, MA.
Hechler, F. (1987). “Safe and fuel minimum reference trajectories for closed loop controlled approaches.” Proc., 1st European In Orbit Operations Technology Symp., ESA, Darmstadt, W. Germany, 19–28.
Hughes, G. W., and McInnes, C. R. (2002). “Solar sail hybrid trajectory optimization for non-Keplerian orbit transfers.” J. Guid. Control Dyn., 25(3), 602–604.
Jacobsen, S., Lee, C., Zhu, C., and Dubowsky, S. (2002). “Planning of safe kinematics trajectories for free-flying robots approaching an uncontrolled spinning satellite.” Proc., ASME 2002 Int. Design Engineering Technical Conf. and Computers and Information in Engineering Conf., ASME, New York, 1145–1151.
Jezewski, D. J. (1980). “Primer vector theory applied to the linear relative-motion equations.” Optim. Control Appl. Meth., 1(4), 387–401.
Kim, Y. H., and Spencer, D. B. (2002). “Optimal spacecraft rendezvous using genetic algorithms.” J. Spacecraft Rockets, 39(6), 859–865.
Luo, Y. Z., Liang, L. B., Wang, H., and Tang, G. J. (2011). “Quantitative performance for spacecraft rendezvous trajectory safety.” J. Guid. Control Dyn., 34(4), 1264–1269.
Luo, Y. Z., Tang, G. J., and Lei, Y. J. (2007). “Optimal multi-objective linearized impulsive rendezvous.” J. Guid. Control Dyn., 30(2), 383–389.
Luo, Y. Z., Tang, G. J., and Li, H. Y. (2006). “Optimization of multiple-impulse minimum-time rendezvous with impulse constraints using a hybrid genetic algorithm.” Aerosp. Sci. Technol., 10(6), 534–540.
Naasz, B. (2005). “Safety ellipse motion with coarse sun angle optimization.” Proc., NASA-GSFC Flight Mechanics Symp., NASA CP 2005-0241964, NASA, Washington, DC.
Prussing, J. E. (1969). “Optimal four-impulse fixed-time rendezvous in the vicinity of a circular orbit.” AIAA J., 7(5), 928–935.
Prussing, J. E. (1970). “Optimal two- and three-impulse fixed-time rendezvous in the vicinity of a circular orbit.” AIAA J., 8(7), 1221–1228.
Prussing, J. E. (1995). “Optimal impulsive linear systems: Sufficient conditions and maximum number of impulses.” J. Astronaut. Sci., 43(2), 195–206.
Roger, A. B., and McInnes, C. R. (2000). “Safety constrained free flyer path planning at the international space station.” J. Guid. Control Dyn., 23(6), 971–979.
Wall, B. J., and Conway, B. A. (2009). “Shape-based approach to low-thrust rendezvous trajectory design.” J. Guid. Control Dyn., 32(1), 95–101.
Yang, X. B., Yu, J. Y., and Gao, H. J. (2012). “An impulse control approach to spacecraft autonomous rendezvous based on genetic algorithms.” Neurocomputing, 77(1), 189–196.
Yokoyama, N., and Suzuki, S. (2005). “Modified genetic algorithm for constrained trajectory optimization.” J. Guid. Control Dyn., 28(1), 139–144.

Information & Authors

Information

Published In

Go to Journal of Aerospace Engineering
Journal of Aerospace Engineering
Volume 27Issue 6November 2014

History

Received: Jan 24, 2013
Accepted: Jun 18, 2013
Published online: Jun 20, 2013
Discussion open until: Oct 23, 2014
Published in print: Nov 1, 2014

Permissions

Request permissions for this article.

Authors

Affiliations

Ya-zhong Luo [email protected]
Professor, College of Aerospace Science and Engineering, National Univ. of Defense Technology, 410073, China (corresponding author). E-mail: [email protected]
Li-bo Liang [email protected]
Engineer, Beijing Aerospace Control Center, 100094, China. E-mail: [email protected]
Zhi-yong Niu [email protected]
Graduate Student, College of Aerospace Science and Engineering, National Univ. of Defense Technology, 410073, China. E-mail: [email protected]
Guo-jin Tang [email protected]
Professor, College of Aerospace Science and Engineering, National Univ. of Defense Technology, 410073, China. E-mail: [email protected]

Metrics & Citations

Metrics

Citations

Download citation

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited by

View Options

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Article
$35.00
Add to cart

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Article
$35.00
Add to cart

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share