首页> 外文会议>International Workshop on the Algorithmic Foundations of Robotics >Gap Navigation Trees: Minimal Representation for Visibility-based Tasks
【24h】

Gap Navigation Trees: Minimal Representation for Visibility-based Tasks

机译:GAP导航树:基于可见性任务的最小表示

获取原文

摘要

In this paper we present our advances in a data structure, the Gap Navigation Tree (GNT), useful for solving different visibility-based robotic tasks in unknown planar environments. We present its use for optimal robot navigation in simply-connected environments, locally optimal navigation in multiply-connected environments, pursuit-evasion, and robot localization. The guiding philosophy of this work is to avoid traditional problems such as complete map building and exact localization by constructing a minimal representation based entirely on critical events in online sensor measurements made by the robot. The data structure is introduced from an information space perspective, in which the information used among the different visibility-based tasks is essentially the same, and it is up to the robot strategy to use it accordingly for the completion of the particular task. This is done through a simple sensor abstraction that reports the discontinuities in depth information of the environment from the robot’s perspective (gaps), and without any kind of geometric measurements. The GNT framework was successfully implemented on a real robot platform.
机译:在本文中,我们在数据结构,间隙导航树(GNT)中提供了我们的进步,可用于解决未知的平面环境中的基于不同的基于可视性的机器人任务。我们在简单连接的环境中介绍了最佳机器人导航,乘以连接环境,追求逃避和机器人定位的局部最佳导航。这项工作的指导理念是避免传统的问题,例如通过完全基于机器人在线传感器测量中的关键事件构建最小的表示来实现完整的地图建设和精确定位。从信息空间透视引入数据结构,其中基于不同可视性的任务中使用的信息基本相同,并且它取决于机器人策略,以便在完成特定任务的情况下使用它。这是通过简单的传感器抽象来完成的,该传感器抽象从机器人的透视(间隙)报告环境的深度信息中的不连续性,并且没有任何类型的几何测量。 GNT框架在真正的机器人平台上成功实施。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号