engleză
This volume offers a novel framework for solving the path planning problems for robot manipulators. simple and efficient solutions are proposed for the path planning problem based on genetic algorithms. One of the attractive features of genetic algorithms is their ability to solve formidable problems in a robust and straightforward manner. Moreover, genetic algorithms are inherently parallel in nature, which makes them ideal candidates for parallel computing implementations. By combining the robustness of genetic algorithms with the power of parallel computers, this work provides an effective and practical approach to solving path planning problems. The book gives details of implementations that allow a better understanding of the complexity involved in the development of parallel path planning algorithms. The material presented is interdisciplinary in nature - it combines topics from robotics, genetic algorithms, and parallel processing. The book can be used by practitioners and researchers in computer science and engineering.
