Orbital Accessibility Problem for Spacecraft with a Single Impulse

Wen, Changxuan; Zhao, Yong; Shi, Peng; Zhang, Hao

doi:10.2514/1.62629

Cited by 37 publications

(17 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…5). As indicated in [6], an increase in target r f along i c forms a family of terminal velocity hyperbolas with identical asymptotes and that monotonically move farther away from the origin of frame Plane M can be arbitrarily set by specifying angle i; therefore, the proposition holds for any plane M and Proposition 2 is proven.…”

Section: Propositionmentioning

confidence: 88%

“…With these conclusions, three possible types of tangency can occur between terminal velocity hyperbola L and section ellipse A M , as illustrated in orbit accessibility problem (OAP) discussed in Ref. [6]. First, Ref.…”

Section: Propositionmentioning

confidence: 99%

“…First, Ref. [6] concludes that a target r f can be reached when at least one available initial velocity v 1 lies on the corresponding terminal velocity hyperbola L. The distribution of Δv is an ellipsoid centered at the terminus of v 0 ; therefore, all available v 1 are confined within this ellipsoid. Accordingly, a target is reachable only when L intersects with or is tangent to the ellipsoid.…”

Section: Propositionmentioning

confidence: 99%

“…[6], as a precondition of orbit accessibility, the admissible domain of angle i should be confined such that the plane M intersects with or is tangent to maneuvering ellipsoid A. That is, an intersection should exist between plane M and maneuvering ellipsoid A.…”

Section: Initial Conditions With Ellipsoidal δV Distributionmentioning

confidence: 99%

See 3 more Smart Citations

Reachable domain for spacecraft with ellipsoidal Delta-V distribution

Wen

Peng

2018

Astrodyn

Self Cite

View full text Add to dashboard Cite

Conventional reachable domain (RD) problem with an admissible velocity increment, Δv, in an isotropic distribution, was extended to the general case with Δv in an anisotropic ellipsoidal distribution. Such an extension enables RD to describe the effect of initial velocity uncertainty because a Gaussian form of velocity uncertainty can be regarded as possible velocity deviations that are confined within an error ellipsoid. To specify RD in space, the boundary surface of RD, also known as the envelope, should be determined. In this study, the envelope is divided into two parts: inner and outer envelopes. Thus, the problem of solving the RD envelope is formulated into an optimization problem. The inner and outer reachable boundaries that are closest to and farthest away from the center of the Earth, respectively, were found in each direction. An optimal control policy is then formulated by using the necessary condition for an optimum; that is, the first-order derivative of the performance function with respect to the control variable becomes zero. Mathematical properties regarding the optimal control policy is discussed. Finally, an algorithm to solve the RD envelope is proposed. In general, the proposed algorithm does not require any iteration, and therefore benefits from quick computation. Numerical examples, including two coplanar cases and two 3D cases, are provided, which demonstrate that the proposed algorithm works efficiently. KEYWORDS reachable domain maneuverability orbit uncertaintyResearch Article

show abstract

Section: Propositionmentioning

confidence: 88%

Section: Propositionmentioning

confidence: 99%

Section: Propositionmentioning

confidence: 99%

Section: Initial Conditions With Ellipsoidal δV Distributionmentioning

confidence: 99%

See 2 more Smart Citations

Reachable domain for spacecraft with ellipsoidal Delta-V distribution

Wen

Peng

2018

Astrodyn

Self Cite

View full text Add to dashboard Cite

show abstract

“…This constitutes one of the major novelties introduced by this methodology. In this study, we also show genetic algorithm based on methodology's ability to find optimized trajectories to both targets whose trajectories lend themselves to easy rendezvous, such as Main Belt Asteroids or planets, as well as targets that would not be accessible to our current spacecraft technology without the aid of at least one planetary flyby, such as Trans-Neptunian Asteroids or comets, as discussed in Wen et al [9] and refined further in Wen et al [10]. This constitutes the second major novelty introduced by this paper.…”

Section: Introductionmentioning

confidence: 99%

Optimal Trajectory Determination and Mission Design for Asteroid/Deep-Space Exploration via Multibody Gravity Assist Maneuvers

Fritz

Turkoglu

2017

International Journal of Aerospace Engineering

View full text Add to dashboard Cite

This paper discusses the creation of a genetic algorithm to locate and optimize interplanetary trajectories using gravity assist maneuvers to improve fuel efficiency of the mission. The algorithm is implemented on two cases: (i) a Centaur-class target close to the ecliptic plane and (ii) a Centaur-class target with a high inclination to the ecliptic plane. Cases for multiple numbers of flybys (up to three) are discussed and compared. It is shown that, for the targets considered here, a single flyby of Jupiter is the most efficient trajectory to either target with the conditions and limitations discussed in this paper. In this paper, we also iterate on possible reasons for certain results seen in the analysis and show how these previously observed behaviors could be present in any trajectory found. The parameters and methods used in the algorithm are explained and justified over multiple real-life interplanetary missions to provide deeper insights into the development choices.

show abstract