Pith. sign in

REVIEW 4 cited by

Coarse-to-Fine Q-attention with Learned Path Ranking

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 2204.01571 v1 pith:UNVGDDDL submitted 2022-04-04 cs.RO cs.AIcs.CVcs.LG

Coarse-to-Fine Q-attention with Learned Path Ranking

classification cs.RO cs.AIcs.CVcs.LG
keywords pathtaskslearnedc2f-armdemonstrationsdifferentrankingable
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We propose Learned Path Ranking (LPR), a method that accepts an end-effector goal pose, and learns to rank a set of goal-reaching paths generated from an array of path generating methods, including: path planning, Bezier curve sampling, and a learned policy. The core idea being that each of the path generation modules will be useful in different tasks, or at different stages in a task. When LPR is added as an extension to C2F-ARM, our new system, C2F-ARM+LPR, retains the sample efficiency of its predecessor, while also being able to accomplish a larger set of tasks; in particular, tasks that require very specific motions (e.g. opening toilet seat) that need to be inferred from both demonstrations and exploration data. In addition to benchmarking our approach across 16 RLBench tasks, we also learn real-world tasks, tabula rasa, in 10-15 minutes, with only 3 demonstrations.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

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

  1. SkiP: When to Skip and When to Refine for Efficient Robot Manipulation

    cs.RO 2026-05 unverdicted novelty 7.0

    SkiP introduces action relabeling and Motion Spectrum Keying to skip redundant steps in robot trajectories, cutting executed steps by 15-40% while maintaining success rates across 72 simulated and 3 real tasks.

  2. KEMO: Event-Driven Keyframe Memory for Long-Horizon Robot Manipulation with VLA Policies

    cs.RO 2026-06 unverdicted novelty 6.0

    KEMO is an event-driven keyframe memory system that improves VLA policy success rates by 23.6% on real dual-arm tasks by selectively preserving task-relevant history via kinematics-visual event detection and gated fusion.

  3. RoboMemArena: A Comprehensive and Challenging Robotic Memory Benchmark

    cs.RO 2026-05 unverdicted novelty 6.0

    RoboMemArena is a new large-scale robotic memory benchmark with real-world tasks, and PrediMem is a dual VLA system that outperforms baselines by managing memory buffers with predictive coding.

  4. Lift3D-VLA: Lifting VLA Models to 3D Geometry and Dynamics-Aware Manipulation

    cs.RO 2026-07 conditional novelty 5.0

    Lift3D-VLA integrates 3D point cloud encoding and temporal action modeling into Vision-Language-Action models, achieving higher success rates on simulated and real-world robotic manipulation tasks.