三维铰接测头可行轨迹的计算
Computing Feasible Trajectories for an Articulated Probe in Three Dimensions
摘要:
考虑由$\mathbb{R}^3$中的一组$n$不相交三角形障碍物和自由空间中的目标点$t$组成的输入,所有这些障碍物都被以$t$为中心的半径为$R$的大球体$S$包围。铰接式探头被建模为在点$b$处连接的两条线段$ab$和$bc$。$ab$的长度可以等于或大于$R$,而$bc$具有给定长度$r \leq R$。探头最初位于$S$外部,假设为非铰接配置,其中$ab$和$bc$共线且$b \in ac$。目标是找到一个可行的(避开障碍物)探头轨迹到达$t$,条件是探头受到以下移动顺序的约束--将无关节探头直线插入$S$,然后可能在$b$处旋转$bc$至多$π/2$弧度,使$c$与$t$重合。我们证明,如果存在一个可行的探测轨迹,那么一组极值可行轨迹必须存在。通过仔细的案例分析,我们表明,这些极值轨迹可以表示为$O(n^4)$组合事件。我们提出了一个解决方案的方法,列举和验证这些组合事件的可行性,在整个$O(n^{4+ε})$时间使用$O(n^{4+ε})$空间,任何常数$ε> 0$。枚举算法是高度并行的,考虑到每个组合事件可以独立于其他事件生成和验证可行性。在推导过程中,我们设计了第一种数据结构,用于解决三维空间中多面体障碍物之间的圆扇区空查询问题,并为二维空间中相应的空查询问题提供了一种简化的数据结构。
英文摘要:
Consider an input consisting of a set of $n$ disjoint triangular obstacles in $\mathbb{R}^3$ and a target point $t$ in the free space, all enclosed by a large sphere $S$ of radius $R$ centered at $t$. An articulated probe is modeled as two line segments $ab$ and $bc$ connected at point $b$. The length of $ab$ can be equal to or greater than $R$, while $bc$ is of a given length $r \leq R$. The probe is initially located outside $S$, assuming an unarticulated configuration, in which $ab$ and $bc$ are collinear and $b \in ac$. The goal is to find a feasible (obstacle-avoiding) probe trajectory to reach $t$, with the condition that the probe is constrained by the following sequence of moves -- a straight-line insertion of the unarticulated probe into $S$, possibly followed by a rotation of $bc$ at $b$ for at most $π/2$ radians, so that $c$ coincides with $t$. We prove that if there exists a feasible probe trajectory, then a set of extremal feasible trajectories must be present. Through careful case analysis, we show that these extremal trajectories can be represented by $O(n^4)$ combinatorial events. We present a solution approach that enumerates and verifies these combinatorial events for feasibility in overall $O(n^{4+ε})$ time using $O(n^{4+ε})$ space, for any constant $ε> 0$. The enumeration algorithm is highly parallel, considering that each combinatorial event can be generated and verified for feasibility independently of the others. In the process of deriving our solution, we design the first data structure for addressing a special instance of circular sector emptiness queries among polyhedral obstacles in three dimensional space, and provide a simplified data structure for the corresponding emptiness query problem in two dimensions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。