Abstract
Aiming at the wide use of the detecting robots in designated place to perform reconnaissance, detection or patrol mission, etc, the tasks cost model of the path planning of detecting robots is transformed into the traveling salesman problem. The improved genetic algorithm is employed to complete the path planning of detecting robots through improving the genetic algorithm crossover operator and mutation operator, a new improved genetic algorithm was formed. The simulation study is presented to prove the effectiveness of the developed path planning method based on the improved genetic algorithm The simulation results show that the improved genetic algorithm can improve the optimization ability of path planning for detecting robot.
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.
