國立高雄大學圖資館 |

登入

回首頁

Interactive reach planning for animated characters using hardware acceleration.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Interactive reach planning for animated characters using hardware acceleration.
作者:	Liu, Ying.
面頁冊數:	95 p.
附註:	Source: Dissertation Abstracts International, Volume: 64-06, Section: B, page: 2755.
附註:	Supervisor: Norman I. Badler.
Contained By:	Dissertation Abstracts International64-06B.
標題:	Computer Science.
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3095914
ISBN:	0496435396

Interactive reach planning for animated characters using hardware acceleration.
Liu, Ying.

Interactive reach planning for animated characters using hardware acceleration. [electronic resource] - 95 p.

Source: Dissertation Abstracts International, Volume: 64-06, Section: B, page: 2755.

Thesis (Ph.D.)--University of Pennsylvania, 2003.

Different from the existing configuration space methods, we plan arm movements directly using constrained search in a discretized 3D workspace and efficient collision detection techniques using available graphics hardware. At each step of the process, the end effector is moved to an unoccupied and adjacent cell in the discretized workspace. The search is guided by, but not limited to, the distance gradient to the goal; this makes the process more powerful than potential field methods and not prone to get stuck in local minima. Three novel but successively more effective efforts to solve the reach problem are presented. The first, 3-step planning, searches end effector paths in the workspace and computes arm configurations using inverse kinematics. While the planning can be accomplished interactively, the incompleteness induced by an analytic (single solution) inverse kinematics procedure (IKAN) makes the algorithm fail too frequently. The second algorithm, sequential planning, seeks to find paths in the 3D workspace for wrist, elbow and hand, respectively. Intersecting spherical ranges for arm segments and exploring more candidate configurations improve completeness. In computer animation, it is vitally important that the computed motion for animated characters look natural and realistic. One aspect of naturalness is that internal strength dictates human postures. Therefore, the third algorithm extends sequential planning by incorporating a human strength model in a hybrid of kinematic and biomechanical techniques.

ISBN: 0496435396Subjects--Topical Terms:

212513
Computer Science.

Interactive reach planning for animated characters using hardware acceleration.
LDR:03194nmm _2200277 _450 001 162064
005 20051017073406.5
008 230606s2003 eng d
020 $a 0496435396
035 $a 00148565
035 $a 162064
040 $a UnM $c UnM
100 0 $a Liu, Ying. $3 227171
245 1 0 $a Interactive reach planning for animated characters using hardware acceleration. $h [electronic resource]
300 $a 95 p.
500 $a Source: Dissertation Abstracts International, Volume: 64-06, Section: B, page: 2755.
500 $a Supervisor: Norman I. Badler.
502 $a Thesis (Ph.D.)--University of Pennsylvania, 2003.
520 # $a Different from the existing configuration space methods, we plan arm movements directly using constrained search in a discretized 3D workspace and efficient collision detection techniques using available graphics hardware. At each step of the process, the end effector is moved to an unoccupied and adjacent cell in the discretized workspace. The search is guided by, but not limited to, the distance gradient to the goal; this makes the process more powerful than potential field methods and not prone to get stuck in local minima. Three novel but successively more effective efforts to solve the reach problem are presented. The first, 3-step planning, searches end effector paths in the workspace and computes arm configurations using inverse kinematics. While the planning can be accomplished interactively, the incompleteness induced by an analytic (single solution) inverse kinematics procedure (IKAN) makes the algorithm fail too frequently. The second algorithm, sequential planning, seeks to find paths in the 3D workspace for wrist, elbow and hand, respectively. Intersecting spherical ranges for arm segments and exploring more candidate configurations improve completeness. In computer animation, it is vitally important that the computed motion for animated characters look natural and realistic. One aspect of naturalness is that internal strength dictates human postures. Therefore, the third algorithm extends sequential planning by incorporating a human strength model in a hybrid of kinematic and biomechanical techniques.
520 # $a The algorithms allow real-time planning in both static and dynamic environments. Algorithm performance is roughly proportional to the complexity of the workspace. No preprocessing for configuration spaces is required. Examples are shown illustrating the competence of the planners at generating motion plans for a typical human arm model.
520 # $a We present real-time articulated arm reach planning algorithms for virtual human figures. Given a start configuration and a goal location, we compute a collision-free path for a seven degrees of freedom arm from the start to the goal. We require automatic reaches with natural human movements at interactive rates.
590 $a School code: 0175.
650 # 0 $a Computer Science. $3 212513
710 0 # $a University of Pennsylvania. $3 212781
773 0 # $g 64-06B. $t Dissertation Abstracts International
790 $a 0175
790 1 0 $a Badler, Norman I., $e advisor
791 $a Ph.D.
792 $a 2003
856 4 0 $u http://libsw.nuk.edu.tw/login?url=http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3095914 $z http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3095914