Reconnaissance problem using genetic algorithms Conference Paper

abstract

• The reconnaissance problem is studied using genetic algorithms. The solution for the problem is an orbit which visits all the target sites without the use of fuel. The cost function that we wish to minimize has many local minima. Genetic algorithms is more efficient in solving this type of problem. The objective is to find an Earth orbit that best visits all the target sites within a given time frame and within an error tolerance for each target site. Two types of missions are considered. The first is to get the highest resolution for each site for a given imaging sensor. The second is to get the maximum observation time for each site. Results for both cases are presented.

authors

• Mortari, Daniele

published proceedings

• Spaceflight Mechanics 2005, Vol 120, Pts 1 and 2

author list (cited authors)

• Abdelkhalik, O., & Mortari, D.

complete list of authors

• Abdelkhalik, O||Mortari, D

publication date

• October 2005

published in

• Spaceflight Mechanics 2005, Vol 120, Pts 1 and 2  Journal

International Standard Book Number (ISBN) 10

• 0-87703-520-2

start page

• 1347

end page

• 1357

volume

• 120

issue

• II