Global optimal solution of rendezvous problem using a hybrid approach

Authors:
R. Esmaelzadeh;A. Naghash;M. Mortazavi
Affiliations:
Aerospace Engineering Department, Amirkabir University of Technology, Tehran, Iran;Aerospace Engineering Department, Amirkabir University of Technology, Tehran, Iran;Aerospace Engineering Department, Amirkabir University of Technology, Tehran, Iran
Venue:
SMO'06 Proceedings of the 6th WSEAS International Conference on Simulation, Modelling and Optimization
Year:
2006

Citing 6
Cited 0

Abort landing in the presence of windshear as a minimax optimal control problem, part 2: multiple shooting and homotopy

Journal of Optimization Theory and Applications
Genetic Algorithms

Genetic Algorithms
Multi-Objective Optimization Using Evolutionary Algorithms

Multi-Objective Optimization Using Evolutionary Algorithms
Genetic Algorithms and Evolution Strategies - Similarities and Differences

PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
Hybrid methods using genetic algorithms for global optimization

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Computational Intelligence for Optimization

Computational Intelligence for Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Genetic algorithms have gained popularity as effective search procedures for obtaining solutions to traditionally difficult space mission optimization problems. In this paper, a real-coded genetic algorithm is used together with calculus of variations to optimize a trajectory for rendezvous problem. The global search properties of genetic algorithm combine with the local search capabilities of calculus of variations to produce solutions that are superior to those generated with the calculus of variations alone, and these solutions require less user interaction than previously possible. The genetic algorithm is not hampered by ill-behaved gradients and is relatively insensitive to problems with a small radius of convergence. The use of calculus of variations within the genetic algorithm optimization routine increases the precision of the final solution to levels uncommon for a genetic algorithm alone.