Game path planning method based on improved potential field grid method

Abstract

The invention relates to a game path planning method based on an improved potential field grid method, which introduces a grid method on the basis of a classic artificial potential field method. Firstly, a repulsion potential field function is improved, so that the problem that a target cannot be reached in a potential field grid method is solved; secondly, a limiting condition is added in the repulsion function, and some obstacles which do not influence path finding are picked and removed, so that the path can be smoothened; finally, a simulated pipeline method is provided, the problem of local minimum value is effectively solved, extended nodes in the simulated pipeline method are set as virtual obstacle nodes, repulsive force is provided for the role, and the role is prevented from entering the area again. The method is more practical and efficient.

Description

technical field

[0001] The invention relates to the technical field of game character pathfinding, in particular to a game path planning method based on an improved potential field grid method. Background technique

[0002] With the development of artificial intelligence and game technology, players' requirements for game quality are also constantly improving. The quality of the game AI system can affect the player's game experience to a certain extent. The automatic pathfinding and navigation of the characters is a reflection of a game's intelligence. One of the key factors of the degree, planning a better path while occupying less resources has been a research topic for these years.

[0003] According to the mastery of environmental information, path planning can be divided into global path planning and local path planning. Among them, the common global path planning methods are: Dijkstra algorithm, A* algorithm, D* algorithm, etc., and local path planning has artificial p...

Images