iX-BSP: Incremental Belief Space Planning

02/18/2021
by   Elad I. Farhi, et al.
0

Deciding what's next? is a fundamental problem in robotics and Artificial Intelligence. Under belief space planning (BSP), in a partially observable setting, it involves calculating the expected accumulated belief-dependent reward, where the expectation is with respect to all future measurements. Since solving this general un-approximated problem quickly becomes intractable, state of the art approaches turn to approximations while still calculating planning sessions from scratch. In this work we propose a novel paradigm, Incremental BSP (iX-BSP), based on the key insight that calculations across planning sessions are similar in nature and can be appropriately re-used. We calculate the expectation incrementally by utilizing Multiple Importance Sampling techniques for selective re-sampling and re-use of measurement from previous planning sessions. The formulation of our approach considers general distributions and accounts for data association aspects. We demonstrate how iX-BSP could benefit existing approximations of the general problem, introducing iML-BSP, which re-uses calculations across planning sessions under the common Maximum Likelihood assumption. We evaluate both methods and demonstrate a substantial reduction in computation time while statistically preserving accuracy. The evaluation includes both simulation and real-world experiments considering autonomous vision-based navigation and SLAM. As a further contribution, we introduce to iX-BSP the non-integral wildfire approximation, allowing one to trade accuracy for computational performance by averting from updating re-used beliefs when they are "close enough". We evaluate iX-BSP under wildfire demonstrating a substantial reduction in computation time while controlling the accuracy sacrifice. We also provide analytical and empirical bounds of the effect wildfire holds over the objective value.

READ FULL TEXT

page 2

page 3

page 9

page 12

page 14

page 21

page 33

page 42

research
05/11/2021

Online POMDP Planning via Simplification

In this paper, we consider online planning in partially observable domai...
research
02/13/2023

Simplified Continuous High Dimensional Belief Space Planning with Adaptive Probabilistic Belief-dependent Constraints

Online decision making under uncertainty in partially observable domains...
research
12/29/2021

Efficient Belief Space Planning in High-Dimensional State Spaces using PIVOT: Predictive Incremental Variable Ordering Tactic

In this work, we examine the problem of online decision making under unc...
research
07/17/2022

Nonmyopic Distilled Data Association Belief Space Planning Under Budget Constraints

Autonomous agents operating in perceptually aliased environments should ...
research
09/02/2019

Efficient Decision Making and Belief Space Planning using Sparse Approximations

In this work, we introduce a new approach for the efficient solution of ...
research
06/05/2019

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

Fast covariance calculation is required both for SLAM (e.g. in order to ...
research
02/10/2022

D2A-BSP: Distilled Data Association Belief Space Planning with Performance Guarantees Under Budget Constraints

Unresolved data association in ambiguous and perceptually aliased enviro...

Please sign up or login with your details

Forgot password? Click here to reset