Abstract
Autonomous agents operating in perceptually aliased environments should ideally be able to solve the data association problem. Yet, planning for future actions while considering this problem is not trivial. State of the art approaches therefore use multi-modal hypotheses to represent the states of the agent and of the environment. However, explicitly considering all possible data associations, the number of hypotheses grows exponentially with the planning horizon. As such, the corresponding Belief Space Planning problem quickly becomes unsolvable. Moreover, under hard computational budget constraints, some non-negligible hypotheses must eventually be pruned in both planning and inference. Nevertheless, the two processes are generally treated separately and the effect of budget constraints in one process over the other was barely studied. We present a computationally efficient method to solve the nonmyopic Belief Space Planning problem while reasoning about data association. Moreover, we rigorously analyze the effects of budget constraints in both inference and planning.
This research was partially supported by US NSF/US-Israel BSF, and by Israel PBC-VATAT and the Technion Artificial Intelligence Hub (Tech.AI).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Agarwal, S., Tamjidi, A., Chakravorty, S.: Motion planning for active data association and localization in non-gaussian belief spaces. In: Algorithmic Foundations of Robotics XII. SPAR, vol. 13, pp. 288–303. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-43089-4_19
Carlone, L., Censi, A., Dellaert, F.: Selecting good measurements via L1 relaxation: a convex approach for robust estimation over graphs. In: IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 2667–2674. IEEE (2014)
Dellaert, F.: Factor graphs and GTSAM: a hands-on introduction. Technical report, GT-RIM-CP &R-2012-002, Georgia Institute of Technology (2012)
Elimelech, K., Indelman, V.: Simplified decision making in the belief space using belief sparsification. Int. J. Robot. Res. (2021). arXiv: https://arxiv.org/abs/1909.00885
Hsiao, M., Kaess, M.: MH-iSAM2: multi-hypothesis iSAM using Bayes tree and hypo-tree. In: IEEE International Conference on Robotics and Automation (ICRA) (2019)
Hsiao, M., Mangelson, J.G., Suresh, S., Debrunner, C., Kaess, M.: Aras: ambiguity-aware robust active slam based on multi-hypothesis state and map estimations. In: IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 5037–5044. IEEE (2020)
Indelman, V., Nelson, E., Dong, J., Michael, N., Dellaert, F.: Incremental distributed inference from arbitrary poses and unknown data association: using collaborating robots to establish a common reference. IEEE Control Syst. Mag. (CSM) 36(2), 41–74 (2016)
Indelman, V., Nelson, E., Michael, N., Dellaert, F.: Multi-robot pose graph localization and data association from unknown initial relative poses via expectation maximization. In: IEEE International Conference on Robotics and Automation (ICRA) (2014)
Jiang, F., Agrawal, V., Buchanan, R., Fallon, M., Dellaert, F.: iMHS: an incremental multi-hypothesis smoother. arXiv preprint arXiv:2103.13178 (2021)
Kaess, M., Johannsson, H., Roberts, R., Ila, V., Leonard, J., Dellaert, F.: iSAM2: incremental smoothing and mapping using the Bayes tree. Int. J. Robot. Res. 31(2), 217–236 (2012)
Kitanov, A., Indelman, V.: Topological multi-robot belief space planning in unknown environments. In: IEEE International Conference on Robotics and Automation (ICRA), pp. 5726–5732 (2018)
Kschischang, F., Frey, B., Loeliger, H.A.: Factor graphs and the sum-product algorithm. IEEE Trans. Inform. Theory 47(2), 498–519 (2001)
Lajoie, P.Y., Hu, S., Beltrame, G., Carlone, L.: Modeling perceptual aliasing in slam via discrete-continuous graphical models. IEEE Robot. Autom. Lett. (RA-L) 4(2), 1232–1239 (2019)
Olson, E., Agarwal, P.: Inference on networks of mixtures for robust robot mapping. Int. J. Robot. Res. 32(7), 826–840 (2013)
Pathak, S., Thomas, A., Indelman, V.: A unified framework for data association aware robust belief space planning and perception. Int. J. Robot. Res. 32(2–3), 287–315 (2018)
Shelly, O., Indelman, V.: Hypotheses disambiguation in retrospective. IEEE Robot. Autom. Lett. (RA-L) 7(2), 2321–2328 (2022)
Shienman, M., Indelman, V.: D2A-BSP: distilled data association belief space planning with performance guarantees under budget constraints. In: IEEE International Conference on Robotics and Automation (ICRA) (2022)
Shienman, M., Indelman, V.: Nonmyopic distilled data association belief space planning under budget constraints. Technical report, Technion - Israel Institute of Technology (2022). https://tinyurl.com/4h3b9mz8
Shienman, M., Kitanov, A., Indelman, V.: FT-BSP: focused topological belief space planning. IEEE Robot. Autom. Lett. (RA-L) 6(3), 4744–4751 (2021)
Silver, D., Veness, J.: Monte-Carlo planning in large POMDPs. In: Advances in Neural Information Processing Systems (NIPS), pp. 2164–2172 (2010)
Sunderhauf, N., Protzel, P.: Towards a robust back-end for pose graph slam. In: IEEE International Conference on Robotics and Automation (ICRA), pp. 1254–1261. IEEE (2012)
Sztyglic, O., Zhitnikov, A., Indelman, V.: Simplified belief-dependent reward mcts planning with guaranteed tree consistency. arXiv preprint arXiv:2105.14239 (2021)
Sztyglic, O., Indelman, V.: Online pomdp planning via simplification. arXiv preprint arXiv:2105.05296 (2021)
Ye, N., Somani, A., Hsu, D., Lee, W.S.: DESPOT: online POMDP planning with regularization. JAIR 58, 231–266 (2017)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Shienman, M., Indelman, V. (2023). Nonmyopic Distilled Data Association Belief Space Planning Under Budget Constraints. In: Billard, A., Asfour, T., Khatib, O. (eds) Robotics Research. ISRR 2022. Springer Proceedings in Advanced Robotics, vol 27. Springer, Cham. https://doi.org/10.1007/978-3-031-25555-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-031-25555-7_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-25554-0
Online ISBN: 978-3-031-25555-7
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)