| 基于栅格法的虚拟人快速路径规划 |
| |
| 引用本文： | 刘一松,魏宁,孙亚民. 基于栅格法的虚拟人快速路径规划[J]. 计算机工程与设计, 2008, 29(5): 1229-1231 |
| |
| 作者姓名： | 刘一松 魏宁 孙亚民 |
| |
| 作者单位： | 南京理工大学,计算机科学与技术学院,江苏,南京,210094;江苏大学,计算机科学与通信工程学院,江苏,镇江,212013;江苏大学,计算机科学与通信工程学院,江苏,镇江,212013;南京理工大学,计算机科学与技术学院,江苏,南京,210094 |
| |
| 基金项目： | 江苏省高校自然科学研究计划 , 江苏省社会发展基金 |
| |
| 摘 要： | 在栅格中使用经典的Dijkstra算法进行路径规划有计算量大,规划时间长、进行扩展判断的节点个数多等缺点.栅格的组织结构决定了栅格中最短路径的特性--组成最短路径的各线段间的最小夹角为90°.根据栅格及最短路径的特性,提出了一种在栅格中使用Dijkstra算法规划路径时减少扩展节点的个数,进而缩短规划时间、降低计算代价的算法,并将其用于虚拟人的路径规划.实验验证了算法的可行性和有效性.
|
| 关 键 词： | 路径规划 狄杰斯特拉算法 栅格法 虚拟人 虚拟环境 |
| 文章编号： | 1000-7024(2008)05-1229-02 |
| 修稿时间： | 2007-03-19 |
Path planning algorithm based on grid method for virtual human |
| |
| LIU Yi-song,WEI Ning,SUN Ya-min. Path planning algorithm based on grid method for virtual human[J]. Computer Engineering and Design, 2008, 29(5): 1229-1231 |
| |
| Authors: | LIU Yi-song WEI Ning SUN Ya-min |
| |
| Affiliation: | LIU Yi-song1,2,WEI Ning2,SUN Ya-min1(1.School of Computer Science , Technology,Nanjing University of Science , Technology,Nanjing 210094,China,2.School of Computer Science , Telecommunication Engineering,Jiangsu University,Zhenjiang 212013,China) |
| |
| Abstract: | Using Dijkstra's algorithm to search an optimal path in a gird has many disadvantages.For example,it requires a large number of canculate and must to consider too many neighboring nodes during a node expansion step.The structure of a grid implicitly decides that,the minimum angle between any two connected lines within an optimal path on a grid is 90 degrees.A simple technique is presented to speed up optimal path planning on grid,and to generate global motion paths for a human model in virtual environments.... |
| |
| Keywords: | path planning dijkstra algorithm grid method virtual human virtual environment |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
