首页> 外文期刊>International Journal of Computer Systems Science & Engineering >Clearance-based homotopic optimal path computation
【24h】

Clearance-based homotopic optimal path computation

机译:基于间隙的同位最优路径计算

获取原文
获取原文并翻译 | 示例
           

摘要

Navigation and path planning have applications in robotics, marine security, oil and gas exploration and production, and geographical information systems domain. One of the problems often faced in such complex environments is to find an optimal path, as defined both by its length and by its clearance from obstacles. Many path planning techniques such as the roadmap method, the cell decomposition method, and the potential field method generate low quality paths with redundant motions, which are later processed to generate high quality approximations of the homotopic optimal path. In this article, we present an improved geometric algorithm to homotopically optimize a path between a source and a destination in a plane based on a preset clearance from obstacles and overall length. Application of our presented method in planning directional petroleum well drilling paths utilizing Voronoi diagram concludes this article.
机译:导航和路径规划在机器人技术,海洋安全,油气勘探和生产以及地理信息系统领域中都有应用。在这样复杂的环境中经常面临的问题之一是找到一条最佳路径,该路径由路径的长度和与障碍物之间的距离来定义。路线图方法,像元分解方法和势场方法等许多路径规划技术都会生成具有冗余运动的低质量路径,随后会对其进行处理以生成同质最优路径的高质量近似值。在本文中,我们提出了一种改进的几何算法,可根据与障碍物的预设距离和总长度同位优化平面中源与目标之间的路径。本文总结了本文提出的方法在利用Voronoi图规划定向油井钻探路径中的应用。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号