Map road-seeking method and system

Abstract

The present invention provides a map pathfinding method, dividing plane map into one or more identical area, generating waypoint on area border; when finding path, processing path find based on the area to acquire area path; then generating final path based on the triangular facet Path finding according to the acquired area path. The invention also provides a mapping road finding system, adoptingmethod and system of the invention not only saves space occupation, but also improves road finding efficiency, also suitable for process of all kinds of maps.

Description

technical field [0001] The invention relates to map pathfinding technology, in particular to a map pathfinding method and system based on a navigation grid. Background technique [0002] With the continuous development of online games, in games based on three-dimensional (3D) scenes, it is often necessary to realize the movement of virtual objects in the scene, and the problem of pathfinding is involved in the moving process. In the field of game pathfinding, A * Pathfinding algorithm is a widely used artificial intelligence technology, A * The pathfinding algorithm is actually a heuristic search, which uses an evaluation function to evaluate the value of each decision and decide which solution to try first. Specifically, the so-called heuristic search means that when the current search node selects the next node, a heuristic function can be used to select the node with the least cost, such as the node closest to the current node, as the next search node, and Jump to the ...

AI Technical Summary

Problems solved by technology

From the above process, it can be seen that when the map corresponding to a scene is composed of a large number of dense triangles, if the starting node is far away from the target node and the pathfinding is based on the triangles, it is necessary to store each detected or searched nodes, then a large number of expanded nodes need to be stored in the search space, and the space overhead will be particularly huge, and many of the nodes are actually irrelevant nodes. In this way, it will not only take up a lot of unnecessary space overhead and cause waste; Seriously affect the efficiency of pathfinding

[0004] As for the A* second-level pathfinding method, it is mainly to create a low-density diamond grid on the map, and select the center point of the diamond grid as the waypoint. First, the macro pathfinding method is used to determine the rough path, and then each path Microscopic pathfinding is used above, but the search node used in this method is the center point of the grid, which has certain limitations in the scope of application. It can only deal with two-dimensional maps with regular shapes, and cannot be used for 2D or 3D irregularly shaped maps

Images