{"title":"机器人运动最短路径的A*算法","authors":"Hameedah Sahib Hasan","doi":"10.31580/sps.v3i1.1928","DOIUrl":null,"url":null,"abstract":"Mobile robot motion in real-time has many challenges in terms of reaching the exact destination and avoid obstacles. In this work, A * algorithm has been selected to show the robot motion in simulation through Matlab software. Different destinations are selected with several obstacles. A * algorithm shows the ability to achieve the shortest path distance for mobile robot motion as well to avoid different obstacles. Thus, the A * algorithm can be an attractive choice to achieve the best shortest path distance for Mobile robot motion.","PeriodicalId":21574,"journal":{"name":"Science Proceedings Series","volume":"2 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A* Algorithm for Shortest Path in Robot Motion\",\"authors\":\"Hameedah Sahib Hasan\",\"doi\":\"10.31580/sps.v3i1.1928\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mobile robot motion in real-time has many challenges in terms of reaching the exact destination and avoid obstacles. In this work, A * algorithm has been selected to show the robot motion in simulation through Matlab software. Different destinations are selected with several obstacles. A * algorithm shows the ability to achieve the shortest path distance for mobile robot motion as well to avoid different obstacles. Thus, the A * algorithm can be an attractive choice to achieve the best shortest path distance for Mobile robot motion.\",\"PeriodicalId\":21574,\"journal\":{\"name\":\"Science Proceedings Series\",\"volume\":\"2 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-06-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Science Proceedings Series\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.31580/sps.v3i1.1928\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Science Proceedings Series","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.31580/sps.v3i1.1928","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Mobile robot motion in real-time has many challenges in terms of reaching the exact destination and avoid obstacles. In this work, A * algorithm has been selected to show the robot motion in simulation through Matlab software. Different destinations are selected with several obstacles. A * algorithm shows the ability to achieve the shortest path distance for mobile robot motion as well to avoid different obstacles. Thus, the A * algorithm can be an attractive choice to achieve the best shortest path distance for Mobile robot motion.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
