An Exact Euclidean Distance Transform for Universal Path Planning

J. C. Elizondo-Leal, G. Ramírez-Torres
{"title":"An Exact Euclidean Distance Transform for Universal Path Planning","authors":"J. C. Elizondo-Leal, G. Ramírez-Torres","doi":"10.1109/CERMA.2010.93","DOIUrl":null,"url":null,"abstract":"Universal path planning is a major issue in order to facilitate the task required for autonomous systems. Distance transform (wavefront) algorithm is a good path planner and can be used to determine a path near to optimum. We present a new algorithm for universal path planning in exact cell decomposition, using a raster scan method for generating an exact euclidean distance transform (EEDT). This algorithm also find, for every cell in the map, the point sequence to the goal (path smoothing), without post processing. These point sequences are computing by visibility verification between cells.","PeriodicalId":119218,"journal":{"name":"2010 IEEE Electronics, Robotics and Automotive Mechanics Conference","volume":"126 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Electronics, Robotics and Automotive Mechanics Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CERMA.2010.93","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Universal path planning is a major issue in order to facilitate the task required for autonomous systems. Distance transform (wavefront) algorithm is a good path planner and can be used to determine a path near to optimum. We present a new algorithm for universal path planning in exact cell decomposition, using a raster scan method for generating an exact euclidean distance transform (EEDT). This algorithm also find, for every cell in the map, the point sequence to the goal (path smoothing), without post processing. These point sequences are computing by visibility verification between cells.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通用路径规划的精确欧氏距离变换
通用路径规划是一个主要问题,以促进自治系统所需的任务。距离变换(波前)算法是一种很好的路径规划算法,可以用来确定接近最优的路径。我们提出了一种新的精确细胞分解通用路径规划算法,使用栅格扫描方法生成精确欧几里德距离变换(EEDT)。该算法还发现,对于地图中的每个细胞,点序列到目标(路径平滑),没有后处理。这些点序列是通过细胞之间的可见性验证来计算的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
OntoDeviceTrust: A Representation Model of Trust between the Users of Mobile Devices and the Producers of Applications Based on Ontologies Defect Detection in Aluminium with an Eddy Currents Sensor Advise Weaving in Énfasis Kinematic and Dynamic Modeling of the PHANToM Premium 1.0 Haptic Device: Experimental Validation Dynamic Visual Servoing of Robot Manipulators Based on Passivity
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1