Pith. sign in

REVIEW 3 cited by

Configuration Space Distance Fields for Manipulation Planning

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 2406.01137 v1 pith:4O3LWN4Y submitted 2024-06-03 cs.RO

classification cs.RO
keywords spaceconfigurationrobotdistancefieldoptimizationplanningrepresentation
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

The signed distance field is a popular implicit shape representation in robotics, providing geometric information about objects and obstacles in a form that can easily be combined with control, optimization and learning techniques. Most often, SDFs are used to represent distances in task space, which corresponds to the familiar notion of distances that we perceive in our 3D world. However, SDFs can mathematically be used in other spaces, including robot configuration spaces. For a robot manipulator, this configuration space typically corresponds to the joint angles for each articulation of the robot. While it is customary in robot planning to express which portions of the configuration space are free from collision with obstacles, it is less common to think of this information as a distance field in the configuration space. In this paper, we demonstrate the potential of considering SDFs in the robot configuration space for optimization, which we call the configuration space distance field. Similarly to the use of SDF in task space, CDF provides an efficient joint angle distance query and direct access to the derivatives. Most approaches split the overall computation with one part in task space followed by one part in configuration space. Instead, CDF allows the implicit structure to be leveraged by control, optimization, and learning problems in a unified manner. In particular, we propose an efficient algorithm to compute and fuse CDFs that can be generalized to arbitrary scenes. A corresponding neural CDF representation using multilayer perceptrons is also presented to obtain a compact and continuous representation while improving computation efficiency. We demonstrate the effectiveness of CDF with planar obstacle avoidance examples and with a 7-axis Franka robot in inverse kinematics and manipulation planning tasks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Robust Convex Model Predictive Control with collision avoidance guarantees for robot manipulators

    cs.RO 2025-08 conditional novelty 6.0 of 10

    A convex model predictive controller with a flexible safety tube and learned collision-free corridors achieves fast, robust, collision-free motion for robot manipulators under model uncertainty.

  2. Diffeomorphic Obstacle Avoidance for Contractive Dynamical Systems via Implicit Representations

    cs.RO 2025-04 conditional novelty 6.0 of 10

    A signed distance field based diffeomorphic transform lets contractive robot skills avoid obstacles while preserving contraction stability.

  3. Safe Dynamic Motion Generation in Configuration Space Using Differentiable Distance Fields

    cs.RO 2024-12 conditional novelty 6.0 of 10

    A QP-based controller combining time-varying control barrier and Lyapunov functions with configuration-space distance fields achieves velocity-aware, collision-free whole-body motion for manipulators.

Pith tools