东南大学学报（自然科学版）2011，Vol.41Issue(2)：420-424,5.DOI:10.3969/j.issn.1001-0505.2011.02.039
虚拟人群仿真的路径规划新算法
New path planning algorithm for crowd simulation
摘要
Abstract
A new path planning algorithm for crowd simulation is proposed in this paper. The algorithm is composed of global path planning module and local obstacle avoidance module. The former is achieved by Delaunay triangulation method with shortest distance constraints for the subdivision of virtual environment, which can be depicted in distance weighted cell and portal graph; while the latter is realized by using reciprocal velocity obstacle approach with stop rule. Results show that shortest paths are gained and stored after traversing the entire graph, which are queried by individuals to get optimal path for global navigation. Obstacle avoidance among virtual characters or between virtual character and static obstacle is realized by reciprocal velocity obstacle approach. In addition stop rule is integrated to eliminate vibration. The new path planning algorithm can be used for the simulation of crowd evacuation process in real time, which shows the good performance for crowd evacuation.关键词
路径规划/相对速度障碍物/Delaunay三角形/单元入口图Key words
path planning /reciprocal velocity obstacle/Delaunay triangulation /cell and portal graphs分类
信息技术与安全科学引用本文复制引用
李晓娜,孙立博,秦文虎..虚拟人群仿真的路径规划新算法[J].东南大学学报（自然科学版）,2011,41(2):420-424,5.基金项目
上海市科委基金资助项目(08515810202)、江苏省社会发展基金资助项目(BE2009662). （08515810202）
