Hohmann transfer via constrained optimization

1Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Inspired by the geometric method proposed by Jean-Pierre MAREC, we first consider the Hohmann transfer problem between two coplanar circular orbits as a static nonlinear programming problem with an inequality constraint. By the Kuhn-Tucker theorem and a second-order sufficient condition for minima, we analytically prove the global minimum of the Hohmann transfer. Two sets of feasible solutions are found: one corresponding to the Hohmann transfer is the global minimum and the other is a local minimum. We next formulate the Hohmann transfer problem as boundary value problems, which are solved by the calculus of variations. The two sets of feasible solutions are also found by numerical examples. Via static and dynamic constrained optimizations, the solution to the Hohmann transfer problem is re-discovered, and its global minimum is analytically verified using nonlinear programming.

Cite

CITATION STYLE

APA

Xie, L., Zhang, Y. qun, & Xu, J. yan. (2018). Hohmann transfer via constrained optimization. Frontiers of Information Technology and Electronic Engineering, 19(11), 1444–1458. https://doi.org/10.1631/FITEE.1800295

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free