Pith. sign in

REVIEW 1 cited by

Task-Directed Exploration in Continuous POMDPs for Robotic Manipulation of Articulated Objects

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2212.04554 v1 pith:CRCFVCMK submitted 2022-12-08 cs.RO

classification cs.RO
keywords uncertaintypomdponlinepomdpsproblemssignificantarticulatedcontinuous
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Representing and reasoning about uncertainty is crucial for autonomous agents acting in partially observable environments with noisy sensors. Partially observable Markov decision processes (POMDPs) serve as a general framework for representing problems in which uncertainty is an important factor. Online sample-based POMDP methods have emerged as efficient approaches to solving large POMDPs and have been shown to extend to continuous domains. However, these solutions struggle to find long-horizon plans in problems with significant uncertainty. Exploration heuristics can help guide planning, but many real-world settings contain significant task-irrelevant uncertainty that might distract from the task objective. In this paper, we propose STRUG, an online POMDP solver capable of handling domains that require long-horizon planning with significant task-relevant and task-irrelevant uncertainty. We demonstrate our solution on several temporally extended versions of toy POMDP problems as well as robotic manipulation of articulated objects using a neural perception frontend to construct a distribution of possible models. Our results show that STRUG outperforms the current sample-based online POMDP solvers on several tasks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Flow-based Domain Randomization for Learning and Sequencing Robotic Skills

    cs.RO 2025-02 conditional novelty 6.0 of 10

    A normalizing-flow sampling distribution, trained with entropy-regularized reward maximization, improves domain coverage and sim-to-real transfer over Gaussian, beta, and interval-based learned domain randomization.

Pith tools