Skip to content
arXiv Robotics — research abstracts· Prabhu Nithin Gollapudi, Andreas Maier, Franziska Mathis-Ullrich, Water Zhao, Jia Wang, Siming Bayer·· 2 days agoSignalEditorial score85

Compressed Orientation Reachability Maps for Sub-Second Robotic Needle Entry Point Planning

Compressed Orientation Reachability Maps for Sub-Second Robotic Needle Entry Point Planning

Summary

This research presents an Orientation-Based Reachability Map (ORM) that enables sub-second robotic needle entry point planning for liver interventions. The ORM precomputes kinematic feasibility across 188,873 workspace positions and uses a JIT compiled runtime pipeline to achieve planning latencies of 0.289-0.349 seconds per target, significantly faster than existing methods which take 13.5-26.9 seconds. The approach maintains high geometric fidelity with mean convex hull and alpha-shape overlap ratios of 0.933 and 0.976 respectively.

Editorial context

This paper introduces an efficient method for robotic needle entry point planning in liver interventions, reducing planning latency from seconds to sub-second levels using a precomputed orientation reachability map.

Source: arXiv Robotics — research abstracts · Read original article ↗

Loading article text…

What the source reports

Publisher-reported claims, with original evidence. These results have not been independently verified by RoboSignal.

Reported numbers

  • planning latency

    0.289–0.349

    View original evidence
    on in planning latency from 13.5-26.9 s to 0.289-0.349 s per target while maintaining high geometric fidelity, achieving a mean convex hull volume overlap ratio of 0.933 and a mean alpha-shape volume ratio of 0.976 relative to the baseline reachable point cloud. The proposed ORM framework enables sub-second entry point planning and provides an efficient computational framework for robotic needle insertion in percutan
    Open source S4
  • mean convex hull volume overlap ratio

    0.933

    View original evidence
    on in planning latency from 13.5-26.9 s to 0.289-0.349 s per target while maintaining high geometric fidelity, achieving a mean convex hull volume overlap ratio of 0.933 and a mean alpha-shape volume ratio of 0.976 relative to the baseline reachable point cloud. The proposed ORM framework enables sub-second entry point planning and provides an efficient computational framework for robotic needle insertion in percutan
    Open source S4
  • mean alpha-shape volume ratio

    0.976

    View original evidence
    on in planning latency from 13.5-26.9 s to 0.289-0.349 s per target while maintaining high geometric fidelity, achieving a mean convex hull volume overlap ratio of 0.933 and a mean alpha-shape volume ratio of 0.976 relative to the baseline reachable point cloud. The proposed ORM framework enables sub-second entry point planning and provides an efficient computational framework for robotic needle insertion in percutan
    Open source S4
  • workspace positions

    188,873

    View original evidence
    paper introduces an Orientation-Based Reachability Map (ORM) that precomputes the kinematic feasibility of a 6 Degrees of Freedom (DoF) serial manipulator across 188,873 workspace positions and encodes orientation feasibility into a compact, indexed 83 MB map. A Just-In-Time (JIT) compiled runtime pipeline replaces live optimization with near-instantaneous array lookups. Experimental evaluation demonstrates a reducti
    Open source S3
  • map size

    83

    View original evidence
    paper introduces an Orientation-Based Reachability Map (ORM) that precomputes the kinematic feasibility of a 6 Degrees of Freedom (DoF) serial manipulator across 188,873 workspace positions and encodes orientation feasibility into a compact, indexed 83 MB map. A Just-In-Time (JIT) compiled runtime pipeline replaces live optimization with near-instantaneous array lookups. Experimental evaluation demonstrates a reducti
    Open source S3
  • paper: not_reported
  • code: not_reported
  • weights: not_reported
  • dataset: not_reported
Source excerpts and review record

Automatically extracted; no manual editorial approval recorded.

arXiv:2610.39879v1 Announce Type: new Abstract: In the context of multi-stage trajectory planning for robotic percutaneous liver interventions, identifying a kinematically feasible entry point remains a critical computational bottleneck. Existing methods rely on exhaustive inverse kinematics or randomized searches, incurring delays of 13 to 27 seconds per target and limiting real-time intraoperative adaptation. This

Open source S2

on in planning latency from 13.5-26.9 s to 0.289-0.349 s per target while maintaining high geometric fidelity, achieving a mean convex hull volume overlap ratio of 0.933 and a mean alpha-shape volume ratio of 0.976 relative to the baseline reachable point cloud. The proposed ORM framework enables sub-second entry point planning and provides an efficient computational framework for robotic needle insertion in percutan

Open source S4

paper introduces an Orientation-Based Reachability Map (ORM) that precomputes the kinematic feasibility of a 6 Degrees of Freedom (DoF) serial manipulator across 188,873 workspace positions and encodes orientation feasibility into a compact, indexed 83 MB map. A Just-In-Time (JIT) compiled runtime pipeline replaces live optimization with near-instantaneous array lookups. Experimental evaluation demonstrates a reducti

Open source S3

Source:arXiv Robotics — research abstracts · arxiv.org

Timezone · UTC

Article dates follow your selected timezone. Briefing editions use Hong Kong time (UTC+8).