WO2022205824A1 - Map resource loading method and apparatus, storage medium, and electronic apparatus - Google Patents

Abstract

Disclosed in the present invention are a map resource loading method and apparatus, a storage medium, and an electronic apparatus. The method comprises: when a preloading condition of a game map is satisfied, determining a first region, where a target character is currently located, in the game map, the game map being divided into multiple regions, the first region belonging to the multiple regions, the preloading condition being used for triggering execution of an operation of selecting a preloading region from the multiple regions, and the target character being a game character controlled by a user terminal; obtaining a prediction result according to a historical trajectory of the game character, and determining a second region among the multiple regions according to the prediction result, the prediction result being used for representing an region, where the target character is about to enter, among the multiple regions predicted by using the historical trajectory, the second region being an region where map resources are about to be loaded, and the second region being adjacent to the first region; and loading the map resources of the second region in the user terminal. The present invention solves the technical problem in the related art that the accuracy of map region loading is low.

Description

Map resource loading method and device, storage medium, and electronic device

cross reference

This application claims the priority of the Chinese patent application filed on March 31, 2021, with the application number of 202110351734.4 and the title of the invention being "Map resource loading method and device, storage medium, and electronic device", the entire contents of which are incorporated herein by reference Applying.

technical field

The present invention relates to the field of computers, and in particular, to a method and device for loading map resources, a storage medium, and an electronic device.

Background technique

With the maturity of the existing game engine technology, the advancement of the technology of game developers and the improvement of the hardware level of game operating equipment, more and more game types, such as massively multiplayer online role-playing games, large-scale survival competitive games, large-scale open world The game starts with a large world scene. A large world scene is also called a big map, which usually refers to a virtual world scene in a game whose length and width are greater than or equal to 4 kilometers. When the character operated by the player is in a large world scene, due to the limitation of hardware computing performance and storage performance, it is often impossible to convert related resources in the large map (including terrain resources, object resources in the scene, weather resources, and character resources in the scene. etc.) are all loaded at the same time. The solution usually adopted is to divide the large map into several small regional components, and dynamically load the resources of the specified regional components according to the current state of the player during the running of the game. Experienced large map resource loading management is implemented.

The above part introduces the technical implementation of large map resource loading, but what is more important is the timing of resource loading behavior and the selection of sub-component areas that need to load resources. The current selection method is relatively fixed, and there are often preloaded map areas that are not areas that players actually enter.

For the above problems, no effective solution has been proposed yet.

SUMMARY OF THE INVENTION

The present invention provides a map resource loading method and device, a storage medium, and an electronic device, so as to at least solve the technical problem of low accuracy of map area loading in the related art.

According to an aspect of the present invention, a method for loading map resources is provided, comprising: under the condition that a preloading condition of a game map is satisfied, determining a first area in the game map where a target character is currently located, wherein the game map is divided into There are multiple areas, the first area belongs to multiple areas, the preloading condition is used to trigger the execution of the operation of selecting the preloading area from multiple areas, and the target character is the game character controlled by the user terminal; the prediction is obtained according to the historical trajectory of the game character result, and determine the second area in the multiple areas according to the prediction result, wherein the prediction result is used to indicate the area to be entered by the target character in the multiple areas predicted by using the historical trajectory, and the second area is the area to be loaded with map resources , the second area is adjacent to the first area; the map resource of the second area is loaded in the user terminal.

According to another aspect of the present invention, there is also provided a map resource loading device, comprising: a search unit, configured to determine the first area in the game map where the target character is currently located under the condition that the preloading condition of the game map is satisfied , wherein the game map is divided into multiple areas, the first area belongs to multiple areas, the preload condition is used to trigger the execution of the operation of selecting the preload area from the multiple areas, and the target character is the game character controlled by the user terminal; The unit is used to obtain the prediction result according to the historical trajectory of the game character, and determine the second area in the plurality of areas according to the prediction result, wherein the prediction result is used to indicate that the target character is to enter in the plurality of areas predicted by the historical trajectory. area, the second area is the area where the map resource is to be loaded, and the second area is adjacent to the first area; the loading unit is used for loading the map resource of the second area in the user terminal.

According to yet another aspect of the present invention, there is also provided a computer-readable medium on which a computer program is stored, and when the computer program is executed by a processor, implements the steps of the above-mentioned method.

According to yet another aspect of the present invention, an electronic device is also provided, comprising a memory, a processor, and a computer program stored in the memory and running on the processor, and the processor implements the above-mentioned method when the computer program is executed. step.

According to another aspect of the present invention, there is also provided a computer program product, comprising a computer program, which implements the steps of the above-mentioned method when the computer program is executed by a processor.

The beneficial effects of the present invention are: considering that with the passage of the game operation time and the increase of the total number of players, the group behavior trajectories of the characters controlled by the players on the big map will become more concentrated and regular. In the solution, the historical trajectory can be used to determine the results that conform to the above rules, and then the area that the player is about to enter can be determined, which can solve the technical problem of low accuracy of map area loading in the related art.

Description of drawings

The above and various other advantages and benefits of the present invention will become apparent to those of ordinary skill in the art upon reading the following detailed description of the preferred embodiments. In the attached image:

FIG. 1 schematically shows a schematic diagram of a hardware environment of a method for loading map resources according to an embodiment of the present invention;

FIG. 2 schematically shows a flowchart of an optional map resource loading method according to an embodiment of the present invention;

FIG. 3 schematically shows a schematic diagram of an optional map resource according to an embodiment of the present invention;

FIG. 4 schematically shows a schematic diagram of an optional map resource loading solution according to an embodiment of the present invention;

FIG. 5 schematically shows a schematic diagram of an optional map resource loading solution according to an embodiment of the present invention;

FIG. 6 schematically shows a schematic diagram of an optional historical track according to an embodiment of the present invention;

FIG. 7 schematically shows a schematic diagram of an optional map resource loading apparatus according to an embodiment of the present invention; and,

FIG. 8 schematically shows a structural block diagram of a terminal according to an embodiment of the present invention;

Figure 9 schematically shows a block diagram of a computer device for implementing the method according to the invention; and

Figure 10 schematically shows a block diagram of a computer program product implementing the method according to the invention.

Detailed ways

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

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

After analyzing the related technology, the inventor realized that the large map area resource loading mode in the related art is designed by the game developer, and this loading strategy is a time-independent static strategy. The loading mode of resources in the large map area based on the static loading strategy has some defects that are difficult to balance: for example, if the game designer designs the strategy to be relatively conservative (such as using a stable trigger mechanism with low resource waste), the map area Resource loading will be relatively lag; if the strategy is designed to be relatively aggressive (that can easily trigger resource loading), resource loading in the map area will cause a high probability of waste, because the probability of players entering the loaded area is relatively high. Small.

Considering that with the passage of game operation time and the increase of the total number of players, the group behavior trajectories of the characters controlled by the players on the big map will become more concentrated and regular. The loading strategy often has a certain deviation, and the deviation will not generate negative feedback as the correction input of the loading strategy in real time, so the deviation will not be corrected spontaneously, and the current strategy lacks the ability to dynamically self-improve and correct.

In order to overcome the above problems, according to an aspect of the embodiments of the present invention, a method embodiment of a method for loading a map resource is provided.

In some embodiments, the above method can be applied to the hardware environment composed of the terminal 101 and the server 103 as shown in FIG. 1 . As shown in FIG. 1 , the server 103 is connected to the terminal 101 through the network, which can be used to provide services (such as game services, etc.) for the terminal or the client installed on the terminal, and the database 105 can be set on the server or independently from the server, for To provide data storage services for the server 103, the above-mentioned networks include but are not limited to: a wide area network, a metropolitan area network or a local area network, and the terminal 101 is not limited to a PC, a mobile phone, a tablet computer, and the like.

The method according to the embodiment of the present invention may be executed by the server 103 , may also be executed by the terminal 101 , or may be executed jointly by the server 103 and the terminal 101 . The following description will be given by taking the above method running on a terminal as an example. The terminal 101 may also execute the method according to the embodiment of the present invention by a client installed on the terminal 101 .

Fig. 2 schematically shows a flowchart of an optional map resource loading method according to an embodiment of the present invention. As shown in Fig. 2, the method may include step S202, step S204 and step S206.

In step S202, when the preloading condition of the game map is satisfied, the first area in the game map where the target character is currently located is determined, and the target character is the game character controlled by the user terminal. The game client of the game application is installed on the user terminal, and the player can control the game characters in the game scene through the game client. The above preloading condition is used to trigger the execution of an operation of selecting a preloading area from a plurality of areas (ie, an operation corresponding to a subsequent step).

In step S204, a prediction result is obtained according to the historical trajectory of the game character, and a second area in the plurality of areas is determined according to the prediction result, and the prediction result is used to indicate the area to be entered by the target character in the plurality of areas predicted by the historical trajectory, The second area is the area where the map resource is to be loaded, and the second area is adjacent to the first area.

When determining the second region among the multiple regions according to the prediction result, the region predicted by the prediction result can be directly used as the second region; or the region predicted by the prediction result and the region determined according to the static loading strategy can be comprehensively considered to determine the second region. area.

The historical trajectory of the above-mentioned game character includes the following situations: 1) the game character represents all game characters, that is, the trajectory of all game characters can be used as the historical trajectory; 2) the game character represents the target character, that is, only the trajectory of the target character is used. As a historical track; 3) The game character represents a similar character of the target character, that is, only the trajectory of the similar character of the target character is used as a historical track.

When determining similar characters of the target character, the eigenvalues of the game character in multiple feature dimensions (such as region, character type, character attribute, etc.) can be determined, and the eigenvalues can be vector values obtained by mapping in the vector space. The feature dimension corresponds to a weight, and the sum of the weights corresponding to all feature dimensions is 1; the similarity P between each game character and the target character is calculated according to the following formula,

n represents the number of multiple feature dimensions, ki represents the weight of the _{ith feature dimension, M i represents} the feature value of the target character on the ith feature dimension, and N _i represents the value of the game character on the ith feature dimension Eigenvalue, f(M _i ,N _i ) represents the Euclidean distance between the target character and the game character in the ith feature dimension. For the calculated P, when P is less than a certain threshold (such as 0.2), it is equivalent to The game character is similar to the target character and is of the same kind, otherwise it is not.

In step S206, the map resource of the second area is loaded in the user terminal.

Considering that with the passage of game operation time and the increase of the total number of players, the group behavior trajectories of the characters controlled by the players on the big map will become more concentrated and regular. Determining the results conforming to the above rules, and then determining the area that the player is about to enter, can solve the technical problem of low accuracy of map area loading in the related art.

For the scene of resource loading in the large map area, this solution mainly solves how to predict and load the map area resources that the user will use in the next step. Compared with the static loading strategy in related technologies, the real-time dynamic of the player's historical trajectory data on the loading strategy is added. Feedback correction to improve the prediction accuracy and resource usage rate of resource loading in the large map area.

In other embodiments, the method for loading map resources of the present invention may include the following steps 1, 2, 3 and 4, and the technical solution of the present invention will be further described in detail below with reference to the specific steps.

In step 1, the game map of the game scene is divided into multiple areas, for example, the game map can be divided into multiple box areas as shown in FIG. 3 .

In step 2, when the player controls the game character to play the game, in the case of satisfying the preloading condition of the game map, determine the first area in the game map where the target character is currently located.

The preloading conditions include but are not limited to the following: when the target character enters the first area from one of the multiple areas, it is determined that the preloading conditions of the game map are satisfied; when the target character reaches the target in the first area When the location (for example, the depth of entering the first area reaches a certain depth or near the edge of the area), it is determined that the preloading conditions of the game map are satisfied; when the target character triggers a specific plot or a specific game mission, it is determined that the game map is satisfied. In the preloading condition, the first region is associated with a specific plot or a specific game task, for example, the specific plot or a specific game task is developed in a series of regions, and the series of regions includes the first region.

In step 3, the map loading strategy is triggered to determine the second area of the map resource to be loaded.

As shown in FIG. 4 , the map loading strategy includes a dynamic loading strategy and/or a static loading strategy, that is, a static loading strategy or a dynamic loading strategy may be used alone here, or a combined loading strategy of the two may be used.

Option 1, run the static loading strategy separately

Under the static loading strategy, when the character controlled by the player enters the current area, it often needs to perform several operations, such as triggering the buried point arranged in advance by the game developer, or completing the specified task, etc. The trigger timing is often delayed. For example, if a trigger and a buried point are placed at a specified position, when the player enters the trigger area, the loading of resources in the specified map area will be triggered; according to the distance between the current camera and the boundary of the specified area, the detail level of the resource loading in the area will be determined; according to the player A series of trigger conditions are established by manipulating the character's level and the completion of game tasks. However, over time, the accumulation of player behavior in the game does not affect the loading strategy developed by the game developer.

Option 2, run the dynamic loading strategy separately

When the character operated by the player triggers the timing of loading the resources of the predicted area in the current area, as shown in Figure 5, according to the historical trajectory data of all players in the game or the player himself in the big map, the largest number of trajectories is selected according to the weight of the same trajectory times. Probabilistic future route. When the maximum probability is greater than or equal to the preset loading probability threshold, the next area is predicted according to the trajectory route and the resource loading behavior is performed in advance. For the specific implementation method of using the dynamic loading strategy, please refer to Scheme 3. description of.

Option 3: Run a comprehensive loading strategy

The comprehensive loading strategy adopts a combination of dynamic loading strategy and static loading strategy to realize the loading of map area resources. The overall implementation framework is shown in Figure 4. In the comprehensive loading strategy, the player's historical operation data (that is, the historical trajectory corresponding to data) and the division method of the big map area to determine the player's action trajectory in the big map, so as to dynamically strengthen and correct the regional resource loading strategy according to the action trajectory, and determine and load the regional resources that the player will use in the future. The solution can be implemented through the following steps 31, 32 and 33:

In step 31, the dynamic loading strategy is run, and the third area to be entered by the target character in the multiple areas is predicted by using the historical trajectory.

Find the first target track that has passed through each map area in the first area sequence from the historical track. The first area sequence includes multiple map areas that the target character passes through in sequence, and the last map area in the first area sequence is the first area sequence. An area; the area entered after passing through the first area according to the first target trajectory among the multiple areas is taken as the third area.

The maximum historical step size can be determined first, that is, the first area and the number of continuous areas that pass before the first area. These continuous areas can be represented by the first area sequence, as shown in Figure 6, as the first area sequence includes The multiple map areas that the target character passes through in sequence are D ₀ , C ₀ , C ₁ , and B ₁ , and it is determined that the track that has passed through each area in the first region sequence in the historical track is the first target track, and the first target track may include The difference between these multiple first target trajectories is that the next area (that is, the first candidate area) that passes through the first area is different. For example, the third area that may enter from B ₁ is A ₂ , C ₂ .

In step 32, when the target character satisfies the triggering condition of the static loading strategy in the first area, a sixth area to be entered by the target character is obtained.

In step 33, the second area is selected from the area set including the third area and the sixth area.

In some embodiments, step 33 may further include the following steps 331 , 332 , 333 and 334 .

In step 331, the first candidate area determined according to the historical track is the first probability that the target character is to enter the area to be entered.

If there are multiple first candidate regions (each first candidate region corresponds to a first target trajectory), for each first target trajectory, when calculating its first probability, the first number of times the game character can be obtained (that is, the cumulative number of times the game character has passed through all the first target trajectories) and the second number of times, where the second number of times is the first specified trajectory of the game character to all the first target trajectories (that is, the first target trajectory for which the first probability is currently to be calculated) ) of the accumulated times; the ratio between the second times and the first times is taken as the first probability of the current candidate area.

For example, when the character operated by the player triggers the timing of loading the predicted area resources in the current area, the current area is simultaneously connected to a maximum of 8 areas (these 8 areas are equivalent to the third area, and the third area may only be partially adjacent in the actual process). area) adjacent, as shown in Figure 6, the eight areas around B ₁ , according to the dynamic loading strategy in the above way to calculate the predicted probability of all adjacent areas to enter, such as in the historical trajectory, the first possible entry from B ₁ The number of times that the three areas have A ₂ is 2, and the number of times that the third area that may be entered from B ₁ has C ₂ is 8 times, then the probability of the former is 20%, and the probability of the latter is 80%.

In step 332, when the target character satisfies the trigger condition in the first area, a second probability that the first candidate area is the area to be entered by the target character is obtained.

The probability of entering all adjacent areas can be calculated according to the static loading strategy (common loading strategies formulated by game developers, including buried point triggering or task status, etc.).

In step 333, the first product between the first probability and the weight α of the first probability, the second product between the second probability and the weight (1-α) of the second probability are determined, and the third product and the fourth The sum of the products is used as the comprehensive predicted probability of the first candidate region.

At step 334, a second region is selected from the set of regions according to the comprehensive predicted probability.

When the comprehensive prediction probability is greater than the target threshold (the target threshold is smaller than the loading probability threshold, which can be 80%), the region with the largest comprehensive prediction probability may be selected from the region set as the second region, that is, two sets of The probability data calculates the comprehensive prediction probability according to the strategy weights of α and (1-α) respectively, and selects the target area (ie the second area) with the largest comprehensive prediction probability.

In the case that the comprehensive prediction probability is not greater than the target threshold, the region with the highest first probability is selected from the region set as the second region, or the region with the second largest probability is selected from the region set as the second region, or it can be selected from all the first regions. The region corresponding to the largest probability among the first probability and the second probability is selected as the second region.

Run the dynamic loading strategy, and obtain the prediction result according to the historical trajectory of the game character. The prediction result represents the third area that the target character will enter among the multiple areas predicted by the historical trajectory, and select one of the third areas as the second area. For example, choose the one with the highest predicted probability.

It should be noted that, considering that the user's behavioral trajectory will show regularity, for example, he will go to a designated location to participate in a specific activity for a period of time, and the user's behavior will change after the activity ends. Therefore, the regularity of the previous period may not be the same. Applies to forecasts for a later period of time. The weight α is initially a fixed value (such as 0.5) and can be adjusted over time as follows:

Obtain the prediction accuracy rate of the previous period (such as the previous week): prediction accuracy rate = the number of times that the results predicted by the dynamic loading strategy are consistent with the results predicted by the comprehensive loading strategy/the total number of prediction times; if the prediction accuracy rate reaches a certain threshold (such as 80%) ), increase the value of the weight α (eg +0.1); if the prediction accuracy is within a certain range (eg 50%-80%), keep the value of the weight α; if the prediction accuracy is lower than a certain threshold (eg 50 %), then reduce the value of the weight α (such as -0.1).

Compared with the static loading strategy, the resource loading behavior under the comprehensive loading strategy has a better prediction of the area that the player will enter next, so the resource loading behavior of the predicted area can be predicted earlier, and the resource loading under the comprehensive loading strategy can be loaded. The trigger timing of the behavior is based on the level of timing advance or lag, including but not limited to the following three.

The first is that when the character controlled by the player enters the current area, the trigger calculation is performed and the resources of the next predicted area are loaded. The loading time of this solution is the earliest, and the advantage is that it has the most sufficient time to slowly load the area, so that the computing performance cost during the loading process is minimal, and the impact on the player's operating experience is minimal. However, this timing represents α=100%, which is a 100% dynamic loading strategy and lacks a static loading strategy as a decision aid.

The second is when the character controlled by the player enters the current area and the displacement relative to the entry point exceeds a specified threshold (such as 0.5 times the diagonal length of the square area), the trigger calculation is performed and the next prediction area is loaded. Resources. The loading timing of this scheme is moderate, and it has a relatively long time to load the area, so that the computing performance cost and the impact on the player's operating experience during the loading process are moderate. This timing represents α<100%. On the basis of the predicted probability of the dynamic loading strategy, the static loading strategy is added to correct the probability.

The third is that when the player leaves the current area, the trigger calculation is performed and the resources of the next prediction area are loaded. This solution is a guaranteed solution. After the loading time, it has the least time to load the target area, and the player experience is relatively poor. However, the advantage of this processing timing is that the prediction accuracy rate reaches 100%, so it can be used as a bottom-line solution.

To sum up, game developers can choose the first solution plus the third trigger timing guarantee or the second plus the third trigger timing guarantee according to the specific situation of the map.

In step 4, the map resource of the second area is loaded in the user terminal.

In some embodiments, the method for loading map resources of the present invention may further include step 5: after selecting the second region with the highest comprehensive prediction probability from the plurality of regions, when the comprehensive maximum prediction probability is greater than or equal to a preset loading probability When the threshold value (such as 90%) is reached, the next area is predicted according to the trajectory and the resource loading operation is performed in advance (for the specific implementation, please refer to the above).

In some embodiments, step 5 may further include the following steps 51 , 52 , 53 and 54 .

In step 51, the third and fourth times of the game character are obtained, where the third time is the cumulative number of times the game character has passed through all the second target trajectories, and the third time is the second designated trajectory of the game character to all the second target trajectories. The second target trajectory is the trajectory that has passed through each map area in the second area sequence in the historical trajectory, and the second area sequence includes multiple map areas that the target character passes through in sequence and the last one in the second area sequence. One map area is the second area, the second specified track is the track of all the second target trajectories passing through each map area in the second area sequence and the second candidate area in sequence, and the second candidate area is the second candidate area among the multiple areas. Regions that are adjacent to each other.

In step 52, the ratio between the fourth time and the third time is used as the third probability of the second candidate region.

In step 53, a third product between the third probability and the weight of the third probability, and a fourth product between the fourth probability and the weight of the fourth probability are determined, and the sum of the third product and the fourth product is used as the second product The overall predicted probability of the candidate region.

In step 54, a fourth region is selected from the plurality of second candidate regions according to the comprehensive prediction probability, where the fourth region is a map region to be loaded with map resources, and the selection method of the fourth region is similar to that of the second region.

In other embodiments, the method for loading map resources of the present invention may further include step 6: after obtaining the prediction result according to the historical trajectory of the game character, and determining the second area in the multiple areas according to the prediction result, the target character In the case of moving to the area boundary of the first area and the area boundary is not the area boundary of the second area, that is, in the case of an error in prediction, the following scheme is adopted to make a bottom line: determine the fifth area adjacent to the area boundary; in the user terminal Load the map resource of the fifth area.

It can be seen from the aforementioned analysis of related technologies that the loading of resources in the map area ultimately serves the player's experience of moving through the map, but the actual operation and usage data of the player is not adopted in the formulation of the entire strategy. Then, using the player's actual behavioral trajectory data in the big map to feed back the resource loading strategy of the big map area, so as to improve the loading prediction accuracy and resource utilization rate, has high application significance.

As an optional embodiment, the technical solution of the present invention is further described in detail below in conjunction with the specific embodiments:

For the player's historical behavior trajectory data model and processing storage in the dynamic loading strategy, for a particular large map, its player historical trajectory data is the sum of all the single historical behavior trajectory data previously passed by all players or the current player. In the case of all players, this data is stored on the game server, and in the case of the current player, the data can be stored on the local device.

A single player’s historical behavior track data refers to: a character controlled by the player enters the big map, the midway area identification, and the player leaves the big map (the way to leave includes: leaving from the exit, teleporting, closing the game, etc.) Trajectory chain of the region experienced. As shown in Figure 6, this trajectory has been walked 10 times in the player's historical trajectory:

D ₀ →C ₀ →B ₀ →A ₀ →B ₁ →B ₂ →A ₃

Because in the same big map, the behavior patterns of players in different periods and the behavior patterns of different players are diverse, so there will be various possible historical trajectories, and there will be a centralized trend. As shown in Figure 6, in the player's historical trajectory, there are two divergences after reaching point B1. The first trajectory goes to A2, and this trajectory has gone through 4 times:

D ₀ →C ₀ →C ₁ →B ₁ →A ₂

The second trajectory goes to C2, and this trajectory travels 16 times:

D ₀ →C ₀ →C ₁ →B ₁ →C ₂

After there are several sets of individual player trajectory data, statistical modeling processing is required for these data. The basic idea is that if the player has followed this trajectory in large numbers, use this as a benchmark to predict the area that the player will reach next. That is, in FIG. 6 , when the character controlled by the player currently walks a certain path, the area that is most likely to be entered next is predicted according to historical data.

In the calculation process, in order to measure the reference standard of the past trajectory length, the concept of the maximum historical step size needs to be introduced: the maximum number of area chains is recorded as a piece of historical data. Because when the number of map areas is m, the player may pass through an infinite number of area nodes continuously, so the strategy should only care about the historical data in the player's fixed mode, that is, the history of the maximum k steps before the current area node trajectory. It can be known that when the player is in a certain area, the number of historical trajectory possibilities Np_max has is:

N _{p_max} =m ^k ,

Table 1

Np_max	m=9	m=16	m=25
k=2	81	256	625
k=3	729	4096	15625
k=4	6561	65536	390625

As shown in Table 1, it can be seen that when the number of large map areas and the maximum number of historical steps increase, the types of possible routes are also greatly increased, and the data that needs to be stored and statistics is more complicated. history step. Usually 3 or 4 is selected as the maximum historical step size.

After having the stored player's historical behavior trajectory data in the specified big map and the determined maximum historical step size, the prediction area can be calculated according to the dynamic loading strategy.

In the dynamic loading strategy, the probability can be calculated based on the prediction area of the player's historical behavior trajectory data. When the player's historical trajectory data continues to increase and accumulate, there is a preliminary scale of statistical data, and can continue to be enhanced based on new trajectory data. Taking the above map 6 as an example, assuming that the maximum historical trajectory step size is 3, the probability is shown in Table 2:

Table 2

current subregion

track route

predictor subregion

Historical track frequency

Historical Trajectory Probability

B 1	D 0 →C 0 →C 1	A 2	4	0.2
B 1	D 0 →C 0 →C 1	C 2	16	0.8
B 1	C 0 →B 0 →A 0	B 2	25	1.0

As shown in Table 2, assuming that the player has just entered the B1 area, the current trajectory route is D ₀ →C ₀ →C ₁ →B ₁ , according to the historical trajectory statistics, the player may enter the A2 area or the C2 area next, according to the frequency statistics can be It is concluded that the probability of entering the A2 area is 0.8, which is the maximum probability prediction area in this trajectory. Therefore, the map resources in the A2 area are streamed. When the player enters the A2 area, the area resources are already loaded.

In addition to the comprehensive loading strategy, according to the above, when the comprehensive loading strategy is triggered at the specified loading time, the dynamic prediction probability calculated by the dynamic loading strategy and the static prediction probability calculated by the static loading strategy will be calculated according to α and (1. The weight of -α) is used to calculate the weighted comprehensive prediction probability. If the predicted probability of the target area with the highest comprehensive predicted probability is lower than the trigger probability threshold, or if the player does not enter the predicted area (prediction failure), the traditional static loading strategy or the guaranteed loading timing method is adopted to ensure the correct experience for the player.

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

In the technical solution of the present invention, implementing a resource loading strategy in a large game scene area based on the player's historical behavior track data in the big map can improve the loading prediction accuracy and resource utilization rate, and make the game run more smoothly.

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

According to another aspect of the embodiments of the present invention, there is also provided a map resource loading apparatus for implementing the above-mentioned map resource loading method. FIG. 7 schematically shows a schematic diagram of an optional map resource loading apparatus according to an embodiment of the present invention. As shown in FIG. 7 , the apparatus may include a search unit 701 , a determination unit 703 and a loading unit 705 .

The search unit 701 is configured to determine the first area where the target character is currently located in the game map under the condition of satisfying the preloading condition of the game map, wherein the game map is divided into multiple areas, and the first area belongs to multiple areas, The preloading condition is used to trigger the operation of selecting a preloading area from multiple areas, and the target character is a game character controlled by the user terminal.

In the case that the target character enters the first area from one of the plurality of areas, it is determined that the preloading condition of the game map is satisfied; when the target character reaches the target in the first area In the case of the location, it is determined that the preloading conditions of the game map are met; when the target character triggers a specific plot or a specific game mission, it is determined that the preloading conditions of the game map are met, wherein the first area exists with a specific plot or a specific game mission. association.

The determining unit 703 is used to obtain the result according to the historical trajectory of the game character, and determine the second area in the multiple areas according to the result, wherein the result is used to represent the area to be entered by the target character in the multiple areas obtained by using the historical trajectory, The second area is the area where the map resource is to be loaded, and the second area is adjacent to the first area.

The loading unit 705 is configured to load the map resource of the second area in the user terminal.

It should be noted that the searching unit 701 in this embodiment may be used to perform step S202 in this embodiment of the present invention, and the determining unit 703 in this embodiment may be used to perform step S204 in this embodiment of the present invention. The loading unit 705 in can be used to perform step S206 in this embodiment of the present invention.

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

Considering that with the passage of game operation time and the increase of the total number of players, the group behavior trajectories of the characters controlled by the players on the big map will become more concentrated and regular. Determining the results conforming to the above rules, and then determining the area that the player is about to enter, can solve the technical problem of low accuracy of map area loading in the related art.

In some implementations, the determining unit may be further configured to obtain a result according to the historical trajectory of the game character, and determine the second area in the plurality of areas according to the result, and use the historical trajectory for the plurality of areas The third area to be entered by the target character in the three areas, and the second area is selected from the area set including the third area, wherein the area set further includes the result obtained when the target character satisfies the trigger condition in the first area Describe the area the target character is going to enter.

In some embodiments, the determining unit may be further configured to, when using the third area in the plurality of areas of the historical trajectory to be entered by the target character, find out the sequence of the first areas that have passed through the first area sequence from the historical trajectory. The first target trajectory of each map area. In some embodiments, the first area sequence includes a plurality of map areas that the target character passes through in sequence, and the last map area in the first area sequence is the The first area; the area entered after passing through the first area according to the first target trajectory among the multiple areas is taken as the third area.

In some implementations, the determining unit may be further configured to use the historical track to use a third area to be entered by the target character in the plurality of areas, and select the area set including the third area. When the second area is used, the first probability and the second probability corresponding to each first candidate area in the area set are obtained. In some embodiments, the first probability is the first candidate determined according to the historical track. The area is the probability of the area to be entered by the target character, and the second probability is that the first candidate area obtained when the target character satisfies the trigger condition in the first area is the target character the probability of entering the area; determine the first product between the first probability and the weight of the first probability, and the second product between the second probability and the weight of the second probability, The sum of the first product and the second product is used as the comprehensive probability of the first candidate region; the second region is selected from the region set according to the comprehensive probability.

In some embodiments, the determining unit may be further configured to, when selecting the second region from the set of regions according to the integrated probability, select an integrated probability from the set of regions in the case that the integrated probability is greater than a target threshold The largest area is used as the second area; if the comprehensive probability is not greater than the target threshold, the area with the largest first probability is selected from the area set as the second area, or the area is selected from the area The region with the highest second probability in the set is selected as the second region.

In some embodiments, the determining unit may be further configured to obtain the first probability corresponding to each first candidate region in the region set including determining the first probability corresponding to each of the first candidate regions in the following manner: obtaining a game character The corresponding first and second times, in some embodiments, the first number of times is the cumulative number of times the game character has passed all the first target trajectories, and the second number of times is the game character's cumulative pass times of all the first target trajectories. The cumulative number of times of the first designated track in the track, the first designated track is the track that sequentially passes through each map area in the first region sequence and the current candidate area among all the first target tracks, and the current candidate track The region is the currently processed candidate region in all the first candidate regions; the ratio between the second number of times and the first number of times is used as the first probability of the current candidate region.

In some embodiments, the determining unit may be further configured to, after selecting the second area with the highest comprehensive probability from the area set, obtain the third area of the game character when the comprehensive probability is greater than the loading probability threshold The number of times and the fourth number of times, in some embodiments, the third number of times is the cumulative number of times the game character passes through all the second target trajectories, and the third number of times is the second specified trajectory of the game character to all the second target trajectories. The second target trajectory is a trajectory that has successively passed through each map area in the second area sequence in the historical trajectory, and the second area sequence includes a plurality of map areas that the target character has passed through in sequence And the last map area in the second area sequence is the second area, and the second designated trajectory is all the second target trajectories passing through each map area and the first area in the second area sequence in sequence. The trajectory of two candidate regions, the second candidate region is the region adjacent to the second region among the multiple regions; the ratio between the fourth number of times and the third number of times is taken as the first The third probability of the second candidate area; determine the third product between the third probability and the weight of the third probability, and the fourth product between the fourth probability and the weight of the fourth probability, The sum of the product and the fourth product is used as the comprehensive probability of the second candidate region; the fourth region is selected from the plurality of second candidate regions according to the comprehensive probability, wherein the fourth region is the map resource to be loaded map area.

In some embodiments, the determining unit may be further configured to obtain a result according to the historical trajectory of the game character, and after determining the second area in the plurality of areas according to the result, after the target character moves to the first area If the area boundary of the area is not the area boundary of the second area, determine a fifth area adjacent to the area boundary; load the map resource of the fifth area in the user terminal .

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

According to another aspect of the embodiments of the present invention, a server or terminal for implementing the above method for loading map resources is also provided.

FIG. 8 schematically shows a structural block diagram of a terminal according to an embodiment of the present invention. As shown in FIG. 8 , the terminal may include: one or more (only one is shown) a processor 801, a memory 803, As well as the transmission device 805, as shown in FIG. 8, the terminal may further include an input and output device 807.

In some embodiments, the memory 803 may be used to store software programs and modules, such as program instructions/modules corresponding to the method and apparatus for loading map resources in the embodiments of the present invention. The processor 801 executes the software programs stored in the memory 803 by running the software program and modules to perform various functional applications and data processing, that is, to implement the above-mentioned method for loading map resources. Memory 803 may include high-speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some instances, the memory 803 may further include memory located remotely relative to the processor 801, and these remote memories may be connected to the terminal through a network. Examples of such networks include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

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

In some implementations, memory 803 is used to store application programs.

The processor 801 can call the application program stored in the memory 803 through the transmission device 805 to perform the following steps:

In the case that the preloading condition of the game map is satisfied, the first area in the game map where the target character is currently located is determined. In some embodiments, the game map is divided into multiple areas, the first area belongs to multiple areas, and the preloading The condition is used to trigger the operation of selecting a preloaded area from multiple areas, and the target character is the game character controlled by the user terminal;

The prediction result is obtained according to the historical trajectory of the game character, and the second area in the multiple areas is determined according to the prediction result. In some embodiments, the prediction result may be used to indicate the target character is to enter in the multiple areas predicted by using the historical trajectory. area, the second area is the area where the map resource is to be loaded, and the second area is adjacent to the first area;

Load the map resource of the second area in the user terminal.

The processor 801 is further configured to perform the following steps:

In the case that the comprehensive predicted probability is greater than the loading probability threshold, the third and fourth times of the game character are obtained. In some embodiments, the third time is the cumulative number of times the game character passes through all the second target trajectories, and the third time It is the cumulative number of times the game character has passed through the second specified trajectory in all second target trajectories. The second target trajectory is the trajectory in the historical trajectory that has passed through each map area in the second area sequence, and the second area sequence includes the target characters in sequence. Multiple map areas that have passed through and the last map area in the second area sequence is the second area, and the second designated track is all the second target trajectories that pass through each map area in the second area sequence and the second candidate area in turn. track, the second candidate area is an area adjacent to the second area among the multiple areas;

Taking the ratio between the fourth time and the third time as the third probability of the second candidate region;

determining a third product between the third probability and the weight of the third probability, a fourth product between the fourth probability and the weight of the fourth probability, and summing the third product and the fourth product and as the comprehensive probability of the second candidate region;

A fourth area is selected from a plurality of the second candidate areas according to the comprehensive probability, wherein the fourth area is a map area to be loaded with a map resource.

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

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

Various component embodiments of the present invention may be implemented in hardware, or in software modules running on one or more processors, or in a combination thereof. Those skilled in the art should understand that a microprocessor or a digital signal processor (DSP) may be used in practice to implement some or all functions of some or all components of the map resource loading apparatus according to the embodiment of the present invention. The present invention can also be implemented as a program/instruction (e.g., computer program/instruction and computer program product) for an apparatus or apparatus for performing some or all of the methods described herein. Such programs/instructions implementing the present invention may be stored on a computer readable medium, or may exist in the form of one or more signals, such signals may be downloaded from an Internet website, or provided on a carrier signal, or in any form Available in other formats.

Embodiments of the present invention also provide a computer-readable medium. In some embodiments, the above-mentioned computer-readable medium can be used to execute the program code of the loading method of the map resource.

In some embodiments, computer readable media, including persistent and non-permanent, removable and non-removable media, can be implemented by any method or technology for information storage. Information may be computer readable instructions, data structures, modules of programs, or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read only memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), Flash Memory or other memory technology, Compact Disc Read Only Memory (CD-ROM), Digital Versatile Disc (DVD) or other optical storage, Magnetic tape cartridges, disk storage, quantum memory, graphene-based storage media or other magnetic storage devices or any other non-transmission media can be used to store information that can be accessed by computing devices.

FIG. 9 schematically shows a computer device that can implement the method for loading map resources according to the present invention. In some embodiments, the computer device includes a processor 910 and a computer-readable medium in the form of a memory 920 . The memory 920 is an example of a computer-readable medium having a storage space 930 for storing the computer program 931 . When the computer program 931 is executed by the processor 910, each step in the method for loading map resources described above can be implemented.

Figure 10 schematically shows a block diagram of a computer program product implementing the method according to the invention. The computer program product includes a computer program 1010 that, when executed by a processor such as the processor 910 shown in FIG. 9 , can implement the various steps in the above-described method for loading map resources .

Specific embodiments of this specification have been described above, and other embodiments are intended to be included within the scope of the appended claims. In some cases, the actions or steps recited in the claims can be performed in an order different from that in the embodiments and still achieve desirable results. Additionally, the processes depicted in the figures do not necessarily follow the specific order shown, or sequential order, to achieve desirable results. In certain embodiments, multitasking and parallel processing are also possible or advantageous.

It should also be noted that the terms "comprising", "comprising" or any other variation thereof are intended to encompass a non-exclusive inclusion such that a process, method, article or device comprising a series of elements includes not only those elements, but also Other elements not expressly listed, or which are inherent to such a process, method, article of manufacture, or apparatus are also included. Without further limitation, an element qualified by the phrase "comprising a..." does not preclude the presence of additional identical elements in the process, method, article of manufacture, or device that includes the element.

It should be understood that the above-mentioned embodiments are only for the purpose of illustrating the present invention and not for limiting the present invention. Those skilled in the art can also implement the present invention in other ways without departing from the basic spirit and characteristics of the present invention. The scope of the present invention shall be determined by the appended claims, and any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of one or more embodiments of this specification shall be covered therein.

Claims (13)

1. A method for loading map resources, including:

   In the case that the preloading condition of the game map is satisfied, the first area in the game map where the target character is currently located is determined, the game map is divided into multiple areas, and the first area belongs to the multiple areas, The preloading condition is used to trigger and execute an operation of selecting a preloading area from the multiple areas, and the target character is a game character controlled by the user terminal;

   A prediction result is obtained according to the historical trajectory of the game character, and a second area in the plurality of areas is determined according to the prediction result, and the prediction result is used to represent all areas in the plurality of areas predicted by using the historical trajectory the area to be entered by the target character, the second area is an area to be loaded with map resources, and the second area is adjacent to the first area;

   Load the map resource of the second area in the user terminal.
2. The method according to claim 1, wherein obtaining a prediction result according to the historical trajectory of the game character, and determining the second area in the plurality of areas according to the prediction result comprises:

   Use the historical trajectory to predict a third area in the plurality of areas that the target character is to enter, and select one of the third areas as the second area; or,

   Predicting a third area to be entered by the target character in the plurality of areas by using the historical trajectory, and selecting the second area from an area set including the third area, where the area set further includes the other areas to be entered by the target character obtained when the target character satisfies the trigger condition in the first area.
3. The method according to claim 2, wherein predicting a third area to be entered by the target character in the plurality of areas using the historical trajectory comprises:

   Find a first target trajectory that has passed through each map area in the first area sequence from the historical trajectory, where the first area sequence includes a plurality of map areas that the target character passes through in sequence, and the first area sequence The last map area in is the first area;

   An area of the plurality of areas that enters after passing through the first area according to the first target trajectory is taken as the third area.
4. The method according to claim 2 or 3, wherein a third area to be entered by the target character in the plurality of areas is predicted by using the historical trajectory, and selected from a set of areas including the third area The second area includes:

   Obtain a first probability and a second probability corresponding to each of the first candidate regions in the region set, where the first probability is the probability that the first candidate region determined according to the historical trajectory is the to-be-entered region of the target character. prediction probability, the second probability is the probability that the first candidate area obtained when the target character satisfies the trigger condition in the first area is the area to be entered by the target character;

   determining a first product between the first probability and the weight of the first probability, a second product between the second probability and the weight of the second probability, and combining the first product with the The sum of the second products is used as the comprehensive prediction probability of the first candidate region;

   The second region is selected from the set of regions according to an integrated predicted probability.
5. 5. The method of claim 4, wherein selecting the second region from the set of regions according to an integrated predicted probability comprises:

   In the case that the comprehensive prediction probability is greater than the target threshold, the region with the largest comprehensive prediction probability is selected from the region set as the second region;

   Under the condition that the comprehensive prediction probability is not greater than the target threshold, select the region with the highest first probability from the region set as the second region, or select the region with the second highest probability from the region set as the second region.
6. The method of claim 4, wherein obtaining the first probability of each first candidate region in the set of regions comprises determining the first probability of each of the first candidate regions as follows:

   Acquire the first and second times corresponding to the game character, where the first time is the cumulative number of times the game character has passed to all the first target trajectories, and the second time is the number of times the game character has passed through all the first target trajectories. The cumulative number of times of a specified trajectory, the first specified trajectory is the trajectory that passes through each map area in the first area sequence and the current candidate area in sequence among all the first target trajectories, and the current candidate area is all the first target trajectories. The currently processed candidate region in the candidate region;

   The ratio between the second number of times and the first number of times is used as the first probability of the current candidate region.
7. The method according to claim 4, wherein after selecting the second region with the highest comprehensive prediction probability from the region set, the method further comprises:

   In the case that the comprehensive predicted probability is greater than the loading probability threshold, the third and fourth times corresponding to the game character are obtained, where the third time is the cumulative number of times the game character passes through all the second target trajectories, and the third The number of times is the cumulative number of times the game character has passed through the second specified trajectory in all second target trajectories. The region sequence includes a plurality of map regions that the target character passes through in sequence, and the last map region in the second region sequence is the second region, and the second designated track is one of all the second target tracks. Passing through the tracks of each map area and a second candidate area in the second area sequence in sequence, where the second candidate area is an area adjacent to the second area in the plurality of areas;

   taking the ratio between the fourth time and the third time as the third probability of the second candidate region;

   determining a third product between the third probability and the weight of the third probability, a fourth product between the fourth probability and the weight of the fourth probability, and summing the third product and the fourth product and as the comprehensive predicted probability of the second candidate region;

   A fourth area is selected from a plurality of the second candidate areas according to the comprehensive prediction probability, where the fourth area is a map area to be loaded with a map resource.
8. The method according to any one of claims 1 to 3, wherein after obtaining a prediction result according to the historical trajectory of the game character, and determining the second area in the plurality of areas according to the prediction result, the method Also includes:

   In the case that the target character moves to the area boundary of the first area and the area boundary is not the area boundary of the second area, determining a fifth area adjacent to the area boundary;

   Load the map resource of the fifth area in the user terminal.
9. The method according to any one of claims 1 to 3, further comprising one of the following:

   In the case that the target character enters the first area from one of the plurality of areas, determining that the preloading condition of the game map is satisfied;

   When the target character reaches the target position in the first area, determining that the preloading condition of the game map is satisfied;

   When the target character triggers a specific plot or a specific game task, it is determined that the preloading condition of the game map is satisfied, and the first area is associated with the specific plot or the specific game task.
10. A device for loading map resources, comprising:

    A search unit, configured to determine the first area in the game map where the target character is currently located under the condition that the preloading condition of the game map is satisfied, the game map is divided into multiple areas, and the first area belongs to the the multiple areas, the preloading condition is used to trigger the execution of an operation of selecting a preloading area from the multiple areas, and the target character is a game character controlled by the user terminal;

    A determination unit, configured to obtain a prediction result according to the historical trajectory of the game character, and determine a second area in the plurality of areas according to the prediction result, where the prediction result is used to represent the predicted result obtained by using the historical trajectory an area to be entered by the target character in multiple areas, the second area is an area to be loaded with map resources, and the second area is adjacent to the first area;

    A loading unit, configured to load the map resource of the second area in the user terminal.
11. A computer readable medium having stored thereon a computer program which, when executed by a processor, implements the steps of the method according to any one of claims 1 to 9.
12. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the computer program according to any one of claims 1 to 9 when the processor executes the computer program The steps of the method described in .
13. A computer program product comprising a computer program which, when executed by a processor, implements the steps of the method according to any one of claims 1 to 9.

Images