Solution of the problem of approaching several asteroids with an optimal correction algorithm.

Details Solution of the problem of approaching several asteroids with an optimal correction algorithm. Solution of the problem of approaching several asteroids with an optimal correction algorithm.

Jan 1989

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1989cosre..26..437z&link_type=abstract

Cosmic Res., Vol. 26, No. 4, p. 437 - 446

Physics

Minor Planets: Numerical Simulations

Scientific paper

An interactive procedure for solving the problem of approaching N main belt asteroids is described. Approach is achieved by means of rocket impulses with a total characteristic velocity expenditure of w. The problem of selecting definite asteroids and the program of impulses which minimizes w is solved. A simplex algorithm for the optimal linear impulse correction is used to minimize w. The effectiveness of the suggested approach is shown by numerical examples of the solutions of one methodical variant of the problem for N = 2, 3, and 4.

Affiliated with

Also associated with

No associations

Rating

Solution of the problem of approaching several asteroids with an optimal correction algorithm. does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Solution of the problem of approaching several asteroids with an optimal correction algorithm., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solution of the problem of approaching several asteroids with an optimal correction algorithm. will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-827083