Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorCherif Foudil-
dc.contributor.authorDjedi Noureddine-
dc.contributor.authorCédric Sanza-
dc.contributor.authorYves Duthen-
dc.description.abstractMotion planning for multiple entities or a crowd is a challenging problem in today’s virtual environments. We describe in this paper a system designed to simulate pedestrian behaviour in crowds in real time, concentrating particularity on collision avoidance. On-line planning is also referred as the navigation problem. Additional difficulties in approaching navigation problem are that some environments are dynamic. In our model we adopted a popular methodology in computer games, namely A* algorithm. The idea behind A* is to look for the shortest possible routes to the destination not through exploring exhaustively all the possible combination but utilizing all the possible directions at any given point. The environment is formed in regions and the algorithm is used to find a path only in visual region. In order to deal with collision avoidance, priority rules are given to some entities as well as some social behaviour. Link
dc.subjectpath finding, collision avoidance, behavioural animation, crowd simulation.en_US
dc.titlePath finding and Collision Avoidance in Crowd Simulationen_US
Appears in Collections:Publications Internationales

Files in This Item:
File Description SizeFormat 
Path finding and Collision Avoidance in Crowd Simulation_p.pdf968,59 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.