arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1607.02770cs.CGcs.RO
收藏

基于采样的瓶颈寻路及其在Frechet匹配中的应用

Sampling-based bottleneck pathfinding with applications to Frechet matching

Tel Aviv University(特拉维夫大学)

Kiril Solovey, Dan Halperin

摘要:

我们描述了一个通用的概率框架,以解决各种弗雷歇距离优化问题。具体来说,我们感兴趣的是在给定的起点和目标点之间的$d$维欧氏空间中找到最小的路径,即在连续的成本图上最小化最大值的路径。我们提出了一个有效的和简单的采样为基础的框架,这个问题,这是启发,并借鉴的想法,机器人运动规划的技术。我们扩展的框架,不仅处理标准的瓶颈寻路,但也更苛刻的情况下,路径需要在所有维度上是单调的。最后,我们提供了几种类型的问题上的框架的实验结果。

英文摘要:

We describe a general probabilistic framework to address a variety of Frechet-distance optimization problems. Specifically, we are interested in finding minimal bottleneck-paths in $d$-dimensional Euclidean space between given start and goal points, namely paths that minimize the maximal value over a continuous cost map. We present an efficient and simple sampling-based framework for this problem, which is inspired by, and draws ideas from, techniques for robot motion planning. We extend the framework to handle not only standard bottleneck pathfinding, but also the more demanding case, where the path needs to be monotone in all dimensions. Finally, we provide experimental results of the framework on several types of problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑