{"title":"Improved Ant Colony Optimization for Ground Robot 3D Path Planning","authors":"Lanfei Wang, Jiangming Kan, Jun Guo, Chao Wang","doi":"10.1109/CYBERC.2018.00030","DOIUrl":null,"url":null,"abstract":"Path planning is an important part in the navigation control of mobile robot in a 3D environment. We proposed an improved ant colony algorithm to address the problems of falling into local optimum easily and long search time in 3D path planning. We redesigned pheromone update and heuristic function. New search mode is designed to solve the problem of searching time. We used a number of 3D terrains to carry out experiments, and set different starting and end points in each terrain. By comparing the results of improved ant colony algorithm and traditional ant colony algorithm, the improved one can reduce the shortest path length by an average of 8.164%.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","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.00030","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Path planning is an important part in the navigation control of mobile robot in a 3D environment. We proposed an improved ant colony algorithm to address the problems of falling into local optimum easily and long search time in 3D path planning. We redesigned pheromone update and heuristic function. New search mode is designed to solve the problem of searching time. We used a number of 3D terrains to carry out experiments, and set different starting and end points in each terrain. By comparing the results of improved ant colony algorithm and traditional ant colony algorithm, the improved one can reduce the shortest path length by an average of 8.164%.