Abstract
Path planning investigates issues including the shortest path, obstacle avoidance, and computation efficiency, which can be regarded as an optimal problem. Taking advantage of the genetic algorithms to solve various optimal problems, this paper first proposes a Cooperative Genetic Optimization (CGO) Algorithm, including the establishment of an elite policy and larger selection region to minimize the occurrence of local optima so as to increase the speed of convergence. Based on the proposed CGO, a global path planning approach for robots is then presented. As a result, the proposed method of this paper leads to a better performance in comparison with the traditional Genetic algorithm to achieve the goal of obtaining a safer and shorter path.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
