|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/4919
|
| タイトル: | Pseudo approximation algorithms with applications to optimal motion planning |
| 著者: | Asano, Tetsuo
Kirkpatrick, David
Yap, Chee |
| 発行日: | 2004-01 |
| 出版者: | Springer |
| 誌名: | Discrete and Computational Geometry |
| 巻: | 31 |
| 号: | 1 |
| 開始ページ: | 139 |
| 終了ページ: | 171 |
| DOI: | 10.1007/s00454-003-2952-3 |
| 抄録: | We introduce a technique for computing approximate solutions to optimization problems. If X is the set of feasible solutions, the standard goal of approximation algorithms is to compute x ∈ X that is an ε - approximate solution in the following sense: d(x) ≤ - (1+ε)d(x^*), where x^* ∈ X is an optimal solution, d : X → R ≥ 0 is the optimization function to be minimized, andε>0 is an input parameter. Our approach is first to devise algorithms that compute pseudo ε-approximate solutions satisfying the bound d(x) ≤ - d(x^*_R) +εR, where R>0 is a new input parameter. Here x^*_R denotes an optimal solution in the space X_R of R-constrained feasible solutions. The parameter R provides a stratification of X in the sense that (1) X_R ⊆ X_<R’> for R < R’ and (2) X_R = X for R sufficiently large. We first describe a highly efficient scheme for converting a pseudo ε-approximation algorithm into a trueε-approximation algorithm. This scheme is useful because pseudo approximation algorithms seem to be easier to construct than ε-approximation algorithms. Another benefit is that our algorithm is automatically precision-sensitive. We apply our technique to two problems in robotics: (A) Euclidean Shortest Path (3ESP), namely the shortest path for a point robot amidst polyhedral obstacles in 3D, and (B) d_1-optimal motion for a rod moving amidst planar obstacles (1ORM). Previously, no polynomial time ε-approximation algorithm for (B) was known. For (A), our new solution is simpler than previous solutions and has an exponentially smaller complexity in terms of the input precision. |
| Rights: | This is the author-created version of Springer, Tetsuo Asano, David Kirkpatrick and Chee Yap, Discrete and Computational Geometry, 31(1), 2004, 139-171. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/s00454-003-2952-3 |
| URI: | http://hdl.handle.net/10119/4919 |
| 資料タイプ: | author |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| C4242.pdf | | 383Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
