3D scene path finding method and apparatus

Abstract

The invention discloses a path-seeking method for a 3D scene, which comprises: identifying area types of path nodes according to preset type marks, and obtaining similar adjacent area information which is the same with the area types of the path nodes through inquiry of preestablished path-seeking data; identifying whether the path nodes comprise different adjacent areas which are different from the area types of the path nodes according to the preset switch marks, and searching for prestored switching data containing different adjacent area information which is different from the area types of the path nodes if the path nodes comprise the different adjacent areas, and obtaining the different adjacent area information; and performing path seeking according to the similar adjacent area information and the different adjacent area information. The method realizes the search of the different adjacent area information so as to realize mixed use of path-seeking data in the mode of lattices and path-seeking data in the mode of navigation meshes in the 3D scene, thereby reducing the complexity and the data quantity of the path-seeking data and the overall path-seeking computation and the overall path-seeking computing speed when guaranteeing the path-seeking effect simultaneously. The invention simultaneously discloses a path-seeking device for the 3D scene.

Description

technical field [0001] The invention relates to the field of three-dimensional (3D) technology, in particular to a pathfinding method and a pathfinding device for a 3D scene. Background technique [0002] Pathfinding is a prerequisite for moving in a 3D scene. Pathfinding is actually searching for a path from one point to another in the walkable area in the pathfinding data. There are many pathfinding algorithms, such as breadth-first search (BFS, Breadth First Search), Depth First Search (DFS, Depth First Search), heuristic search algorithm and so on. No matter what algorithm, its basis is pathfinding data, and any pathfinding algorithm is applied to pathfinding data. [0003] Pathfinding data is divided into two types according to its data form, one is based on a plane square grid as the area unit, hereinafter referred to as the grid method, and the other is based on a spatial triangle as the area unit, which is 3D data, hereinafter referred to as the navigation grid Way...

AI Technical Summary

Problems solved by technology

For large-scale 3D scenes, although the navigation grid method is highly flexible, has a natural sense of spatial hierarchy, has the advantages of accurate paths and strong sense of reality, the navigation grid method is used to generate pathfinding data in the whole scene The workload is very huge, the production is very complicated, and the post-maintenance cost is very high. For the navigation grid, because the walkable areas are irregular, have different shapes, and a large number, the amount of calculation required for path search is also quite large. At the same time, due to the complexity of making navigation grids, it is not easy to modify, so that the layout of the scene terrain, various elements and buildings in the scene must also consider the production of navigation grids in advance, so it will also make the design of 3D scenes subject to certain restrictions

Although it is simple and convenient to generate pathfinding data by grid, it is easy to modify, but because the grid is a 2-dimensional plane, there is no sense of hierarchy, and it is difficult to simulate the effect of moving in 3D space, especially in complex 3D scenes such as indoors. It is difficult to show the real movement path, which greatly reduces the realism of the entire 3D scene

[0007] The two types of pathfinding data have their own advantages and disadvantages, but there is currently no implementation method for mixing the two types of pathfinding data in 3D scenes

Images