Random searches are classified as either guided or unguided, depending on whether information is retained whenever the outcome of a trial step is learned. Furthermore, both the guided and unguided varieties of random search are given accelerated convergence by increasing the adopted step size in a successful search direction. Four representative examples of random search algorithms used for adaptive array applications are considered in this chapter: linear random search (LRS), accelerated random search (ARS), guided accelerated random search (GARS), and genetic algorithm (GA).

Chapter Contents:

• 8.1 Linear Random Search
• 8.2 Accelerated Random Search
• 8.3 Guided Accelerated Random Search
• 8.4 Genetic Algorithm
• 8.5 Comparison of Random Search Algorithms
• 8.6 Summary and Conclusions
• 8.7 Problems
• 8.8 References

Inspec keywords: adaptive antenna arrays; genetic algorithms; random processes

Other keywords: guided accelerated random search; genetic algorithm; random search algorithms; unguided variety; adopted step size; linear random search; adaptive array applications; accelerated convergence

Subjects: Antenna arrays; Other topics in statistics; Optimisation techniques