2008Fire Control and Command ControlRequires access

A Hill Climbing Like Fast Searching Algorithm and it's Application in Orbit Attacking Fire Control

Xiangmin Li

Open publisher page 0 citations

Abstract

Genetic algorithm is widely used in optimization computations,it is characterized in high ability for non-linear system,so it is good at optimize for non-linear system.But all the variations of Genetic algorithm now have the same drawbacks of high time consumption,so it can be only used in offline optimization or some lower fast requirements applications.Due to it's slowly execution speed to find the optimal solutions,it can not be used for real timing optimization such as the real timing optimize the control parameters for the flying vehicles.In order to speed up the Genetic algorithm and keep the high ability for non-linear system of Genetic algorithm,presented a fast searching genetic algorithm based on a single chromosome,and verified the algorithm and testified the algorithm.The tests for the algorithm implies that this algorithm have the same convergence ability as the Genetic algorithm,and it only needs 3 seconds to find the optimal solutions compared with the 50 seconds required by the Genetic algorithm under the same conditions.In addition,if the size of the traditional genetic algorithm is n,then the memory requirements of this algorithm presented in this paper is 1/n compared with the memory requirements of traditional genetic algorithm,and it is simple and easy programming.

About this research paper

What this paper is about

Genetic algorithm is widely used in optimization computations,it is characterized in high ability for non-linear system,so it is good at optimize for non-linear system.But all the variations of Genetic algorithm now have the same drawbacks of high time consumption,so it can be only used in offline optimization or some lower fast requirements applications.Due to it's slowly execution speed to find the optimal solutions,it can not be used for real timing optimization such as the real timing optimize the control parameters for the flying vehicles.In order to speed up the Genetic algorithm and keep the high ability for non-linear system of Genetic algorithm,presented a fast searching genetic algorithm based on a single chromosome,and verified the algorithm and testified the algorithm.The tests for the algorithm implies that this algorithm have the same convergence ability as the Genetic algorithm,and it only needs 3 seconds to find the optimal solutions compared with the 50 seconds required by the Genetic algorithm under the same conditions.In addition,if the size of the traditional genetic algorithm is n,then the memory requirements of this algorithm presented in this paper is 1/n compared with the memory requirements of traditional genetic algorithm,and it is simple and easy programming.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Genetic algorithm is widely used in optimization computations,it is characterized in high ability for non-linear system,so it is good at optimize for non-linear system.But all the variations of Genetic algorithm now have the same drawbacks of high time consumption,so it can be only used in offline optimization or some lower fast requirements applications.Due to it's slowly execution speed to find the optimal solutions,it can not be used for real timing optimization such as the real timing optimize the control parameters for the flying vehicles.In order to speed up the Genetic algorithm and keep the high ability for non-linear system of Genetic algorithm,presented a fast searching genetic algorithm based on a single chromosome,and verified the algorithm and testified the algorithm.The tests for the algorithm implies that this algorithm have the same convergence ability as the Genetic algorithm,and it only needs 3 seconds to find the optimal solutions compared with the 50 seconds required by the Genetic algorithm under the same conditions.In addition,if the size of the traditional genetic algorithm is n,then the memory requirements of this algorithm presented in this paper is 1/n compared with the memory requirements of traditional genetic algorithm,and it is simple and easy programming.

Key concepts: Population-based incremental learning, Genetic algorithm, Algorithm, Computer science, Meta-optimization, Chromosome, Hill climbing, Convergence (economics)

Related papers

Back to paper searchBrowse research topicsOriginal source
A Hill Climbing Like Fast Searching Algorithm and it's Application in Orbit Attacking Fire Control — Research Paper | ScholarLens