首页> 外文会议>Robotic and Sensors Environments, 2007 International Workshop on >Vision-based Exploration Algorithms for Rough Terrain Modeling Using Triangular Mesh Maps
【24h】

Vision-based Exploration Algorithms for Rough Terrain Modeling Using Triangular Mesh Maps

机译:基于视觉的三角网格地图地形建模探索算法

获取原文

摘要

The purpose of this paper is to develop a new exploratory approach based on a triangular mesh map for automatic modeling of a large rough agricultural environment. A triangular mesh map was used to represent the agricultural field surface because of its ability to represent large rough areas efficiently. A terrain map is built incrementally during exploration, using 3D image sensor readings. A 3D image sensor model, with attributes similar to a camera or laser sensor, was used in the simulation. A two-stage exploring policy was used to plan the next-best view by considering both the distance and elevation change in the cost function. In the first stage of exploration, the robot travels to the outer boundary between the explored and unexplored terrain, while in the second stage it fills in the hole left by the first stage. Previous work considered distance as the only traveling cost. In this work, the slope factor is also included in the cost function because the mobile robot needs more energy to overcome the changes in elevation. A line sweeping approach based on the bug concept is also presented to identify a path for complete coverage of the terrain. The two methods are implemented and validated in simulation. A complete comparison of the traveling distance, time consumption, and number of scans recorded using the two methods is presented to show the effectiveness of the two-stage exploration algorithm.
机译:本文的目的是开发一种基于三角网格图的新探索性方法,用于对大型粗糙农业环境进行自动建模。三角形网格图用于表示农田表面,因为它能够有效地表示较大的粗糙区域。使用3D图像传感器读数,在探索过程中逐步构建地形图。在仿真中使用了3D图像传感器模型,其属性类似于照相机或激光传感器。通过考虑成本函数中的距离和高程变化,采用了两阶段的探索策略来计划下一个最佳视图。在探索的第一阶段,机器人行进到已探索和未探索的地形之间的外边界,而在第二阶段,它填补了第一阶段留下的空洞。以前的工作将距离视为唯一的旅行成本。在这项工作中,斜率因子也包含在成本函数中,因为移动机器人需要更多的能量来克服仰角的变化。还提出了一种基于错误概念的扫线方法,以识别用于完全覆盖地形的路径。两种方法均已在仿真中实现和验证。给出了使用两种方法记录的行驶距离,时间消耗和扫描次数的完整比较,以显示两阶段探索算法的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号