检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]宁波大学信息科学与工程学院,宁波315211
出 处:《系统仿真学报》2012年第1期104-107,共4页Journal of System Simulation
基 金:国家自然科学基金(60973099);浙江省自然科学基金(Y1091158);浙江省公益性技术应用研究(2011C23027)
摘 要:虚拟角色的路径规划是动漫游戏的一个重要课题,如何建立高效的路径规划方法仍是一个热点话题。提出了一种基于感知记忆的路径规划方法,该算法包括全局路径规划、局部路径规划和记忆模块。全局路径规划是根据已知的路径建立的,提出了拥堵系数和容忍度的公式;而局部路径规划是根据局部感知建立的,虚拟角色能够依据局部路径规划探索一个未知环境,全局路径信息记录在记忆模块中。构造了一个包含虚拟角色的三维迷宫,实验结果表明,根据前面探索信息建立的全局路径规划是有效的。Path planning of a virtual character is a very important subject for cartoon games, and how to build the high-effect methods of path planning is still a hot topic. A perception-memory based path planning was proposed, and the algorithm is composed of global path planning, local path planning and memory module. The global path planning was set up based on the known paths, the formulas for congestion coefficient and tolerance were proposed, and the local path planning was built by local perception. A virtual character could explore an unknown environment by local path planning, and the information of the global path was recorded in memory module. A 3D maze with a virtual character was established. The experiment shows that the global path planning by previous exploration information is effective.
分 类 号:TP391.9[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249