Path finding verification method and device

Abstract

The invention provides a path finding verification method which comprises the following steps: obtaining a walking area by scanning and fusion; and judging that a path needing verification is included in the walking area so as to verify that the path is directly reachable. The method provided by the invention finds a large walking area and judges that two points of the path to be verified are both located in the walking area; and then a server immediately returns a path verification result indicating that the path to be verified is directly reachable. Through the method provided by the invention, the verification of the middle path point is not required, thus the time consumption of the server in path verification is greatly reduced, and the verification result is accurate and reliable.

Description

technical field [0001] The invention relates to pathfinding technology, in particular to a pathfinding verification method and device. Background technique [0002] In the game, the pathfinding algorithm usually adopts a simplified method, which cuts the map horizontally and vertically at certain intervals, and divides it into multiple grids (Tile). Each grid has two states: walkable and non-walkable. figure 1 A schematic diagram of the path for pathfinding in existing games, such as figure 1 As shown in , the area of ​​the shaded grid is the non-walkable area, and the area of ​​the white grid is the walkable area. The pathfinding algorithm (such as the A* algorithm) obtains a path from point A to point B through a certain calculation method, such as the broken line shown in the figure; then optimizes the broken line and judges that point C is redundant , which in turn simplifies to a solid-line path from A directly to B. Among them, the A* (pronounced as A Star) algorith...

AI Technical Summary

Problems solved by technology

[0004] In the existing verification path algorithm, because the selection process of C and D is based on the straight line equation to calculate the specific position of C and D, which involves floating-point operations, multiplication and division operations, therefore, the method of calculating C and D two points It is time-consuming, and the calculation of the straight line equation involves a large number of multiplication and division and floating-point operations, which reduces the system performance for the server, and the estimation method will make the verification result inaccurate; moreover, with the increase of the distance between A and B, it is necessary to The number of intermediate points for verification also increases, especially when the map is large, this long-distance pathfinding verification seriously damages the load capacity of the server

Images