Constructive Geometric Constraint Solving: A New Application of Genetic Algorithms
Geometric problems de.ned by constraints have an exponential number of solution instances in the number of geometric elements involved. Generally, the user is only interested in one instance such that besides fulfilling the geometric constraints, exhibits some addicional properties. Selecting a solution instance amounts to selecting a given root everytime the geometric constraint solver needs to compute the zeros of a multivaluated function. The problem of selecting a given root is known as the Root Identification Problem. In this paper we present a new technique to solve the root identification problem based on an automatic search in the space of solutions performed by a genetic algorithm. The user specifies the solution of interest by defining a set of additional constraints on the geometric elements which drive the search of the genetic algorithm. Some examples illustrate the performance of the method.
KeywordsGenetic Algorithm Geometric Constraint Geometric Problem Geometric Element Extra Constraint
Unable to display preview. Download preview PDF.
- 1.T. Bäck, D.B. Fogel, and Z. Michalewicz, editors. Handbook of Evolutionary Computation. Institute of Physics Publishing Ltd and Oxford University Press, 1997.Google Scholar
- 2.J. E. Baker. Reducing bias and ine.ciency in the selection algorithm. Proc. Second International Conference on Genetic Algorithms (ICGA’87), pages 14–21, 1987.Google Scholar
- 3.L.B. Booker, D.B. Fogel, D. Whitley, and P.J. Angeline. Recombination. In T. Bäck, D.B. Fogel, and Z. Michalewicz, editors, Handbook of Evolutionary Computation, chapter C3.3, pages C3.3:1–C3.3:10. Institute of Physics Publishing Ltd and Oxford University Press, 1997.Google Scholar
- 5.C. Durand. Symbolic and Numerical Techniques for Constraint Solving. PhD thesis, Computer Science, Purdue University, December 1998.Google Scholar
- 6.A. Eiben, P.-E. Raué, and Zs. Ruttkay. GA-easy and GA-hard constraint satisfaction problems. In M. Meyer, editor, Constraint Processing, LNCS Series 923, pages 267–284. Springer-Verlag, Heidelberg, 1995.Google Scholar
- 9.D.E. Goldberg. Genetic Algorithms in Search, Optimization Machine Learning. Addison Wesley, 1989.Google Scholar
- 11.R. Joan-Arinyo and N. Mata. A data structure for solving geomegtric cosntraint problems with interval parameters. Technical Report LSI-00-24-R, Department LiSI, Universitat Politècnica de Catalunya, 2000.Google Scholar
- 15.M.V. Luzón. Resolución de Restricciones Geométricas. Selección de la Solución Deseada. PhD thesis, Dept. Informática, Universidad de Vigo, December 2001. Written in Spanish.Google Scholar
- 16.N. Mata. Solving incidence and tangency constraints in 2D. Technical Report LSI-97-3R, Department LiSI, Universitat Politècnica de Catalunya, 1997.Google Scholar
- 17.N. Mata. Constructible Geometric Problems with Interval Parameters. PhD thesis, Dept. LiSI, Universitat Politècnica de Catalunya, 2000.Google Scholar
- 18.Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, 1996.Google Scholar
- 20.V. Petridis, S. Kazarlis, and A. Bakirtzis. Varying quality functions in genetic algorithm constrained optimization: The cutting stock and unit commitment problems. IEEE Transactions on Systems, Man and Cybernetics, 28, Part B(5), 1998.Google Scholar