Asymptotically Optimal Belief Space Planning in Discrete Partially-Observable Domains
Janis Eric Freund, Camille Phiquepal, Andreas Orthey, Marc, Toussaint

TL;DR
This paper introduces an improved path tree optimization (PTO) method for belief space planning in discrete partially observable domains, enhancing contingency computation with a camera-based state sampler and supporting non-euclidean spaces, demonstrated through realistic scenarios.
Contribution
The paper presents PTO with a novel camera-based state sampler and support for non-euclidean spaces, advancing belief space planning efficiency and success rates.
Findings
Camera-based sampler improves success in 3 out of 4 scenarios.
PTO reduces memory footprint compared to baseline methods.
Supports non-euclidean state spaces in belief planning.
Abstract
Robots often have to operate in discrete partially observable worlds, where the states of world are only observable at runtime. To react to different world states, robots need contingencies. However, computing contingencies is costly and often non-optimal. To address this problem, we develop the improved path tree optimization (PTO) method. PTO computes motion contingencies by constructing a tree of motion paths in belief space. This is achieved by constructing a graph of configurations, then adding observation edges to extend the graph to belief space. Afterwards, we use a dynamic programming step to extract the path tree. PTO extends prior work by adding a camera-based state sampler to improve the search for observation points. We also add support to non-euclidean state spaces, provide an implementation in the open motion planning library (OMPL), and evaluate PTO on four realistic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotic Path Planning Algorithms · Machine Learning and Data Classification · AI-based Problem Solving and Planning
