Abstract
Today, contemporary computer methods inspired by biological evolution are grouped under the field called evolutionary computation. Evolutionary computation is the name given to a collection of algorithms based on the evolution of a population toward a solution of a certain problem. These algorithms can be used successfully in many applications requiring the optimization of a certain multi-dimensional function. The population of possible solutions evolves from one generation to the next, ultimately arriving at a satisfactory solution to the problem. These algorithms differ in the way a new population is generated from the present one, and in the way the members are represented within the algorithm. The three main elements of evolutionary computation are: 1) evolution algorithms (EA); 2) genetic programming (GP); 3) genetic algorithms (GA). Each of these three techniques mimics the processes observed in natural evolution, and provides efficient search engines by evolving populations of candidate solutions to a given problem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Katic, D., Vukobratovic, M. (2003). Genetic Algorithms in Robotics. In: Intelligent Control of Robotic Systems. International Series on Microprocessor-Based and Intelligent Systems Engineering, vol 25. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-0317-8_4
Download citation
DOI: https://doi.org/10.1007/978-94-017-0317-8_4
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-6426-4
Online ISBN: 978-94-017-0317-8
eBook Packages: Springer Book Archive