单纯形复形的一种搜索算法
A Search Algorithm for Simplicial Complexes
摘要:
我们提出了'基本S*'算法计算最短路径通过一个度量单纯复形。特别地,给定一个度量图$G$,它被构造为底层配置空间(一个更大的“连续”空间/流形,通常维数大于1)的离散表示,我们考虑与之关联的Rips复形$\mathcal{R}(G)$。这样的复形,因此其中的最短路径,比图更接近底层度量空间。虽然连续空间的离散图形表示对于机器人系统的配置空间中的运动规划是方便的,但是由周围配置空间在它们中引入的度量与配置空间本身的度量显著不同。我们使用单纯复表示来解决这个问题。我们的算法只需要一个抽象图,$G=(V,E)$,和成本/长度函数,$d:E\rightarrow \mathbb{R}_+$,作为输入,而不需要全局信息,如嵌入或全局坐标图。的基本S* 算法的复杂性是可比的Dijkstra的搜索,但是,在本文中提出的结果表明,使用该算法获得的最短路径表示/近似的测地线路径在原始度量空间显着更密切。
英文摘要:
We present the `Basic S*' algorithm for computing shortest path through a metric simplicial complex. In particular, given a metric graph, $G$, which is constructed as a discrete representation of an underlying configuration space (a larger "continuous" space/manifold typically of dimension greater than one), we consider the Rips complex, $\mathcal{R}(G)$, associated with it. Such a complex, and hence shortest paths in it, represent the underlying metric space more closely than what the graph does. While discrete graph representations of continuous spaces is convenient for motion planning in configuration spaces of robotic systems, the metric induced in them by the ambient configuration space is significantly different from the metric of the configuration space itself. We remedy this problem using the simplicial complex representation. Our algorithm requires only an abstract graph, $G=(V,E)$, and a cost/length function, $d:E\rightarrow \mathbb{R}_+$, as inputs, and no global information such as an embedding or a global coordinate chart is required. The complexity of the Basic S* algorithm is comparable to that of Dijkstra's search, but, as the results presented in this paper demonstrate, the shortest paths obtained using the proposed algorithm represent/approximate the geodesic paths in the original metric space significantly more closely.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。