{"title":"Genetic Algorithm-Based Path Planning for Autonomous Mobile Robots","authors":"Areej Alabbadi, Awos Kanan","doi":"10.1109/JEEIT58638.2023.10185855","DOIUrl":null,"url":null,"abstract":"In this paper, a Genetic Algorithm is used to solve the path planning problem for autonomous mobile robots in static environments. The goal of the path planning problem is to find a valid and practical path between two points while avoiding obstacles and optimizing a number of criteria including path length, safety, and distance from obstacles. A quality function is proposed to evaluate the optimization approach for different scenarios. Experimental results show that enhanced solutions can be achieved in less time using optimal values of the search algorithm parameters.","PeriodicalId":177556,"journal":{"name":"2023 IEEE Jordan International Joint Conference on Electrical Engineering and Information Technology (JEEIT)","volume":"34 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE Jordan International Joint Conference on Electrical Engineering and Information Technology (JEEIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/JEEIT58638.2023.10185855","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, a Genetic Algorithm is used to solve the path planning problem for autonomous mobile robots in static environments. The goal of the path planning problem is to find a valid and practical path between two points while avoiding obstacles and optimizing a number of criteria including path length, safety, and distance from obstacles. A quality function is proposed to evaluate the optimization approach for different scenarios. Experimental results show that enhanced solutions can be achieved in less time using optimal values of the search algorithm parameters.