Graduate Thesis Or Dissertation

 

Interactive human locomotion using motion graphs and mobility maps Public Deposited

Downloadable Content

Download PDF
https://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/z316q476w

Descriptions

Attribute NameValues
Creator
Abstract
  • Graph-based approaches for sequencing motion capture data have produced some of the most realistic and controllable character motion to date. Most previous graph-based approaches have employed a run-time global search to find paths through the motion graph that meet user-defined constraints such as a desired locomotion path. Such searches do not scale well to large numbers of characters. In this thesis, we describe a locomotion approach that benefits from the realism of graph-based approaches while maintaining basic user control and scaling well to large numbers of characters. Our approach is based on precomputing multiple least cost sequences from every state in a state-action graph. We store these precomputed sequences in a data structure called a mobility map and perform a local search of this map at run-time to generate motion sequences in real time that achieve user constraints in a natural manner. We demonstrate the quality of the motion through various example locomotion tasks including target tracking and collision avoidance. We demonstrate scalability by animating crowds of up to a hundred and fifty rendered articulated walking characters at real-time rates.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Peer Reviewed
Language
Digitization Specifications
  • File scanned at 300 ppi (Monochrome, 8-bit Grayscale, 24-bit Color) using ScandAll PRO 1.8.1 on a Fi-6670A in PDF format. CVista PdfCompressor 4.0 was used for pdf compression and textual OCR.
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Anna Opoien(anna.opoien@oregonstate.edu) on 2011-08-25T23:57:20Z (GMT) No. of bitstreams: 1 SrinivasanMadhusudhanan2005.pdf: 3027926 bytes, checksum: ac34762d28ae1669f084d999520cd7e6 (MD5)
  • description.provenance : Rejected by Anna Opoien(anna.opoien@oregonstate.edu), reason: Re-scan the following pages in greyscale: 2, 4, 30, 33, 39, and 41. Please rotate page 39 as well. on 2011-08-25T23:02:50Z (GMT)
  • description.provenance : Made available in DSpace on 2011-08-26T00:19:37Z (GMT). No. of bitstreams: 1 SrinivasanMadhusudhanan2005.pdf: 3027926 bytes, checksum: ac34762d28ae1669f084d999520cd7e6 (MD5) Previous issue date: 2005-03-17
  • description.provenance : Submitted by Sergio Trujillo (jstscanner@gmail.com) on 2011-08-23T23:34:02Z No. of bitstreams: 1 SrinivasanMadhusudhanan2005.pdf: 625905 bytes, checksum: a3f853b35ff6ea6120caed8219103f76 (MD5)
  • description.provenance : Approved for entry into archive by Anna Opoien(anna.opoien@oregonstate.edu) on 2011-08-26T00:19:37Z (GMT) No. of bitstreams: 1 SrinivasanMadhusudhanan2005.pdf: 3027926 bytes, checksum: ac34762d28ae1669f084d999520cd7e6 (MD5)
  • description.provenance : Submitted by Sergio Trujillo (jstscanner@gmail.com) on 2011-08-25T23:54:29Z No. of bitstreams: 1 SrinivasanMadhusudhanan2005.pdf: 3027926 bytes, checksum: ac34762d28ae1669f084d999520cd7e6 (MD5)

Relationships

Parents:

This work has no parents.

Items