Solving the Optimal Multi-impulse Rendezvous ProblemBased on the Dynamic Programming
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    The multi-impulse rendezvous problem is a key research field of astronautics. Firstly, based on the operational research, this problem was converted to a multi-phase-multi- dimension dynamic programming question. Then the multi-phase-two-dimension dynamic programming problem was emphatically analyzed, and the state transfer equations and recursion equations of the performance function were deduced. The solution to the two-impulse and three-impulse problem and the validating examples were given later. ln the end, the dynamic programming idea which uses the evolution algorithm to reduce the dimension of the multi-dimension question was introduced.

    Reference
    Related
    Cited by
Get Citation

LIU Luhua, TANG Guojian, YU Menglun. Solving the Optimal Multi-impulse Rendezvous ProblemBased on the Dynamic Programming[J]. Journal of National University of Defense Technology,2006,28(6):38-42.

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:April 07,2006
  • Revised:
  • Adopted:
  • Online: March 14,2013
  • Published:
Article QR Code