Computationally efficient decision making under uncertainty in high-dimensional state spaces

We develop a novel approach for decision making under uncertainty in high-dimensional state spaces, considering both active unfocused and focused inference, where in the latter case reducing the uncertainty of only a subset of variables is of interest. State of the art approaches typically first calculate the posterior information (or covariance) matrix, followed by its determinant calculation, and do so separately for each candidate action. In contrast, using the generalized matrix determinant lemma, we avoid calculating these posteriors and determinants of large matrices. Furthermore, as our key contribution we introduce the concept of calculation re-use, performing a onetime computation that depends on state dimensionality and system sparsity, after which evaluating the impact of each candidate action no longer depends on state dimensionality. Such a concept is derived for both active focused and unfocused inference, leading to general, non-myopic and exact approaches that are faster by orders of magnitude compared to the state of the art. We verify our approach experimentally in two scenarios, sensor deployment (focused and unfocused) and measurement selection in visual SLAM, and show its superiority over standard techniques.

[1]  Vadim Indelman No Correlations Involved: Decision Making Under Uncertainty in a Conservative Sparse Information Space , 2016, IEEE Robotics and Automation Letters.

[2]  Pavel Zemcík,et al.  Fast covariance recovery in incremental nonlinear least square solvers , 2015, 2015 IEEE International Conference on Robotics and Automation (ICRA).

[3]  F. Dellaert Factor Graphs and GTSAM: A Hands-on Introduction , 2012 .

[4]  Andreas Krause,et al.  Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies , 2008, J. Mach. Learn. Res..

[5]  Ryan M. Eustice,et al.  Risk aversion in belief-space planning under measurement acquisition uncertainty , 2015, 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[6]  Diane Valérie Ouellette Schur complements and statistics , 1981 .

[7]  Juan Andrade-Cetto,et al.  Planning Reliable Paths With Pose SLAM , 2013, IEEE Transactions on Robotics.

[8]  Jonathan P. How,et al.  Sensor Selection in High-Dimensional Gaussian Trees with Nuisances , 2013, NIPS.

[9]  Leslie Pack Kaelbling,et al.  Belief space planning assuming maximum likelihood observations , 2010, Robotics: Science and Systems.

[10]  D. Harville Matrix Algebra From a Statistician's Perspective , 1998 .

[11]  Cyrill Stachniss,et al.  Information-theoretic compression of pose graphs for laser-based SLAM , 2012, Int. J. Robotics Res..

[12]  Vadim Indelman,et al.  Towards information-theoretic decision making in a conservative information space , 2015, 2015 American Control Conference (ACC).

[13]  G. Golub,et al.  Large scale geodetic least squares adjustment by dissection and orthogonal decomposition , 1979 .

[14]  Leslie Pack Kaelbling,et al.  Planning and Acting in Partially Observable Stochastic Domains , 1998, Artif. Intell..

[15]  Pieter Abbeel,et al.  Scaling up Gaussian Belief Space Planning Through Covariance-Free Trajectory Optimization and Automatic Differentiation , 2014, WAFR.

[16]  Frank Dellaert,et al.  Selecting good measurements via ℓ1 relaxation: A convex approach for robust estimation over graphs , 2014, 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[17]  Frank Dellaert,et al.  Covariance recovery from a square root information matrix for data association , 2009, Robotics Auton. Syst..

[18]  Wolfram Burgard,et al.  Nonlinear Graph Sparsification for SLAM , 2014, Robotics: Science and Systems.

[19]  Gamini Dissanayake,et al.  Multi-Step Look-Ahead Trajectory Planning in SLAM: Possibility and Necessity , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[20]  Dale L. Zimmerman,et al.  Optimal network design for spatial prediction, covariance parameter estimation, and empirical prediction , 2006 .

[21]  Juan Andrade-Cetto,et al.  Information-Based Compact Pose SLAM , 2010, IEEE Transactions on Robotics.

[22]  Ryan M. Eustice,et al.  Active visual SLAM for robotic area coverage: Theory and experiment , 2015, Int. J. Robotics Res..

[23]  Ron Alterovitz,et al.  Motion planning under uncertainty using iterative local optimization in belief space , 2012, Int. J. Robotics Res..

[24]  Hugh F. Durrant-Whyte,et al.  Conservative Sparsification for efficient and consistent approximate estimation , 2011, 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[25]  Frank Dellaert,et al.  iSAM2: Incremental smoothing and mapping using the Bayes tree , 2012, Int. J. Robotics Res..

[26]  Frank Dellaert,et al.  Planning in the continuous domain: A generalized belief space approach for autonomous navigation in unknown environments , 2015, Int. J. Robotics Res..

[27]  G. Golub,et al.  Some large-scale matrix computation problems , 1996 .

[28]  John J. Leonard,et al.  Consistent sparsification for graph optimization , 2013, 2013 European Conference on Mobile Robots.

[29]  Andrew J. Davison,et al.  Active matching for visual tracking , 2009, Robotics Auton. Syst..

[30]  Jonathan P. How,et al.  Two-Stage Focused Inference for Resource-Constrained Collision-Free Navigation , 2015, Robotics: Science and Systems.

[31]  Michael Kaess,et al.  Generic Node Removal for Factor-Graph SLAM , 2014, IEEE Transactions on Robotics.

[32]  Andrew J. Davison,et al.  Active search for real-time vision , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

[33]  M. Stein,et al.  Spatial sampling design for prediction with estimated parameters , 2006 .