Mohammed Baziyad, A. B. Nassif, T. Rabie, R. Fareh
{"title":"Comparative Study on the Performance of Heuristic Optimization Techniques in Robotic Path Planning","authors":"Mohammed Baziyad, A. B. Nassif, T. Rabie, R. Fareh","doi":"10.1145/3369114.3369138","DOIUrl":null,"url":null,"abstract":"This work presents a comparative study between the three popular optimization techniques namely the Genetic Algorithm (GA), Particle Swarm Optimization technique (PSO) and the Artificial Bee Colony (ABC) in the robotic path planning field. Path planning techniques suffer from a well-known trade-off between path quality and swiftness. Researchers had to always trade-off between shorter paths and higher computational execution time. However, with the invention of heuristic optimization techniques such as GA, PSO and ABC, there is an expect that these optimization techniques can overcome this trade-off. Thus, this paper investigates the performance of the three optimization techniques in robotic path planning problems.","PeriodicalId":262468,"journal":{"name":"Proceedings of the 3rd International Conference on Advances in Artificial Intelligence","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 3rd International Conference on Advances in Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3369114.3369138","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
This work presents a comparative study between the three popular optimization techniques namely the Genetic Algorithm (GA), Particle Swarm Optimization technique (PSO) and the Artificial Bee Colony (ABC) in the robotic path planning field. Path planning techniques suffer from a well-known trade-off between path quality and swiftness. Researchers had to always trade-off between shorter paths and higher computational execution time. However, with the invention of heuristic optimization techniques such as GA, PSO and ABC, there is an expect that these optimization techniques can overcome this trade-off. Thus, this paper investigates the performance of the three optimization techniques in robotic path planning problems.