2 citations · 4 across the 3 of their papers we have counts for
3 papers
math.CV2018★ 1 cited
On Divergence-based Distance Functions for Multiply-connected Domains
Renjie Chen, Craig Gotsman, Kai Hormann
Given a finitely-connected bounded planar domain , it is possible to define a {\it divergence distance} from to , which takes into account the complex ge…
cs.RO2017★ 1 cited
Practical Distance Functions for Path-Planning in Planar Domains
Renjie Chen, Craig Gotsman, Kai Hormann
Path planning is an important problem in robotics. One way to plan a path between two points within a (not necessarily simply-connected) planar domain , is to define a non…
cs.RO2017★ 2 cited
Path Planning with Divergence-Based Distance Functions
Renjie Chen, Craig Gotsman, Kai Hormann
Distance functions between points in a domain are sometimes used to automatically plan a gradient-descent path towards a given target point in the domain, avoiding obstacles that m…