A simple robot paths planning based on Quadtree

F. Wang, Changle Zhou, Hugo de Garis
{"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":"27 1","pages":"0"},"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}
引用次数: 1

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.
基于四叉树的简单机器人路径规划
本文在传统方法的基础上,根据四叉树的实际应用条件,结合四叉树的特殊结构,提出了一种实用的路径规划方法,以进一步扩展四叉树在路径规划领域的应用,除分割障碍外。实验和仿真结果表明,本文所描述的算法能够正确地找到所有相关路径,并快速做出更好的选择。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信