基于快速搜索随机树的运动规划算法综述

Proceedings of the 7th International Conference on Communication and Information Processing Pub Date : 2021-12-16 DOI:10.1145/3507971.3507973

Chengyi Zhang, Shu-wen Dang, Yong Chen, ChenFei Ling

{"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}

引用次数: 1

摘要

本文总结了近年来快速搜索随机树路径规划算法的改进。首先，本文解释了原始快速搜索随机树的模型;其次，在仿真实验的基础上，讨论了RRT算法的优缺点。作为比较，介绍了改进的基于rrt的算法。最后，文章总结了当前研究面临的挑战，并提出了相关的建议和思路。

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

查看原文本刊更多论文

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.

求助全文

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

来源期刊

Proceedings of the 7th International Conference on Communication and Information Processing

自引率

0.00%

发文量