arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2011.11672cs.CG
收藏

变长度铰接测头可行轨迹的表征与计算

Characterization and Computation of Feasible Trajectories for an Articulated Probe with a Variable-Length End Segment

Ovidiu Daescu, Ka Yaw Teo

摘要:

铰接式探头在平面中被建模为在$b$处连接的两个线段,$ab$和$bc$,其中$ab$非常长,而$bc$具有某个小长度$r$。我们调查的轨迹规划问题,涉及铰接两段探头的长度$r$的$bc$可以定制。考虑一组简单多边形障碍物$P$,其具有全部$n$顶点、位于自由空间中使得$t$不能看到无穷远的目标点$t$以及围绕$P$的以$t$为中心的圆$S$。探针最初位于$S$外部,$ab$和$bc$共线,并限于以下移动顺序:将$abc$直线插入$S$,然后围绕$b$旋转$bc$。我们的目标是计算一个可行的避障轨迹的探头,使移动序列后,$c$符合$t$。我们证明了,对于$n$线段障碍,最小长度$r$存在一个可行的探针轨迹可以发现在$O(n^{2+ε})$时间使用$O(n^{2+ε})$空间,任何常数$ε> 0$。此外,我们证明了所有的值$r$的一个可行的探针轨迹存在形式$O(n^2)$间隔,并可以计算在$O(n^{5/2})$时间使用$O(n^{2+ε})$空间。我们还表明,对于一个给定的$r$,可行的轨迹空间的铰接式探头的特点是一个简单的安排的复杂性$O(n^2)$,它可以在$O(n^2)$时间构建。为了获得我们的解决方案,我们设计了高效的数据结构的一些有趣的变种的几何相交和空查询问题。

英文摘要:

An articulated probe is modeled in the plane as two line segments, $ab$ and $bc$, joined at $b$, with $ab$ being very long, and $bc$ of some small length $r$. We investigate a trajectory planning problem involving the articulated two-segment probe where the length $r$ of $bc$ can be customized. Consider a set $P$ of simple polygonal obstacles with a total of $n$ vertices, a target point $t$ located in the free space such that $t$ cannot see to infinity, and a circle $S$ centered at $t$ enclosing $P$. The probe initially resides outside $S$, with $ab$ and $bc$ being collinear, and is restricted to the following sequence of moves: a straight line insertion of $abc$ into $S$ followed by a rotation of $bc$ around $b$. The goal is to compute a feasible obstacle-avoiding trajectory for the probe so that, after the sequence of moves, $c$ coincides with $t$. We prove that, for $n$ line segment obstacles, the smallest length $r$ for which there exists a feasible probe trajectory can be found in $O(n^{2+ε})$ time using $O(n^{2+ε})$ space, for any constant $ε> 0$. Furthermore, we prove that all values $r$ for which a feasible probe trajectory exists form $O(n^2)$ intervals, and can be computed in $O(n^{5/2})$ time using $O(n^{2+ε})$ space. We also show that, for a given $r$, the feasible trajectory space of the articulated probe can be characterized by a simple arrangement of complexity $O(n^2)$, which can be constructed in $O(n^2)$ time. To obtain our solutions, we design efficient data structures for a number of interesting variants of geometric intersection and emptiness query problems.

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

↑