CN103020443A - Method for map training - Google Patents

Abstract

The invention discloses a method for map training, belonging to the technical field of computer graphics. The method particularly comprises the following steps that: on the basis of a map road searching system of a navigation grid, by the adoption of an off-line method, a pure A* algorithm grid with an off-line role capable of reaching is generated; and according to collided boxes of the role, the height limit of a reachable point and the like, the grid is generated off line, according to the off-line generated navigation grid information, the limit on the reachable position of the role in a game is maximally satisfied, meanwhile a road is searched by the navigation grid, the speed of road searching is accelerated, and the memory space storage of the grid is reduced.

Description

A kind of method of map training

Technical field

The present invention relates to the computer graphics techniques field, more particularly, based on the map Pathfinding system of navigation grid.

Background technology

Along with the development of online game, often to realize that the leading role is mobile in virtual world.In the field of game pathfinding, the A* algorithm is a pathfinding algorithm relatively more commonly used.The A* algorithm is a kind of heuristic search, utilizes an each decision value of valuation functions assessment, determines to adopt first that scheme.

At present main method for searching mainly contains: A* algorithm and based on the A* algorithm of waypoint.

But above two kinds of methods have its shortcoming now.Because scene of game is larger, based on A* algorithm completely, be an expense of can not ignore its search time.Particularly in the higher online game of requirement of real-time, if be used for clicking position far away, adopt pure A* algorithm, will produce very large delay, this is that the user is unacceptable.And, the A* algorithm of employing waypoint pathfinding, one is, generates necessary waypoint and need to consume a large amount of time of the fine arts, time cost is very high; The 2nd, owing to adopting the waypoint pathfinding, easily a lot of roles of generation are crowded if waypoint is a large amount of, then can reduce again the efficient of pathfinding on single waypoint, and the limit quantity of waypoint is the number of grid that equals in the grid pathfinding.

Summary of the invention

Problem in view of prior art exists the objective of the invention is to provide a kind of efficient and rational pathfinding algorithm.

To achieve these goals, the technical solution adopted in the present invention is a kind of efficient and rational pathfinding algorithm, and its step is as follows:

1) adopts method under the line, generate the pure A* algorithm grid of off-line role Ke Da; This grid is the collision box according to the role, and the limitation in height of accessible point etc. carries out that off-line generates;

2) by the reached grid of art designing according to generation, be merged into needed navigation grid;

3) according to the connectivity that generates the navigation grid, be stored as the pathfinding grid file;

4) in game, at first load the pathfinding grid file;

5) when the user carries out pathfinding, at first adopt the A* algorithm based on grid; According to user's destination and position, at first determine grid and the purpose grid at place;

6) if be in the same navigation grid, then directly can reach;

7) if at different grids, then carry out the A* algorithm on the grid basis, draw the pathfinding gridding information of gained;

8) tabulate according to the pathfinding grid that draws the role is carried out determining of the final path of pathfinding.

The present invention generates the navigation gridding information by off-line, has satisfied to greatest extent in the game for the restriction of role Ke Da position, adopts simultaneously the pathfinding of navigation grid, has accelerated the speed of pathfinding, has reduced the memory headroom storage of grid.

Embodiment

A kind of efficient and rational pathfinding algorithm, its step is as follows:

1) adopts method under the line, generate the pure A* algorithm grid of off-line role Ke Da; This grid is the collision box according to the role, and the limitation in height of accessible point etc. carries out that off-line generates;

2) by the reached grid of art designing according to generation, be merged into needed navigation grid;

3) according to the connectivity that generates the navigation grid, be stored as the pathfinding grid file;

4) in game, at first load the pathfinding grid file;

5) when the user carries out pathfinding, at first adopt the A* algorithm based on grid; According to user's destination and position, at first determine grid and the purpose grid at place;

6) if be in the same navigation grid, then directly can reach;

7) if at different grids, then carry out the A* algorithm on the grid basis, draw the pathfinding gridding information of gained;

8) tabulate according to the pathfinding grid that draws the role is carried out determining of the final path of pathfinding.

Claims (1)

1. efficient and rational pathfinding algorithm, its step is as follows:

1) adopts method under the line, generate the pure A* algorithm grid of off-line role Ke Da; This grid is the collision box according to the role, and the limitation in height of accessible point etc. carries out that off-line generates;

2) by the reached grid of art designing according to generation, be merged into needed navigation grid;

3) according to the connectivity that generates the navigation grid, be stored as the pathfinding grid file;

4) in game, at first load the pathfinding grid file;

5) when the user carries out pathfinding, at first adopt the A* algorithm based on grid; According to user's destination and position, at first determine grid and the purpose grid at place;

6) if be in the same navigation grid, then directly can reach;

7) if at different grids, then carry out the A* algorithm on the grid basis, draw the pathfinding gridding information of gained;

8) tabulate according to the pathfinding grid that draws the role is carried out determining of the final path of pathfinding.