| 虚拟人群仿真的路径规划新算法 |
| |
| 引用本文： | 李晓娜,孙立博,秦文虎.虚拟人群仿真的路径规划新算法[J].东南大学学报(自然科学版),2011,41(2):420-424. |
| |
| 作者姓名： | 李晓娜 孙立博 秦文虎 |
| |
| 作者单位： | 李晓娜,秦文虎,Li Xiaona,Qin Wenhu(东南大学仪器科学与工程学院,南京,210096);孙立博,Sun Libo(天津大学计算机科学与技术学院,天津,300072) |
| |
| 基金项目： | 上海市科委基金资助项目，江苏省社会发展基金资助项目 |
| |
| 摘 要： | 提出了一种用于虚拟人群仿真的路径规划新算法.该算法由全局路径规划模块和局部避碰模块组成.全局路径规划模块利用具有最短距离约束的Delaunay三角形方法分割虚拟环境,并由具有距离信息的单元入口图进行表示;局部避碰模块利用相互速度障碍物方法,并加入了停止规则.实验结果表明:通过对具有距离信息的单元入口图的遍历可获得并存储...
|
| 关 键 词： | 路径规划 相对速度障碍物 Delaunay三角形 单元入口图 |
New path planning algorithm for crowd simulation |
| |
| Li Xiaona Sun Libo Qin Wenhu.New path planning algorithm for crowd simulation[J].Journal of Southeast University(Natural Science Edition),2011,41(2):420-424. |
| |
| Authors: | Li Xiaona Sun Libo Qin Wenhu |
| |
| Institution: | Li Xiaona1 Sun Libo2 Qin Wenhu1 (1School of Instrument Science and Engineering,Southeast University,Nanjing 210096,China)(2School of Computer Science and Technology,Tianjin University,Tianjin 300072,China) |
| |
| 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 stor... |
| |
| Keywords: | path planning reciprocal velocity obstacle Delaunay triangulation cell and portal graphs |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
