Previous Knowledge Utilization In Online Anytime Belief Space Planning

Michael Novitsky, Moran Barenboim, Vadim Indelman
12/17/2024
cs.AIcs.RO

No official code found. Best implementation: miken1990/ir-pft (0 stars, last commit 2024-12-21).

Abstract

Online planning under uncertainty remains a critical challenge in robotics and autonomous systems. While tree search techniques are commonly employed to construct partial future trajectories within computational constraints, most existing methods discard information from previous planning sessions considering continuous spaces. This study presents a novel, computationally efficient approach that leverages historical planning data in current decision-making processes. We provide theoretical foundations for our information reuse strategy and introduce an algorithm based on Monte Carlo Tree Search (MCTS) that implements this approach. Experimental results demonstrate that our method significantly reduces computation time while maintaining high performance levels. Our findings suggest that integrating historical planning information can substantially improve the efficiency of online decision-making in uncertain environments, paving the way for more responsive and adaptive autonomous systems.

View on arXivView PDF

Code Implementations(1)

miken1990/ir-pftCommunity100%
00JuliaDec 17, 20241 years ago

Similar Papers

Cite this paper

@article{novitsky2024previous,
  title  = {Previous Knowledge Utilization In Online Anytime Belief Space Planning},
  author = {Michael Novitsky and Moran Barenboim and Vadim Indelman},
  year   = {2024},
  eprint = {2412.13128},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2412.13128v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2412.13128.svg)](https://codeofpaper.com/paper/2412.13128)

Discussion