Path planning with divergence-based distance functions

Renjie Chen, Craig Gotsman, Kai Hormann

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

Distance functions between points in a domain can be used to automatically plan a gradient-descent path towards a given target point in the domain, avoiding obstacles that may be present. A key requirement from such distance functions is the absence of spurious local minima, and this has led to the common use of harmonic potential functions. This choice guarantees the absence of spurious minima, but is well known to be slow to numerically compute and prone to numerical precision issues. To alleviate the first of these problems, we propose a family of novel divergence distances. These are based on f-divergence of the Poisson kernel of the domain. Using the concept of conformal invariance, we show that divergence distances are equivalent to the harmonic potential function on simply-connected domains, namely generate paths which are identical to those generated by the potential function. We then discuss how to compute two special cases of divergence distances, one based on the Kullback–Leibler, the other on the total variation divergence, in practice by discretizing the domain with a triangle mesh and using Finite Elements (FEM) computation. We show that using divergence distances instead of the potential function and other distances has a significant computational advantage, as, following a pre-processing stage, they may be computed online in a multi-query scenario up to an order of magnitude faster than the others when taking advantage of certain sparsity properties of the Poisson kernel. Furthermore, the computation is “embarrassingly parallel”, so may be implemented on a GPU with up to three orders of magnitude speedup.

Original languageEnglish (US)
Pages (from-to)52-74
Number of pages23
JournalComputer Aided Geometric Design
Volume66
DOIs
StatePublished - Nov 2018
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Modeling and Simulation
  • Automotive Engineering
  • Aerospace Engineering
  • Computer Graphics and Computer-Aided Design

Keywords

  • Distance function
  • Divergence
  • Path planning
  • Potential function

Fingerprint Dive into the research topics of 'Path planning with divergence-based distance functions'. Together they form a unique fingerprint.

Cite this