首页> 美国卫生研究院文献>Sensors (Basel Switzerland) >Robotic Active Information Gathering for Spatial Field Reconstruction with Rapidly-Exploring Random Trees and Online Learning of Gaussian Processes
【2h】

Robotic Active Information Gathering for Spatial Field Reconstruction with Rapidly-Exploring Random Trees and Online Learning of Gaussian Processes

机译:机器人主动信息收集用于快速探索随机树和高斯过程在线学习的空间领域重构

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Information gathering (IG) algorithms aim to intelligently select a mobile sensor actions required to efficiently obtain an accurate reconstruction of a physical process, such as an occupancy map, or a magnetic field. Many recent works have proposed algorithms for IG that employ Gaussian processes (GPs) as underlying model of the process. However, most algorithms discretize the state space, which makes them computationally intractable for robotic systems with complex dynamics. Moreover, they are not suited for online information gathering tasks as they assume prior knowledge about GP parameters. This paper presents a novel approach that tackles the two aforementioned issues. Specifically, our approach includes two intertwined steps: (i) a Rapidly-Exploring Random Tree (RRT) search that allows a robot to identify unvisited locations, and to learn the GP parameters, and (ii) an RRT*-based informative path planning that guides the robot towards those locations by maximizing the information gathered while minimizing path cost. The combination of the two steps allows an online realization of the algorithm, while eliminating the need for discretization. We demonstrate that our proposed algorithm outperforms state-of-the-art both in simulations, and in a lab experiment in which a ground-based robot explores the magnetic field intensity within an indoor environment populated with obstacles.
机译:信息收集(IG)算法旨在智能地选择有效获取物理过程(例如,占用图或磁场)的准确重建所需的移动传感器动作。许多最近的工作为IG提出了算法,这些算法采用高斯过程(GPs)作为过程的基础模型。但是,大多数算法会将状态空间离散化,这使它们对于具有复杂动力学的机器人系统在计算上难以处理。此外,它们不适合用于在线信息收集任务,因为它们假定具有有关GP参数的先验知识。本文提出了一种解决上述两个问题的新颖方法。具体来说,我们的方法包括两个相互交织的步骤:(i)快速探索随机树(RRT)搜索,该搜索使机器人可以识别未访问的位置并学习GP参数;(ii)基于RRT *的信息路径规划通过最大化收集的信息同时最小化路径成本,将机器人引导到这些位置。这两个步骤的组合允许在线实现算法,同时消除了离散化的需要。我们证明了我们提出的算法在仿真和实验室实验中均优于最新技术,在该实验中,地面机器人探索了充满障碍物的室内环境中的磁场强度。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号