{"title":"基于模拟退火遗传算法的地面机器人路径规划","authors":"Lanfei Wang, Jun Guo, Qu Wang (王曲), Jiangming Kan","doi":"10.1109/CYBERC.2018.00081","DOIUrl":null,"url":null,"abstract":"Robot path planning is the key to robot navigation. We implemented the robot path planning based on ant colony algorithm and genetic algorithm, and proposed simulated annealing genetic algorithm. Under the condition that there is not much difference in running time (within 3 seconds), planning results of different terrains, start and end points based on ant colony algorithm(with 200 iterations)and simulated annealing genetic algorithm show that, the optimal path outputted by simulated annealing genetic algorithm is better than the optimal path outputted by ant colony algorithm in terms of avoiding obstacles; The simulated annealing genetic algorithm has shorter average optimal path length than ant colony algorithm in multiple tests, the average path length is reduced by 6.85%.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Ground Robot Path Planning Based on Simulated Annealing Genetic Algorithm\",\"authors\":\"Lanfei Wang, Jun Guo, Qu Wang (王曲), Jiangming Kan\",\"doi\":\"10.1109/CYBERC.2018.00081\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Robot path planning is the key to robot navigation. We implemented the robot path planning based on ant colony algorithm and genetic algorithm, and proposed simulated annealing genetic algorithm. Under the condition that there is not much difference in running time (within 3 seconds), planning results of different terrains, start and end points based on ant colony algorithm(with 200 iterations)and simulated annealing genetic algorithm show that, the optimal path outputted by simulated annealing genetic algorithm is better than the optimal path outputted by ant colony algorithm in terms of avoiding obstacles; The simulated annealing genetic algorithm has shorter average optimal path length than ant colony algorithm in multiple tests, the average path length is reduced by 6.85%.\",\"PeriodicalId\":282903,\"journal\":{\"name\":\"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)\",\"volume\":\"46 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CYBERC.2018.00081\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CYBERC.2018.00081","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Ground Robot Path Planning Based on Simulated Annealing Genetic Algorithm
Robot path planning is the key to robot navigation. We implemented the robot path planning based on ant colony algorithm and genetic algorithm, and proposed simulated annealing genetic algorithm. Under the condition that there is not much difference in running time (within 3 seconds), planning results of different terrains, start and end points based on ant colony algorithm(with 200 iterations)and simulated annealing genetic algorithm show that, the optimal path outputted by simulated annealing genetic algorithm is better than the optimal path outputted by ant colony algorithm in terms of avoiding obstacles; The simulated annealing genetic algorithm has shorter average optimal path length than ant colony algorithm in multiple tests, the average path length is reduced by 6.85%.