Parallel robot motion planning in a dynamic environment
they are well adapted to search for solutions in high dimensionality search space. The algorithm can be used without reduction of its efficiency for arms with more than six degree of freedom,
they are very tolerant to the form of the function to optimize, for instance these functions do not need to be neither differentiable or continuous. They make no assumptions about the problem space that they are searching. We are using them to solve other optimization problems: graph partitioning, quadratic assignment, ...
they are easy to implement on massively parallel distributed memory architectures. The parallel algorithm proposed achieve near-linear speed-up.
- D.E.Goldberg, “Genetic algorithms in search, optimization, and machine learning”, Addison-Wesley, 1989 Google Scholar
- E-G.Talbi, T.Muntean, “A parallel genetic algorithm for process-processors mapping”. Int. Conf. on High Speed Computing 11, Montpellier, M.Durand and F.El Dabaghi (Editors),Elsevier Science Pub., North-Holland, pp.71–82, Oct 1991.Google Scholar
- J-C.Latombe, “Robot motion planning”, Ed. Kluwer Academic Publisher, 1991.Google Scholar