arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1906.02249cs.ROstat.ML
收藏

基于因子图传播动作树的通用增量协方差更新和有效置信空间规划

General Purpose Incremental Covariance Update and Efficient Belief Space Planning via Factor-Graph Propagation Action Tree

Technion - Israel Institute of Technology(以色列理工学院)

Dmitry Kopitkov, Vadim Indelman

摘要:

对于SLAM(例如,为了解决数据关联)和用于评估置信空间规划(BSP)中的不同候选动作的信息理论项。在本文中,我们做了两个主要贡献。首先,我们开发了一种新的通用增量协方差更新技术,它有效地恢复特定的协方差条目后的任何变化的推断问题,如引入新的观察/变量或重新线性化的状态向量。我们的方法被证明比其他最先进的方法更快地恢复它们。其次,我们提出了一个计算效率高的方法BSP在高维状态空间,利用我们的增量协方差更新方法。现有技术的BSP方法对每个候选动作执行置信传播,然后评估通常包括信息理论项(诸如熵或信息增益)的目标函数。然而,候选动作通常具有相似的部分(例如,共同的轨迹部分),然而,针对每个候选动作单独地评估这些部分。此外,计算信息论项涉及整个信息(协方差)矩阵的昂贵的行列式计算,其为O(n^3),其中n是状态的维数,或者如果仅对某些变量的边际后验协方差感兴趣,则需要昂贵的舒尔补运算。我们的方法,rAMDL-Tree,扩展了我们以前的BSP方法rAMDL,通过利用增量协方差计算和执行非近视候选动作的公共部分之间的计算重用,使得这些部分只被评估一次,与现有的方法相比。

英文摘要:

Fast covariance calculation is required both for SLAM (e.g.~in order to solve data association) and for evaluating the information-theoretic term for different candidate actions in belief space planning (BSP). In this paper we make two primary contributions. First, we develop a novel general-purpose incremental covariance update technique, which efficiently recovers specific covariance entries after any change in the inference problem, such as introduction of new observations/variables or re-linearization of the state vector. Our approach is shown to recover them faster than other state-of-the-art methods. Second, we present a computationally efficient approach for BSP in high-dimensional state spaces, leveraging our incremental covariance update method. State of the art BSP approaches perform belief propagation for each candidate action and then evaluate an objective function that typically includes an information-theoretic term, such as entropy or information gain. Yet, candidate actions often have similar parts (e.g. common trajectory parts), which are however evaluated separately for each candidate. Moreover, calculating the information-theoretic term involves a costly determinant computation of the entire information (covariance) matrix which is O(n^3) with n being dimension of the state or costly Schur complement operations if only marginal posterior covariance of certain variables is of interest. Our approach, rAMDL-Tree, extends our previous BSP method rAMDL, by exploiting incremental covariance calculation and performing calculation re-use between common parts of non-myopic candidate actions, such that these parts are evaluated only once, in contrast to existing approaches.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑