Show simple item record

dc.contributor.authorDutta, Atri
dc.identifier.citationDutta, Atri. 2015. A greedy random adaptive search procedure for multi-rendezvous mission planning. Advances in the Astronautical Sciences Spaceflight Mechanics, vol. 155:pp 151-163en_US
dc.descriptionClick on the link to access the article (may not be free).en_US
dc.description.abstractThe 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.en_US
dc.publisherUnivelt, Inc.en_US
dc.relation.ispartofseriesAdvances in the Astronautical Sciences Spaceflight Mechanics;v.155
dc.subjectMultidimensional assignment problemen_US
dc.subjectApproximation algorithmsen_US
dc.titleA greedy random adaptive search procedure for multi-rendezvous mission planningen_US
dc.typeConference paperen_US
dc.rights.holderCopyright © 2010, Univelt, Inc. All rights reserved.en_US

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

  • AE Research Publications
    Research publications authored by the Department of Aerospace Engineering faculty and graduate students.

Show simple item record