首页> 外文会议>2010 IEEE Electronics, Robotics and Automotive Mechanics Conference >An Exact Euclidean Distance Transform for Universal Path Planning
【24h】

An Exact Euclidean Distance Transform for Universal Path Planning

机译:用于通用路径规划的精确欧氏距离变换

获取原文

摘要

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.
机译:通用路径规划是一个主要问题,目的是简化自治系统所需的任务。距离变换(波前)算法是很好的路径规划器,可用于确定接近最佳路径。我们提出了一种用于精确单元分解的通用路径规划的新算法,该算法使用栅格扫描方法生成精确的欧氏距离变换(EEDT)。该算法还可以为地图中的每个像元找到目标的点序列(路径平滑),而无需后期处理。这些点序列通过单元之间的可见性验证进行计算。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号