My Account Log in

3 options

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

LIBRA QA003 2003 .L783
Loading location information...

Available from offsite location This item is stored in our repository but can be checked out.

Log in to request item
LIBRA Diss. POPM2003.194
Loading location information...

Available from offsite location This item is stored in our repository but can be checked out.

Log in to request item
LIBRA Microfilm P38:2003
Loading location information...

Mixed Availability Some items are available, others may be requested.

Log in to request item
Format:
Book
Manuscript
Microformat
Thesis/Dissertation
Author/Creator:
Liu, Ying.
Contributor:
Badler, Norman I., advisor.
University of Pennsylvania.
Language:
English
Subjects (All):
Penn dissertations--Computer and information science.
Computer and information science--Penn dissertations.
Local Subjects:
Penn dissertations--Computer and information science.
Computer and information science--Penn dissertations.
Physical Description:
ix, 95 pages : illustrations (some color) ; 29 cm
Production:
2003.
Summary:
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.
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.
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.
Notes:
Supervisor: Norman I. Badler.
Thesis (Ph.D. in Computer and Information Science) -- University of Pennsylvania, 2003.
Includes bibliographical references.
Local Notes:
University Microfilms order no.: 3095914.
OCLC:
244973209

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account