Abstract
We are presenting in this work a method to calculate collision free paths, for redundant and non redundant robots, through an adaptation of the Messy Genetic Algorithm with a fitness function weakly defined. The adaptation consists in replacing the two crossing operators (cut and splice) traditionally used by a mechanism similar to that one used in the simple genetic algorithm. Nevertheless, the mechanism presented in this work was designed to work with variable length strings. The main advantages of this method are: even though the fitness function is weakly defined good solutions can be obtained; it does not need a previous discretization of the work space; and it works directly within such space without needing any transformation as in the C-space method. In this work, the fitness function is defined as a linear combination of values which are easily calculated.
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.
References
J.C. Latombe, Robot Motion Planning, (Norwell: Kluwer Academic Publishers, 1990).
W.T. Park, “Minicomputer software organization for control of industrial robots”, Proc. Joint Automat. Contr. Conf., San Francisco, CA, 1977.
R. A. Brooks, “Solving The Find-Path Problem by Good Representation of Free Space”, IEEE Transacitions on System, Man, and Cybernetics, 13(3), 1983, 190–197.
J.F. Canny and B.R. Donald, “Simplified Voronoi Diagram”, Discrete and Computational Geometry, Springer-Verlag, 3, 1988, 219–236.
T. Llozano-Pérez, “Automatic Planning of Manipulator Transfer Movements“. IEEE Trans. on System, Man and Cybernetics, SMC-11(10), 1981, 681–698.
J.T. Schuartz and M. Sharir, “On the piano movers' problem I: the case of a two-dimensional rigid polygonal body moving amidst polygonal barriers”, Communication on Pure and Applied Mathematics, 36,1983, 345–398.
O. Khatib, “Real-Time Obstacle Avoidance for Manipulators and Movile Robots”, International Journal of Robotics Research, 5(1), 1986, 90–98.
T. Lozano-Pérez, “An algorithm for planning collision free paths among polyhedral obstacles“. Communications ACM, 1979, 22(10), 560–570.
V. de la Cueva y F. Ramos, "Cálculo de trayectorias libres de colisiones para un robot móvil mediente la utilización de un algoritmo genético". Memorias del 1er. Encuentro de Computación, Taller de Visión y Robótica, Querétaro, Qro., 1997, 1–6.
D. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. (U.S.A.: Addisson Wesley, 1986).
Y. Davidor. Genetic Algorithms and Robotics: A Heuristic Strategy for Optimization. (Singapore: World Scientific Publishing, 1991).
Y. Davidor, “Genetic Algorithms in Robotics”, Dynamic, Genetic, and Chaotic Programming, (New York: Jhon Wiley & Sons, Inc., 1992).
D. Goldberg, B. Korb, and K. Deb, “Messy Genetic Algorithms: Motivation, Analysis, and First Results”, Complex Systems, 3(5), 1989, 493–530.
D. Goldberg, B. Korb, and K. Deb. “Messy Genetic Algorithm revisited: studies in mixed size and scale”. Complex Systems, 4(4), 415–44, 1990.
D. Goldberg, K. Deb, Kargupta & Harik, “Rapid accurate optimization of difficult problems using fast messy genetic algorithms“. Proc. of the Fifth International Conference on Genetic Algorithms, Morgan Kaufmann, 1993, 56–64.
T. Lozano-Pérez, M. Brady and J. Hollerbach, Robot Motion: Planning and Control, (Massachusetts: MIT Press, Series in Artificial Intelligence, 1983).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de la Cueva, V., Ramos, F. (2002). Adapting the Messy Genetic Algorithm for Path Planning in Redundant and Non-redundant Manipulators. In: Coello Coello, C.A., de Albornoz, A., Sucar, L.E., Battistutti, O.C. (eds) MICAI 2002: Advances in Artificial Intelligence. MICAI 2002. Lecture Notes in Computer Science(), vol 2313. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46016-0_3
Download citation
DOI: https://doi.org/10.1007/3-540-46016-0_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43475-7
Online ISBN: 978-3-540-46016-9
eBook Packages: Springer Book Archive