April
2019
Minimizing task-space frechet error via efficient incremental graph search
Authors:
Abstract:
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 a variant of Dijkstra's graph-search algorithm to efficiently search for and iteratively improve the solution. We compare multiple proposed densification strategies and empirically show that our algorithm outperforms a set of state-of-the-art planners on a range of manipulation problems. Finally, we offer a proof sketch of the asymptotic optimality of our algorithm.
copied = false, 2000);
">
@article{Holladay-2019-122657,
author = {Rachel Holladay And Oren Salzman And Siddhartha Srinivasa},
title = {Minimizing task-space frechet error via efficient incremental graph search},
journal = {Proceedings of IEEE Robotics and Automation Letters},
year = {2019},
month = {April},
volume = {4},
number = {2},
pages = {1999 - 2006},
}
author = {Rachel Holladay And Oren Salzman And Siddhartha Srinivasa},
title = {Minimizing task-space frechet error via efficient incremental graph search},
journal = {Proceedings of IEEE Robotics and Automation Letters},
year = {2019},
month = {April},
volume = {4},
number = {2},
pages = {1999 - 2006},
}