DocumentCode
690999
Title
Detecting Robots Path Planning Based on Improved Genetic Algorithm
Author
Shi-Gang Cui ; Jiang-lei Dong
Author_Institution
Tianjin Key Lab. of Inf. Sensing & Intell. Control, Tianjin Univ. of Technol. & Educ., Tianjin, China
fYear
2013
fDate
21-23 Sept. 2013
Firstpage
204
Lastpage
207
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.
Keywords
genetic algorithms; mobile robots; path planning; travelling salesman problems; genetic algorithm; optimization; path planning; patrol mission; robot detection; traveling salesman problem; Algebra; Algorithm design and analysis; Computers; Genetic algorithms; Path planning; Robot sensing systems; detecting robots; improved genetic algorithm; path planning; travelling salesman problem (TSP);
fLanguage
English
Publisher
ieee
Conference_Titel
Instrumentation, Measurement, Computer, Communication and Control (IMCCC), 2013 Third International Conference on
Conference_Location
Shenyang
Type
conf
DOI
10.1109/IMCCC.2013.50
Filename
6840439
Link To Document