Abstract

The improved adaptive genetic algorithm has been presented to overcome the premature convergence problem of traditional genetic algorithm and obtain the genetic operator having adaptability at any time. Then, the location in the working space has been setted by the serial number method, and the mathematical model has been established for the picking operation of mobile robot. Finally, the sine type adaptive genetic algorithm has been adopted to improve the initial path and get the optimal solution. In addition, a simulation has been conducted by the Matlab Genetic Algorithms Box to show that this algorithm is more quickly and efficiently for the path optimization of mobile robot.

Full Text
Paper version not known

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 call

Disclaimer: 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.