iX-BSP: Incremental Belief Space Planning
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 2 of its 41 references that are in the map. First posted on arXiv 18 Feb 2021.
Builds on
2 of 41 references.
References · 2
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 2; 2024: 1; 2025: 1.
6 papers.
- 2023Simplified Continuous High Dimensional Belief Space Planning with Adaptive Probabilistic Belief-dependent Constraintscited by 4
- 2021Probabilistic Loss and its Online Characterization for Simplified Decision Making Under Uncertaintycited by 2
- 2024Previous Knowledge Utilization In Online Anytime Belief Space Planningcited by 2
- 2023No Compromise in Solution Quality: Speeding Up Belief-dependent Continuous POMDPs via Adaptive Multilevel Simplificationcited by 1
- 2022Achieving mouse-level strategic evasion performance using real-time computational planningcited by 0
- 2025Action-Gradient Monte Carlo Tree Search for Non-Parametric Continuous (PO)MDPscited by 0
- 2025Action-Gradient Monte Carlo Tree Search for Non-Parametric Continuous (PO)MDPs15 Mar 2025
- 2024Previous Knowledge Utilization In Online Anytime Belief Space Planning17 Dec 2024
- 2023No Compromise in Solution Quality: Speeding Up Belief-dependent Continuous POMDPs via Adaptive Multilevel Simplification16 Oct 2023
- 2023Simplified Continuous High Dimensional Belief Space Planning with Adaptive Probabilistic Belief-dependent Constraints13 Feb 2023
- 2022Achieving mouse-level strategic evasion performance using real-time computational planning4 Nov 2022
- 2021Probabilistic Loss and its Online Characterization for Simplified Decision Making Under Uncertainty12 May 2021