東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Analysis of probabilistic roadmap me...

Ladd, Andrew M.

FindBook

Google Book

Amazon

博客來

Analysis of probabilistic roadmap methods for motion planning and applications to polygon manipulation.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Analysis of probabilistic roadmap methods for motion planning and applications to polygon manipulation./
作者:	Ladd, Andrew M.
面頁冊數:	78 p.
附註:	Source: Masters Abstracts International, Volume: 41-06, page: 1752.
Contained By:	Masters Abstracts International41-06.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1414274

Analysis of probabilistic roadmap methods for motion planning and applications to polygon manipulation.
Ladd, Andrew M.

Analysis of probabilistic roadmap methods for motion planning and applications to polygon manipulation. - 78 p.

Source: Masters Abstracts International, Volume: 41-06, page: 1752.

Thesis (M.S.)--Rice University, 2003.

Motion planning deals with the problem of finding trajectory between two configurations in some space under some constraints. The science of motion planning deals with solving this problem efficiently in different spaces and under varying sets of constraints. This thesis provides an extended analysis of the PRM algorithm by using tools from measure theory to obtain greater generality. We then apply the results to planning in finite CW complexes and detail an application to planning with a polygonal robot in a polygonal workspace when contact is allowed. The final part of thesis deals with an application of motion planning to untangling mathematical knots. This problem is particularly interesting as it addresses motion planning with large number of degrees of freedom in a reconfigurable space. Planning applications with flexible robots, reconfigurable robots, molecular biology and other instances that share similar characteristics are some of the most challenging in planning today.Subjects--Topical Terms:

626642
Computer Science.

Analysis of probabilistic roadmap methods for motion planning and applications to polygon manipulation.
LDR:01826nmm 2200253 4500 001 1854557
005 20040615083624.5
008 130614s2003 eng d
035 $a (UnM)AAI1414274
035 $a AAI1414274
040 $a UnM $c UnM
100 1 $a Ladd, Andrew M. $3 1265836
245 1 0 $a Analysis of probabilistic roadmap methods for motion planning and applications to polygon manipulation.
300 $a 78 p.
500 $a Source: Masters Abstracts International, Volume: 41-06, page: 1752.
500 $a Chair: Lydia E. Kavraki.
502 $a Thesis (M.S.)--Rice University, 2003.
520 $a Motion planning deals with the problem of finding trajectory between two configurations in some space under some constraints. The science of motion planning deals with solving this problem efficiently in different spaces and under varying sets of constraints. This thesis provides an extended analysis of the PRM algorithm by using tools from measure theory to obtain greater generality. We then apply the results to planning in finite CW complexes and detail an application to planning with a polygonal robot in a polygonal workspace when contact is allowed. The final part of thesis deals with an application of motion planning to untangling mathematical knots. This problem is particularly interesting as it addresses motion planning with large number of degrees of freedom in a reconfigurable space. Planning applications with flexible robots, reconfigurable robots, molecular biology and other instances that share similar characteristics are some of the most challenging in planning today.
590 $a School code: 0187.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a Rice University. $3 960124
773 0 $t Masters Abstracts International $g 41-06.
790 1 0 $a Kavraki, Lydia E., $e advisor
790 $a 0187
791 $a M.S.
792 $a 2003
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1414274