期刊
COMPUTER AIDED GEOMETRIC DESIGN
卷 66, 期 -, 页码 52-74出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.cagd.2018.09.002
关键词
Path planning; Divergence; Potential function; Distance function
资金
- Max Planck Center for Visual Computing and Communication
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 preprocessing 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. (C) 2018 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据