{"title":"基于四叉树的简单机器人路径规划","authors":"F. Wang, Changle Zhou, Hugo de Garis","doi":"10.1109/PIC.2010.5687965","DOIUrl":null,"url":null,"abstract":"Based on traditional methods, according with practical application conditions, and the special structure of Quadtree, this paper gives a practical method of paths planning for the further expansion of Quadtree in the field of paths planning, except for segmentation obstacles. The experimental and simulation results demonstrate that the algorithm described in the text could be able to find all the relevant paths correctly, and make the better choice rapidly.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A simple robot paths planning based on Quadtree\",\"authors\":\"F. Wang, Changle Zhou, Hugo de Garis\",\"doi\":\"10.1109/PIC.2010.5687965\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Based on traditional methods, according with practical application conditions, and the special structure of Quadtree, this paper gives a practical method of paths planning for the further expansion of Quadtree in the field of paths planning, except for segmentation obstacles. The experimental and simulation results demonstrate that the algorithm described in the text could be able to find all the relevant paths correctly, and make the better choice rapidly.\",\"PeriodicalId\":142910,\"journal\":{\"name\":\"2010 IEEE International Conference on Progress in Informatics and Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE International Conference on Progress in Informatics and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PIC.2010.5687965\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Conference on Progress in Informatics and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIC.2010.5687965","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Based on traditional methods, according with practical application conditions, and the special structure of Quadtree, this paper gives a practical method of paths planning for the further expansion of Quadtree in the field of paths planning, except for segmentation obstacles. The experimental and simulation results demonstrate that the algorithm described in the text could be able to find all the relevant paths correctly, and make the better choice rapidly.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
