Nonsingular dual-primal algorithm for fuel-optimal impulsive rendezvous

Youngkwang Kim, Sang-Young Park

Research output: Contribution to journalArticle

Abstract

This paper addresses a fuel-optimal impulsive rendezvous problem for minimizing the total characteristic velocity. In previous research, the authors proposed an efficient dual-primal optimization algorithm for this problem, taking advantage of the primal and dual formulations at once. Although the dual-primal optimization algorithm is capable of computing the accurate global-optimal trajectory for most cases, it cannot solve the nontrivial primer vector cases in which the optimal impulse timings (that is, the time points at which the optimality conditions are satisfied) are not identical to the time points of the optimal impulses (that is, the time points at which the impulses are applied in the optimal trajectory). The main contributions of this paper are 1) development of a novel strategy resolving the nontrivial primer vectors for general dual-first approaches, and 2) development of a new nonsingular dual-primal optimization algorithm adopting the strategy. The new algorithm generates an impulse sequence set including the possible combinations of time points of impulses, and then it searches through the impulse sequence set to find the primal root. To demonstrate its nontriviality resolution capability, the rendezvous problems near circular and elliptical orbits are solved for five test cases, and the newly developed algorithm succeeds in resolving nontrivial primer vectors.

Original languageEnglish
Pages (from-to)737-751
Number of pages15
JournalJournal of Guidance, Control, and Dynamics
Volume42
Issue number4
DOIs
Publication statusPublished - 2019 Jan 1

Fingerprint

Primal-dual Algorithm
rendezvous
Rendezvous
Impulse
impulses
primers
Optimization Algorithm
Optimal Trajectory
optimization
trajectory
Trajectories
trajectories
elliptical orbits
circular orbits
Optimality Conditions
Orbits
Timing
Orbit
time measurement
Roots

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Aerospace Engineering
  • Space and Planetary Science
  • Electrical and Electronic Engineering
  • Applied Mathematics

Cite this

@article{8d4b91b6f4014dcbbb481af6c5115336,
title = "Nonsingular dual-primal algorithm for fuel-optimal impulsive rendezvous",
abstract = "This paper addresses a fuel-optimal impulsive rendezvous problem for minimizing the total characteristic velocity. In previous research, the authors proposed an efficient dual-primal optimization algorithm for this problem, taking advantage of the primal and dual formulations at once. Although the dual-primal optimization algorithm is capable of computing the accurate global-optimal trajectory for most cases, it cannot solve the nontrivial primer vector cases in which the optimal impulse timings (that is, the time points at which the optimality conditions are satisfied) are not identical to the time points of the optimal impulses (that is, the time points at which the impulses are applied in the optimal trajectory). The main contributions of this paper are 1) development of a novel strategy resolving the nontrivial primer vectors for general dual-first approaches, and 2) development of a new nonsingular dual-primal optimization algorithm adopting the strategy. The new algorithm generates an impulse sequence set including the possible combinations of time points of impulses, and then it searches through the impulse sequence set to find the primal root. To demonstrate its nontriviality resolution capability, the rendezvous problems near circular and elliptical orbits are solved for five test cases, and the newly developed algorithm succeeds in resolving nontrivial primer vectors.",
author = "Youngkwang Kim and Sang-Young Park",
year = "2019",
month = "1",
day = "1",
doi = "10.2514/1.G003828",
language = "English",
volume = "42",
pages = "737--751",
journal = "Journal of Guidance, Control, and Dynamics",
issn = "0731-5090",
publisher = "American Institute of Aeronautics and Astronautics Inc. (AIAA)",
number = "4",

}

Nonsingular dual-primal algorithm for fuel-optimal impulsive rendezvous. / Kim, Youngkwang; Park, Sang-Young.

In: Journal of Guidance, Control, and Dynamics, Vol. 42, No. 4, 01.01.2019, p. 737-751.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Nonsingular dual-primal algorithm for fuel-optimal impulsive rendezvous

AU - Kim, Youngkwang

AU - Park, Sang-Young

PY - 2019/1/1

Y1 - 2019/1/1

N2 - This paper addresses a fuel-optimal impulsive rendezvous problem for minimizing the total characteristic velocity. In previous research, the authors proposed an efficient dual-primal optimization algorithm for this problem, taking advantage of the primal and dual formulations at once. Although the dual-primal optimization algorithm is capable of computing the accurate global-optimal trajectory for most cases, it cannot solve the nontrivial primer vector cases in which the optimal impulse timings (that is, the time points at which the optimality conditions are satisfied) are not identical to the time points of the optimal impulses (that is, the time points at which the impulses are applied in the optimal trajectory). The main contributions of this paper are 1) development of a novel strategy resolving the nontrivial primer vectors for general dual-first approaches, and 2) development of a new nonsingular dual-primal optimization algorithm adopting the strategy. The new algorithm generates an impulse sequence set including the possible combinations of time points of impulses, and then it searches through the impulse sequence set to find the primal root. To demonstrate its nontriviality resolution capability, the rendezvous problems near circular and elliptical orbits are solved for five test cases, and the newly developed algorithm succeeds in resolving nontrivial primer vectors.

AB - This paper addresses a fuel-optimal impulsive rendezvous problem for minimizing the total characteristic velocity. In previous research, the authors proposed an efficient dual-primal optimization algorithm for this problem, taking advantage of the primal and dual formulations at once. Although the dual-primal optimization algorithm is capable of computing the accurate global-optimal trajectory for most cases, it cannot solve the nontrivial primer vector cases in which the optimal impulse timings (that is, the time points at which the optimality conditions are satisfied) are not identical to the time points of the optimal impulses (that is, the time points at which the impulses are applied in the optimal trajectory). The main contributions of this paper are 1) development of a novel strategy resolving the nontrivial primer vectors for general dual-first approaches, and 2) development of a new nonsingular dual-primal optimization algorithm adopting the strategy. The new algorithm generates an impulse sequence set including the possible combinations of time points of impulses, and then it searches through the impulse sequence set to find the primal root. To demonstrate its nontriviality resolution capability, the rendezvous problems near circular and elliptical orbits are solved for five test cases, and the newly developed algorithm succeeds in resolving nontrivial primer vectors.

UR - http://www.scopus.com/inward/record.url?scp=85067015659&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85067015659&partnerID=8YFLogxK

U2 - 10.2514/1.G003828

DO - 10.2514/1.G003828

M3 - Article

VL - 42

SP - 737

EP - 751

JO - Journal of Guidance, Control, and Dynamics

JF - Journal of Guidance, Control, and Dynamics

SN - 0731-5090

IS - 4

ER -