{"title":"基于双光源连续反射的新型机器人全局路径规划方法","authors":"Jintao Ye, Lina Hao, Hongtai Cheng, Xingchen Li","doi":"10.1016/j.isatra.2024.05.006","DOIUrl":null,"url":null,"abstract":"<p><p>Aiming to address the problem of robot path planning in environments containing narrow passages, this paper proposes a novel global path planning method: the DSR (Dual-source Light Continuous Reflection Exploration) algorithm. This algorithm, inspired by the natural reflection of light, employs the concept of continuous reflection for path planning. It can efficiently generate an asymptotically optimal path on the map containing narrow passages. The DSR algorithm has been evaluated on different maps with narrow passages and compared with other algorithms. In comparison with the bidirectional Rapidly-exploring Random Tree algorithm, the DSR algorithm achieves a significant reduction in both path length (by 27.08% and 34.35%) and time consumption (by 98.47% and 91.03%). Numerical simulations and experimental analysis have demonstrated the excellent performance of the DSR algorithm.</p>","PeriodicalId":94059,"journal":{"name":"ISA transactions","volume":" ","pages":"15-29"},"PeriodicalIF":0.0000,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A novel global path planning method for robot based on dual-source light continuous reflection.\",\"authors\":\"Jintao Ye, Lina Hao, Hongtai Cheng, Xingchen Li\",\"doi\":\"10.1016/j.isatra.2024.05.006\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>Aiming to address the problem of robot path planning in environments containing narrow passages, this paper proposes a novel global path planning method: the DSR (Dual-source Light Continuous Reflection Exploration) algorithm. This algorithm, inspired by the natural reflection of light, employs the concept of continuous reflection for path planning. It can efficiently generate an asymptotically optimal path on the map containing narrow passages. The DSR algorithm has been evaluated on different maps with narrow passages and compared with other algorithms. In comparison with the bidirectional Rapidly-exploring Random Tree algorithm, the DSR algorithm achieves a significant reduction in both path length (by 27.08% and 34.35%) and time consumption (by 98.47% and 91.03%). Numerical simulations and experimental analysis have demonstrated the excellent performance of the DSR algorithm.</p>\",\"PeriodicalId\":94059,\"journal\":{\"name\":\"ISA transactions\",\"volume\":\" \",\"pages\":\"15-29\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ISA transactions\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1016/j.isatra.2024.05.006\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2024/5/9 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ISA transactions","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1016/j.isatra.2024.05.006","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2024/5/9 0:00:00","PubModel":"Epub","JCR":"","JCRName":"","Score":null,"Total":0}
A novel global path planning method for robot based on dual-source light continuous reflection.
Aiming to address the problem of robot path planning in environments containing narrow passages, this paper proposes a novel global path planning method: the DSR (Dual-source Light Continuous Reflection Exploration) algorithm. This algorithm, inspired by the natural reflection of light, employs the concept of continuous reflection for path planning. It can efficiently generate an asymptotically optimal path on the map containing narrow passages. The DSR algorithm has been evaluated on different maps with narrow passages and compared with other algorithms. In comparison with the bidirectional Rapidly-exploring Random Tree algorithm, the DSR algorithm achieves a significant reduction in both path length (by 27.08% and 34.35%) and time consumption (by 98.47% and 91.03%). Numerical simulations and experimental analysis have demonstrated the excellent performance of the DSR algorithm.