A greedy random adaptive search procedure for multi-rendezvous mission planning

No Thumbnail Available
Authors
Dutta, Atri
Issue Date
2015-01
Type
Conference paper
Language
en_US
Keywords
Multidimensional assignment problem , Approximation algorithms
Research Projects
Organizational Units
Journal Issue
Alternative Title
Abstract

The paper proposes a new algorithm to optimize a sequence of rendezvous maneuvers by a spacecraft with multiple targets. The algorithm consists of two phases: the first phase generates feasible solutions of the problem using a greedy randomized adaptive search procedure, and the second phase performs local search about the constructed solution. The performance of the algorithm is evaluated by considering different cases of complexity for each rendezvous problem. The first case considers C-W equations, the second case considers multi-revolution Lambert's problem, and the third case considers a Non-Linear Programming problem to determine the cost of a rendezvous maneuver. Numerical examples demonstrate the proposed algorithm for cases when the targets are on a circular orbit.

Description
Click on the link to access the article (may not be free).
Citation
Dutta, Atri. 2015. A greedy random adaptive search procedure for multi-rendezvous mission planning. Advances in the Astronautical Sciences Spaceflight Mechanics, vol. 155:pp 151-163
Publisher
Univelt, Inc.
License
Journal
Volume
Issue
PubMed ID
DOI
ISSN
1081-6003
EISSN