Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chen, Ying-ping | en_US |
dc.contributor.author | Lin, Ying-yin | en_US |
dc.date.accessioned | 2014-12-08T15:09:25Z | - |
dc.date.available | 2014-12-08T15:09:25Z | - |
dc.date.issued | 2009-06-01 | en_US |
dc.identifier.issn | 1568-4946 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1016/j.asoc.2009.03.004 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/7193 | - |
dc.description.abstract | This paper presents a uniform conceptual model to co-operate with particle swarm optimization (PSO) for controlling the movement of crowds in computer graphics. According to the PSO mechanism, each particle in the swarm adopts the information to automatically find a path from the initial position to the optimum. However, PSO aims to obtain the optimal solution instead of the searching path, while the purpose of this work concentrates on the control of the crowd movement, which is composed of the generated searching paths of particles. Hence, in order to generate seemingly natural, appropriate paths of people in a crowd, we propose a model to work with the computational facilities provided in PSO. Compared to related approaches previously presented in the literature, the proposed model is simple, uniform, and easy to implement. The results of the conducted simulations demonstrate that the coupling of PSO and the proposed technique can generate appropriate non-deterministic, non-colliding paths for the use in computer graphics for several different scenarios, including static and dynamic obstacles, moving targets, and multiple crowds. (C) 2009 Elsevier B. V. All rights reserved. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | Crowd control | en_US |
dc.subject | Moving path generation | en_US |
dc.subject | Computer graphics | en_US |
dc.subject | Particle swarm optimization | en_US |
dc.subject | Adaptive behavior | en_US |
dc.title | Controlling the movement of crowds in computer graphics by using the mechanism of particle swarm optimization | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1016/j.asoc.2009.03.004 | en_US |
dc.identifier.journal | APPLIED SOFT COMPUTING | en_US |
dc.citation.volume | 9 | en_US |
dc.citation.issue | 3 | en_US |
dc.citation.spage | 1170 | en_US |
dc.citation.epage | 1176 | en_US |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:000265909000032 | - |
dc.citation.woscount | 5 | - |
Appears in Collections: | Articles |
Files in This Item:
If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.