基于蚁群算法的移动机器人路径规划

2016 2nd IEEE International Symposium on Robotics and Manufacturing Automation (ROMA) Pub Date : 2016-09-01 DOI:10.1109/ROMA.2016.7847836

R. Rashid, N. Perumal, I. Elamvazuthi, M. Tageldeen, M.K.A.Ahmed Khan, S. Parasuraman

{"title":"基于蚁群算法的移动机器人路径规划","authors":"R. Rashid, N. Perumal, I. Elamvazuthi, M. Tageldeen, M.K.A.Ahmed Khan, S. Parasuraman","doi":"10.1109/ROMA.2016.7847836","DOIUrl":null,"url":null,"abstract":"Ant colony optimization (ACO) technique is proposed to solve the mobile robot path planning (MRPP) problem. In order to demonstrate the effectiveness of ACO in solving the MRPP problem, several maps of varying complexity used by an earlier researcher is used for evaluation. Each map consists of static obstacles in different arrangements. Besides that, each map has a grid representation with an equal number of rows and columns. The performance of the proposed ACO is tested on a given set of maps. Overall, the results demonstrate the effectiveness of the proposed approach for path planning.","PeriodicalId":409977,"journal":{"name":"2016 2nd IEEE International Symposium on Robotics and Manufacturing Automation (ROMA)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"93","resultStr":"{\"title\":\"Mobile robot path planning using Ant Colony Optimization\",\"authors\":\"R. Rashid, N. Perumal, I. Elamvazuthi, M. Tageldeen, M.K.A.Ahmed Khan, S. Parasuraman\",\"doi\":\"10.1109/ROMA.2016.7847836\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Ant colony optimization (ACO) technique is proposed to solve the mobile robot path planning (MRPP) problem. In order to demonstrate the effectiveness of ACO in solving the MRPP problem, several maps of varying complexity used by an earlier researcher is used for evaluation. Each map consists of static obstacles in different arrangements. Besides that, each map has a grid representation with an equal number of rows and columns. The performance of the proposed ACO is tested on a given set of maps. Overall, the results demonstrate the effectiveness of the proposed approach for path planning.\",\"PeriodicalId\":409977,\"journal\":{\"name\":\"2016 2nd IEEE International Symposium on Robotics and Manufacturing Automation (ROMA)\",\"volume\":\"96 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"93\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 2nd IEEE International Symposium on Robotics and Manufacturing Automation (ROMA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ROMA.2016.7847836\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 2nd IEEE International Symposium on Robotics and Manufacturing Automation (ROMA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ROMA.2016.7847836","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 93

摘要

针对移动机器人路径规划问题，提出了蚁群优化算法。为了证明蚁群算法在解决MRPP问题上的有效性，使用了早期研究者使用的几个不同复杂性的地图进行评估。每张地图都由不同排列方式的静态障碍组成。除此之外，每个地图都有一个具有相同行数和列数的网格表示。在给定的映射集上测试了所提出的蚁群算法的性能。总体而言，结果证明了所提出的路径规划方法的有效性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Mobile robot path planning using Ant Colony Optimization

Ant colony optimization (ACO) technique is proposed to solve the mobile robot path planning (MRPP) problem. In order to demonstrate the effectiveness of ACO in solving the MRPP problem, several maps of varying complexity used by an earlier researcher is used for evaluation. Each map consists of static obstacles in different arrangements. Besides that, each map has a grid representation with an equal number of rows and columns. The performance of the proposed ACO is tested on a given set of maps. Overall, the results demonstrate the effectiveness of the proposed approach for path planning.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2016 2nd IEEE International Symposium on Robotics and Manufacturing Automation (ROMA)

自引率

0.00%

发文量