Ahmed Hussein, Heba Mostafa, Mohamed Badrel-din, Osama Sultan, Alaa Khamis
{"title":"移动机器人路径规划的元启发式优化方法","authors":"Ahmed Hussein, Heba Mostafa, Mohamed Badrel-din, Osama Sultan, Alaa Khamis","doi":"10.1109/ICENGTECHNOL.2012.6396150","DOIUrl":null,"url":null,"abstract":"This paper presents a metaheuristic optimization-based approach to mobile robot path planning problem. A comparative study between trajectory-based metaheuristic optimization and population-based metaheuristic optimization is conducted. Breadth-first deterministic search is used to find the optimal solution (ground truth) that is compared to the paths generated by tabu search, simulated annealing and genetic algorithm. The experimental study shows that simulated annealing outperforms the other algorithms in terms of computational time while tabu search gives the shortest path.","PeriodicalId":149484,"journal":{"name":"2012 International Conference on Engineering and Technology (ICET)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"45","resultStr":"{\"title\":\"Metaheuristic optimization approach to mobile robot path planning\",\"authors\":\"Ahmed Hussein, Heba Mostafa, Mohamed Badrel-din, Osama Sultan, Alaa Khamis\",\"doi\":\"10.1109/ICENGTECHNOL.2012.6396150\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a metaheuristic optimization-based approach to mobile robot path planning problem. A comparative study between trajectory-based metaheuristic optimization and population-based metaheuristic optimization is conducted. Breadth-first deterministic search is used to find the optimal solution (ground truth) that is compared to the paths generated by tabu search, simulated annealing and genetic algorithm. The experimental study shows that simulated annealing outperforms the other algorithms in terms of computational time while tabu search gives the shortest path.\",\"PeriodicalId\":149484,\"journal\":{\"name\":\"2012 International Conference on Engineering and Technology (ICET)\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-12-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"45\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Conference on Engineering and Technology (ICET)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICENGTECHNOL.2012.6396150\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Engineering and Technology (ICET)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICENGTECHNOL.2012.6396150","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Metaheuristic optimization approach to mobile robot path planning
This paper presents a metaheuristic optimization-based approach to mobile robot path planning problem. A comparative study between trajectory-based metaheuristic optimization and population-based metaheuristic optimization is conducted. Breadth-first deterministic search is used to find the optimal solution (ground truth) that is compared to the paths generated by tabu search, simulated annealing and genetic algorithm. The experimental study shows that simulated annealing outperforms the other algorithms in terms of computational time while tabu search gives the shortest path.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
