图上机器人手臂的位形空间
The configuration space of a robotic arm over a graph
摘要:
我们调查的配置空间$\mathcal{S}_{G,b,\ell}$与移动的机器人手臂的长度$\ell$在一个网格上的底层图形$G$,锚定在一个顶点$b \in G$。研究了由$G$上的索引路组成的关联PIP(不一致偏序集)$\text{IP}_{G,b,\ell}$.该PIP作为机器人手臂的组合模型,我们使用$\text{IP}_{G,b,\ell}$来证明空间$\mathcal{S}_{G,b,\ell}$是CAT(0)立方复合体,推广了Ardila,Bastidas,Ceballos和Guo的工作。这建立了测地线存在于配置空间内,并产生用于以最佳方式在不同配置之间移动机器人臂的显式算法。我们还给出了一个紧约束的机器人手臂过渡图的直径(从一种配置到另一种配置所需的最大移动次数),并计算这个直径为一个大家庭的基础图$G$。
英文摘要:
We investigate the configuration space $\mathcal{S}_{G,b,\ell}$ associated with the movement of a robotic arm of length $\ell$ on a grid over an underlying graph $G$, anchored at a vertex $b \in G$. We study an associated PIP (poset with inconsistent pairs) $\text{IP}_{G,b,\ell}$ consisting of indexed paths on $G$. This PIP acts as a combinatorial model for the robotic arm, and we use $\text{IP}_{G,b,\ell}$ to show that the space $\mathcal{S}_{G,b,\ell}$ is a CAT(0) cubical complex, generalizing work of Ardila, Bastidas, Ceballos, and Guo. This establishes that geodesics exist within the configuration space, and yields explicit algorithms for moving the robotic arm between different configurations in an optimal fashion. We also give a tight bound on the diameter of the robotic arm transition graph (the maximal number of moves necessary to change from one configuration to another) and compute this diameter for a large family of underlying graphs $G$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。