CN111773687A

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

Info

Publication number: CN111773687A
Application number: CN202010621469.2A
Authority: CN
Inventors: 康世禹
Original assignee: Perfect World Beijing Software Technology Development Co Ltd
Current assignee: Perfect World Beijing Software Technology Development Co Ltd
Priority date: 2020-06-30
Filing date: 2020-06-30
Publication date: 2020-10-16

Abstract

The application discloses a map path finding method and device, a storage medium and an electronic device. Wherein, the method comprises the following steps: 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 outlet 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 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. The method and the device solve the problem that the route searching mode across the maps in the related technology is easy to jam due to the fact that the number of the maps needing to be loaded is too large.

Description

Map way finding method and device, storage medium and electronic device

Technical Field

The present application relates to the field of internet, and in particular, to a map routing method and apparatus, a storage medium, and an electronic apparatus.

Background

Currently, in a game map, a path can be found for a virtual character in the game map to generate a navigation path, and the game map can be a large map of an MMO (Massive Multiplayer Online) game. The way finding means that: given a starting point and an end point on the map, a path is found from the starting point to the end point. When performing a route search, it is desirable that the sought path is feasible and as short as possible.

When the starting point and the ending point are located in different maps, a path spanning multiple maps, for example, a path from the current layer of the tower to the target layer (e.g., 19 layers to 4 layers), needs to be found. If a path searching request is initiated to another map, the map is not loaded yet, and the navigation grid data cannot be acquired, the path cannot be generated. In the related art, navigation data for loading all maps at the time of game running is generally employed in order to generate a cross-map path. However, the map loading quantity is large, and the excessive memory is occupied, so that the problem that the game is easy to be jammed is caused.

Therefore, the cross-map way-finding method in the related art has the problem that the game is easy to be stuck due to the excessive number of maps needing to be loaded.

Disclosure of Invention

The embodiment of the application provides a map way-finding method and device, a storage medium and an electronic device, which are used for at least solving the problem that a cross-map way-finding mode in the related art is easy to jam due to the fact that the number of maps needing to be loaded is too large.

According to an aspect of an embodiment of the present application, there is provided a map routing method, including: 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 outlet 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 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.

According to another aspect of the embodiments of the present application, there is provided a map routing apparatus, including: the first determining unit is used for 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; 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; and a first acquisition unit configured to acquire a third route from the movement start point to the movement end point based on the first route, the second route, and a route between an entrance and an exit of each of a plurality of maps stored in advance, wherein the plurality of maps include a first map and a second map, and the exit of the first associated map is associated with the entrance of the second associated map among two associated maps having an association relationship among the plurality of maps.

According to a further aspect of an embodiment of the present application, there is also provided a computer-readable storage medium having a computer program stored thereon, wherein the computer program is configured to perform the steps of any of the above method embodiments when executed.

According to a further aspect of an embodiment of the present application, there is also provided an electronic apparatus, including a memory and a processor, the memory storing a computer program therein, the processor being configured to execute the computer program to perform the steps in any of the above method embodiments.

In the embodiment of the application, a first path in a first map where a moving starting point is located is determined in a mode of saving a path between paths (between an entrance and an exit) between map transfer doors, 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; the method comprises the steps of obtaining a third path from a moving starting point to a moving destination point according to a first path, a 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, the exit of the first associated map is associated with the entrance of the second associated map in two associated maps with an association relationship, and each map stores the path between transfer gates Easy to be stuck.

Drawings

The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application. In the drawings:

FIG. 1 is a diagram illustrating a hardware environment for a map routing method according to an embodiment of the present application;

FIG. 2 is a flow chart of an alternative map routing method according to an embodiment of the present application;

FIG. 3 is a schematic diagram of an alternative map routing method according to an embodiment of the present application;

FIG. 4 is a schematic diagram of another alternative map routing method according to an embodiment of the present application;

FIG. 5 is a schematic diagram of yet another alternative map routing method according to an embodiment of the present application;

FIG. 6 is a schematic diagram of yet another alternative map routing method according to an embodiment of the present application;

FIG. 7 is a schematic diagram of yet another alternative map routing method according to an embodiment of the present application;

FIG. 8 is a schematic diagram of yet another alternative map routing method according to an embodiment of the present application;

FIG. 9 is a schematic diagram of yet another alternative map routing method according to an embodiment of the present application;

FIG. 10 is a schematic diagram of yet another alternative map routing method according to an embodiment of the present application;

FIG. 11 is a flow chart of another alternative map routing method according to an embodiment of the present application;

FIG. 12 is a schematic diagram of an alternative map routing device according to an embodiment of the present application;

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

Detailed Description

In order to make the technical solutions better understood by those skilled in the art, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only partial embodiments of the present application, but not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.

It should be noted that the terms "first," "second," and the like in the description and claims of this application and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the application described herein are capable of operation in sequences other than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.

According to an aspect of embodiments of the present application, a method embodiment of a map way-finding method is provided. Alternatively, in the present embodiment, the map routing method described above may be applied to a hardware environment formed by the terminal 101 and the server 103 as shown in fig. 1. As shown in fig. 1, a server 102 is connected to a terminal 101 through a network, which may be used to provide services (such as game services, application services, etc.) for the terminal or a client installed on the terminal, and a database 105 may be provided on the server or separately from the server for providing data storage services for the server 103, and the network includes but is not limited to: the terminal 101 is not limited to a PC (Personal Computer), a mobile phone, a tablet Computer, and the like. The map routing method according to the embodiment of the present application may be executed by the server 103, the terminal 101, or both the server 103 and the terminal 101. The terminal 101 executing the map routing method according to the embodiment of the present application may also be executed by a client installed thereon.

Optionally, an embodiment of the present application provides a map way-finding method, and fig. 2 is a flowchart of an optional map way-finding method according to an embodiment of the present application, and as shown in fig. 2, the method may include the following steps:

step S202, 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;

step S204, 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;

step S206, acquiring a third path from the movement starting point to the movement destination point according to the first path, the second path and the path between the entrance and the 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.

Through the above steps S202 to S206, determining a first path in the first map where the movement starting point is located, where the first path is a path from the movement starting point to the 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; the method comprises the steps of obtaining a third path from a moving starting point to a moving destination point according to a first path, a 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 in two associated maps with an associated relationship, the exit of the first associated map is associated with the entrance of the second associated map, so that the problem that a game is easy to jam due to the fact that the number of the maps needing to be loaded is too large in a cross-map route searching mode in the related art is solved, the occupation of navigation data on a memory is reduced, and the game running smoothness is improved.

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

The map way-finding method in the embodiment may be applied to a scene in which a control object moves in a map, where the map may be a game map or other scene maps (e.g., a shopping map).

Map routing may be between multiple maps. For each of the plurality of maps, each map may have an entrance and an exit, e.g., a transfer gate. The plurality of maps may include two associated maps having an association relationship, and in the two associated maps, an exit of one map (first associated map) may be associated with an entrance of the other map (second associated map). Each map has at least one associated map.

The path searched by the map is the path from the moving starting point to the moving end point. The map where the movement starting point is located is a first map. When the map is used for seeking a way, a first path in the first map can be determined, and the first path is a path from the moving starting point to the target outlet of the first map.

The manner of determining the first path in the first map may be various, and all manners of performing route finding within a single map may be used in the map route finding method in this embodiment, for example, route finding based on a-x algorithm and route finding based on Dijkstra algorithm. The way to find the way in the 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 the path from the moving start point to each target exit may be determined separately, resulting in a plurality of first paths. The way of performing the path finding for each target outlet may be the same or different, and this is not limited in this embodiment.

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

The path searched by the map is the path from the moving starting point to the moving end point. And the map where the mobile terminal is located is a second map. When the map is searched, a second path in the second map can be determined, wherein the second path is a path from the target entrance of the second map to the moving destination.

The manner of determining the second path in the second map may be various, and all manners of performing route finding within a single map may be used in the map route finding method in this embodiment, for example, route finding based on a-x algorithm and route finding based on Dijkstra algorithm. The way to find the way in the single map is not specifically limited in this embodiment.

The second map may have one or more entries, that is, the number of target entries may be one or more, and the path from each target entry to the movement destination may be determined separately, resulting in a plurality of second paths. The way of performing the path finding for each target entry may be the same or different, and this is not limited in this embodiment.

In the technical solution provided in step S206, a third route from the movement start point to the movement end point is acquired according to the first route, the second route, and a route between an entrance and an exit of each of a plurality of maps stored in advance, where the plurality of maps include the first map and the second map.

In order to reduce the navigation data required to be loaded, the number of maps on which the navigation data is loaded may be reduced, and for each of a plurality of maps, the route between the entrance and the exit of each map, that is, the route between the transfer gates may be stored in advance.

During the game run, the navigation grid data of the map (e.g., the first map) where the client-controlled object is currently located is loaded without loading the navigation grid for each map. Other maps only require one empty dtNavMesh shell that is initialized but only carries navigation data around the door. When a way is found, 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 entrance and the exit of other maps have been stored in advance, the route from the start point to the end point can be obtained even if the entire navigation data is not loaded.

Alternatively, in this embodiment, when performing a map way finding, a third path from the movement start point to the movement end point may be acquired according to the first path, the second path, and a path between an entrance and an exit of each of a plurality of maps stored in advance.

In the case where there are a plurality of first paths and a plurality of second paths, there may be a plurality of paths between the movement start point and the movement end point. A path from the mobile starting point to the mobile ending point can be searched based on a shortest path algorithm or other path searching algorithms, and the path can be the shortest path from the mobile starting point to the mobile ending point, or a path searched fastest. As to a specific manner of obtaining the third path, this is not specifically limited in this embodiment.

As an alternative embodiment, determining the first path in the first map where the moving start point is located includes:

s11, determining a first sub-path in a first target area of the first map, where the first target area is an area where a moving start point is located in a plurality of first areas included in the first map, each of the plurality of first areas includes a neighboring interface allowing entry 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 neighboring interface of the first target area;

s12, a first path from the movement start point to the target exit belonging to the adjacent port of the second target area where the target exit is located is obtained according to the first sub-path and the pre-stored path between the adjacent ports of each first area.

Each map of the plurality of maps may contain map cells, which may be a minimum unit of map division, and each map cell may be a polygon. The polygon may be a regular polygon, for example, the map unit of a grid map is a grid in the map, and the grid is a regular quadrangle (square); the polygon may also be an irregular convex polygon, for example, the map unit of the navigation map is a navigation grid in the map, and the navigation grid is an irregular convex polygon.

The first path in the first map where the moving start point is located may be determined in various ways, for example, a way-finding based on the a-x algorithm, a way-finding based on the Dijkstra algorithm.

Taking the route a as an example, the route a is a heuristic search method, and based on polygon nodes included in the navigation area, the search direction is determined by evaluating each current search position (polygon node). The route searching mode is related to the number of polygon nodes contained in the map, and the more the polygon nodes are, the longer the route searching time is, and the lower the route searching efficiency is.

In order to improve the routing efficiency, a first map (other maps in the multiple maps are similar to the first map) can be divided into multiple first areas (clusters, each cluster can be used as a map unit of a divided high-level map), and each first area comprises multiple basic map units; the method comprises the steps of configuring adjacent interfaces of each first area, namely, allowing the entrance from the area to adjacent areas of the area, and storing paths between the adjacent interfaces of each first area in advance. Based on the saved paths between the adjacent ports of the first areas, the map routing can be performed.

It should be noted that, in the present embodiment, by layering the respective maps, the number of polygons (e.g., grid, navigation mesh) per high-level map unit (per cluster, per area) is averaged as much as possible. The resulting layer can be considered as a high layer of polygons in the map, and the way-finding between polygons can be abstracted from a cluster-to-cluster way-finding, i.e. a way-finding is done on a higher layer map.

For example, the grid map may be divided into a plurality of regions (a plurality of clusters, one for each region), each region being a higher level of the grid contained by the region. The way finding from the first grid to the second grid can be abstracted into the way finding from the area where the first grid is located to the area where the second grid is located, that is, the way finding is performed on a high-level map.

Optionally, in this embodiment, before using the first map (which may be any one of a plurality of maps), the first map may be divided into a plurality of 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 a plurality of areas in different manners.

In the case where the first map is a grid map, the first map may be divided into a plurality of regions having the same size according to the map length and the map width of the first map. For example, the area length and the area width of each area may be previously configured, and the first map may be divided into a plurality of areas according to the area length and the area width.

For example, as shown in fig. 3, the game map is a grid map, and grids in the grid map may be layered to abstract grid clusters (each cluster corresponds to a map unit of a higher-level map), where each cluster corresponds to a region in the grid map and includes all grids in the region.

In the case where the first map is a navigation map, the first map may be divided into a plurality of regions including the same number of navigation meshes in accordance with the number of navigation meshes included in the first map. For example, the number of navigation grids contained in each region may be preconfigured. The game map may be divided into a plurality of areas according to the number of navigation grids each area includes, which is configured in advance.

The navigation map is not as regular as the grid map, and cannot be layered with coordinates like the grid map. The navigation grid is a graph formed by a series of convex polygon nodes, the convex polygons (navigation grid) in the navigation map can be taken as the nodes of the graph theory, the public edges among the convex polygons are taken as the edges of the graph theory, and a complete graph theory model is extracted, so that the navigation map can be layered by means of a plurality of hierarchical algorithms based on the graph theory: for example, multilevel bisectionalgorithmm (multilevel dichotomy algorithm). The algorithm can evenly divide any given undirected graph into a plurality of clusters, and the number of nodes of each cluster is about k (k is an input value).

For the navigation map, after the nodes of the graph theory are divided into various clusters, the undirected edges in the graph theory can be divided into two types: the first type of undirected edge is that two nodes connected by an edge belong to the same cluster, and the second type of undirected edge is that two nodes connected by an edge belong to different clusters (such edges may be referred to as "EdgeCut"). The second type of undirected edge connects two different clusters, which is equal to the connection relationship between the clusters, and can be referred to as an adjacent edge between the clusters.

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

Through this embodiment, through dividing into a plurality of regions to navigation map and grid map according to the mode of difference, can guarantee the rationality of regional division, and then guarantee the efficiency that the map sought way.

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

For any adjacent two of the plurality of first regions, if the two are connected, the adjoining positions of the two first regions may be regarded as region-connected positions. The communication position in each first region may be a region entrance (i.e., an adjacent interface) for the region to enter an adjacent region, and thus, each first region may include an entrance for allowing entry from the region to the adjacent region of the region.

In addition to the contiguous areas between areas in the local map, a portion of the first area may contain exits from the local map to other maps or entrances from other areas into the local area. The gateway (transfer gate) between the two maps may be the same, that is, the transfer gate is an exit where the local map is transferred to the other map and an entrance where the other map is transferred to the local map. The transfer gates of the local map and the different maps may be located at different positions of the map, and the different positions may be positions in the same area of the local map or positions in different areas.

For example, the transfer gate between map a and map B is located at position 1 in one area of map a, and the transfer gate between map a and map C is located at position 2 in another area of map a.

The target exit is located within a second target area of the first map, the target exit allowing access from the second target area to an area adjacent (logically adjacent) to the second target area in the other map, whereby the target exit belongs to a contiguous junction of the second target area.

It should be noted that, for each area in each map, the adjacent port included in the area may include an exit of the map in addition to an entrance between the area and the adjacent area in the map. And if the entrance and the exit of one map are the same, the exit of the map is the entrance and the exit of the 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 can be determined in different manners.

For a grid map, the manner of determining the adjacency port of each of the plurality of first regions may be: identifying a candidate neighbor interface for each of the plurality of first regions, wherein the candidate neighbor interface is a grid in each of the first regions that allows access from each of the first regions to an adjacent region of each of the first regions; selecting one grid from the plurality of grids as an adjacent interface of each first region when the candidate adjacent interface comprises a plurality of continuous grids; in the case where the candidate neighbor interfaces include one or more grids that are not contiguous, the one or more grids are determined as the one or more neighbor interfaces of each first region.

To identify the contiguous ports contained in each first region, candidate contiguous ports for each of the plurality of first regions may be identified. The candidate adjacent interface in the grid map is a grid of adjacent areas in each first area, and the adjacent areas are allowed to enter the area from the area.

For the identified candidate entries, the candidate entries may include continuous grids or discrete grids, and for the continuous grids, each grid may serve as an adjacent interface of the region. To reduce the routing complexity, one grid may be selected from the continuous grids as an adjacent interface of the area, and the other grids in the continuous grids are not used as adjacent interfaces of the area. For a discrete grid, it can be directly used as a neighbor for the region.

For example, as shown in fig. 5, if the number of the inlet blocks (adjacent interfaces) of the adjacent clusters is continuously plural, two adjacent ones of the inlet blocks may be selected as the inlets of the adjacent clusters, and the inlets may be connected. The selected entry block may be abstracted as two nodes in the abstract graph, with an edge between the two nodes weighted by 1.

Through the embodiment, when the candidate adjacent port comprises a plurality of continuous grids, one of the candidate adjacent ports is selected as the adjacent port, so that the route searching complexity can be reduced, and the route searching efficiency can be improved.

The number of contiguous ports in each first region may comprise one or more. If the number of the adjacent interfaces in a first area is one, the first area is only one entrance, and no path exists between the adjacent interfaces. If the number of adjacent ports in one first area is plural, the path between the adjacent ports of the first area may be stored in advance.

Alternatively, in the present embodiment, the adjacent port of each of the plurality of first regions may be determined first; under the condition that a plurality of first areas comprise a first sub-area with a plurality of adjacent interfaces, acquiring a first reference path between the adjacent interfaces in the first sub-area; and saving a first reference path between a plurality of neighboring interfaces within the first sub-region.

The first sub-area of the plurality of first areas contains a plurality of neighbor interfaces. If there is connectivity between two adjacent interfaces, a path (e.g., a first reference path) between the two may be found. If the two adjacent interfaces are not communicated, the path between the two interfaces cannot be found.

For example, if a cluster has a plurality of adjacent clusters, and the cluster includes a plurality of entrances and exits, the entrances may be connected inside the cluster, that is, the respective entrances in each cluster are connected to obtain an intra-cluster connection path.

After obtaining the path between the adjacent ports in each first region, the obtained path (e.g., the first reference path) may be saved, and the obtained path may be saved in the target database.

The map routing in the first map may be abstracted as a routing problem in an abstract map, which may be an abstract map based on a graph theory model. The adjacent ports of each first area can be used as nodes in the abstract graph, the paths between the adjacent ports can be used as edges in the abstract graph, and the lengths of the paths can be used as the weights of the edges.

As shown in fig. 6, the grid blocks in the circle on the left side are entries in the same cluster, corresponding to nodes in the abstract graph (circles on the right side), the path between two entries, corresponding to the edges between the nodes in the abstract graph, the path length (number of grid blocks passed), and the weight of the edge in the abstract graph (6, 8, 12, etc.).

Through the embodiment, the path between the entrances of each area is identified and stored, so that the method can be conveniently used in the map path searching process, and the map path searching efficiency is improved.

For the navigation map, determining the adjacency of each of the plurality of first regions may be at least one of:

1) and directly selecting a point on the adjacent edge as an entrance between the high-level cluster and the high-level cluster. The path in the high-level cluster stores a real path between one entry point and another entry point, and the final path is spliced by real paths among a plurality of high-level clusters.

For the above manner, an adjacent edge between each first region in the plurality of first regions and an adjacent region of each first region may be determined; selecting an adjacent point from each adjacent edge of each first area as an adjacent interface on each adjacent edge to obtain an adjacent interface of each first area; under the condition that a second sub-area with a plurality of adjacent interfaces is contained in the plurality of first areas, acquiring a second reference path between the plurality of adjacent interfaces in the second sub-area; a second reference path between a plurality of neighboring interfaces within a second sub-region is saved.

When determining the path between the adjacent ports in each first region, an adjacent edge between each first region and an adjacent region of the region may be determined first, and then a point is directly selected on the adjacent edge as an entry (adjacent port) between the regions (upper-layer cluster and upper-layer cluster).

For a first region (second sub-region) containing a plurality of adjacent interfaces, a path between any two adjacent interfaces in the plurality of adjacent interfaces may be determined, respectively. If there is connectivity between two adjacent interfaces, a path (e.g., a second reference path) between the two may be found. If the two adjacent interfaces are not communicated, the path between the two interfaces cannot be found.

After obtaining the path between the adjacent ports in each first region, the obtained path (e.g., the second reference path) may be saved, and the obtained path may be saved in the target database.

Optionally, in this embodiment, for the navigation grid, the boundary between the high-level cluster and the high-level cluster is a common edge (adjacent edge) of the EdgeCut type, and then the entry between the high-level cluster and the high-level cluster falls on the common edge. A point may be directly selected on the common edge of the neighboring clusters as an entry between the higher level cluster and the higher level cluster. The path in the high-level cluster stores a real path (a waypoint path) between one entry point and another entry point, and the final path is spliced by real paths among a plurality of high-level clusters.

For the above scenario, assuming that there are N entries connected to other upper-level clusters in the same upper-level cluster, a total of N (N-1)/2 paths between every two entries in the upper-level cluster are calculated, and O (N-1)/2) paths are stored.

Through the embodiment, the path between the adjacent ports of each first area is identified and stored, so that the map can be conveniently used in the process of searching the path, and the map path searching efficiency is improved.

2) Firstly, a point is not directly selected, and the whole adjacent edge is taken as an inlet. The path in the high-level cluster stores a polygonal path between one entry adjacent edge and another entry adjacent edge (the path is a slice path region). And the final path is obtained by refining an adjacent edge path among a plurality of high-level clusters through an integral StringPull algorithm and the like.

For the above manner, an abutting edge of each of the plurality of first regions may be determined, where the abutting edge of each first region is an abutting opening between each first region and an adjacent region of each first region; under the condition that a plurality of first areas comprise a third sub-area with a plurality of adjacent edges, searching a first path area between the plurality of adjacent edges in the third sub-area by taking a navigation grid contained in the third sub-area as a node and a common edge between the navigation grids as an edge, wherein the first path area comprises the navigation grid passed by the first path area; and saving the first path region among the plurality of adjacent edges in the third sub-region.

For a plurality of first areas contained in the navigation map, the whole adjacent edge between the first areas can be directly selected as an adjacent interface, and a point is not directly selected as the adjacent interface. For a plurality of first areas contained in the navigation map, an adjacent edge (common edge) between each first area and an adjacent area of the area can be determined, and the adjacent edge is used as an adjacent interface of the area.

For a first region (third sub-region) containing a plurality of adjacent edges, a path between any two adjacent edges of the plurality of adjacent edges may be determined, respectively. If the two adjoining edges are connected, a path (e.g., a first path region) between the two can be found. If the two adjacent edges are not communicated, the path between the two adjacent edges cannot be found.

When a path between adjacent edges is found in an area, a navigation grid included in the area may be used as a node, and a common edge between the navigation grids may be used as an edge, and a path between any two adjacent edges in the area is searched, where the path includes a string of convex polygons (i.e., includes a string of navigation grids and a common edge between the navigation grids), and may be considered as a sheet of path area (i.e., a first path area).

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

For the navigation map, the intra-cluster path holds a polygonal path between the entrance common edge (adjacent edge) and the entrance common edge (adjacent edge).

Optionally, in this embodiment, when calculating paths between different entries in the cluster, since a whole common edge is selected as an entry, this information belongs to information on the graph theory model after abstraction. If there are multiple nodes A, B, C, D to seek to point E, a single-source shortest-path algorithm may be called to seek to all nodes in reverse, starting from E. The shortest path search tree with the E point as the root is finally output by the single-source shortest path algorithm. Thus, if a cluster has K nodes, N entry points, a total of N shortest path search trees need to be stored. One way to save a tree is to store the parent node of each node directly, so a total of K × N parent nodes need to be stored.

Through the embodiment, the path between the adjacent edges of each area is identified and stored, so that the map can be conveniently used in the process of searching the path, and the map path searching efficiency is improved.

In the process of map routing, a path from the moving starting point to the adjacent port in the area can be determined firstly. The movement starting point is located within a first target area in the first map, and the server may determine a path (i.e., a first sub-path) of the movement starting point to an adjacent port of the first target area.

The number of adjacent ports in the first target region may be one or more, and if the number of adjacent ports is one, the first sub-path may include a path from the movement start point to the adjacent port. If the number of the adjacent interfaces is multiple, the first sub-path may include one or more paths from the moving start point to each of the adjacent interfaces.

When determining the first sub-path, for the grid map, the existing map routing method in the related art may be adopted to perform routing, for example, routing based on an a-algorithm, routing based on a Dijkstra algorithm, and the like, which is not described herein again. For the navigation map, the sub-path can be determined in different modes for a scene with an adjacent interface being one point on an adjacent edge and a scene with the whole adjacent edge.

For a scenario in which the neighboring interface is a point on the neighboring edge, when calculating a path from the starting point to the neighboring interface of the cluster, a path finding may be initiated from the moving starting point to each neighboring interface, for example, a path finding based on an a-x algorithm, a path finding based on a Dijkstra algorithm, and the like, which is not described herein again.

For example, if the cluster entry is entry point A, B, C, D and the starting point is S, four seeks from point S to A, B, C, D four points are required.

For the scenario that the adjacent interface is the whole adjacent edge, when the path from the starting point to the adjacent interface of the cluster is calculated, since the shortest path tree is already stored for all graph theory nodes, the moving starting point can be firstly corresponding to the navigation grid, and then the path from the navigation grid to each adjacent edge is queried 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 is already stored for all graph nodes, no path finding is needed, if the path from the starting point S to the entrance common edge P is to be queried, the starting point S is firstly mapped onto the convex polygon SS on the navigation grid, and then the tree is searched for the path from the SS to the P on the shortest path with the P as the root (the path between every two points on the tree is unique).

After the first sub-path is obtained, a first path from the movement start point to the target exit may be acquired based on the first sub-path and a path between adjacent ports of each first region stored in advance.

According to the embodiment, the map is divided into a plurality of areas, and the paths between the adjacent ports of the areas are stored in advance, so that the search times of the route searching algorithm can be reduced, and the route searching efficiency of the map is improved.

As an alternative embodiment, the acquiring the first path from the movement start point to the target exit according to the first sub-path and the pre-stored path between the adjacent ports of each first area includes:

s21, using the movement start point and the adjacent port of each first region as nodes, and using the first sub-path and the path between the adjacent ports of each first region as edges, searching for a path from the movement start point to the target exit, and obtaining a first path.

For the grid map and the navigation map, the way finding can be carried out in the first map according to the graph theory model. The first map may be abstracted as a graph theory model that is an abstract of the first map. In the graph theory model, the adjacent interfaces of each region are nodes, the paths between the adjacent interfaces are edges, and the length of the path is the weight of the edge.

After obtaining a first sub-path between the movement start point and the adjacent port of the first target area, the movement start point may be added to the graph theory model of the first map as a node, and the first sub-path may be used as an edge between the node corresponding to the movement start point and the node corresponding to the adjacent port of the first target area, and the weight of the edge is the length of the first sub-path.

In the graph theory model of the first map, a path from a node corresponding to the movement starting point to a node corresponding to the target exit may be searched for, and a first path is obtained.

For example, for the grid map shown in fig. 3, the corresponding cluster entry and the path between the intra-cluster entries are as shown in fig. 7, and the five-pointed star position is the position of the target exit. As shown in fig. 8, when performing a map route search, a starting point is added to the abstract map, and a circle position is used as the starting point, so as to generate a path from the starting point to the cluster entrance.

Finding a path in the abstract graph and refining the path: and determining a path from the starting point to the target in the abstract graph in a path searching mode such as A x and the like to obtain the path shown in FIG. 9.

By the embodiment, the map path searching is carried out by adopting the graph theory algorithm, so that the method is suitable for the existing graph theory algorithm, and the applicability of the map path searching mode is improved.

Optionally, in this embodiment, for a scene in which an adjacent port in the navigation map is a whole adjacent edge, a path region is found according to the graph theory algorithm, and a path may be determined in the path region as a path finding result. The first path may be generated by: searching a second path area from the moving starting point to the target outlet by taking the moving starting point and the adjacent edge of each first area as nodes and taking the first sub-path and the first path area as edges, wherein the second path area comprises a navigation grid passed by the second path area; and acquiring a first path from the moving starting point to the target outlet from the second path area.

For the navigation map, the intra-cluster paths store polygonal paths between an entrance common edge (adjacent edge) and an entrance common edge (adjacent edge), and finally, the real paths can be extracted from the common edge paths (polygonal paths) among a plurality of clusters through a path extraction algorithm (such as StringPull algorithm).

When map routing is performed, the moving starting point may be added to the abstract map, the moving starting point and the adjacent edge of each first area are used as nodes, the first sub-path and the first path area are used as edges, and a path from the moving starting point to the target exit is searched according to a routing algorithm (e.g., a × algorithm) in the graph theory model, where the path is a polygon string and may be restored to a path area in the navigation map, e.g., a second path area, where the second path area includes a navigation grid through which the second path area passes.

After the second path area is obtained, the first path from the moving start point to the target exit may be refined through a path refinement algorithm, for example, the first path from the moving start point to the target exit is determined according to a 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 start point to the target exit obtained by the routing is as short as possible, an algorithm such as StringPull may be used to determine the final inflection point of the path by relying on the common edge between the polygon and the polygon, so as to determine the first path.

For example, as shown in fig. 10, when performing a map seek, the StringPull algorithm may be used to reduce the number of inflection points, maintain a monotonically decreasing funnel, correspond the inflection points to a common edge of a convex polygon, move the first edge, reduce the funnel angle, and determine the movement; moving the second side, and determining the movement when the funnel angle is still reduced; moving the first side again, continuously reducing the funnel angle, and determining the movement; since the second side cannot be moved in the same direction, the first side is also moved, the positional relationship of the two sides of the funnel changes, and if the movement is not allowed, it is determined that an inflection point is required. After the inflection point is determined, the StringPull algorithm refinement path can continue to be called with the inflection point as a starting point.

According to the method and the device for searching the map, the map is used for searching the path by adopting the graph theory algorithm, and the polygon string obtained by searching the path is restored to the path in the map, so that the map path searching efficiency can be improved, and the feasibility and the better path quality of the searched path are ensured.

As an alternative embodiment, determining the second path in the second map where the mobile terminal is located includes:

s31, determining a second sub-path in a third target area of the second map, where 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 an adjacent interface allowing entry from each second area to an adjacent area of each second area, and the second sub-path is a path from the adjacent interface of the third target area to the movement destination;

s32, obtaining a second path from the target entry to the moving destination according to the second sub-path and the pre-stored path between the target interfaces of each second area, where the target interface of each second area includes at least one of: the adjacent interface of each second zone, the target portal.

The path from the target entry to the moving destination of the second map may be determined in various ways, for example, a way-finding based on the a-x algorithm, a way-finding based on the Dijkstra algorithm. In the above manner, the complete navigation data of the second map needs to be loaded, and a part of cache space is occupied.

In order to improve the routing efficiency, the second map can be divided into a plurality of second areas (clusters, each cluster can be used as a map unit of a divided high-level map), and each second area comprises a plurality of basic map units; configuring the adjacent interfaces of the second areas, namely, allowing the entrance from the area to the adjacent areas of the area, and pre-storing the path between the adjacent interfaces of each second area. Based on the saved paths between the adjacent ports of the second areas, the map routing can be performed.

The manner of dividing the second map into a plurality of second areas, the manner of configuring the neighboring interfaces of each second area, the manner of pre-storing the path between the target interfaces of each second area, and the manner of determining the second path based on the stored path between the neighboring interfaces of each second area are similar to the foregoing, and are not described herein again.

As an alternative embodiment, acquiring the second path from the target entry to the mobile endpoint according to the second sub-path and the pre-stored path between the target interfaces of each second area includes:

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

The way finding may be performed in the second map in the manner of a graph theory model. The second map may be abstracted as a graph theory model that is an abstract of the second map. In the graph theory model, the target interfaces of the second regions are nodes, the paths between the target interfaces are edges, and the lengths of the paths are the weights of the edges.

After obtaining a second sub-path from the adjacent port of the third target area to the movement destination, the movement destination may be added to the graph theory model of the second map as a node, and the second sub-path may be used as an edge between the node corresponding to the movement destination and the node corresponding to the adjacent port of the third target area, and the weight of the edge is the length of the second sub-path.

The manner of searching for the second path from the target entry to the moving destination in the graph-theoretical model is similar to that described above, and is not described herein again.

According to the method and the device for searching the map, the map is used for searching the route by adopting the graph theory algorithm, and the route obtained by searching the route is restored to the route in the map, so that the map route searching efficiency can be improved, and the feasibility and the better route quality of the searched route are ensured.

As an alternative embodiment, before determining the second sub-path within the third target area of the second map, the method further comprises:

s51, determining a third target area where the mobile terminal point is located in the second map;

s52, first navigation data of the third target area is acquired.

In order to reduce the occupation of the navigation data on the cache space, when the route is searched across the map, only a small piece of navigation where the destination is located in the destination map is loaded, that is, only the navigation data of the third target area where the mobile destination is located in the second map is loaded.

According to the position information of the moving destination, a third target area in the second map where the moving destination is located can be determined. The third target area may be represented by a map identification of the second map and an area identification of the third target area.

After determining the third target area where the moving destination is located, the navigation data (first navigation data) of the third target area may be loaded for map routing, for example, determining the second sub-path. And navigation data for areas other than the third target area in the second map may not be loaded.

The position information of the mobile destination can be carried in the route searching request, and the position information can be represented in a map identifier and position coordinates mode, or represented in a map identifier, area identifier and position coordinates mode, and the third target area can be determined according to the position information of the mobile destination carried in the route searching request.

By the aid of the navigation method and the navigation device, the data volume of the loaded navigation data can be reduced by determining and loading the small navigation block where the terminal point is located in the terminal point map, and accordingly the occupation of the navigation data on the cache space is reduced.

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

s61, searching navigation data of a third target area from a target cache, wherein the target cache is cached with a navigation data queue of a plurality of navigation data, and the plurality of navigation data are accessed navigation data;

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

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

The route-finding system usually needs to update the route according to the position of the player, before the player does not reach the target, the route-finding request may be initiated many times, if the target map (the map where the destination is located) navigation is loaded each time, even if a small block, the IO cost is very large, and if the destination is changed, the navigation is reloaded.

In order to reduce the data volume of the loaded navigation data, the navigation data can be cached through a target cache, a navigation data queue of a plurality of navigation data is cached in the target cache, and the plurality of navigation data are accessed navigation data.

The server may look up navigation data for the third target area from the target cache, for example, by area identification, or a combination of map identification and area identification. If the navigation data of the third target area is found, the first navigation data of the third target area is determined to be acquired, and the navigation data of the third target area does not need to be loaded.

Considering that a piece of navigation data just entered into 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 head of the navigation data queue so as to be used continuously.

According to the navigation data caching method and device, the navigation data cached through the target cache are moved to the head of the navigation data queue, the data volume of the loaded navigation data can be reduced, and meanwhile the timeliness of data calling is guaranteed.

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

s71, 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;

s72, saving the first navigation data to the head of the navigation data queue.

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

The navigation data of the third target area, i.e., the first navigation data, may be loaded through the area identification, or a combination of the map identification and the area identification, and saved to the head of the navigation data queue so as to be continuously used.

By the embodiment, the navigation data of the area is loaded and stored to the head of the navigation data queue, so that the timeliness of data calling can be ensured.

As an alternative embodiment, saving the first navigation data to a queue head of the navigation data queue comprises:

s81, removing second navigation data at the tail 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 by the first navigation data;

s82, saving the first navigation data to the head of the navigation data queue.

The target cache can only store a certain amount of navigation data because of limited storage space. The amount of navigation data in the navigation data queue may be configured, for example, the navigation data queue holds only a target amount (e.g., 5) of navigation data, and the amount of navigation data in the navigation data queue may be configured, for example, the navigation data queue holds only a target amount (e.g., 2G) of navigation data.

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

The navigation data to be removed may be navigation data at the tail of the navigation data queue, that is, the second navigation data, and since the navigation data that is used most recently is moved to the head of the navigation data queue, the navigation data at the tail of the navigation data queue is navigation data that has not been accessed for a period of time, and the navigation data is less likely to be accessed in the future, and therefore, the navigation data may be preferentially removed.

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

For example, a navigation that has just entered memory may be likely to continue to be Used in the future (a new request is initiated) and a navigation that has not been accessed for a period of time may be less likely to be accessed in the future (a destination change), and therefore, navigation data may be cached based on an LRU (Least Recently Used) algorithm.

By the embodiment, the reasonability of data storage can be improved by removing the navigation data at the tail of the navigation data queue when the data removal condition is met.

As an alternative embodiment, the 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 the plurality of maps stored in advance includes:

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

After the first path and the second path are obtained, path finding can be carried out among a plurality of maps according to a graph theory model mode. The plurality of maps may be abstracted into a graph theory model that is an abstract of the plurality of maps. In the graph theory model, the entrance and exit of each map are nodes, the path between the entrance and exit in each map is a side, and the length of the path is the weight of the side. Among different maps, the passageways with the incidence relation are the same nodes in the graph theory model, so that a plurality of maps can be identified through one graph theory model.

After the first path and the second path are obtained, the movement starting point and the movement end point can be added to the graph theory models of the plurality of maps as nodes, the first path is taken as an edge between the node corresponding to the movement starting point and the node corresponding to the target exit, the weight of the edge is the length of the first path, the second path is taken as an edge between the node corresponding to the target entrance and the node corresponding to the movement end point, and the weight of the edge is the length of the second path.

The manner of searching for the third path from the moving start point to the moving end point in the graph-theory model is similar to the foregoing, and is not described herein again.

According to the map path searching method and device, the map path searching is carried out by adopting the graph theory algorithm, and the path obtained by the path searching is restored to the path in the map, so that the map path searching efficiency can be improved, and the feasibility of the searched path is ensured.

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

s101, 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 a moving starting point to a moving destination;

s102, responding to the moving request, and determining a moving starting point and a moving end point of the object to be moved.

The map routing process may be based on a moving request (routing request) sent by a client of the object to be moved, where the moving request is used to request to find a path from the moving start point to the moving end point, so as to control the object to be moved to move from the moving start point to the moving end point.

The plurality of maps may be game maps or other maps. Taking the game map as an example, the game map may be a map in a target game application, which may include, but is not limited to, an MMO game. The user of the target game application may log into the target game through the target account using a client of the target game application running on his terminal device to control the interaction between the client and the server of the target game application. The same account may control one virtual character in the target game, or may control multiple virtual characters in the target game at the same time.

The target user may log into the target client using the target account to launch the target game application. The virtual character controlled by the target user is an object to be moved. In the process of moving the operation object in the game map, a moving starting point and a moving end point of the movement can be determined. The movement starting point is located in a first map of the plurality of maps and the movement ending 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 a target user in the target game) may detect an operation performed on the client, generate a movement request for the object to be moved in response to the operation, the movement request requesting to control the object to be moved to move from the movement start point to the movement end point, and send the movement request to the server through a communication connection with the server.

The server may receive a movement request sent by the client, and in response to the movement request, the server may determine a movement start point and a movement end point of the object to be moved. The movement starting point and the movement ending point may be determined by a map identifier and position coordinates in a map, or may be determined by a position identifier, that is, the movement request carries the position identifier of the movement starting point and/or the movement ending point. The server extracts the position identification in the movement request, and determines a map where the movement starting point and/or the movement ending point are/is located and position coordinates in the map according to the corresponding relation between the position identification and the position.

Through the embodiment, the movement of the object to be moved in the plurality of maps is triggered through the movement request, and the control capability of the user on the object in the map can be improved.

As an alternative embodiment, after obtaining the third path from the movement starting point to the movement ending point, the method further includes:

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

and 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 movement starting point to the movement ending point according to a third path.

When the server uniformly controls the movement of the objects in the game map, the server can control the object to be moved to move from the movement starting point to the movement ending point by using the third path, and synchronize the movement process to the client terminal displaying the object to be moved.

Alternatively, controlling the object to be moved from the movement start point to the movement end point may also be performed by the terminal device. The server may generate a movement control instruction, where the movement control instruction is used to instruct 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 may extract the third path from the movement control instruction, and control the object to be moved to move from the movement starting point to the movement ending point according to the third path.

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

Through the embodiment, the client controls the movement of the object to be moved, so that the operation burden of the server can be reduced, and the smoothness of game operation is ensured.

It should be noted that the path found by the map routing method in this embodiment is not necessarily the optimal (shortest path), but since the paths between the clusters are predefined and stored, the paths can be directly used without concern for details of the paths inside the clusters that pass through (because the paths are generated in advance, that is, defined, and used directly), the path can be found out quickly.

The map way-finding method in the embodiment of the present application is described below with reference to an optional example. The map way-finding method in this example is applied to a game scene, the game map is a grid map or a navigation map, the area into which the map is divided is a cluster, and each cluster corresponds to a map unit in a high-level map.

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

step S1102 calculates a path between the start point and the end point in the local graph and the entry.

For multiple maps, navigation grids do not need to be loaded for each map, navigation grid data of the map where the virtual object controlled by the player is located currently can be loaded, and other maps only need one initialized dtNavMesh empty shell which only transmits navigation data around the door.

When the cross-map route finding is initiated, a small piece of navigation data where the end point is located in the end point map can be loaded, and a path between the start point and the entrance of the map in the map where the start point is located and a path between the end point and the entrance of the map in the map where the end point is located are calculated.

And step S1104, performing cross-map layer route finding to obtain a path between an entrance of the map where the starting point is located and an entrance of the map where the end point is located.

The connection mode between the map and the map can be a map transmission gate, the map transmission gate can be an entrance of the map, the route searching across the map layer can be simplified into simple table query, and the route between each transmission gate across the map layer is calculated and stored in advance.

According to the pre-stored route between the transfer gates, the route 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 acquired.

Step S1106, performing path splicing to obtain a path between the starting point and the ending point.

And splicing the starting point with the path of the entrance in the local map, the path between the entrance of the map where the starting point is located and the entrance of the map where the end point is located, and the path between the end point and the entrance in the local map to obtain the path between the starting point and the end point.

By the method, the route searching across the map is completed by only loading the small piece of navigation data where the end point is located in the end point map, so that the data volume needing to be loaded can be reduced, the utilization rate of the memory is improved, and the route searching efficiency is improved.

It should be noted that, for simplicity of description, the above-mentioned method embodiments are described as a series of acts or combination of acts, but those skilled in the art will recognize that the present application is not limited by the order of acts described, as some steps may occur in other orders or concurrently depending on the application. Further, those skilled in the art should also appreciate that the embodiments described in the specification are preferred embodiments and that the acts and modules referred to are not necessarily required in this application.

Through the above description of the embodiments, those skilled in the art can clearly understand that the method according to the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but the former is a better implementation mode in many cases. Based on such understanding, the technical solutions of the present application may be embodied in the form of a software product, which is stored in a storage medium (e.g., ROM/RAM, magnetic disk, optical disk) and includes instructions for enabling a terminal device (e.g., a mobile phone, a computer, a server, or a network device) to execute the method according to the embodiments of the present application.

According to another aspect of the embodiment of the application, a map way-finding device for implementing the map way-finding method is also provided. The apparatus can be applied to the animation creating device described above. Fig. 12 is a schematic diagram of an alternative map routing device according to an embodiment of the present application, and as shown in fig. 12, the device may include:

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

(2) a second determining unit 1204, connected to the first determining unit 1202, for determining a second path in a second map where the moving destination is located, where the second path is a path from the target entrance to the moving destination on the second map;

(3) a first obtaining unit 1206, connected to the second determining unit 1204, for obtaining 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, wherein the plurality of maps includes 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 having an association relationship among the plurality of maps.

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

Determining a first path in a first map where the moving starting point is located through the module, 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; the method comprises the steps of obtaining a third path from a moving starting point to a moving destination point according to a first path, a 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 in two associated maps with an associated relationship, the exit of the first associated map is associated with the entrance of the second associated map, so that the problem that a game is easy to jam due to the fact that the number of the maps needing to be loaded is too large in a cross-map route searching mode in the related art is solved, the occupation of navigation data on a memory is reduced, and the game running smoothness is improved.

As an alternative embodiment, the first determination unit 1202 includes:

the first determining module is used for determining a first sub-path in a first target area of a first map, wherein the first target area is an area where a moving starting point is located in a plurality of first areas contained in the first map, each first area in the plurality of first areas contains a neighboring interface allowing the first area to enter an adjacent area of each first area, and the first sub-path is a path from the moving starting point to the neighboring interface of the first target area;

and the first acquisition module is used for acquiring a 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.

As an alternative embodiment, the first obtaining module includes:

and the first searching submodule is used for searching a path from the moving starting point to the target outlet by taking the moving starting point, the adjacent port of each first area as a node and the first sub-path and the path between the adjacent ports of each first area as edges to obtain a first path.

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

a second determining module, configured to determine a second sub-path in a third target area of the second map, where the third target area is an area where a mobile destination is located in a plurality of second areas included in the second map, each of the plurality of second areas includes an adjacent interface that allows the mobile destination to enter an adjacent area of each of the second areas from each of the second areas, and the second sub-path is a path from the adjacent interface of the third target area to the mobile destination;

a second obtaining module, configured to obtain, according to the second sub-path and a pre-stored path between target interfaces of each second area, a second path from the target entry to the mobile endpoint, where the target interface of each second area includes at least one of: the adjacent interface of each second zone, the target portal.

As an alternative embodiment, the second determining module includes:

and the second searching submodule is used for searching a path from the target inlet to the mobile terminal point by taking the mobile terminal point, the target interface of each second area as a node and taking the second sub-path and the path between the target interfaces of each second area as edges to obtain a second path.

As an alternative embodiment, the apparatus further comprises:

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

and the second acquisition unit is used for acquiring the first navigation data of the third target area.

As an alternative embodiment, the second obtaining unit includes:

the searching module is used for searching navigation data of a 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;

the third determining module is used for determining and acquiring the first navigation data of the third target area under the condition that the navigation data of the third target area is found;

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

As an alternative embodiment, the apparatus further comprises:

the loading unit is used for 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 after the navigation data of the third target area is found from the target cache;

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

As an alternative embodiment, the holding unit includes:

the removing module is used for 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;

and the storage module is used for storing the first navigation data to the head of the navigation data queue.

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

and the searching unit is used for 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.

As an alternative embodiment, the apparatus further comprises:

the mobile terminal comprises a receiving unit, a moving unit and a processing unit, wherein the receiving unit is used for receiving a moving request sent by a client of an object to be moved before determining a first path in a first map where a moving starting point is located, and the moving request is used for requesting to control the object to be moved to move from the moving starting point to a moving destination;

and a fourth determining unit, configured to determine a movement start point and a movement end point of the object to be moved in response to the movement request.

As an alternative embodiment, the apparatus further comprises:

the generating unit is used for generating a movement control instruction after acquiring a third path from the movement starting point to the movement end point, wherein the movement control instruction is used for indicating the object to be moved to move according to the third path;

and 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 movement starting point to the movement ending point according to the third path.

It should be noted here that the modules described above are the same as the examples and application scenarios implemented by the corresponding steps, but are not limited to the disclosure of the above embodiments. It should be noted that the modules described above as a part of the apparatus may be operated in a hardware environment as shown in fig. 1, and may be implemented by software, or may be implemented by hardware, where the hardware environment includes a network environment.

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

Fig. 13 is a block diagram of an electronic device according to an embodiment of the present application, and as shown in fig. 13, the electronic device includes a memory 1302 and a processor 1304, where the memory 1302 stores a computer program, and the processor 1304 is configured to execute the steps in any of the method embodiments described above through the computer program.

Optionally, in this embodiment, the electronic apparatus may be located in at least one network device of a plurality of network devices of a computer network.

Optionally, in this embodiment, the processor may be configured to execute the following steps by a computer program:

s1, 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;

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

and S3, acquiring a third path from the movement starting point to the movement destination according to the first path, the second path and the path between the entrance and the 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.

The memory 1302 may be used to store software programs and modules, such as program instructions/modules corresponding to the model control method and apparatus in the embodiment of the present application, and the processor 1304 executes various functional applications and data processing by running the software programs and modules stored in the memory 1302, so as to implement the model control method. The 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 examples, the memory 1302 may further include memory located remotely from the processor 1304, which may be connected to the terminal over a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.

As an example, as shown in fig. 13, the memory 1302 may include, but is not limited to, a first determining unit 1202, a second determining unit 1204, and a first obtaining unit 1206 of the model control apparatus. In addition, other module units in the model control device may also be included, but are not limited to, and are not described in detail in this example.

Optionally, the transmitting device 1306 is used for receiving or sending data via a network. Examples of the network may include a wired network and a wireless network. In one example, the transmission device 1306 includes a NIC (network interface Controller) that can be connected to a router via a network cable and other network devices so as to communicate with the internet or a local area network. In one example, the transmitting device 1306 is a Radio Frequency (RF) module, which is used to communicate with the internet in a wireless manner.

In addition, the electronic device further includes: a display 1308, configured to display an interface of the client; and a connection bus 1310 for connecting the respective module parts in the above-described electronic apparatus.

Optionally, the specific examples in this embodiment may refer to the examples described in the above embodiments, and this embodiment is not described herein again.

It can be understood by those skilled in the art that the structure shown in fig. 13 is only an illustration, and the device implementing the model control method may be a terminal device, and the terminal device may be a terminal device such as a smart phone (e.g., an Android phone, an iOS phone, etc.), a tablet computer, a palm computer, and a MID (Mobile internet devices), a PAD, and the like. Fig. 13 is a diagram illustrating a structure of the electronic device. For example, the terminal device may also include more or fewer components (e.g., network interfaces, display devices, etc.) than shown in fig. 13, or have a different configuration than shown in fig. 13.

Those skilled in the art will appreciate that all or part of the steps in the methods of the above embodiments may be implemented by a program instructing hardware associated with the terminal device, where the program may be stored in a computer-readable storage medium, and the storage medium may include: flash disks, ROM (Read-Only Memory), RAM (Random access Memory), magnetic or optical disks, and the like.

According to still another aspect of an embodiment of the present application, there is also provided a storage medium. Alternatively, in the present embodiment, the storage medium may be a program code for executing the model control method.

Optionally, in this embodiment, the storage medium may be located on at least one of a plurality of network devices in a network shown in the above embodiment.

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

Optionally, the specific example in this embodiment may refer to the example described in the above embodiment, which is not described again in this embodiment.

Optionally, in this embodiment, the storage medium may include, but is not limited to: various media capable of storing program codes, such as a U disk, a ROM, a RAM, a removable hard disk, a magnetic disk, or an optical disk.

The above-mentioned serial numbers of the embodiments of the present application are merely for description and do not represent the merits of the embodiments.

The integrated unit in the above embodiments, if implemented in the form of a software functional unit and sold or used as a separate product, may be stored in the above computer-readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or a part of or all or part of the technical solution contributing to the prior art may be embodied in the form of a software product stored in a storage medium, and including instructions for causing one or more computer devices (which may be personal computers, servers, network devices, or the like) to execute all or part of the steps of the method described in the embodiments of the present application.

In the above embodiments of the present application, the descriptions of the respective embodiments have respective emphasis, and 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 the present application, it should be understood that the disclosed client may be implemented in other manners. The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units is only one type of division of logical functions, and there may be other divisions when actually implemented, for example, a plurality of units or components may be combined or may be integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, units or modules, and may be in an electrical or other form.

The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.

In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.

The foregoing is merely an alternative embodiment of the present application and it should be noted that modifications and embellishments could be made by those skilled in the art without departing from the principle of the present application and should be considered as the scope of the present application.

Claims

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.