{"title":"基于快速搜索随机树的运动规划算法综述","authors":"Chengyi Zhang, Shu-wen Dang, Yong Chen, ChenFei Ling","doi":"10.1145/3507971.3507973","DOIUrl":null,"url":null,"abstract":"The article summarizes the improvement of fast search random tree path planning algorithm in recent years. Firstly, the article explains the model of the original fast search random tree; secondly, the advantages and disadvantages of the RRT algorithm is discussed based on the simulation experiments.As a comparison, the improved RRT-based algorithm is introduced. Finally, the article summarizes the current researching challenges and proposes relevant suggestions and ideas.","PeriodicalId":439757,"journal":{"name":"Proceedings of the 7th International Conference on Communication and Information Processing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Survey of Motion Planning Algorithms Based on Fast Searching Random Tree\",\"authors\":\"Chengyi Zhang, Shu-wen Dang, Yong Chen, ChenFei Ling\",\"doi\":\"10.1145/3507971.3507973\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The article summarizes the improvement of fast search random tree path planning algorithm in recent years. Firstly, the article explains the model of the original fast search random tree; secondly, the advantages and disadvantages of the RRT algorithm is discussed based on the simulation experiments.As a comparison, the improved RRT-based algorithm is introduced. Finally, the article summarizes the current researching challenges and proposes relevant suggestions and ideas.\",\"PeriodicalId\":439757,\"journal\":{\"name\":\"Proceedings of the 7th International Conference on Communication and Information Processing\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 7th International Conference on Communication and Information Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3507971.3507973\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 7th International Conference on Communication and Information Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3507971.3507973","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Survey of Motion Planning Algorithms Based on Fast Searching Random Tree
The article summarizes the improvement of fast search random tree path planning algorithm in recent years. Firstly, the article explains the model of the original fast search random tree; secondly, the advantages and disadvantages of the RRT algorithm is discussed based on the simulation experiments.As a comparison, the improved RRT-based algorithm is introduced. Finally, the article summarizes the current researching challenges and proposes relevant suggestions and ideas.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
