Abstract
Learning to control systems with unknown dynamics is a challenging task for machine learning algorithms. One of the problems that arises here is that the input space is a high dimensional real vector space, while many learning algorithms usually work with a preferably small set of discrete units. Partitioning the input space into a small proper set of subspaces however requires some domain knowledge which is not available to the learning algorithm, while choosing a relatively large set of subspaces makes learning a lot more difficult. In this paper we examine the feasibility for genetic algorithms to exploite the continuity of the input space, such that learning is made more efficient for larger sets of subspaces. Every gene of the genotype represents one subspace, while the alleles specify the action that has to be taken in that part of the input space. The genes are structured on the genotype such that adjacent genes are representatives of neighboring points in the higher dimensional input space. By exploiting this property the GA is capable of finding a solution quite efficiently although the genotype has considerable length.
Preview
Unable to display preview. Download preview PDF.
References
Barto A., Sutton R. and Anderson C. (1983): "Neuronlike Adaptive Elements That Can Solve Difficult Learning Control Problems" in IEEE Transactions on Systems, Man and Cybernetics, p.834–846.
Booker L. (1987): "Improving Search in Genetic Algorithms" in Genetic Algorithms and Simulated Annealing, p.61–73. Ed. Lawrence Davis.Pitman Publishing.
Goldberg D. (1989): "Genetic Algorithms". Addison Wesley Publishing Company.
Holland J. (1975): "Adaptation in Natural and Artificial Systems". University of Michigan Press.
Holland J. (1985): "Properties of the Bucket Brigade Algorithm" in Proceedings of the First International Conference on Genetic Algorithms, p.1–7. Lawrence Erlbaum.
Kohonen T. (1988): "Self-Organization and Associative Memory". Springer-Verlag.
Odetayo M. and McGregor D. (1989): "Genetic Algorithm for Inducing Control Rules for a Dynamic System" in Proceedings of the International Conference on Genetic Algorithms, p.177–182. Morgan Kaufmann.
Sutton R. (1988): "Learning to Predict by the Methods of Temporal Differences" in Machine Learning, vol.3 p.9–44. Kluwer Academic Publishers.
Whitley D. (1989): "The Genitor Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best" in Proc. of the ICGA-89 p.116–121. Morgan Kaufmann.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Thierens, D., Vercauteren, L. (1991). A topology exploiting genetic algorithm to control dynamic systems. In: Schwefel, HP., Männer, R. (eds) Parallel Problem Solving from Nature. PPSN 1990. Lecture Notes in Computer Science, vol 496. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029739
Download citation
DOI: https://doi.org/10.1007/BFb0029739
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54148-6
Online ISBN: 978-3-540-70652-6
eBook Packages: Springer Book Archive