CN111773687A - Map way finding method and device, storage medium and electronic device - Google Patents

Abstract

The present application discloses a map pathfinding method and device, a storage medium and an electronic device. Wherein, the method includes: determining a first path in a first map where the moving starting point is located, wherein the first path is a path from the moving starting point to a target exit of the first map; determining a second path in a second map where the moving end point is located path, wherein the second path is the path from the target entrance of the second map to the moving end point; obtain the path according to the first path, the second path, and the path between the entrance and the exit of each of the pre-stored multiple maps A third path from the moving start point to the moving end point, wherein the multiple maps include a first map and a second map, and in the two associated maps with an associated relationship among the multiple maps, the exit of the first associated map is associated with the second The map's entry association. The present application solves the problem that the game is easy to freeze due to the excessive number of maps to be loaded in the cross-map pathfinding method in the related art.

Description

Map wayfinding method and device, storage medium and electronic device

technical field

The present application relates to the field of the Internet, and in particular, to a map pathfinding method and device, a storage medium and an electronic device.

Background technique

Currently, in a game map, pathfinding can be performed for a virtual character in the game map to generate a navigation path, and the game map may be an MMO (Massive Multiplayer Online, massively multiplayer online) game map. Pathfinding means: given a starting point and an ending point on the map, find a path from the starting point to the ending point. When performing pathfinding, the path sought is required to be feasible and as short as possible.

When the start and end points are in different maps, it is necessary to find a path that spans multiple maps, for example, a path from the current level of the tower to the target level (eg, level 19 to level 4). If a wayfinding request is made to another map, the map has not been loaded and the navigation mesh data cannot be obtained, the route cannot be generated. In the related art, the navigation data of all maps is generally loaded when the game is running, so as to generate a cross-map path. However, due to the large number of loaded maps, it takes up too much memory, which leads to the problem that the game is prone to freeze.

Therefore, in the cross-map pathfinding method in the related art, there is a problem that the game is easy to freeze due to the excessive number of maps that need to be loaded.

SUMMARY OF THE INVENTION

The embodiments of the present application provide a map pathfinding method and device, a storage medium, and an electronic device, so as to at least solve the problem that the game is easily stuck due to the excessive number of maps to be loaded in the cross-map pathfinding method in the related art .

According to an aspect of the embodiments of the present application, a map path finding method is provided, including: determining a first path in a first map where a moving starting point is located, wherein the first path is a path from the moving starting point to a target exit of the first map path; determining a second path in the second map where the moving end point is located, wherein the second path is a path from the target entry of the second map to the moving end point; according to the first path, the second path, and a plurality of pre-stored maps The path between the entrance and the exit of each map in , obtains a third path from the moving start point to the moving end point, wherein the multiple maps include a first map and a second map, and two of the multiple maps have an associated relationship. In the associated map, the exit of the first associated map is associated with the entrance of the second associated map.

According to another aspect of the embodiments of the present application, there is provided a map path finding device, comprising: a first determination unit configured to determine a first path in a first map where a moving starting point is located, wherein the first path is the moving starting point The path to the target exit of the first map; the second determination unit is used to determine the second path in the second map where the moving end point is located, wherein the second path is the path from the target entrance of the second map to the moving end point; an obtaining unit, configured to obtain a third path from the moving start point to the moving end point according to the first path, the second path, and the path between the entrance and the exit of each of the pre-stored multiple maps, wherein the multiple Each map includes a first map and a second map, and in the two associated maps having an associated relationship among the multiple maps, the outlet of the first associated map is associated with the inlet of the second associated map.

According to yet another aspect of the embodiments of the present application, a computer-readable storage medium is also provided, where a computer program is stored in the storage medium, wherein the computer program is configured to execute any one of the above method embodiments when running. A step of.

According to yet another aspect of the embodiments of the present application, an electronic device is also provided, including a memory and a processor, where a computer program is stored in the memory, and the processor is configured to run the computer program to execute any of the above method embodiments. step.

In the embodiment of the present application, the path between paths between the map portals (between the entrance and the exit) is saved, and the first path in the first map where the moving starting point is located is determined, wherein the first path is The path from the moving start point to the target exit of the first map; determine the second path in the second map where the moving end point is located, wherein the second path is the path from the target entrance of the second map to the moving end point; The second path and the path between the entrance and the exit of each of the pre-stored multiple maps are obtained, and the third path from the moving start point to the moving end point is obtained, wherein the multiple maps include a first map and a second map. In two associated maps with multiple maps, the exit of the first associated map is associated with the entrance of the second associated map. Since each map stores the path between the portals, when performing map pathfinding, only Load all or part of the navigation data of the map of the starting point and the destination map. Other maps do not need to be loaded or only need to load a small amount of navigation data. Therefore, it can achieve the purpose of reducing the number of maps that need to be loaded and reduce the amount of navigation data to memory. The technical effect of increasing the occupancy of the game and improving the running smoothness of the game further solves the problem that the game is easy to freeze due to the excessive number of maps that need to be loaded in the cross-map pathfinding method in the related art.

Description of drawings

The drawings described herein are used to provide further understanding of the present application and constitute a part of the present application. The schematic embodiments and descriptions of the present application are used to explain the present application and do not constitute an improper limitation of the present application. In the attached image:

1 is a schematic diagram of a hardware environment of a map pathfinding method according to an embodiment of the present application;

2 is a flowchart of an optional map path finding method according to an embodiment of the present application;

3 is a schematic diagram of an optional map path finding method according to an embodiment of the present application;

4 is a schematic diagram of another optional map path finding method according to an embodiment of the present application;

5 is a schematic diagram of yet another optional map path finding method according to an embodiment of the present application;

6 is a schematic diagram of yet another optional map path finding method according to an embodiment of the present application;

7 is a schematic diagram of yet another optional map path finding method according to an embodiment of the present application;

8 is a schematic diagram of yet another optional map path finding method according to an embodiment of the present application;

9 is a schematic diagram of yet another optional map path finding method according to an embodiment of the present application;

10 is a schematic diagram of yet another optional map path finding method according to an embodiment of the present application;

11 is a flowchart of another optional map path finding method according to an embodiment of the present application;

12 is a schematic diagram of an optional map path finding device according to an embodiment of the present application;

FIG. 13 is a structural block diagram of an electronic device according to an embodiment of the present application.

Detailed ways

In order to make those skilled in the art better understand the solutions of the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application. Obviously, the described embodiments are only The embodiments are part of the present application, but not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without creative work shall fall within the scope of protection of the present application.

It should be noted that the terms "first", "second", etc. in the description and claims of the present application and the above drawings are used to distinguish similar objects, and are not necessarily used to describe a specific sequence or sequence. It is to be understood that data so used may be interchanged under appropriate circumstances so that the embodiments of the application described herein can be practiced in sequences other than those illustrated or described herein. Furthermore, the terms "comprising" and "having" and any variations thereof, are intended to cover non-exclusive inclusion, for example, a process, method, system, product or device comprising a series of steps or units is not necessarily limited to those expressly listed Rather, those steps or units may include other steps or units not expressly listed or inherent to these processes, methods, products or devices.

According to an aspect of the embodiments of the present application, a method embodiment of a map path finding method is provided. Optionally, in this embodiment, the above-mentioned map path finding method may be applied to a hardware environment composed of a terminal 101 and a server 103 as shown in FIG. 1 . As shown in FIG. 1, the server 102 is connected to the terminal 101 through the network, and can be used to provide services (such as game services, application services, etc.) for the terminal or the client installed on the terminal, and the database 105 can be set on the server or independently from the server, For providing data storage services for the server 103, the above-mentioned network includes but is not limited to: a wide area network, a metropolitan area network or a local area network, and the terminal 101 is not limited to a PC (Personal Computer, personal computer), mobile phone, tablet computer, etc. The map path finding method in this embodiment of the present application may be executed by the server 103 , may also be executed by the terminal 101 , or may be executed jointly by the server 103 and the terminal 101 . Wherein, the terminal 101 may execute the map pathfinding method of the embodiment of the present application by a client installed on the terminal 101 .

Optionally, an embodiment of the present application provides a map path finding method. FIG. 2 is a flowchart of an optional map path finding method according to an embodiment of the present application. As shown in FIG. 2 , the method may include: The following steps:

Step S202, determining a first path in the first map where the moving starting point is located, wherein the first path is a path from the moving starting point to the target exit of the first map;

Step S204, determining the second path in the second map where the moving end point is located, wherein the second path is the path from the target entrance of the second map to the moving end point;

Step S206, according to the first path, the second path, and the path between the entrance and the exit of each of the pre-stored multiple maps, obtain a third path from the moving start point to the moving end point, wherein the multiple maps include: In the first map and the second map, among the two associated maps of the plurality of maps that have an associated relationship, the exit of the first associated map is associated with the entrance of the second associated map.

Through the above steps S202 to S206, by determining the first path in the first map where the moving starting point is located, wherein the first path is the path from the moving starting point to the target exit of the first map; the second path, wherein the second path is the path from the target entrance of the second map to the moving end point; according to the first path, the second path, and the path between the entrance and the exit of each of the pre-stored multiple maps path, obtains a third path from the moving start point to the moving end point, wherein the multiple maps include a first map and a second map, and in the two associated maps with an associated relationship among the multiple maps, the exit of the first associated map is The entry association of the second associated map solves the problem of the cross-map pathfinding method in the related art that the game is easy to freeze due to the excessive number of maps to be loaded, reduces the memory occupation of the navigation data, and improves the operation of the game. Fluency.

In the technical solution provided in step S202, a first path in the first map where the moving starting point is located is determined, wherein the first path is a path from the moving starting point to the target exit of the first map.

The map pathfinding method in this embodiment can be applied to a scene where objects are controlled to move in a map, and the above-mentioned map can be a game map, or another scene map (eg, a shopping map, etc.).

Map wayfinding can be done between multiple maps. For each of the multiple maps, each map can have an entrance and an exit, eg, a portal. A plurality of maps may include two associated maps with an associated relationship. In the two associated maps, the exit of one map (the first associated map) may be associated with the entrance of the other map (the second associated map). Each map has at least one associated map.

The path searched by map pathfinding is the path from the moving start point to the moving end point. The map where the moving starting point is located is the first map. During map pathfinding, a first path in the first map may be determined, where the first path is a path from the moving starting point to the target exit of the first map.

There may be many ways to determine the first path in the first map, and all ways that can be used for pathfinding in a single map can be used for the map pathfinding method in this embodiment, for example, pathfinding based on the A* algorithm, Pathfinding based on Dijkstra's algorithm. The way of finding a way in a single map is not specifically limited in this embodiment.

The first map may have one or more exits, that is, the number of target exits may be one or more, and paths from the moving starting point to each target exit may be determined respectively to obtain multiple first paths. The path-finding method for each target exit may be the same or different, which is not limited in this embodiment.

In the technical solution provided in step S204, a second path in the second map where the moving end point is located is determined, wherein the second path is a path from the target entrance of the second map to the moving end point.

The path searched by map pathfinding is the path from the moving start point to the moving end point. The map where the moving end is located is the second map. During map pathfinding, a second path in the second map may be determined, where the second path is a path from the target entry of the second map to the moving end point.

There may be many ways to determine the second path in the second map, and all the ways that can perform pathfinding in a single map can be used in the map pathfinding method in this embodiment, for example, pathfinding based on the A* algorithm, Pathfinding based on Dijkstra's algorithm. The way of finding a way in a single map is not specifically limited in this embodiment.

The second map may have one or more entrances, that is, the number of target entrances may be one or more, and the paths from each target entrance to the moving end point may be determined respectively to obtain multiple second paths. The manner used for pathfinding for each target entry may be the same or different, which is not limited in this embodiment.

In the technical solution provided in step S206, according to the first path, the second path, and the path between the entrance and the exit of each of the pre-stored multiple maps, a third path from the moving start point to the moving end point is obtained, Wherein, the multiple maps include a first map and a second map.

In order to reduce the navigation data that needs to be loaded, the number of maps for loading the navigation data can be reduced. For each map in multiple maps, the path between the entrance and the exit of each map can be pre-stored, that is, the path between the portals .

During the running of the game, the navigation mesh data of the map (for example, the first map) where the object controlled by the client is currently located is loaded, without the need to load the navigation mesh for each map. Other maps just need a dtNavMesh shell that is initialized but only has navigation data around the portal. During the pathfinding, all or part of the map data of the second map (the map where the destination is located) may be loaded. Since the routes between the entrances and exits of other maps are pre-stored, even if all the navigation data is not loaded, the route from the start point to the end point can be obtained.

Optionally, in this embodiment, when performing map pathfinding, according to the first path, the second path, and the path between the entrance and the exit of each map in the pre-stored multiple maps, it is possible to obtain the path from the mobile The third path from the start point to the end point of the move.

When there are multiple first paths and second paths, there may be multiple paths between the movement start point and the movement end point. A path between the moving start point and the moving end point can be found based on the shortest path algorithm or other path finding algorithms, and the path can be the shortest path from the moving start point to the moving end point, or the fastest path found. The specific manner of acquiring the third path is not specifically limited in this embodiment.

As an optional embodiment, determining the first path in the first map where the movement starting point is located includes:

S11. Determine a first sub-path in the first target area of the first map, where the first target area is the area where the moving starting point is located in the plurality of first areas included in the first map, and each of the plurality of first areas The first area includes an adjacent interface that allows access from each first area to an adjacent area of each first area, and the first sub-path is a path from the moving start point to the adjacent interface of the first target area;

S12, according to the first sub-path and the pre-stored paths between adjacent interfaces of each first area, obtain a first path from the moving starting point to the target exit, where the target exit belongs to the second target area where the target exit is located adjacent interface.

Each of the plurality of maps may contain a map unit, the map unit may be the smallest unit of map division, and each map unit may be a polygon. The polygon can be a polygon with regular shape, for example, the map unit of a grid map is a grid in the map, and the grid is a regular quadrilateral (square); the polygon can also be a convex polygon with irregular shape, for example, navigation The map unit of the map is the navigation mesh in the map, and the navigation mesh is an irregular convex polygon.

There may be various ways to determine the first path in the first map where the moving starting point is located, for example, pathfinding based on the A* algorithm and pathfinding based on the Dijkstra algorithm.

Taking A* wayfinding as an example, A* wayfinding is a heuristic search method. Based on the polygon nodes contained in the navigation area, the search direction is determined by evaluating each current search position (polygon node). The A* pathfinding method is related to the number of polygon nodes contained in the map. The more polygonal nodes, the longer the pathfinding time and the lower the pathfinding efficiency.

In order to improve the pathfinding efficiency, the first map (other maps in the multiple maps are similar to the first map) can be divided into multiple first regions (clusters, each cluster can be used as a map unit of a divided high-level map), Each first area contains a plurality of basic map units; configure the adjacency ports of each first area, that is, the entrances that allow access from this area to the adjacent areas of this area, and store the adjacency ports of each first area in advance path between. Based on the saved paths between adjacent interfaces of each first area, map pathfinding may be performed.

It should be noted that, in this embodiment, by layering each map, the number of polygons (eg, grid, navigation mesh) of each high-level map unit (each cluster, each area) is as average as possible . The resulting layer can be considered as a high level of polygons in the map, and pathfinding between polygons can be abstracted into cluster-to-cluster pathfinding, ie, pathfinding is performed on a higher-level map.

For example, a raster map can be divided into multiple regions (multiple clusters, each region corresponding to a cluster), and each region is a high level of the raster contained in the region. The pathfinding from the first grid to the second grid can be abstracted into the pathfinding from the area where the first grid is located to the area where the second grid is located, that is, the pathfinding is performed on a high-level map.

Optionally, in this embodiment, before using the first map (which may be any one of multiple maps), the first map may be divided into multiple first areas. The first map may be a grid map or a navigation map, and the grid map and the navigation map may be divided into multiple areas in different ways.

When the first map is a grid map, the first map may be divided into multiple regions of equal size according to the map length and map width of the first map. For example, the area length and area width of each area may be preconfigured, and the first map may be divided into multiple areas according to the area length and area width.

For example, as shown in Figure 3, the game map is a grid map, and the grids in the grid map can be layered to abstract grid clusters (each cluster is equivalent to a map unit of a higher-level map). A cluster corresponds to an area in the raster map and contains all the rasters within that area.

When the first map is a navigation map, the first map may be divided into a plurality of areas including the same number of navigation grids according to the number of navigation grids included in the first map. For example, the number of navigation meshes contained in each area can be pre-configured. The game map can be divided into multiple zones according to the pre-configured number of navmesh each zone contains.

Navigation maps are not as organized as grid maps, and cannot be layered using coordinates like grid maps. The navigation mesh is a graph composed of a series of convex polygon nodes. The convex polygons (navigation meshes) in the navigation map can be regarded as the nodes of the graph theory, and the common edges between the convex polygons can be regarded as the edges of the graph theory. Graph theory model, then, the navigation map can be layered with the help of some layering algorithms based on graph theory: for example, multilevel bisectionalgorithm (multilevel bisectional algorithm). The algorithm can evenly divide any given undirected graph into several clusters, and the number of nodes in each cluster is about k (k is the input value).

For the navigation map, when the nodes of graph theory are divided into clusters, the undirected edges in graph theory can be divided into two types: the first undirected edge is that the two nodes connected by the edge belong to the same cluster, the second An undirected edge is an edge connecting two nodes that belong to different clusters (such an edge may be called an "EdgeCut"). The second type of undirected edge connects two different clusters, which is equivalent to the connection between clusters. The second type of undirected edge can be called an adjacency edge between clusters.

For example, as shown in Figure 4, the game map is a navigation map, and the navigation grids in the navigation map can be layered to abstract the navigation grid clusters (each cluster is equivalent to a node of a higher-level map), and each A cluster corresponds to an area in the navigation map, and includes all navigation meshes in the area, and the number of navigation meshes contained in each cluster is a predetermined value.

Through this embodiment, by dividing the navigation map and the grid map into multiple areas in different ways, the rationality of the area division can be ensured, thereby ensuring the efficiency of map pathfinding.

Optionally, in this embodiment, for a plurality of first areas into which the first map is divided, adjacent interfaces of each first area may be separately identified and configured.

For any two adjacent first regions in the plurality of first regions, if the two are connected, the adjacent position of the two first regions may be used as the region connecting position. The communication location in each first zone may be the zone entry (ie, the adjacency port) of the present zone into the adjacent zone, and thus, each first zone may contain the entrance allowing access from the present zone to the adjacent zone of the present zone .

In addition to the adjacency interface between the areas in this map, some of the first areas may include exits from this map to other maps, or entrances into this area from other areas. The entrance and exit (portal) between the two maps can be the same, that is to say, the portal is the exit from this map to another map, and also the entrance from another map to this map. The portals of this map and different maps may be located in different locations on the map, and the different locations may be locations in the same area of this map, or locations in different areas.

For example, the portal between map A and map B is at position 1 in one area of map A, and the portal between map A and map C is at position 2 in another area of map A.

The target exit is located in the second target area of the first map, and the target exit allows entry from the second target area to an area adjacent to the second target area in another map (logically adjacent), so the target exit belongs to the second target area. The neighbor interface of the target area.

It should be noted that, for each area in each map, the adjacent port included in the adjacent port may also include the exit of the local map in addition to the entrance between the local area and the adjacent area in the local map. If the entrance and exit of a map are the same, the exit of this map is the entrance and exit of this map.

For the grid map and the navigation map, the adjacent interfaces of each first area of the first map and the paths between the adjacent interfaces may be determined in different ways.

For a grid map, the manner of determining the adjacent interface of each of the plurality of first regions may be: identifying candidate adjacent interfaces of each of the plurality of first regions, wherein the candidate adjacent interface is The grids in each first area that allow access from each first area to the adjacent areas of each first area; if the candidate adjacent interface contains multiple consecutive grids, select from multiple grids One grid is used as one adjacent interface for each first area; in the case that the candidate adjacent interface contains one or more grids that are not continuous, the one or more grids are determined as one or more grids for each first area. adjacent interface.

In order to identify adjacent interfaces contained in each of the first areas, candidate adjacent interfaces for each of the plurality of first areas may be identified. The candidate adjacency interface in the grid map is the grid in each first area that allows access from this area to the adjacent area of this area.

For the identified candidate entrances, it can contain continuous grids or discrete grids, and for continuous grids, each grid can be used as the adjacent interface of the area. In order to reduce the complexity of pathfinding, one grid can be selected from the continuous grid as an adjacent interface of the area, and other grids in the continuous grid are not used as the adjacent interface of the area. For discrete rasters, you can directly use it as the neighbor interface for the area.

For example, as shown in FIG. 5 , if there are multiple consecutive entry blocks (adjacent interfaces) of adjacent clusters, two adjacent ones can be selected as the entrances of the adjacent cluster, and the entrances can be connected. The selected entry block can be abstracted as two nodes in the abstract graph, and the weight of the edge between the two nodes is 1.

With this embodiment, when the candidate adjacent interface includes a plurality of consecutive grids, one of them is selected as the adjacent interface, which can reduce the complexity of path finding and improve the efficiency of path finding.

The number of adjacent interfaces in each first area may include one or more. If the number of adjacent interfaces in a first area is one, the first area has only one entrance and exit, and there is no path between adjacent interfaces. If the number of adjacent interfaces in a first area is multiple, paths between adjacent interfaces in the first area may be pre-stored.

Optionally, in this embodiment, an adjacent interface of each of the multiple first areas may be determined first; in the case that the multiple first areas include a first sub-area with multiple adjacent interfaces , obtain a first reference path between multiple adjacent interfaces in the first sub-area; and save the first reference path between multiple adjacent interfaces in the first sub-area.

A first sub-area of the plurality of first areas includes a plurality of adjacent interfaces. If the two adjacent interfaces are connected, a path (eg, the first reference path) between the two can be found. If the two adjacent interfaces are disconnected, the path between them cannot be found.

For example, if a cluster has multiple adjacent clusters, and the cluster contains multiple entrances and exits, the entrances can be connected within the cluster, that is, the entrances in each cluster are connected to obtain the intra-cluster connection path.

After obtaining the path between the adjacent interfaces in each first area, the obtained above-mentioned path (eg, the first reference path) may be saved, and the obtained path may be saved in the target database.

The map pathfinding in the first map can be abstracted as a pathfinding problem in an abstract graph, and the abstract graph can be an abstract graph based on a graph theory model. The adjacent interfaces of each first area can be used as nodes in the abstract graph, the paths between adjacent interfaces can be used as edges in the abstract graph, and the length of the paths can be used as the weights of the edges.

As shown in Figure 6, the grid blocks in the circle on the left are the portals within the same cluster, corresponding to the nodes in the abstract graph (circles on the right), and the path between the two portals corresponds to the nodes in the abstract graph The edges between, the path length (number of grid blocks traversed), corresponding to the weights of the edges in the abstract graph (6, 8, 12, etc.).

Through this embodiment, by identifying and saving the paths between the entrances of each area, it can be easily used in the process of map pathfinding, and the efficiency of map pathfinding can be improved.

For a navigation map, determining an adjacent interface of each of the plurality of first areas may be at least one of the following:

1) Directly select a point on the adjacent edge as the entrance between the high-level cluster and the high-level cluster. The high-level intra-cluster path saves the real path between one entry point and another, and the final path is spliced by the real paths between multiple high-level clusters.

For the above method, the adjoining edge between each of the multiple first regions and the adjacent regions of each first region can be determined; an adjoining point is selected from each adjoining edge of each first region As the adjacent interface on each adjacent edge, obtain the adjacent interface of each first area; in the case that the second sub-area with multiple adjacent interfaces is included in the multiple first areas, obtain the multiple adjacent interfaces in the second sub-area. A second reference path between multiple adjacent interfaces; and the second reference path between multiple adjacent interfaces in the second sub-area is saved.

When determining the path between the adjacent interfaces in each first area, you can first determine the adjacent edge between each first area and the adjacent area of the area, and then directly select a point on the adjacent edge as the area and the adjacent area. Ingress (adjacent interface) between regions (high-level cluster and high-level cluster).

For the first area (second sub-area) including multiple adjacent interfaces, a path between any two adjacent interfaces among the multiple adjacent interfaces can be determined respectively. If two adjacent interfaces are connected, a path (eg, a second reference path) between the two can be found. If the two adjacent interfaces are disconnected, the path between them cannot be found.

After obtaining the path between the adjacent interfaces in each first area, the obtained path (eg, the second reference path) can be saved, and the obtained path can be saved in the target database.

Optionally, in this embodiment, for the navigation mesh, the boundary between the high-level cluster and the high-level cluster is a common edge (adjacent edge) of the EdgeCut type, then the entrance between the high-level cluster and the high-level cluster falls on the common edge. superior. A point can be directly selected on the common edge of adjacent clusters as the entrance between high-level clusters and high-level clusters. The high-level intra-cluster path saves the real path (waypoint path) between one entry point and another entry point, and the final path is spliced by the real paths between multiple high-level clusters.

For the above scenario, assuming that there are N entries connected to other high-level clusters in the same high-level cluster, then the high-level cluster calculates the path between each two entries N(N-1)/2 times in total, and stores O(N( N-1)/2) paths.

With this embodiment, by identifying and saving the paths between the adjacent interfaces of each first area, it is convenient to use in the process of map pathfinding, and the efficiency of map pathfinding can be improved.

2) Do not directly select a point first, and use the entire adjacent edge as the entrance. The high-level intra-cluster path saves a polygonal path between one entry-adjacent edge and another entry-adjacent edge (the path is a path region). The final path is obtained by refining the adjacent edge paths between multiple high-level clusters through the overall StringPull algorithm.

For the above manner, an adjacent edge of each first region in the plurality of first regions may be determined, wherein the adjacent edge of each first region is between each first region and an adjacent region of each first region The adjacency interface of ; in the case that multiple first regions include third subregions with multiple adjacent edges, take the navigation meshes contained in the third subregions as nodes, and take the common edges between the navigation meshes as edge, search the first path area between multiple adjacent edges in the third sub-area, wherein the first path area includes the navigation mesh passed by the first path area; save the multiple adjacent edges in the third sub-area the first path area in between.

For a plurality of first areas included in the navigation map, the entire adjacent edge between the first areas may be directly selected as the adjacent interface, instead of directly selecting a point as the adjacent interface. For a plurality of first areas included in the navigation map, the adjoining edge (common edge) between each first area and the adjacent areas of the area may be determined, and the adjoining edge may be used as the adjacency interface of the area.

For the first area (third sub-area) containing multiple adjacent edges, a path between any two adjacent edges among the multiple adjacent edges can be determined respectively. If two adjacent edges are connected, a path (eg, the first path region) between them can be found. If two adjacent edges are disconnected, the path between them cannot be found.

When pathfinding between adjacent edges in an area, the navigation mesh contained in the area can be used as a node, and the common edge between navigation meshes can be used as an edge to search for the path between any two adjacent edges in the area. A path, which contains a series of convex polygons (ie, contains a series of navigation meshes, and a common edge between the navigation meshes), can be considered as a path region (ie, the first path region).

After obtaining the path region between adjacent edges in each first region, the obtained path region (eg, the first path region) can be saved, and the obtained path region can be saved in the target database.

For navigation maps, the intra-cluster path holds the polygonal path between the entry common edge (adjacent edge) and the entry common edge (adjacent edge).

Optionally, in this embodiment, when calculating paths between different portals in the cluster, since a whole common edge is selected as the portal, this information belongs to the information on the abstracted graph theory model. If there are multiple nodes A, B, C, and D all need to find the path to point E, you can use E as the starting point, and call the single-source shortest path algorithm for all nodes in the reverse direction to find the path. The final output of the single-source shortest path algorithm is the shortest path search tree rooted at point E. In this way, if a cluster has K nodes and N entry points, a total of N shortest path search trees need to be saved. One way to save a tree is to directly store the parent node of each node, so a total of K*N parent nodes need to be stored.

With this embodiment, by identifying and saving the paths between the adjacent edges of each area, it is convenient to use in the process of map pathfinding, and the efficiency of map pathfinding can be improved.

In the process of map pathfinding, the path between the moving starting point and the adjacent interface in the area may be determined first. The moving starting point is located within the first target area in the first map, and the server may determine a path (ie, a first sub-path) from the moving starting point to an adjacent interface of the first target area.

The number of adjacent interfaces in the first target area may be one or more. If the number of adjacent interfaces is one, the first sub-path may include a path from the moving starting point to the adjacent interface. If the number of adjacent interfaces is multiple, the first sub-path may include one or more paths from the moving origin to each adjacent interface.

When determining the first sub-path, for the grid map, the existing map path-finding methods in the related art can be used for path-finding, for example, path-finding based on A* algorithm, path-finding based on Dijkstra algorithm, etc. Do repeat. For the navigation map, the sub-path can be determined in different ways for the scene where the adjacent interface is a point on the adjacent edge and the scene where the adjacent interface is the entire adjacent edge.

For a scenario where an adjacent interface is a point on an adjacent edge, when calculating the path from the starting point to the adjacent interface of the cluster, pathfinding can be initiated from the moving starting point to each adjacent interface. For example, pathfinding based on A* algorithm, based on Dijkstra The pathfinding of the algorithm, etc., will not be repeated here.

For example, if the entry points of the cluster are entry points A, B, C, and D, and the starting point is S, then four pathfinding needs to be initiated from point S to points A, B, C, and D.

For the scenario where the adjacent interface is the entire adjacent edge, when calculating the path from the starting point to the adjacent interface of the cluster, since the shortest path tree has been stored for all graph theory nodes, the moving starting point can be first mapped to the navigation mesh where it is located. The navigation mesh is then queried for paths to each adjacent edge based on the shortest path tree.

For example, when calculating the path from the starting point to the entrance of the cluster, since the shortest path tree has been stored for all graph theory nodes, no further pathfinding is required. On the grid, the starting point S corresponds to the convex polygon SS, and then on the shortest path search tree with P as the root, the path from SS to P can be found (the path between every two points on the tree is unique).

After the first sub-path is obtained, the first path from the moving starting point to the target exit can be obtained according to the first sub-path and the pre-stored paths between adjacent interfaces of each first area.

With this embodiment, by dividing the map into multiple areas and storing the paths between adjacent interfaces in each area in advance, the search times of the path-finding algorithm can be reduced, and the path-finding efficiency of the map can be improved.

As an optional embodiment, according to the first sub-path and the pre-stored path between adjacent interfaces of each first area, obtaining the first path from the moving start point to the target exit includes:

S21, take the moving starting point and the adjacent interface of each first area as a node, and use the first subpath and the path between the adjacent interfaces of each first area as an edge, search for the path between the moving starting point and the target exit, Get the first path.

For grid maps and navigation maps, wayfinding can be performed in the first map in the manner of a graph theory model. The first map may be abstracted into a graph theory model, which is an abstract graph of the first map. In this graph theory model, the adjacent interface of each region is a node, the path between each adjacent interface is an edge, and the length of the path is the weight of the edge.

After the first sub-path between the moving starting point and the adjacent interface of the first target area is obtained, the moving starting point can be added as a node to the graph theory model of the first map, and the first sub-path can be used as the corresponding moving starting point. The edge between the node and the node corresponding to the adjacent interface of the first target area, the weight of the edge is the length of the first sub-path.

In the graph theory model of the first map, the path between the node corresponding to the moving start point and the node corresponding to the target exit can be searched to obtain the first path.

For example, for the grid map shown in Fig. 3, the path between the corresponding cluster entrance and the entrance in the cluster is shown in Fig. 7, and the position of the five-pointed star is the position of the target exit. As shown in Figure 8, when performing map pathfinding, the starting point is added to the abstract graph, and the position of the circle is the starting point, and the path between the starting point and the cluster entrance is generated.

Find the path in the abstract graph and refine the path: in the abstract graph, determine the path between the starting point and the target through path-finding methods such as A*, and obtain the path shown in Figure 9.

Through this embodiment, the graph theory algorithm is used for map pathfinding, which can be applied to the existing graph theory algorithm, and the applicability of the map pathfinding method is improved.

Optionally, in this embodiment, for a scene in which the adjacent interface in the navigation map is the entire adjacent edge, a path area is found according to the graph theory algorithm, and a path can be determined in the path area as the path finding result. . The first path can be generated in the following way: take the moving starting point and the adjacent edges of each first area as nodes, take the first sub-path and the first path area as edges, and search for the second path area from the moving starting point to the target exit , wherein the second path area includes the navigation mesh passed by the second path area; the first path from the moving starting point to the target exit is obtained from the second path area.

For the navigation map, the intra-cluster path saves the polygonal path between the entrance common edge (adjacent edge) and the entrance common edge (adjacent edge), and finally can be refined by the common edge path (polygon path) between multiple clusters. Algorithms (eg, StringPull algorithm) extract the true path.

When performing map pathfinding, the moving starting point can be added to the abstract graph, and the moving starting point and the adjacent edges of each first area are nodes, and the first sub-path and the first path area are used as edges, according to the graph On the pathfinding algorithm (for example, the A* algorithm) in the model, it searches for a path from the moving starting point to the target exit. The path is a polygon string and can be restored to a path area in the navigation map, for example, the second path area, which is a The second path area contains the navigation mesh traversed by the second path area.

After obtaining the second path area, the first path from the moving starting point to the target exit can be extracted through a path extraction algorithm, for example, the first path from the moving starting point to the target exit is determined according to the common edge midpoint method.

Optionally, in this embodiment, in order to reduce the number of inflection points of the path, to ensure that the path from the moving starting point to the target exit obtained by pathfinding is as short as possible, an algorithm such as StringPull can be used to rely on the common edge between polygons. The final inflection point of the path is determined, thereby determining the first path.

For example, as shown in Figure 10, when performing map pathfinding, the StringPull algorithm can be used to reduce the number of inflection points, maintain a monotonically decreasing funnel, map the starting point to the common edge of the convex polygon, move the first edge, and reduce the angle of the funnel. Confirm the move; move the second side, the funnel angle is still reduced, confirm the move; move the first side again, the funnel angle continues to decrease, confirm the move; since the second side cannot be moved in the same direction, the first is still moved At this time, the positional relationship between the two sides of the funnel changes, and if movement is not allowed, it is determined that an inflection point is required here. After the inflection point is determined, you can continue to use the inflection point as the starting point to call the StringPull algorithm to refine the path.

Through this embodiment, the graph theory algorithm is used for map pathfinding, and the polygon string obtained by the pathfinding is restored to the path in the map, which not only improves the map pathfinding efficiency, but also ensures the feasibility and better performance of the found path. path quality.

As an optional embodiment, determining the second path in the second map where the moving end point is located includes:

S31: Determine the second sub-path in the third target area of the second map, where the third target area is the area where the moving end point is located among the multiple second areas included in the second map, and the Each second area includes an adjacency port that allows access from each second area to an adjacent area of each second area, and the second sub-path is a path from the adjacency port of the third target area to the moving destination;

S32, according to the second sub-path and the pre-stored path between the target interfaces of each second area, obtain a second path from the target entrance to the moving destination, wherein the target interface of each second area includes the following at least One: the adjacent interface of each second area, the target entry.

There may be various ways to determine the path from the target entry of the second map to the moving end point, for example, pathfinding based on the A* algorithm and pathfinding based on the Dijkstra algorithm. The above method needs to load the complete navigation data of the second map, which occupies a part of the cache space.

In order to improve the pathfinding efficiency, the second map can be divided into multiple second areas (clusters, each cluster can be used as a map unit of a divided high-level map), and each second area contains multiple basic map units; configuration The adjacent ports of each second area, that is, the entrances that allow access from the current area to the adjacent areas of the current area, and the paths between the adjacent ports of each second area are stored in advance. Based on the saved paths between adjacent interfaces of each second area, map pathfinding may be performed.

The method of dividing the second map into a plurality of second areas, the method of configuring the adjacent interfaces of each second area, the method of storing the paths between the target interfaces of each second area in advance, and the method of storing each second area based on the method. The path between the adjacent interfaces of the area determines the second path in a manner similar to that described above, which will not be repeated here.

With this embodiment, by dividing the map into multiple areas and storing the paths between adjacent interfaces in each area in advance, the search times of the path-finding algorithm can be reduced, and the path-finding efficiency of the map can be improved.

As an optional embodiment, according to the second sub-path and the pre-stored path between the target interfaces of each second area, acquiring the second path from the target entrance to the moving destination includes:

S41, take the moving end point and the target interface of each second area as nodes, take the second sub-path and the path between the target interfaces of each second area as edges, search for the path from the target entrance to the moving end point, and obtain the first Second path.

Pathfinding in the second map can be done in the manner of a graph theory model. The second map may be abstracted into a graph theory model, which is an abstract graph of the second map. In this graph theory model, the target interface of each second region is a node, the path between each target interface is an edge, and the length of the path is the weight of the edge.

After obtaining the second sub-path from the adjacency point of the third target area to the moving end point, the moving end point can be added as a node to the graph theory model of the second map, and the second sub-path can be regarded as the node corresponding to the moving end point and The edge between the nodes corresponding to the adjacent interface of the third target area, the weight of the edge is the length of the second sub-path.

The manner of finding the second path between the target entry and the moving end point in the graph theory model is similar to that described above, and will not be repeated here.

Through this embodiment, the graph theory algorithm is used for map path finding, and the path obtained by the path finding is restored to the path in the map, which not only improves the map path finding efficiency, but also ensures the feasibility and better performance of the found path. path quality.

As an optional embodiment, before determining the second sub-path in the third target area of the second map, the above method further includes:

S51, determine the third target area where the moving end point is located in the second map;

S52: Acquire the first navigation data of the third target area.

In order to reduce the occupation of the cache space by the navigation data, when the cross-map pathfinding is initiated, only a small piece of navigation where the end point is located in the destination map can be loaded, that is, only the third target area where the moving end point is located in the second map is loaded. navigation data.

According to the location information of the moving end point, the third target area where the moving end point is located in the second map can be determined. The third target area may be represented by the map identifier of the second map and the area identifier of the third target area.

After the third target area where the moving end point is located, the navigation data (first navigation data) of the third target area can be loaded to perform map pathfinding, for example, to determine the second sub-path. However, the navigation data of other regions except the third target region in the second map may not be loaded.

The location information of the moving destination can be carried in the wayfinding request, and the location information can be represented by a map identifier and location coordinates, or, represented by a map identifier, area identifier and location coordinates, according to the movement carried in the wayfinding request. The location information of the end point can determine the third target area.

Through this embodiment, by determining and loading a small piece of navigation where the end point is located in the end point map, the data amount of the loaded navigation data can be reduced, thereby reducing the occupation of the cache space by the navigation data.

As an optional embodiment, acquiring the first navigation data of the third target area includes:

S61, search the navigation data of the third target area from the target cache, wherein the target cache has a plurality of navigation data queues of navigation data cached, and the plurality of navigation data are visited navigation data;

S62, when the navigation data of the third target area is found, determine that the first navigation data of the third target area is obtained;

S63, move the first navigation data to the queue head of the navigation data queue.

The pathfinding system often needs to update the path according to the player's location. Before the player reaches the target, the pathfinding request may be initiated multiple times. If the target map (the map of the destination) is loaded each time for navigation, even if it is a small piece, IO The cost is also very high, and if the destination is changed, the navigation is reloaded.

In order to reduce the data amount of the loaded navigation data, the navigation data can be cached through the target cache. The target cache caches a plurality of navigation data queues of navigation data, and the plurality of navigation data are accessed navigation data.

The server may look up the navigation data of the third target area from the target cache, for example, the navigation data lookup is performed by using the area identifier or the combination of the map identifier and the area identifier. If the navigation data of the third target area is found and it is determined that the first navigation data of the third target area is obtained, it is unnecessary to load the navigation data of the third target area.

Considering that a piece of navigation data that has just entered the memory is likely to be used continuously in the future (for example, when a new request is initiated), the first navigation data can be moved to the queue head of the navigation data queue, so that it can continue to be used.

With this embodiment, the navigation data is cached through the target cache, and the most recently used navigation data is moved to the queue head of the navigation data queue, which can reduce the amount of loaded navigation data and ensure the timeliness of data calling.

As an optional embodiment, after searching the navigation data of the third target area from the target cache, the above method further includes:

S71, in the case where the navigation data of the third target area is not found, load the first navigation data of the third target area;

S72, save the first navigation data to the queue head of the navigation data queue.

If the navigation data of the third target area is not found from the target cache, it can be determined that the navigation data of the third target area has not been used recently, and the navigation data of the third target area needs to be loaded and saved.

The navigation data of the third target area, that is, the first navigation data, can be loaded by the area identifier or the combination of the map identifier and the area identifier, and the first navigation data can be saved to the queue head of the navigation data queue, so that it can be used continuously .

Through this embodiment, by loading and saving the navigation data of the area to the queue head of the navigation data queue, the timeliness of data calling can be guaranteed.

As an optional embodiment, saving the first navigation data to the queue head of the navigation data queue includes:

S81, when it is determined that the unused storage space in the target cache is less than the storage space required for storing the first navigation data, remove the second navigation data located at the tail of the queue of the navigation data queue in the target cache;

S82, save the first navigation data to the queue head of the navigation data queue.

Due to the limited storage space of the target cache, it can only store a certain amount of navigation data. The number of navigation data in the navigation data queue can be configured, for example, the navigation data queue only saves the target number (for example, 5) of navigation data, the data volume of the navigation data in the navigation data queue can be configured, for example, the navigation data queue is only Navigation data of the target data amount (eg, 2G) is saved.

When saving the first navigation data to the queue head of the navigation data queue, it may be first determined whether the navigation data in the navigation data queue needs to be removed. If the unused storage space in the target cache is less than the storage space required for storing the first navigation data, or the amount of navigation data in the navigation data queue exceeds the quantity threshold, or the data amount of the navigation data in the navigation data queue exceeds If the data volume threshold is exceeded, the navigation data in the navigation data queue needs to be removed.

The removed navigation data may be the navigation data at the end of the queue of the navigation data queue, that is, the second navigation data. Since the newly used navigation data will be moved to the head of the queue of the navigation data queue, the data at the tail of the queue of the navigation data queue is The navigation data is the navigation data that has not been accessed for a period of time, and the possibility of the navigation data being accessed in the future is very small, so it can be preferentially removed.

After the second navigation data at the end of the queue of the navigation data queue is removed, the first navigation data may be saved to the head of the queue of the navigation data queue.

For example, a piece of navigation that has just entered the memory is very likely to continue to be used in the future (a new request is initiated), while the navigation that has not been accessed for a period of time is also very unlikely to be accessed in the future (changed destination), therefore, the navigation data can be cached based on the LRU (Least Recently Used) algorithm.

With this embodiment, the rationality of data storage can be improved by removing the navigation data at the end of the queue of the navigation data queue when the data removal condition is satisfied.

As an optional embodiment, according to the first path, the second path, and the path between the entrance and the exit of each of the pre-stored multiple maps, obtaining the third path from the moving start point to the moving end point includes: :

S91, take the moving starting point, moving end point, and the entrance of each map and the exit of each map as nodes, take the first path, the second path and the path between the entrance and the exit of each map as edges, search for the moving starting point to the moving end point path to get the third path.

After the first path and the second path are obtained, pathfinding can be performed among multiple maps in the manner of a graph theory model. Multiple maps can be abstracted into a graph theory model, which is an abstract graph of multiple maps. In this graph theory model, the entrances and exits of each map are nodes, the paths between the entrances and exits in each map are edges, and the lengths of the paths are the weights of the edges. Between different maps, the entrances and exits with associated relationships are the same nodes in the graph theory model, so that multiple maps can be identified by one graph theory model.

After the first path and the second path are obtained, the moving starting point and moving end point can be added to the graph theory model of multiple maps as nodes, and the first path can be used as the node corresponding to the moving starting point and the node corresponding to the target exit The weight of the edge is the length of the first path, and the second path is used as the edge between the node corresponding to the target entry and the node corresponding to the moving end point, and the weight of this edge is the length of the second path. .

The manner of finding the third path between the moving start point and the moving end point in the graph theory model is similar to that described above, and will not be repeated here.

Through this embodiment, the graph theory algorithm is used for map path finding, and the path obtained by the path finding is restored to the path in the map, which can improve the map path finding efficiency and ensure the feasibility of the found path.

As an optional embodiment, before determining the first path in the first map where the moving starting point is located, the above method further includes:

S101, receiving a movement request sent by a client of the object to be moved, where the movement request is used to request to control the object to be moved from a moving starting point to a moving end point;

S102, in response to the movement request, determine the movement starting point and the moving end point of the object to be moved.

The above-mentioned map pathfinding process can be based on a movement request (pathfinding request) sent by the client of the object to be moved, and the movement request is used to request to find a path from the moving starting point to the moving destination, so as to control the object to be moved to move from the moving starting point. to the moving end point.

The above-mentioned multiple maps may be game maps or other maps. Taking a game map as an example, the game map may be a map in a target game application, and the target game may include, but is not limited to, an MMO game. The user of the target game application can use the client of the target game application running on his terminal device to log in to the target game through the target account to control the interaction between the client and the server of the target game application. The same account can control one virtual character in the target game, and can also control multiple virtual characters in the target game at the same time. In this embodiment, controlling one virtual character is used as an example for description.

The target user can use the target account to log in to the target client to start the target game application. The virtual character controlled by the target user is the object to be moved. In the process of operating the object to be moved to move in the game map, the moving starting point and moving end point of the moving can be determined. The moving start point is located in a first map of the plurality of maps, and the moving end point is located in a second map of the plurality of maps.

The client of the object to be moved (the object to be moved may be a virtual object controlled by the target user in the target game) can detect the operation performed on the client, and in response to the operation, generate a movement request of the object to be moved, and the movement request is used for The request controls the object to be moved to move from the moving start point to the moving end point, and is sent to the server through the communication connection with the server.

The server may receive the movement request sent by the client, and in response to the movement request, the server may determine the movement origin and movement destination of the object to be moved. The moving starting point and moving end point may be determined by the map identifier and the position coordinates in the map, or may be determined by the location identifier, that is, the move request carries the location identifier of the moving starting point and/or the moving end point. The server extracts the location identifier in the movement request, and determines the map where the movement starting point and/or the moving end point are located and the location coordinates in the map through the correspondence between the location identifier and the location.

With this embodiment, the movement of the object to be moved in the multiple maps is triggered by the movement request, so that the user's control ability over the objects in the map can be improved.

As an optional embodiment, after obtaining the third path from the moving start point to the moving end point, the above method further includes:

S111, generating a movement control instruction, wherein the movement control instruction is used to instruct the object to be moved to move according to a third path;

S112 , sending a movement control instruction to the client of the object to be moved, so as to control the object to be moved to move from the moving start point to the moving end point according to the third path.

When the movement of objects in the game map is uniformly controlled by the server, the server can use the third path to control the movement of the object to be moved from the moving starting point to the moving end point, and synchronize the moving process to the client that displays the to-be-moved object.

Optionally, controlling the object to be moved to move from the moving start point to the moving end point may also be performed by the terminal device. The server may generate a movement control instruction for instructing the object to be moved to move according to the third path, and send the movement control instruction to the client of the object to be moved.

After receiving the movement control instruction, the client can extract the third path from the movement control instruction, and control the object to be moved to move from the moving start point to the moving end point according to the third path.

For other clients displaying the object to be moved, the client can perform location synchronization, synchronize the location of the object to be moved to the server, and the server can synchronize the location of the object to be moved to other clients.

With this embodiment, by controlling the movement of the object to be moved by the client, the running burden of the server can be reduced, and the smooth running of the game can be ensured.

It should be noted that the path found by the map path finding method in this embodiment is not necessarily the optimal (shortest path). However, since the paths between clusters are predefined and saved, they can be used directly without the need for Care about the path details inside the cluster (because it is pre-generated, that is, it is defined and can be used directly), so the path can quickly find a path.

The map path finding method in this embodiment of the present application will be described below with reference to optional examples. The map pathfinding method in this example is applied to a game scene, where the game map is a grid map or a navigation map, and the areas into which the map is divided are clusters, and each cluster corresponds to a map unit in a high-level map.

As shown in FIG. 11 , the flow of the map pathfinding method in this example may include the following steps:

Step S1102: Calculate the path between the starting point and the ending point in the local map and the entrance.

For multiple maps, there is no need to load the navmesh for each map. You can load the navmesh data of the map where the virtual object controlled by the player is currently located. Other maps only need a dtNavMesh shell that is initialized but only has the navigation data around the portal. .

When initiating cross-map pathfinding, you can load a small piece of navigation data where the end point is located in the end point map, and calculate the path between the start point in the start point map and the entrance of the map, and the end point and the map in the end point map. the path between the entrances.

In step S1104, a path finding is performed across map layers to obtain a path between the entry of the map where the starting point is located and the entry of the map where the ending point is located.

The connection method between the map and the map can be a map portal, and the map portal can be the entrance of the map, which can simplify the cross-map layer pathfinding into a simple table query, pre-compute and store the data between each portal across the map layer. path.

According to the pre-stored paths between the portals, the path between the entrance of the map where the starting point is located and the entrance of the map where the ending point is located can be obtained.

Step S1106, performing path splicing to obtain a path between the start point and the end point.

The path between the starting point and the entrance in this map, the path between the entrance of the map where the starting point is located and the entrance of the map where the ending point is located, and the path of the ending point and the entrance in this map are spliced to obtain the path between the starting point and the ending point.

Through this example, by loading only a small piece of navigation data in the destination map to complete cross-map pathfinding, the amount of data to be loaded can be reduced, memory utilization can be improved, and pathfinding efficiency can be improved.

It should be noted that, for the sake of simple description, the foregoing method embodiments are all expressed as a series of action combinations, but those skilled in the art should know that the present application is not limited by the described action sequence. Because in accordance with the present application, certain steps may be performed in other orders or simultaneously. Secondly, those skilled in the art should also know that the embodiments described in the specification are all preferred embodiments, and the actions and modules involved are not necessarily required by the present application.

From the description of the above embodiments, those skilled in the art can clearly understand that the method according to the above embodiment can be implemented by means of software plus a necessary general hardware platform, and of course can also be implemented by hardware, but in many cases the former is better implementation. Based on this understanding, the technical solution of the present application can be embodied in the form of a software product in essence or in a part that contributes to the prior art, and the computer software product is stored in a storage medium (such as ROM/RAM, magnetic disk, CD-ROM), including several instructions to make a terminal device (which may be a mobile phone, a computer, a server, or a network device, etc.) execute the methods described in the embodiments of this application.

According to another aspect of the embodiments of the present application, a map path finding device for implementing the above map path finding method is also provided. The apparatus can be applied to the above animation creation apparatus. FIG. 12 is a schematic diagram of an optional map path finding apparatus according to an embodiment of the present application. As shown in FIG. 12 , the apparatus may include:

(1) a first determination unit 1202, configured to determine a first path in the first map where the moving starting point is located, wherein the first path is a path from the moving starting point to the target exit of the first map;

(2) The second determining unit 1204 is connected to the first determining unit 1202, and is used to determine the second path in the second map where the moving end point is located, wherein the second path is the distance between the target entrance of the second map and the moving end point path;

(3) The first obtaining unit 1206, which is connected to the second determining unit 1204, is configured to obtain the path defined by the first path, the second path, and the path between the entrance and the exit of each of the pre-stored multiple maps A third path from the moving start point to the moving end point, wherein the multiple maps include a first map and a second map, and in the two associated maps with an associated relationship among the multiple maps, the exit of the first associated map is associated with the second associated map entry association.

It should be noted that, the first determining unit 1202 in this embodiment may be configured to perform step S202 in this embodiment of the present application, and the second determining unit 1202 in this embodiment may be configured to perform step S204 in this embodiment of the present application , the first obtaining unit 1206 in this embodiment may be configured to perform step S206 in this embodiment of the present application.

Through the above modules, the first path in the first map where the moving starting point is located is determined, wherein the first path is the path from the moving starting point to the target exit of the first map; the second path in the second map where the moving ending point is located is determined , wherein the second path is the path from the target entrance of the second map to the moving end point; according to the first path, the second path, and the path between the entrance and the exit of each of the pre-stored multiple maps, the A third path from the moving start point to the moving end point, wherein the multiple maps include a first map and a second map, and in the two associated maps with an associated relationship among the multiple maps, the exit of the first associated map is associated with the second associated map It solves the problem that the game is easy to freeze due to the excessive number of maps to be loaded in the cross-map pathfinding method in the related art, reduces the memory occupation of the navigation data, and improves the running smoothness of the game.

As an optional embodiment, the first determining unit 1202 includes:

The first determination module is configured to determine the first sub-path in the first target area of the first map, wherein the first target area is the area where the moving starting point is located in the plurality of first areas included in the first map, and the plurality of first Each first area in the area includes an adjacent interface that allows access from each first area to an adjacent area of each first area, and the first sub-path is a path from the moving origin to the adjacent interface of the first target area;

The first obtaining module is configured to obtain the first path from the moving starting point to the target exit according to the first sub-path and the pre-stored path between the adjacent interfaces of each first area, wherein the target exit belongs to where the target exit is located The adjacent interface of the second target area.

As an optional embodiment, the first acquisition module includes:

The first search sub-module is used to search the moving starting point to the target with the moving starting point and the adjacent interface of each first area as the node, and the first sub-path and the path between the adjacent interfaces of each first area as the edge The path between exits, get the first path.

As an optional embodiment, the second determining unit 1204 includes:

The second determination module is configured to determine the second sub-path in the third target area of the second map, wherein the third target area is the area where the moving end point is located among the multiple second areas included in the second map, and the multiple Each of the second areas contains an adjacency port that allows access from each second area to an adjacent area of each second area, and the second sub-path is a path from the adjacency port of the third target area to the moving destination ;

The second obtaining module is configured to obtain the second path from the target entrance to the moving end point according to the second sub-path and the pre-stored path between the target interfaces of each second area, wherein the The target interface includes at least one of the following: an adjacent interface of each second area, a target portal.

As an optional embodiment, the second determining module includes:

The second search sub-module is configured to take the movement end point and the target interface of each second area as a node, and use the second subpath and the path between the target interfaces of each second area as edges to search for the target entry to the mobile The path to the end point to get the second path.

As an optional embodiment, the above device also includes:

a third determining unit, configured to determine the third target area in the second map where the moving end point is located before determining the second sub-path in the third target area of the second map;

The second acquiring unit is configured to acquire the first navigation data of the third target area.

As an optional embodiment, the second obtaining unit includes:

A search module, used to search the navigation data of the third target area from the target cache, wherein the target cache is cached with a plurality of navigation data queues of navigation data, and the plurality of navigation data are visited navigation data;

a third determining module, configured to determine that the first navigation data of the third target area is obtained when the navigation data of the third target area is found;

The moving module is used for moving the first navigation data to the queue head of the navigation data queue.

As an optional embodiment, the above device also includes:

a loading unit, configured to load the first navigation data of the third target area when the navigation data of the third target area is not found after searching for the navigation data of the third target area from the target cache;

The saving unit is used for saving the first navigation data to the queue head of the navigation data queue.

As an optional embodiment, the storage unit includes:

A removal module, configured to remove the second navigation data located at the tail of the queue of the navigation data queue in the target cache when it is determined that the unused storage space in the target cache is less than the storage space required for storing the first navigation data ;

The saving module is used for saving the first navigation data to the queue head of the navigation data queue.

As an optional embodiment, the first obtaining unit 1206 includes:

The search unit is used to search for the moving starting point with the moving start point, the moving end point, the entrance of each map and the exit of each map as nodes, and the first path, the second path and the path between the entrance and the exit of each map as edges The path to the end point of the move to get the third path.

As an optional embodiment, the above device also includes:

a receiving unit, configured to receive a moving request sent by the client of the object to be moved before determining the first path in the first map where the moving starting point is located, and the moving request is used to request to control the moving object to be moved from the moving starting point to the moving end point;

The fourth determining unit is used for determining the moving starting point and moving end point of the object to be moved in response to the moving request.

As an optional embodiment, the above device also includes:

a generating unit, configured to generate a movement control instruction after acquiring the third path from the moving start point to the moving end point, wherein the movement control instruction is used to instruct the object to be moved to move according to the third path;

The sending unit is used for sending the movement control instruction to the client of the object to be moved, so as to control the object to be moved to move from the moving starting point to the moving end point according to the third path.

It should be noted here that the examples and application scenarios implemented by the foregoing modules and corresponding steps are the same, but are not limited to the contents disclosed in the foregoing embodiments. It should be noted that, as a part of the device, the above modules may run in the hardware environment as shown in FIG. 1 , and may be implemented by software or hardware, wherein the hardware environment includes a network environment.

According to yet another aspect of the embodiments of the present application, an electronic device for implementing the above model control method is also provided, where the electronic device may be a server, a terminal, or a combination thereof.

FIG. 13 is a structural block diagram of an electronic device according to an embodiment of the present application. As shown in FIG. 13 , the electronic device includes a memory 1302 and a processor 1304, where a computer program is stored in the memory 1302, and the processor 1304 is set to The steps in any one of the above method embodiments are performed by a computer program.

Optionally, in this embodiment, the above-mentioned electronic apparatus may be located in at least one network device among multiple network devices of a computer network.

Optionally, in this embodiment, the above-mentioned processor may be configured to execute the following steps through a computer program:

S1, determine the first path in the first map where the moving starting point is located, wherein the first path is the path from the moving starting point to the target exit of the first map;

S2, determine the second path in the second map where the moving end point is located, wherein the second path is the path from the target entrance of the second map to the moving end point;

S3, according to the first path, the second path, and the path between the entrance and the exit of each of the pre-stored multiple maps, obtain a third path from the moving start point to the moving end point, wherein the multiple maps include the first path A map and a second map, in the two associated maps of the plurality of maps having an associated relationship, the outlet of the first associated map is associated with the inlet of the second associated map.

The memory 1302 may be used to store software programs and modules, such as program instructions/modules corresponding to the model control method and device in the embodiments of the present application. The processor 1304 executes the software programs and modules stored in the memory 1302 by running the software programs and modules This kind of function application and data processing is to realize the above-mentioned model control method. Memory 1302 may include high-speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some instances, memory 1302 may further include memory located remotely from processor 1304, and these remote memories may be connected to the terminal through a network. Examples of such networks include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

As an example, as shown in FIG. 13 , the foregoing memory 1302 may include, but is not limited to, the first determining unit 1202 , the second determining unit 1204 and the first obtaining unit 1206 in the foregoing model control apparatus. In addition, it may also include, but is not limited to, other module units in the above-mentioned model control apparatus, which will not be repeated in this example.

Optionally, the above-mentioned transmission means 1306 is configured to receive or transmit data via a network. Specific examples of the above-mentioned networks may include wired networks and wireless networks. In one example, the transmission device 1306 includes a NIC (Network Interface Controller, network adapter), which can be connected to other network devices and routers through a network cable so as to communicate with the Internet or a local area network. In one example, the transmission device 1306 is an RF (Radio Frequency, radio frequency) module, which is used to communicate with the Internet in a wireless manner.

In addition, the above-mentioned electronic device further includes: a display 1308 for displaying the interface of the above-mentioned client; and a connection bus 1310 for connecting various module components in the above-mentioned electronic device.

Optionally, for specific examples in this embodiment, reference may be made to the examples described in the foregoing embodiments, and details are not described herein again in this embodiment.

Those skilled in the art can understand that the structure shown in FIG. 13 is for illustration only, and the device implementing the above model control method may be a terminal device, and the terminal device may be a smart phone (such as an Android phone, an iOS phone, etc.), a tablet computer, a Handheld computers and terminal equipment such as MID (Mobile Internet Devices), PAD, etc. FIG. 13 does not limit the structure of the above electronic device. For example, the terminal device may also include more or less components than those shown in FIG. 13 (eg, a network interface, a display device, etc.), or have a different configuration than that shown in FIG. 13 .

Those of ordinary skill in the art can understand that all or part of the steps in the various methods of the above embodiments can be completed by instructing the hardware related to the terminal device through a program, and the program can be stored in a computer-readable storage medium, and the storage medium can Including: flash disk, ROM (Read-Only Memory, read-only memory), RAM (Random Access Memory, random access device), magnetic disk or optical disk, etc.

According to yet another aspect of the embodiments of the present application, a storage medium is also provided. Optionally, in this embodiment, the above-mentioned storage medium may be used to execute the program code of the model control method.

Optionally, in this embodiment, the foregoing storage medium may be located on at least one network device among multiple network devices in the network shown in the foregoing embodiment.

Optionally, in this embodiment, the storage medium is configured to store program codes for executing the following steps:

S1, determine the first path in the first map where the moving starting point is located, wherein the first path is the path from the moving starting point to the target exit of the first map;

S2, determine the second path in the second map where the moving end point is located, wherein the second path is the path from the target entrance of the second map to the moving end point;

S3, according to the first path, the second path, and the path between the entrance and the exit of each of the pre-stored multiple maps, obtain a third path from the moving start point to the moving end point, wherein the multiple maps include the first path A map and a second map, in the two associated maps of the plurality of maps having an associated relationship, the outlet of the first associated map is associated with the inlet of the second associated map.

Optionally, for specific examples in this embodiment, reference may be made to the examples described in the foregoing embodiments, which will not be repeated in this embodiment.

Optionally, in this embodiment, the above-mentioned storage medium may include, but is not limited to: U disk, ROM, RAM, removable hard disk, magnetic disk, or optical disk, and other mediums that can store program codes.

The above-mentioned serial numbers of the embodiments of the present application are only for description, and do not represent the advantages or disadvantages of the embodiments.

If the integrated units in the above-mentioned embodiments are implemented in the form of software functional units and sold or used as independent products, they may be stored in the above-mentioned computer-readable storage medium. Based on this understanding, the technical solution of the present application can be embodied in the form of a software product in essence, or the part that contributes to the prior art, or all or part of the technical solution, and the computer software product is stored in a storage medium, Several instructions are included to cause one or more computer devices (which may be personal computers, servers, or network devices, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present application.

In the above-mentioned embodiments of the present application, the description of each embodiment has its own emphasis. For parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.

In the several embodiments provided in this application, it should be understood that the disclosed client may be implemented in other manners. The apparatus embodiments described above are only illustrative, for example, the division of the units is only a logical function division, and there may be other division methods in actual implementation, for example, multiple units or components may be combined or Integration into another system, or some features can be ignored, or not implemented. On the other hand, the shown or discussed mutual coupling or direct coupling or communication connection may be through some interfaces, indirect coupling or communication connection of units or modules, and may be in electrical or other forms.

The units described as separate components may or may not be physically separated, and components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution in this embodiment.

In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically alone, or two or more units may be integrated into one unit. The above-mentioned integrated units may be implemented in the form of hardware, or may be implemented in the form of software functional units.

The above are only optional embodiments of the present application. It should be pointed out that for those skilled in the art, without departing from the principles of the present application, several improvements and modifications can also be made. These improvements and modifications It should also be regarded as the protection scope of this application.

Claims (15)

1. A map way-finding method is characterized by comprising the following steps:

determining a first path in a first map where a moving starting point is located, wherein the first path is a path from the moving starting point to a target exit of the first map;

determining a second path in a second map where the mobile terminal point is located, wherein the second path is a path from a target entrance of the second map to the mobile terminal point;

and acquiring a third path from the movement starting point to the movement destination point according to the first path, the second path and a path between an entrance and an exit of each map in a plurality of pre-stored maps, wherein the plurality of maps comprise the first map and the second map, and the exit of the first associated map is associated with the entrance of the second associated map in two associated maps with association relationship in the plurality of maps.

2. The method of claim 1, wherein determining the first path in the first map where the start of movement is located comprises:

determining a first sub-path in a first target area of the first map, wherein the first target area is an area where the movement starting point is located in a plurality of first areas included in the first map, each of the plurality of first areas includes an adjacent port allowing the movement starting point to enter an adjacent area of each first area, and the first sub-path is a path from the movement starting point to the adjacent port of the first target area;

and acquiring the first path from the moving starting point to the target outlet according to the first sub-path and a pre-stored path between adjacent ports of each first area, wherein the target outlet belongs to the adjacent port of a second target area where the target outlet is located.

3. The method according to claim 2, wherein the obtaining the first path from the movement start point to the target exit according to the first sub-path and a pre-stored path between adjacent ports of each first area comprises:

and searching a path from the movement starting point to the target exit by taking the movement starting point, the adjacent port of each first area as a node, and the first sub-path and a path between the adjacent ports of each first area as edges to obtain the first path.

4. The method of claim 1, wherein determining the second path in the second map of the mobile terminal comprises:

determining a second sub-path in a third target area of the second map, wherein the third target area is an area where the movement destination is located in a plurality of second areas included in the second map, each of the plurality of second areas includes a neighboring port allowing entry from the each second area to a neighboring area of the each second area, and the second sub-path is a path from the neighboring port of the third target area to the movement destination;

acquiring the second path from the target entrance to the mobile terminal according to the second sub-path and a pre-stored path between the target interfaces of each second area, wherein the target interface of each second area comprises at least one of the following: the adjacent port of each second region, the target inlet.

5. The method according to claim 4, wherein the obtaining the second path from the target entry to the mobile destination according to the second sub-path and a pre-stored path between the target interfaces of each second area comprises:

and searching a path from the target entrance to the mobile destination by taking the mobile destination and the target interface of each second area as nodes and taking the second sub-path and the path between the target interfaces of each second area as edges to obtain the second path.

6. The method of claim 4, wherein prior to said determining a second sub-path within a third target region of said second map, said method further comprises:

determining the third target area in the second map where the mobile terminal point is;

first navigation data of the third target area is acquired.

7. The method of claim 6, wherein the obtaining first navigation data for the third target region comprises:

searching navigation data of the third target area from a target cache, wherein a plurality of navigation data queues of the navigation data are cached in the target cache, and the navigation data are accessed navigation data;

determining to acquire the first navigation data of the third target area under the condition that the navigation data of the third target area is found;

moving the first navigation data to a queue head of the navigation data queue.

8. The method of claim 7, wherein after the retrieving the navigation data for the third target region from the target cache, the method further comprises:

loading the first navigation data of the third target area under the condition that the navigation data of the third target area is not found;

saving the first navigation data to a queue head of the navigation data queue.

9. The method of claim 8, wherein saving the first navigation data to a queue head of the navigation data queue comprises:

removing second navigation data positioned at the tail part of the navigation data queue in the target cache under the condition that the unused storage space in the target cache is determined to be smaller than the storage space required for storing the first navigation data;

saving the first navigation data to a queue head of the navigation data queue.

10. The method of claim 1, wherein obtaining a third path from the movement start point to the movement end point according to the first path, the second path, and a path between an entrance and an exit of each of a plurality of pre-stored maps comprises:

and searching a path from the moving starting point to the moving destination by taking the moving starting point, the moving destination, the entrance of each map and the exit of each map as nodes and taking the first path, the second path and the path between the entrance and the exit of each map as edges to obtain a third path.

11. The method according to any of claims 1 to 10, wherein prior to said determining the first path in the first map where the start of movement is located, the method further comprises:

receiving a moving request sent by a client of an object to be moved, wherein the moving request is used for requesting to control the object to be moved to move from the moving starting point to the moving destination;

and determining the movement starting point and the movement ending point of the object to be moved in response to the movement request.

12. The method of claim 11, wherein after said obtaining a third path from the start of movement to the end of movement, the method further comprises:

generating a movement control instruction, wherein the movement control instruction is used for indicating the object to be moved to move according to the third path;

and sending the movement control instruction to a client of the object to be moved so as to control the object to be moved to move from the movement starting point to the movement ending point according to the third path.

13. A map routing device, comprising:

a first determining unit, configured to determine a first path in a first map where a moving starting point is located, where the first path is a path from the moving starting point to a target exit of the first map;

the second determining unit is used for determining a second path in a second map where the mobile terminal point is located, wherein the second path is a path from a target entrance of the second map to the mobile terminal point;

a first obtaining unit, configured to obtain a third route from the movement starting point to the movement ending point according to the first route, the second route, and a route between an entrance and an exit of each of a plurality of pre-stored maps, where the plurality of maps include the first map and the second map, and an exit of a first associated map is associated with an entrance of a second associated map in two associated maps having an association relationship among the plurality of maps.

14. A computer-readable storage medium, in which a computer program is stored, wherein the computer program is configured to carry out the method of any one of claims 1 to 12 when executed.

15. An electronic device comprising a memory and a processor, characterized in that the memory has stored therein a computer program, the processor being arranged to execute the method of any of claims 1 to 12 by means of the computer program.

Images