基于子模块的高效触摸定位
Efficient Touch Based Localization through Submodularity
摘要:
许多机器人系统通过执行一系列信息收集动作来处理不确定性。在这项工作中,我们专注于有效地构建这样一个序列的问题,通过绘制一个显式连接到子模块。理想情况下,我们希望有一种方法可以找到最佳序列,在提供足够信息的同时花费最少的时间。然而,找到这个序列通常是困难的。因此,许多成熟的方法都选择了greatly操作。令人惊讶的是,这往往表现良好。我们的工作首先解释了这种高性能-我们注意到一个常用的度量,减少香农熵,是submodular在某些假设下,渲染贪婪的解决方案相比,在离线设置的最佳计划。然而,在线对观察结果做出反应可以提高性能。最近开发的自适应子模块化的概念提供了一个贪心算法在这个在线设置的保证。在这项工作中,我们开发了新的方法,基于自适应子模块选择一系列的信息收集行动在线。除了提供保证之外,我们还可以利用子模块化来获得额外的计算加速。我们证明了这些方法在仿真和机器人上的有效性。
英文摘要:
Many robotic systems deal with uncertainty by performing a sequence of information gathering actions. In this work, we focus on the problem of efficiently constructing such a sequence by drawing an explicit connection to submodularity. Ideally, we would like a method that finds the optimal sequence, taking the minimum amount of time while providing sufficient information. Finding this sequence, however, is generally intractable. As a result, many well-established methods select actions greedily. Surprisingly, this often performs well. Our work first explains this high performance -- we note a commonly used metric, reduction of Shannon entropy, is submodular under certain assumptions, rendering the greedy solution comparable to the optimal plan in the offline setting. However, reacting online to observations can increase performance. Recently developed notions of adaptive submodularity provide guarantees for a greedy algorithm in this online setting. In this work, we develop new methods based on adaptive submodularity for selecting a sequence of information gathering actions online. In addition to providing guarantees, we can capitalize on submodularity to attain additional computational speedups. We demonstrate the effectiveness of these methods in simulation and on a robot.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。