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.
Efficient Belief Space Planning in High-Dimensional State Spaces using PIVOT: Predictive Incremental Variable Ordering Tactic
Autonomous Systems Program, Technion –- Israel Institute of Technology. 2 Department of Aerospace Engineering, Technion –- Israel Institute of Technology
SCOUT: Semantic scene COverage via Uncertainty-guided Traversal
Nokia Bell Labs, France(诺基亚贝尔实验室,法国);Nokia Bell Labs, Murray Hill, NJ, USA(诺基亚贝尔实验室,美国,新泽西州 Murray Hill);Imperial College London(帝国理工学院伦敦分校);Locus Robotics(Locus机器人技术公司)
Belief-Conditioned One-Step Diffusion: Real-Time Trajectory Planning with Just-Enough Sensing
University of Illinois Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校);University of Florida(佛罗里达大学);Providence College(普罗维登斯学院);Florida International University(佛罗里达国际大学)
IA-TIGRIS: An Incremental and Adaptive Sampling-Based Planner for Online Informative Path Planning
Robotics Institute, School of Computer Science, Carnegie Mellon University(卡内基梅隆大学计算机科学学院机器人研究所);Department of Mechanical Engineering, Brigham Young University(杨百翰大学机械工程系)
Multi-robot Learning-based Informative Path Planning Using Spatio-Temporal Gaussian Process Kalman Filter
Carnegie Mellon University(卡内基梅隆大学);Singapore University of Technology and Design(新加坡科技设计大学);Daegu Gyeongbuk Institute of Science and Technology(大邱庆北科学技术院)