多角形障害物間での高品質パスを効率的に計算するアルゴリズム
An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles
障害物からの距離の逆数を積分したコストを最小化する経路計画問題に対し、初の多項式時間近似スキームを提案した。
著者: Pankaj K. Agarwal, Kyle Fox, Oren Salzman
分類: cs.CG, cs.DS, cs.RO
原文アブストラクト
We study a path-planning problem amid a set $\mathcal{O}$ of obstacles in $\mathbb{R}^2$, in which we wish to compute a short path between two points while also maintaining a high clearance from $\mathcal{O}$; the clearance of a point is its distance from a nearest obstacle in $\mathcal{O}$. Specifically, the problem asks for a path minimizing the reciprocal of the clearance integrated over the length of the path. We present the first polynomial-time approximation scheme for this problem. Let $n$ be the total number of obstacle vertices and let $\varepsilon \in (0,1]$. Our algorithm computes in time $O(\frac{n^2}{\varepsilon ^2} \log \frac{n}{\varepsilon})$ a path of total cost at most $(1+\varepsilon)$ times the cost of the optimal path.
