← Search

Rachel M. Holladay

3 accepted papers

2019

Minimizing Task-Space Fréchet Error via Efficient Incremental Graph Search

RA-L 2019

We present an anytime algorithm that generates a collision-free configuration-space path that closely follows a desired path in task space, according to the discrete Fréchet distance. By leveraging tools from computational geometry, we approximate the search space using a cross-product graph. We use

Cited by 27SourceScholar