Efficient path matching motion generation algorithm for multi agent environment

Man Lung Lau; Chapmann Chow; Pouro Lcc; Bartholomew Iu

Efficient path matching motion generation algorithm for multi agent environment

Man Lung Lau, Chapmann Chow, Pouro Lcc, Bartholomew Iu

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

Abstract

This 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 dips. The final motion is obtained by blending the motion dips to fit with the speed of the agents' walking paths. From our experiments, our algorithm generates natural looking motions.

Original language	English
Title of host publication	Theory and Practice of Computer Graphics 2008, TPCG 2008 - Eurographics UK Chapter Proceedings
Pages	123-128
Number of pages	6
Publication status	Published - 1 Dec 2008
Event	6th Theory and Practice of Computer Graphics Conference, TPCG 2008 - Manchester, United Kingdom Duration: 9 Jun 2008 → 11 Jun 2008

Conference

Conference	6th Theory and Practice of Computer Graphics Conference, TPCG 2008
Country/Territory	United Kingdom
City	Manchester
Period	9/06/08 → 11/06/08

ASJC Scopus subject areas

Computer Graphics and Computer-Aided Design

Cite this

@inproceedings{5797fd492b804d5dbdee2a2952ef11d6,

title = "Efficient path matching motion generation algorithm for multi agent environment",

abstract = "This 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 dips. The final motion is obtained by blending the motion dips to fit with the speed of the agents' walking paths. From our experiments, our algorithm generates natural looking motions.",

author = "Lau, {Man Lung} and Chapmann Chow and Pouro Lcc and Bartholomew Iu",

year = "2008",

month = dec,

day = "1",

language = "English",

isbn = "9783905673678",

pages = "123--128",

booktitle = "Theory and Practice of Computer Graphics 2008, TPCG 2008 - Eurographics UK Chapter Proceedings",

note = "6th Theory and Practice of Computer Graphics Conference, TPCG 2008 ; Conference date: 09-06-2008 Through 11-06-2008",

}

Efficient path matching motion generation algorithm for multi agent environment. / Lau, Man Lung; Chow, Chapmann; Lcc, Pouro et al.
Theory and Practice of Computer Graphics 2008, TPCG 2008 - Eurographics UK Chapter Proceedings. 2008. p. 123-128.

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

TY - GEN

T1 - Efficient path matching motion generation algorithm for multi agent environment

AU - Lau, Man Lung

AU - Chow, Chapmann

AU - Lcc, Pouro

AU - Iu, Bartholomew

PY - 2008/12/1

Y1 - 2008/12/1

N2 - This 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 dips. The final motion is obtained by blending the motion dips to fit with the speed of the agents' walking paths. From our experiments, our algorithm generates natural looking motions.

AB - This 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 dips. The final motion is obtained by blending the motion dips to fit with the speed of the agents' walking paths. From our experiments, our algorithm generates natural looking motions.

UR - http://www.scopus.com/inward/record.url?scp=84878512055&partnerID=8YFLogxK

M3 - Conference article published in proceeding or book

SN - 9783905673678

SP - 123

EP - 128

BT - Theory and Practice of Computer Graphics 2008, TPCG 2008 - Eurographics UK Chapter Proceedings

T2 - 6th Theory and Practice of Computer Graphics Conference, TPCG 2008

Y2 - 9 June 2008 through 11 June 2008

ER -

Efficient path matching motion generation algorithm for multi agent environment

Abstract

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this