Collective Crowd Formation Transform with Mutual Information–Based Runtime Feedback

Simple item page
dc.contributor.authorXu, Mingliangen_US
dc.contributor.authorWu, Yunpengen_US
dc.contributor.authorYe, Yangdongen_US
dc.contributor.authorFarkas, Illesen_US
dc.contributor.authorJiang, Haoen_US
dc.contributor.authorDeng, Zhigangen_US
dc.contributor.editorDeussen, Oliver and Zhang, Hao (Richard)en_US
dc.date.accessioned2015-03-02T19:44:46Z
dc.date.available2015-03-02T19:44:46Z
dc.date.issued2015en_US
dc.description.abstractThis paper introduces a new crowd formation transform approach to achieve visually pleasing group formation transition and control. Its core idea is to transform crowd formation shapes with a least effort pair assignment using the Kuhn–Munkres algorithm, discover clusters of agent subgroups using affinity propagation and Delaunay triangulation algorithms and apply subgroup‐based social force model (SFM) to the agent subgroups to achieve alignment, cohesion and collision avoidance. Meanwhile, mutual information of the dynamic crowd is used to guide agents' movement at runtime. This approach combines both macroscopic (involving least effort position assignment and clustering) and microscopic (involving SFM) controls of the crowd transformation to maximally maintain subgroups' local stability and dynamic collective behaviour, while minimizing the overall effort (i.e. travelling distance) of the agents during the transformation. Through simulation experiments and comparisons, we demonstrate that this approach is efficient and effective to generate visually pleasing and smooth transformations and outperform several existing crowd simulation approaches including reciprocal velocity avoidances, optimal reciprocal collision avoidance and OpenSteer.This paper introduces a new crowd formation transform approach to achieve visually pleasing group formation transition and control. Its core idea is to transform crowd formation shapes with a least‐effort pair assignment using the Kuhn–Munkres algorithm, discover clusters of agent subgroups using affinity propagation and Delaunay triangulation algorithms, and apply subgroup‐based SFM (social force model) to the agent subgroups to achieve alignment, cohesion and collision avoidance.en_US
dc.description.number1en_US
dc.description.sectionheadersArticlesen_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume34en_US
dc.identifier.doi10.1111/cgf.12459en_US
dc.identifier.urihttps://doi.org/10.1111/cgf.12459en_US
dc.publisherCopyright © 2015 The Eurographics Association and John Wiley & Sons Ltd.en_US
dc.titleCollective Crowd Formation Transform with Mutual Information–Based Runtime Feedbacken_US
Files
Collections
34-Issue 1