Efficient Path Matching Motion Generation Algorithm for Multi Agent Environment

Simple item page
dc.contributor.authorLau, Newmanen_US
dc.contributor.authorChow, Chapmannen_US
dc.contributor.authorLee, Pouroen_US
dc.contributor.authorIu, Bartholomewen_US
dc.contributor.editorIk Soo Lim and Wen Tangen_US
dc.date.accessioned2014-01-31T20:02:23Z
dc.date.available2014-01-31T20:02:23Z
dc.date.issued2008en_US
dc.description.abstractThis paper presents an efficient method to generate a large amount of continuous motion data from motion captured data. Given user defined way point lists for each agent, the algorithm can automatically generate collision free walking paths for them. The walking path data is then analyzed and transformed into a sequence of agent states such as walking or standing state. Based on the randomized depth first algorithm, the agent states are matched with a sequence of corresponding motion clips. The final motion is obtained by blending the motion clips to fit with the speed of the agents' walking paths. From our experiments, our algorithm generates natural looking motions.en_US
dc.description.seriesinformationTheory and Practice of Computer Graphicsen_US
dc.identifier.isbn978-3-905673-67-8en_US
dc.identifier.urihttps://doi.org/10.2312/LocalChapterEvents/TPCG/TPCG08/123-128en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCategories and Subject Descriptors: I.6 Simulation and Modelingen_US
dc.titleEfficient Path Matching Motion Generation Algorithm for Multi Agent Environmenten_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
123-128.pdf
Size:
464.8 KB
Format:
Adobe Portable Document Format
Download
Collections
EG UK Theory and Practice of Computer Graphics 2008