h-NESDF: An Infinitely Differentiable Signed Distance Between Two Sets with Robotic Applications
Overview
This paper introduces h-NESDF, a normal Euclidean signed distance function that is infinitely differentiable for any smoothing parameter h > 0 and reduces to the non-smooth NESDF as h approaches zero. The method supports GPU parallelization and is evaluated through extensive simulations for motion planning tasks involving general, possibly non-convex sets.
Generated from attributed reports · Updated 2 hours ago
Event evidence and corrections
0 attributed source owners. Ownership does not establish independent confirmation. Quantities are reported separately and are never added together.
Artifact availability · paper: reported pending
“arXiv:2611.03944v1 Announce Type: new Abstract: Computing distances between sets is important in many robotic applications, such as motion planning and control. In many applications, derivatives of the distance are needed as well. It is well known that the Euclidean distance is not always differentiable, which create issues to algorithms that need a derivative. In this paper, we introduce NESDF, the Normal Euclidean”
Exact source · revision 1Source owner not reported
Report timeline
Follow attributed reports and material updates.
- arXiv Robotics — research abstractsSignalh-NESDF: An Infinitely Differentiable Signed Distance Between Two Sets with Robotic Applications
This paper introduces h-NESDF, a normal Euclidean signed distance function that is infinitely differentiable for any smoothing parameter h > 0 and reduces to the non-smooth NESDF as h approaches zero. The method supports GPU parallelization and is evaluated through extensive simulations for motion planning tasks involving general, possibly non-convex sets.
Event coverage history
There is not enough continuous observation data to show a trend.
Timezone · UTC
Article dates follow your selected timezone. Briefing editions use Hong Kong time (UTC+8).