Research Of Path Planning Technology In Virtual Reality

Path planning is mainly used for the avatar in the virtual environment to plan a realistic motion line.In order to make the best route,path planning algorithm requires a large amount of storage space and needs to do a complex operation.With the development of virtual reality,virtual environment becomes more and more complex,so it becomes particularly important to planning a good path for the avatar,especially under the premise of limited time and resources.According to the characteristics of the complex virtual reality scenes,as well as users'high demand of the experience etc.This paper will conduct the research of two main aspects of the path planning technology,path search algorithm and search space model representation.In order to find a more realistic and safer route for virtual characters,this paper carried out the following work:First of all,in order to solve the problem of mainstream path-finding algorithm only concerned path length without considering the distribution of obstacles,which lead to the virtual character always walking along the obstacle boundary,the heuristic algorithm of A*evaluation function was improved.The new heuristic function will not only considers the distance cost of the path,but also is affected by the obstacle distribution in the map,so that the algorithm can outputs a path with short enough length and away from obstacles as far as possible.Secondly,in view of the problem that the common search space models cannot properly display the distribution information of obstacles,this paper improves the space models.At the same time,a pre-processing method is proposed in this paper,which can reduce the searching time of the improved A*algorithm.In addition,in view of the problem that the Navigation mesh does not considered the distribution of obstacles around the nodes when generating paths inside nodes,which leads to the problem that the path is so close to obstacles.This paper proposed a new method to generate the internal path of polygon nodes by using the improved model proposed above.By combining with the improved A*algorithm,our new method can improve the clearance of the path effectively.Finally,using C++ language,carry out comparative experiments in the Qt platform.The results shows that the algorithm proposed in this paper can significantly improve the natural and safe degree of the path with guarantee that the path is short enough and the routing time is small enough.Which not only can avoid the necessity of collision detection in a large number of operations,but also can improve the efficiency of path planning and reduce the complexity of path execution.