本資料は、掲載誌(URI)等のリンク先にある学位授与機関のWebサイトやCiNii Dissertationsから、本文を自由に閲覧できる場合があります。
博士論文
国立国会図書館館内限定公開
収録元データベースで確認する
国立国会図書館デジタルコレクション
デジタルデータあり
Implementation of a New Backtrack Free Path Planning Algorithm for Manipulators
- 国立国会図書館永続的識別子
- info:ndljp/pid/11433750
国立国会図書館での利用に関する注記
資料に関する注記
一般注記:
- In this research, a new backtrack free path-planning algorithm (BFA) for multi-arm manipulators that calculates paths by searching grid points in Eucl...
書店で探す
障害者向け資料で読む
書店で探す
障害者向け資料で読む
書誌情報
この資料の詳細や典拠(同じ主題の資料を指すキーワード、著者名)等を確認できます。
デジタル
- 資料種別
- 博士論文
- 著者・編者
- Md. Nazrul, Islam
- 出版年月日等
- 2008-09
- 出版年(W3CDTF)
- 2008-09
- タイトル(掲載誌)
- 福井大学大学院工学研究科博士論文
- 授与機関名
- 福井大学
- 授与年月日
- 2008-09-30
- 授与年月日(W3CDTF)
- 2008-09-30
- 報告番号
- 工博甲第280号
- 学位
- 博士(工学)
- 博論授与番号
- 工博甲第280号
- 本文の言語コード
- eng
- 一般注記
- In this research, a new backtrack free path-planning algorithm (BFA) for multi-arm manipulators that calculates paths by searching grid points in Euclidean space directly instead of Configuration space is implemented. Currently available resolution complete path-planning algorithms cannot be applied to manipulators with many arms, because their computation time and memory space for calculating collision free paths increase exponentially with the number of arms. Here, it is assumed that positions in the workspace of manipulators are approximated by finite number of grid points, and a resolution complete algorithm is the one that can determine the existence of paths and find correct paths if they exist, when grid sizes are small enough. Therefore usual planners adopt heuristics that are not adequate for automated and real time applications, i.e. sometimes they cannot find paths even they exist, and it is not possible to estimate path calculation times in advance. A newly proposed backtrack free path planning algorithm (BFA) solves this problem. BFA is an exact algorithm, i.e. it is backtrack free and resolution complete. Different from existing resolution complete algorithms, its computation time and memory space are proportional to the number of arms. Therefore paths can be calculated within practical and predetermined time even for manipulators with many arms, and it becomes possible to operate multi-arm manipulators in complicated and fully automated environments. This thesis describes the implementation and evaluation results of BFA. BFA was implemented for the path planning in 2-dimensional environments and evaluated while changing the number of arms and obstacle placements. Its performance under locus and attitude constraints was also evaluated. In all of the experiments, collision free paths were found within less than few seconds. The computation volume of the algorithm is almost the same as the theoretical one even for complicated cases. Namely, BFA calculates paths with much shorter time than existing algorithms with constant performance independent of environments. Also BFA enables easy locus and attitude constrained path calculations.
- 国立国会図書館永続的識別子
- info:ndljp/pid/11433750
- コレクション(共通)
- コレクション(障害者向け資料:レベル1)
- コレクション(個別)
- 国立国会図書館デジタルコレクション > デジタル化資料 > 博士論文
- 収集根拠
- 博士論文(自動収集)
- 受理日(W3CDTF)
- 2020-01-16T18:57:33+09:00
- 作成日(W3CDTF)
- 2008-10-14
- 記録形式(IMT)
- application/pdf
- オンライン閲覧公開範囲
- 国立国会図書館内限定公開
- デジタル化資料送信
- 図書館・個人送信対象外
- 遠隔複写可否(NDL)
- 可
- 掲載誌(URI)
- 連携機関・データベース
- 国立国会図書館 : 国立国会図書館デジタルコレクション