CN117224960A - Virtual scene path finding method and device, storage medium and electronic equipment - Google Patents

Abstract

The disclosure provides a virtual scene path finding method, a virtual scene path finding device, a storage medium and electronic equipment, and relates to the technical field of computers. The method is applied to a virtual scene, and is characterized in that the virtual scene comprises a first virtual scene unit and a second virtual scene unit, and comprises the following steps: determining an initial path-finding position and a target path-finding position in the virtual scene, wherein the initial path-finding position is positioned in a first virtual scene unit, and the target path-finding position is positioned in a second virtual scene unit; editing the first path finding grid according to the path finding grid cell data in the first virtual scene cell to obtain a first path finding path, and editing the second path finding grid according to the path finding grid cell data in the second virtual scene cell to obtain a second path finding path; and obtaining a target path finding path according to the first path finding path and the second path finding path, and carrying out path finding in the virtual scene based on the target path finding path. The virtual scene path finding method and device improve path finding efficiency of the virtual scene.

Description

Virtual scene path finding method and device, storage medium and electronic equipment

Technical Field

The disclosure relates to the field of computer technology, and in particular, to a virtual scene path-finding method, a virtual scene path-finding device, a computer readable storage medium and an electronic device.

Background

In game development, a path is generally required to be searched in a virtual scene to plan a motion path of a game character, and the path searching method in the related technology is large in memory occupation and easy to cause resource waste when applied to other geometric virtual scenes such as a spherical virtual scene, so that the system operation efficiency is low, and the path searching efficiency of the virtual scene is low.

Disclosure of Invention

The disclosure provides a virtual scene path finding method, a virtual scene path finding device, a computer readable storage medium and electronic equipment, so as to at least improve the problem of low path finding efficiency of the virtual scene to a certain extent.

Other features and advantages of the present disclosure will be apparent from the following detailed description, or may be learned in part by the practice of the disclosure.

According to a first aspect of the present disclosure, there is provided a method for finding a path of a virtual scene, applied to a virtual scene, wherein the virtual scene includes a first virtual scene unit and a second virtual scene unit, the method including: determining an initial path-finding position and a target path-finding position in the virtual scene in response to a path-finding request, wherein the initial path-finding position is positioned in the first virtual scene unit, and the target path-finding position is positioned in the second virtual scene unit; the first virtual scene unit comprises a first path finding grid, and the first path finding grid is used for finding paths in the first virtual scene unit; the second virtual scene unit comprises a second path finding grid, and the second path finding grid is used for finding paths in the second virtual scene unit; editing the first path finding grid according to the path finding grid cell data in the first virtual scene cell to obtain a first path finding path, and editing the second path finding grid according to the path finding grid cell data in the second virtual scene cell to obtain a second path finding path; and obtaining a target path finding path according to the first path finding path and the second path finding path, and carrying out path finding in the virtual scene based on the target path finding path.

According to a second aspect of the present disclosure, there is provided a routing device of a virtual scene, applied to the virtual scene, wherein the virtual scene includes a first virtual scene unit and a second virtual scene unit, the method includes: a path-finding position determining module configured to determine a start path-finding position and a target path-finding position in the virtual scene in response to a path-finding request, wherein the start path-finding position is located in the first virtual scene unit, and the target path-finding position is located in the second virtual scene unit; the first virtual scene unit comprises a first path finding grid, and the first path finding grid is used for finding paths in the first virtual scene unit; the second virtual scene unit comprises a second path finding grid, and the second path finding grid is used for finding paths in the second virtual scene unit; the path-finding grid editing module is configured to edit the first path-finding grid according to path-finding grid cell data in the first virtual scene cell to obtain a first path-finding path, and edit the second path-finding grid according to path-finding grid cell data in the second virtual scene cell to obtain a second path-finding path; the target path-finding path acquisition module is configured to obtain a target path-finding path according to the first path-finding path and the second path-finding path, and perform path-finding in the virtual scene based on the target path-finding path.

According to a third aspect of the present disclosure, there is provided a computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements the method of routing a virtual scene of the first aspect described above and possible implementations thereof.

According to a fourth aspect of the present disclosure, there is provided an electronic device comprising: a processor; and the memory is used for storing executable instructions of the processor. Wherein the processor is configured to perform the method of finding a path of a virtual scene of the first aspect and possible implementations thereof via execution of the executable instructions.

The technical scheme of the present disclosure has the following beneficial effects:

on the one hand, the first path-finding grid is edited according to the path-finding grid cell data in the first virtual scene cell to obtain a first path-finding path, the second path-finding grid is edited according to the path-finding grid cell data in the second virtual scene cell to obtain a second path-finding path, which virtual scene cell is loaded is realized, the path-finding grid in the virtual scene cell is loaded, all the path-finding grids in the virtual scene are not required to be loaded at one time, the memory occupation in the path-finding process of the virtual scene is reduced, the resource waste caused by loading all the path-finding grids at one time is reduced, and the system operation efficiency is effectively improved, so that the path-finding efficiency of the virtual scene is improved. On the other hand, the first path finding grid is edited according to the path finding grid unit data in the first virtual scene unit to obtain a first path finding path, so that the loading process of the path finding path is more detailed, and the realism of the path finding process of the virtual scene is further improved. In still another aspect, the path-finding grid editing processes in each virtual scene unit are independent of each other and do not affect each other, and the path-finding paths corresponding to each virtual scene unit can be loaded independently, so that the error rate of the path-finding path loading process is reduced, and the path-finding efficiency of the virtual scene is further improved.

It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the disclosure and together with the description, serve to explain the principles of the disclosure. It will be apparent to those of ordinary skill in the art that the drawings in the following description are merely examples of the disclosure and that other drawings may be derived from them without undue effort.

FIG. 1 illustrates a schematic diagram of a routing grid not being able to overlay a virtual scene;

FIG. 2 illustrates a system architecture of the operating environment of the present exemplary embodiment;

fig. 3 shows a flowchart of a method of finding a path of a virtual scene in the present exemplary embodiment;

FIG. 4 illustrates a flowchart of a method of editing a routing grid in the present exemplary embodiment;

fig. 5 shows a flowchart of a method of generating a routing grid in the present exemplary embodiment;

fig. 6 shows a flowchart of storing the first routing grid cell data in correspondence to the child bounding box in the present exemplary embodiment;

Fig. 7 is a schematic view showing a structure in which a virtual scene includes a plurality of routing grids in the present exemplary embodiment;

FIG. 8 illustrates a flowchart of one method of determining a target parent bounding box in the exemplary embodiment;

fig. 9 is a schematic diagram showing the structure of a virtual scene in the present exemplary embodiment;

fig. 10 is a schematic view showing a structure in which a virtual scene includes only one routing grid in the present exemplary embodiment;

fig. 11 is a schematic diagram showing the structure of a path-finding device of a virtual scene in the present exemplary embodiment;

fig. 12 shows a schematic structural diagram of an electronic device in the present exemplary embodiment.

Detailed Description

Example embodiments will now be described more fully with reference to the accompanying drawings. However, the exemplary embodiments may be embodied in many forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of the example embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a thorough understanding of embodiments of the present disclosure. However, those skilled in the art will recognize that the aspects of the present disclosure may be practiced with one or more of the specific details, or with other methods, components, devices, steps, etc. In other instances, well-known technical solutions have not been shown or described in detail to avoid obscuring aspects of the present disclosure.

Furthermore, the drawings are merely schematic illustrations of the present disclosure and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and thus a repetitive description thereof will be omitted. Some of the block diagrams shown in the figures are functional entities and do not necessarily correspond to physically or logically separate entities. These functional entities may be implemented in software or in one or more hardware modules or integrated circuits or in different networks and/or processor devices and/or microcontroller devices.

In the related art, referring to fig. 1, a path-finding grid is generally set for a virtual scene and loaded, and it is obvious that when the method is applied to a spherical virtual scene or other polygonal virtual scenes, the path-finding grid needs to cover the whole virtual scene, if the whole path-finding grid is loaded at one time during game operation, and the path-finding path corresponding to a game role is generally only in the visible range of a player, resource waste is easily caused, and the memory occupation is too large, so that the system operation efficiency is low, and the path-finding efficiency of the virtual scene is low.

In view of one or more of the above problems, exemplary embodiments of the present disclosure first provide a path finding method of a virtual scene. The system architecture of the operating environment of the present exemplary embodiment is described below in conjunction with fig. 2.

Referring to fig. 2, a system architecture 200 may include a terminal device 210 and a server 220. The terminal device 210 may be an electronic device such as a notebook computer, a tablet computer, or a desktop computer, and the terminal device 210 may be configured to obtain a virtual scene of a routing grid to be loaded. The server 220 generally refers to a background system that provides a path-finding related service of the virtual scene in the present exemplary embodiment, and may be, for example, a server that implements a path-finding method of the virtual scene. Server 220 may be a server or a cluster of servers, which is not limited by this disclosure. The terminal device 210 and the server 220 may form a connection through a wired or wireless communication link for data interaction.

The method of routing the virtual scene in the present exemplary embodiment may be performed by the terminal device 210. For example, in a game scenario, the terminal device 210 may be a computer running the game, the virtual scenario may be a spherical virtual scenario used by the game, the virtual scenario may include a first virtual scenario unit and a second virtual scenario unit, the terminal device 210 may edit the first routing grid according to the routing grid cell data in the first virtual scenario unit to obtain a first routing path, edit the second routing grid according to the routing grid cell data in the second virtual scenario unit to obtain a second routing path, and perform routing in the virtual scenario based on the first routing path and the second routing path.

In one embodiment, the virtual scene may be divided into one or more virtual scene units at the server 220, the virtual scene may include a first path-finding unit and a second path-finding unit, the terminal device 210 may determine a start path-finding position and a target path-finding position in the virtual scene in response to the path-finding request, and send the start path-finding position and the target path-finding position to the server 220, the server 220 determines that the start path-finding position is located in the first virtual scene unit after receiving the start path-finding position and the target path-finding position, and the target path-finding position is located in the second virtual scene unit, edits the first path-finding grid according to the path-finding grid unit data in the first virtual scene unit to obtain a first path-finding path, edits the second path-finding grid according to the path-finding grid unit data in the second virtual scene unit to obtain a second path-finding path; and obtaining a target path finding path according to the first path finding path and the second path finding path, and carrying out path finding in the virtual scene based on the target path finding path.

As can be seen from the above, the routing method of the virtual scene in the present exemplary embodiment may be performed by the terminal device 210 or the server 220 described above.

The following describes a way-finding method of a virtual scene with reference to fig. 3, which may be applied to a virtual scene, where the virtual scene includes a first virtual scene unit and a second virtual scene unit, and fig. 3 shows an exemplary flow of the way-finding method of the virtual scene, including the following steps S310 to S330:

step S310, determining an initial path-finding position and a target path-finding position in a virtual scene in response to a path-finding request, wherein the initial path-finding position is positioned in a first virtual scene unit, and the target path-finding position is positioned in a second virtual scene unit; the first virtual scene unit comprises a first path finding grid, and the first path finding grid is used for finding paths in the first virtual scene unit; the second virtual scene unit comprises a second path finding grid, and the second path finding grid is used for finding paths in the second virtual scene unit;

step S320, editing the first path finding grid according to the path finding grid cell data in the first virtual scene cell to obtain a first path finding path, and editing the second path finding grid according to the path finding grid cell data in the second virtual scene cell to obtain a second path finding path;

step S330, a target path is obtained according to the first path and the second path, and the path is found in the virtual scene based on the target path.

Wherein the seek request may include an instruction to begin a seek. The routing grid may be a navigation grid generated based on the virtual scene, and the path between the initial routing position and the target routing position may be determined by the routing grid, and the routing grid may be NavMesh in a virtual Engine (UE). The virtual scenes may include scenes requiring a route-seeking, the present disclosure does not particularly limit the shape of the virtual scenes, and the shape of the virtual scenes may be a polygon such as a sphere, for example, a route-seeking is performed in a multi-person online tactical competition (Multiplayer Online Battle Arena, MOBA) game scene using a spherical virtual scene, and the entire spherical virtual scene may be determined as a world in the UE when loading/streaming of the spherical virtual scene is performed using the UE. The virtual scene unit may include a partial scene of the virtual scene, for example, when the UE is used for loading the virtual scene, the virtual scene unit may include a level in the UE. The routing grid cell data may be part of a routing grid obtained by spatially dividing the routing grid, for example, the routing grid cell data may be Tile in the UE. The routing path may be a result of editing the routing grid, and illustratively, in the game scene, the routing grid of the corresponding virtual scene unit may be edited according to the position of the game character to obtain the routing path.

On the basis of the method, on the one hand, the first path-finding grid is edited according to the path-finding grid data in the first virtual scene unit to obtain the first path-finding path, the second path-finding grid is edited according to the path-finding grid data in the second virtual scene unit to obtain the second path-finding path, which virtual scene unit is loaded is realized, the path-finding grid in the virtual scene unit is loaded, all the path-finding grids in the virtual scene are not required to be loaded at one time, the memory occupation in the path-finding process of the virtual scene is reduced, the resource waste caused by loading all the path-finding grids at one time is reduced, the system operation efficiency is effectively improved, and the path-finding efficiency of the virtual scene is improved. On the other hand, the first path finding grid is edited according to the path finding grid cell data in the first virtual scene cell to obtain a first path finding path, so that the loading process of the path finding path is more detailed, and the sense of reality of the path finding process of the virtual scene is further improved. In still another aspect, the path-finding grid editing processes in each virtual scene unit are independent of each other and do not affect each other, and the path-finding paths corresponding to each virtual scene unit can be loaded independently, so that the error rate of the path-finding path loading process is reduced, and the path-finding efficiency of the virtual scene is further improved.

Each step in fig. 3 is specifically described below.

Referring to fig. 3, in step S310, in response to a seek request, a start seek position and a target seek position are determined in a virtual scene, wherein the start seek position is located in a first virtual scene unit and the target seek position is located in a second virtual scene unit; the first virtual scene unit comprises a first path finding grid, and the first path finding grid is used for finding paths in the first virtual scene unit; the second virtual scene unit includes a second routing grid for routing in the second virtual scene unit.

Since the initial path-finding position and the target path-finding position are respectively located in different virtual scene units, when the path-finding in the virtual scene is performed, the different virtual scene units need to be loaded in sequence according to the moving position of the virtual object to realize the path-finding of the virtual object in the virtual scene, and with continued reference to fig. 3, in step S320, the first path-finding grid is edited according to the path-finding grid unit data in the first virtual scene unit to obtain the first path-finding path, and the second path-finding grid is edited according to the path-finding grid unit data in the second virtual scene unit to obtain the second path-finding path.

In one embodiment, the first virtual scene unit includes one or more parent bounding boxes, and one or more child bounding boxes included in each parent bounding box, where each parent bounding box stores a local routing grid of the first routing grid, and the child bounding boxes store routing grid unit data corresponding to the local routing grid; editing the first routing grid according to the routing grid cell data in the first virtual scene cell, as shown in fig. 4, may include steps S410 to S420:

step S410, traversing child bounding boxes in the first virtual scene unit, and determining a target parent bounding box corresponding to any child bounding box in the parent bounding boxes of the first virtual scene unit;

step S420, editing the local routing grid stored in the target father bounding box according to the routing grid unit data stored in any child bounding box.

The bounding box may divide the virtual scene into one or more scene parts, that is, each bounding box may wrap a part of the virtual scene, where the parent bounding box has a correspondence relationship with the child bounding box, and if the parent bounding box parvolme 1 corresponds to three child bounding boxes subvolme 1, subvolme 2 and subvolme 3, illustratively, the routing grid NavMesh1 stored in the parent bounding box may store the included routing grid cell data Tile1 in the child bounding box subvolme 1, tile2 may store the child bounding box subvolme 2, and Tile2 may store the child bounding box subvolme 3. The child bounding box may exist in the parent bounding box, or may exist in the virtual scene unit to which the child bounding box belongs together with the parent bounding box.

In step S410, step S310 traverses the child bounding boxes in the first virtual scene unit, and determines a target parent bounding box corresponding to any child bounding box in the parent bounding boxes of the first virtual scene unit.

In one embodiment, before a route is found in a virtual scene, a route-finding grid corresponding to the virtual scene needs to be generated first, and several methods for generating the route-finding grid of the virtual scene are described below.

The first method is as follows: in one embodiment, the virtual scene may be voxelized to obtain a voxel grid corresponding to the virtual scene, the scene grid corresponding to the virtual scene is rasterized along a vertical direction, a walkable surface is determined in the virtual scene according to the rasterized scene grid and voxel grid, a target convex polygon area is obtained according to all walkable surfaces in the virtual scene, and the target convex polygon areas are combined to obtain a path finding grid corresponding to the virtual scene.

The target convex polygon area may be segmented based on all walkable surfaces in the virtual scene, for example, the target convex polygon area may be segmented into one or more Poly data in the UE.

The method for acquiring the path-finding grid through the voxel grid and the scene grid is low in complexity, and the generation efficiency of the path-finding grid is improved.

The second method is as follows: because the virtual scene further includes a spherical virtual scene, in order to make the application range of the generating method of the path-finding grid wider, in an implementation manner, the virtual scene may be rasterized to generate path-finding grids in N preset directions so as to cover and wrap the entire virtual scene (N is a positive integer).

Therefore, the method generates one or more path finding grids in the virtual scene to completely wrap the whole virtual scene, so that the path finding grid generation method is suitable for the virtual scene with an indefinite shape, and the adaptability of the path finding grid generation method is effectively improved.

The third method is as follows: in general, the memory occupation of the virtual scene is larger, and the routing grid occupies larger memory for covering the whole virtual scene, in the game scene, the game character usually moves only in the visible range of the player, and correspondingly, only a small part of the routing grid is used, if the game starts to run, the routing grid corresponding to the virtual scene used by the game is loaded, and the larger memory is certainly occupied, so that the running speed of the game is slowed down; therefore, in order to improve the game running efficiency, the routing grid should also use the streaming mechanism when loading, in one embodiment, before traversing the child bounding boxes in the first virtual scene unit and determining the target parent bounding box corresponding to any child bounding box in the parent bounding boxes in the first virtual scene unit, the method may further include steps S510 to S520 as shown in fig. 5:

Step S510, determining one or more father bounding boxes according to the first virtual scene unit, and generating a path-finding grid in the father bounding boxes, wherein the local path-finding grid is generated based on the father virtual scene range defined by the father bounding boxes;

step S520, a child bounding box corresponding to the parent bounding box is acquired, and the path finding grid unit data of the local path finding grid in the parent bounding box is correspondingly stored in the child bounding box.

For example, in the case that the virtual scene is a game scene, a world corresponding to the game scene may be divided into a plurality of virtual scene units levels in the UE, one or more parvolmes are generated to wrap the levels according to the scene range of the virtual scene units, one parvolme to be used for generating a route searching grid is selected, an interface Recast provided by a navigation route searching tool set recastname is called, and a corresponding local route searching grid NavMesh is generated in the game scene range defined by the parvolme; dividing Navmesh into path-finding grid cell data with the same size according to the preset virtual field origin and the preset path-finding grid cell size; the new child bounding box SubVolume may be continued in the virtual scene unit level or the parent bounding box ParVolume, e.g., when a corresponding SubVolume is generated in the ParVolume, the ParVolume may be spatially partitioned to obtain the SubVolume, where the SubVolume may have a ParGUID attribute for indicating its corresponding parent bounding box. After the SubVolume corresponding to the ParVolume is obtained, the route searching grid unit data Tile corresponding to the Navmesh stored in the ParVolume can be stored in the scene range defined by the SubVolume.

Based on the method of fig. 5, the child bounding box corresponding to the parent bounding box is obtained, and the Tile corresponding to the NavMesh stored in the parent bounding box is stored in the child bounding box, so that granularity of the path finding grid streaming can be reduced in the virtual scene loading process, the detail degree of the path finding grid loading process is improved, and the authenticity and loading efficiency of the path finding grid loading process are further improved.

In one embodiment, the routing grid cell data includes first routing grid cell data stored in a child bounding box, and the storing of the routing grid cell data of the local routing grid of the parent bounding box in the child bounding box corresponds to the storing, referring to fig. 6, steps S610 to S620 may include:

step S610, dividing local path finding grids in the father bounding box into first path finding grid unit data;

step S620, determining a sub virtual scene range according to the sub bounding box, and storing the first routing grid cell data in the sub virtual scene range in the sub bounding box.

The first routing grid unit data may be wrapped by a scene range defined by a sub bounding box.

For example, firstly, all child bounding boxes SubVolume under the virtual scene world can be traversed, whether the ParGUID of the SubVolume1 points to the current parent bounding box ParVolume1 is judged, a local routing grid Navmesh1 is stored in the ParVolume1, if the ParGUID of the SubVolume1 points to the current parent bounding box ParVolume1, the ParVolume1 and the SubVolume1 are in a father-son relationship, and the SubVolume1 can store the routing grid unit data of the local routing grid in the ParVolume 1; obtaining a sub virtual scene range according to the sub volume1, and first route searching grid unit data Tile1 of the sub virtual scene range correspondingly wrapped in the Navmesh1, and storing Tile1 in the sub volume 1; the scene range corresponding to the Tile can be calculated according to a preset virtual field origin and a preset path-finding grid cell size.

Based on the method of fig. 6, the data of the path searching grid unit corresponding to the path searching grid of the father bounding box can be correspondingly stored in the child bounding box, so that the flow granularity of the path searching grid can be reduced, the memory occupation of the path searching grid can be further reduced, and the path searching efficiency of the virtual scene can be improved; meanwhile, the path finding method of the virtual scene can be suitable for more virtual scenes, so that the applicability of the path finding method of the virtual scene is improved.

Because the shapes of the way finding grids may be irregular, when the sub bounding boxes are used to store the way finding grid cell data corresponding to the way finding grids, there may be a problem that part of the way finding grid cell data cannot be stored by the sub bounding boxes, so in one embodiment, the way finding grid cell data may further include second way finding grid cell data directly stored in the parent bounding box, the sub virtual scene range is determined according to the sub bounding box, and the first way finding grid cell data in the sub virtual scene range is stored in the sub bounding box, and further includes the following steps:

in the parent virtual scene range, second routing grid cell data existing outside any child virtual scene range is stored in a parent bounding box corresponding to the parent virtual scene range.

Wherein the second routing grid cell data may be routing grid cell data existing outside a scene range defined by any child bounding box corresponding to the parent bounding box.

For example, each of the routing grid cell data Tile may be numbered, the Tile number that has been saved by the sub-volume may be recorded in the ParVolume, tile2 (second routing grid cell data) in the ParVolume that has not been saved by any sub-volume may be determined from the Tile number, and the Tile2 may be stored in the ParVolume.

It should be noted that, since virtual scene units may overlap, the child bounding boxes may belong to different virtual scene units, for example, referring to fig. 7, a virtual scene world is divided into a first virtual scene unit level1 and a second virtual scene unit level2, where level1 may include a parent bounding box parvolme 1 and a child bounding box subvolme 1, where the parvolme 1 corresponds to a local routing grid NavMesh1, and the child bounding box corresponding to the parvolme 1 has subvolme 1, subvolme 2 and subvolme 3; the path-finding grid cell data corresponding to the Navmesh1 comprises a Tile1, a Tile2, a Tile3 and a Tile4; according to the scene range corresponding to the sub bounding box and the scene range corresponding to the path finding grid unit, the method can determine to store Tile1 in the sub volume1, store Tile2 in the sub volume1 and store Tile3 in the sub volume 1; tile4, which is not saved by any child bounding box in the parvolme 1, is saved in the parent bounding box parvolme 1. While SubVolume2 and SubVolume3 belong to scene ranges where level2 and level1 overlap, so SubVolume2 and SubVolume3 also belong to child bounding boxes corresponding to level 2.

The above is content about several methods of generating a routing grid, and the following is editing-related content about a routing grid.

In one embodiment, before determining the target parent bounding box corresponding to any child bounding box in the parent bounding boxes of the first virtual scene unit, the method may further include the following steps:

a first label is added to the parent bounding box and a second label is added to the child bounding box.

The first label may be a unique identifier corresponding to the parent bounding box, and for example, each parent bounding box may have a respective identifier GUID, and then the GUID may be used as the first label of the parent bounding box; the second label may be a unique identifier of a parent bounding box corresponding to the child bounding box, or may be a unique identifier of a child bounding box, for example, each child bounding box may have a respective ParGUID, and the ParGUID may be used as the second label of the parent bounding box, and the corresponding parent bounding box may be determined according to the second label of the child bounding box. It should be noted that the sub bounding box may correspond to one or more second tags.

By adding the first label to the parent bounding box and adding the second label to the child bounding box, the parent bounding box and the child bounding box corresponding to the parent bounding box can be associated, so that an execution basis is provided for realizing the path finding grid editing process in the exemplary embodiment.

In one embodiment, the determining, in the parent bounding box of the first virtual scene unit, the target parent bounding box corresponding to any child bounding box, as shown in fig. 8, may include steps S810 to S820:

step S810, obtaining a second label of any child bounding box;

in step S820, in the parent bounding box of the first virtual scene unit, the parent bounding box corresponding to the first tag matched with the second tag is determined as the target parent bounding box.

For example, when the first virtual scene unit level1 is triggered to flow into or out of the visual range of the player, all child bounding boxes SubVolume corresponding to level1 are traversed, the ParVolume corresponding to each SubVolume may be determined according to the second label ParGUID of the SubVolume, specifically, when determining the parent bounding box of the target child bounding box SubVolume1, the ParGUID1 of the SubVolume1 may be first obtained, in the ParVolume corresponding to level1, whether the second label GUID of the ParVolume is equal to the ParGUID1 is determined, and the ParVolume corresponding to the GUID1 equal to the ParGUID1 is determined as the parent bounding box of the SubVolume1, that is, the target parent bounding box.

Based on the method of fig. 8, the parent bounding box corresponding to the first label matched with the second label is determined as the target parent bounding box, so that complexity of a process of determining the parent bounding box corresponding to the child bounding box can be reduced, and the path searching efficiency of the virtual scene is further improved.

After determining the target parent bounding box corresponding to the child bounding box, with continued reference to fig. 4, in step S420, the local routing grid stored in the target parent bounding box is edited according to the routing grid cell data stored in any child bounding box.

The editing means to modify the local routing grid in the target parent bounding box, and by way of example, editing the local routing grid stored in the target parent bounding box may include flowing the routing grid cell data Tile stored in the child bounding box into or out of the local routing grid NavMesh in the target parent bounding box.

It should be noted that, when loading the routing grid, the sub bounding boxes may also be directly placed in the corresponding virtual scene units, and then loaded following the virtual scene units, for example, referring to fig. 7, the sub bounding boxes SubVolume2 and SubVolume3 are directly placed in the corresponding virtual scene units level 2.

Since the way-finding grid unit data needs to be streamed through the corresponding way-finding grid when the way-finding grid is loaded, in one embodiment, editing the local way-finding grid stored in the target father bounding box according to the way-finding grid unit data stored in any child bounding box may include the following steps:

And adding the path searching grid unit data stored in any child bounding box into the local path searching grid of the target father bounding box, and/or removing the path searching grid unit data in any child bounding box through the target father bounding box.

For example, since the routing grid is generated based on the walkable region in the corresponding virtual scene unit, the routing grid can be loaded along with the loading of the corresponding virtual scene unit, when the first virtual scene unit level1 flows in/out, all the sub bounding boxes SubVolume corresponding to level1 can be traversed, the parvolme corresponding to the SubVolume is obtained according to the ParGUID of the SubVolume, when the level1 needs to flow, the AddTile () interface provided by the recastname can be called to flow the routing grid data Tile in the SubVolume into the local routing grid NavMesh of the corresponding parvolme, and the recastname () interface provided by the recastname is called to flow the routing grid cell data Tile in the SubVolume out of NavMesh.

The local path-finding grids in the target father bounding box are edited through the path-finding grid cell data in the child bounding box, so that the problem of large memory occupation caused by the fact that all Navmesh in the virtual scene is stored in the memory is avoided to a certain extent, the running speed is improved, flexible editing of the path-finding grids is realized, and the flexibility of the path-finding method of the virtual scene is further improved.

In addition, in the case that the shape of the virtual scene is simpler and the composition of the virtual scene is simpler, in order to further reduce the complexity of the path-finding method of the virtual scene, in one embodiment, the path-finding grid may be determined according to the virtual scene, and the path-finding grid cell data corresponding to the path-finding grid may be stored in the corresponding virtual scene cell, so that the path-finding grid cell data is loaded along with the loading of the virtual scene cell.

For example, streaming of the routing grid is performed in the UE, and referring to fig. 9, the virtual scene world includes three virtual scene units level1, level2, and level3, where each virtual scene unit includes a corresponding scene object obj. When the distance between the game character and the level is required to be realized in the virtual scene and is smaller than the preset distance threshold, the level flows into the visual range of the player, otherwise, the level flows out of the visual range of the player. Referring to fig. 10, firstly, a routing grid NavMesh corresponding to a world is horizontally divided into two routing grid unit data Tile1 and Tile2 by a RecastNavigation, tile1 and Tile2 are correspondingly stored in virtual scene units Tile1 and Tile2, when Tile1 and Tile2 are correspondingly stored in virtual scene units Tile1 and Tile2, a virtual scene world can be firstly divided into two parts by cuboid bounding boxes Volume1 and Volume2, and Tile1 can be wrapped by Volume1, and Tile2 can be wrapped by Volume 2; then, saving the Tile1 to which the scene range defined by Volume1 belongs in level1, and saving the Tile2 to which the scene range defined by Volume2 belongs in level2, so as to realize the data of the path-finding grid unit to which the scene range defined by the bounding box belongs, and saving the data in the virtual scene unit corresponding to the bounding box; when the distance between the game role and the level1 is smaller than a preset distance threshold value during the streaming of the path-finding grid, the AddTile interface of the RecastNavigation can be called to flow the Tile1 into the Navmesh while the level1 flows into the visible range of the player; when the distance between the game character and the level1 is greater than a preset distance threshold, the level1 can flow out of the visible range of the player, and a RemoveTile interface of the RecastNavigation can be called to flow the Tile1 out of the Navmesh.

The complexity of the path-finding method of the virtual scene can be reduced by directly putting the path-finding grid cell data into the virtual scene cell for streaming, and the path-finding efficiency of the virtual scene is further improved.

It should be noted that, the process of editing the second routing grid according to the routing grid cell data in the second virtual scene cell is the same as the process of editing the first routing grid according to the routing grid cell data in the first virtual scene cell, so the process of editing the second routing grid according to the routing grid cell data in the second virtual scene cell is not repeated in the present disclosure.

With continued reference to fig. 3, in step S330, a target path is obtained according to the first path and the second path, and a path is found in the virtual scene based on the target path.

The target path-finding path refers to a path of a virtual object for finding a path in a virtual scene.

Based on the method, the memory occupation in the path searching process of the virtual scene is saved, the system operation efficiency is further improved, and the path searching efficiency of the virtual scene is effectively improved.

The exemplary embodiment of the disclosure also provides a path-finding device of the virtual scene. The apparatus may be applied to a virtual scene, where the virtual scene includes a first virtual scene unit and a second virtual scene unit, as shown in fig. 11, a path-finding apparatus 1100 of the virtual scene may include:

A seek position determining module 1110 configured to determine, in response to a seek request, a starting seek position and a target seek position in a virtual scene, wherein the starting seek position is located in a first virtual scene unit and the target seek position is located in a second virtual scene unit; the first virtual scene unit comprises a first path finding grid, and the first path finding grid is used for finding paths in the first virtual scene unit; the second virtual scene unit comprises a second path finding grid, and the second path finding grid is used for finding paths in the second virtual scene unit;

the route searching grid editing module 1120 is configured to edit the first route searching grid according to the route searching grid unit data in the first virtual scene unit to obtain a first route searching path, and edit the second route searching grid according to the route searching grid unit data in the second virtual scene unit to obtain a second route searching path;

the target path-finding path obtaining module 1130 is configured to obtain a target path-finding path according to the first path-finding path and the second path-finding path, and perform path-finding in the virtual scene based on the target path-finding path.

In one embodiment, the first virtual scene unit includes one or more parent bounding boxes, and one or more child bounding boxes included in each parent bounding box, where each parent bounding box stores a local routing grid of the first routing grid, and the child bounding boxes store routing grid unit data corresponding to the local routing grid; the editing the first routing grid according to the routing grid cell data in the first virtual scene cell may include:

Traversing child bounding boxes in the first virtual scene unit, and determining a target parent bounding box corresponding to any child bounding box in the parent bounding box of the first virtual scene unit;

editing the local path finding grid stored in the target father bounding box according to the path finding grid unit data stored in any child bounding box.

In one embodiment, before traversing the child bounding box in the first virtual scene unit and determining the target parent bounding box corresponding to any child bounding box in the parent bounding box in the first virtual scene unit, the apparatus may further include:

determining one or more father bounding boxes according to the first virtual scene unit, and generating local path finding grids in the father bounding boxes, wherein the local path finding grids are generated based on the father virtual scene range defined by the father bounding boxes;

and obtaining a child bounding box corresponding to the parent bounding box, and correspondingly storing the path finding grid cell data of the local path finding grid of the parent bounding box in the child bounding box.

In one embodiment, the routing grid cell data includes first routing grid cell data stored in a child bounding box, and the storing the routing grid cell data of the local routing grid of the parent bounding box in the child bounding box may include:

Dividing local path searching grids in the father bounding box into first path searching grid unit data;

and determining a sub virtual scene range according to the sub bounding box, and storing first path finding grid cell data in the sub virtual scene range in the sub bounding box.

In one embodiment, the routing grid unit data includes second routing grid unit data directly stored in a parent bounding box, where the determining a sub-virtual scene range according to the sub-bounding box and storing the first routing grid unit data in the sub-virtual scene range in the sub-bounding box may further include:

in the parent virtual scene range, second routing grid cell data existing outside any child virtual scene range is stored in a parent bounding box corresponding to the parent virtual scene range.

In one embodiment, before determining the target parent bounding box corresponding to any child bounding box in the parent bounding boxes of the first virtual scene unit, the apparatus may further include:

a first label is added to the parent bounding box and a second label is added to the child bounding box.

In an embodiment, determining, in the parent bounding boxes of the first virtual scene unit, a target parent bounding box corresponding to any child bounding box may include:

Acquiring a second label of any child bounding box;

and determining a parent bounding box corresponding to the first label matched with the second label as a target parent bounding box in the parent bounding box of the first virtual scene unit.

In one embodiment, the editing the local routing grid stored in the target parent bounding box according to the routing grid cell data stored in any child bounding box may include:

adding the path finding grid cell data stored in any child bounding box into the local path finding grid of the target father bounding box, and/or removing the path finding grid cell data in any child bounding box through the target father bounding box.

The specific details of each part in the above apparatus are already described in the method part embodiments, and thus will not be repeated.

Exemplary embodiments of the present disclosure also provide a computer readable storage medium, which may be implemented in the form of a program product comprising program code for causing an electronic device to carry out the steps according to the various exemplary embodiments of the disclosure as described in the above section of the "exemplary method" when the program product is run on the electronic device. In an alternative embodiment, the program product may be implemented as a portable compact disc read only memory (CD-ROM) and comprises program code and may run on an electronic device, such as a personal computer. However, the program product of the present disclosure is not limited thereto, and in this document, a readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.

The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium can be, for example, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium would include the following: an electrical connection having one or more wires, a portable disk, a hard disk, random Access Memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

The computer readable signal medium may include a data signal propagated in baseband or as part of a carrier wave with readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A readable signal medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.

Program code embodied on a readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

Program code for carrying out operations of the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C++ or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device, partly on a remote computing device, or entirely on the remote computing device or server. In the case of remote computing devices, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., connected via the Internet using an Internet service provider).

Exemplary embodiments of the present disclosure also provide an electronic device. The electronic device may include a processor and a memory. The memory stores executable instructions of the processor, such as program code. The processor performs the method of the present exemplary embodiment by executing the executable instructions.

An electronic device is illustrated in the form of a general purpose computing device with reference to fig. 12. It should be understood that the electronic device 1200 shown in fig. 12 is merely an example and should not be construed as limiting the functionality and scope of use of embodiments of the present disclosure.

As shown in fig. 12, an electronic device 1200 may include: processor 1210, memory 1220, bus 1230, I/O (input/output) interface 1240, network adapter 1250.

Processor 1210 may include one or more processing units such as: processor 1210 may include a central processor (Central Processing Unit, CPU), AP (Application Processor ), modem processor, display processor (Display Process Unit, DPU), GPU (Graphics Processing Unit, graphics processor), ISP (Image Signal Processor ), controller, encoder, decoder, DSP (Digital Signal Processor ), baseband processor, artificial intelligence processor, and the like. In one embodiment, an artificial intelligence processor may determine, in response to a seek request, a starting seek position and a target seek position in a virtual scene, wherein the starting seek position is located in a first virtual scene unit and the target seek position is located in a second virtual scene unit; editing the first path searching grid according to the path searching grid unit data in the first virtual scene unit to obtain a first path searching path, and editing the second path searching grid according to the path searching grid unit data in the second virtual scene unit to obtain a second path searching path; and finally, obtaining a target path finding path according to the first path finding path and the second path finding path, and carrying out path finding in the virtual scene based on the target path finding path.

Memory 1220 may include volatile memory, such as RAM 1221, cache unit 1222, and nonvolatile memory, such as ROM 1223. Memory 1220 may also include one or more program modules 1224, such program modules 1224 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each or some combination of which may include an implementation of a network environment. Program modules 1224 may include, for example, the modules described above in apparatus 1100.

Bus 1230 is used to enable connections between the different components of electronic device 1200 and may include a data bus, an address bus, and a control bus.

The electronic device 1200 may communicate with one or more external devices 1300 (e.g., keyboard, mouse, external controller, etc.) via the I/O interface 1240.

The electronic device 1200 may communicate with one or more networks through the network adapter 1250, e.g., the network adapter 1250 may provide a mobile communication solution such as 3G/4G/5G, or a wireless communication solution such as wireless local area network, bluetooth, near field communication, etc. The network adapter 1250 may communicate with other modules of the electronic device 1200 via the bus 1230.

Although not shown in fig. 12, other hardware and/or software modules may also be provided in the electronic device 1200, including but not limited to: displays, microcode, device drivers, redundant processors, external disk drive arrays, RAID systems, tape drives, data backup storage systems, and the like.

It should be noted that although in the above detailed description several modules or units of a device for action execution are mentioned, such a division is not mandatory. Indeed, the features and functionality of two or more modules or units described above may be embodied in one module or unit in accordance with exemplary embodiments of the present disclosure. Conversely, the features and functions of one module or unit described above may be further divided into a plurality of modules or units to be embodied.

Those skilled in the art will appreciate that the various aspects of the present disclosure may be implemented as a system, method, or program product. Accordingly, various aspects of the disclosure may be embodied in the following forms, namely: an entirely hardware embodiment, an entirely software embodiment (including firmware, micro-code, etc.) or an embodiment combining hardware and software aspects may be referred to herein as a "circuit," module "or" system. Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This disclosure is intended to cover any adaptations, uses, or adaptations of the disclosure following the general principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.

It is to be understood that the present disclosure is not limited to the precise arrangements and instrumentalities shown in the drawings, and that various modifications and changes may be effected without departing from the scope thereof. The scope of the present disclosure is limited only by the appended claims.

Claims (11)

1. A method for finding a path of a virtual scene, applied to a virtual scene, wherein the virtual scene comprises a first virtual scene unit and a second virtual scene unit, the method comprising:

determining an initial path-finding position and a target path-finding position in the virtual scene in response to a path-finding request, wherein the initial path-finding position is positioned in the first virtual scene unit, and the target path-finding position is positioned in the second virtual scene unit; the first virtual scene unit comprises a first path finding grid, and the first path finding grid is used for finding paths in the first virtual scene unit; the second virtual scene unit comprises a second path finding grid, and the second path finding grid is used for finding paths in the second virtual scene unit;

editing the first path finding grid according to the path finding grid cell data in the first virtual scene cell to obtain a first path finding path, and editing the second path finding grid according to the path finding grid cell data in the second virtual scene cell to obtain a second path finding path;

And obtaining a target path finding path according to the first path finding path and the second path finding path, and carrying out path finding in the virtual scene based on the target path finding path.

2. The method of claim 1, wherein the first virtual scene unit comprises one or more parent bounding boxes, and one or more child bounding boxes included in each of the parent bounding boxes, wherein the parent bounding boxes store local routing grids of the first routing grid, and wherein the child bounding boxes store routing grid unit data corresponding to the local routing grids; the editing the first routing grid according to the routing grid unit data in the first virtual scene unit includes:

traversing child bounding boxes in the first virtual scene unit, and determining a target parent bounding box corresponding to any child bounding box in the parent bounding boxes of the first virtual scene unit;

editing the local path finding grid stored in the target father bounding box according to the path finding grid unit data stored in any child bounding box.

3. The method of claim 2, wherein prior to said traversing the child bounding boxes in the first virtual scene unit and determining a target parent bounding box corresponding to any of the child bounding boxes in the parent bounding box in the first virtual scene unit, the method further comprises:

Determining one or more father bounding boxes according to the first virtual scene unit, and generating the local routing grid in the father bounding boxes, wherein the local routing grid is generated based on the father virtual scene range defined by the father bounding boxes;

and obtaining a child bounding box corresponding to the parent bounding box, and correspondingly storing the path finding grid unit data of the local path finding grid of the parent bounding box in the child bounding box.

4. The method of claim 3, wherein the way-finding grid cell data comprises first way-finding grid cell data stored in the child bounding box, the correspondingly storing way-finding grid cell data of the local way-finding grid of the parent bounding box in the child bounding box comprising:

dividing local path finding grids in the father bounding box into first path finding grid unit data;

and determining a sub virtual scene range according to the sub bounding box, and storing first path finding grid cell data in the sub virtual scene range in the sub bounding box.

5. The method of claim 4, wherein the routing grid cell data comprises second routing grid cell data stored directly in the parent bounding box, wherein the determining a child virtual scene range from the child bounding box and storing first routing grid cell data within the child virtual scene range in the child bounding box further comprises:

And in the father virtual scene range, storing second routing grid cell data existing outside any child virtual scene range in a father bounding box corresponding to the father virtual scene range.

6. The method of claim 2, wherein before determining a target parent bounding box corresponding to any of the child bounding boxes in the parent bounding boxes of the first virtual scene unit, the method further comprises:

adding a first label to the parent bounding box and adding a second label to the child bounding box.

7. The method of claim 6, wherein determining, among the parent bounding boxes of the first virtual scene unit, a target parent bounding box corresponding to any one of the child bounding boxes, comprises:

acquiring a second label of any child bounding box;

and determining a parent bounding box corresponding to the first label matched with the second label as the target parent bounding box in the parent bounding box of the first virtual scene unit.

8. The method according to claim 2, wherein editing the local routing grid stored in the target parent bounding box according to the routing grid cell data stored in the any child bounding box comprises:

And adding the path finding grid cell data stored by any child bounding box into the local path finding grid of the target father bounding box, and/or removing the path finding grid cell data in any child bounding box through the target father bounding box.

9. A virtual scene's way finding device is applied to virtual scene, characterized in that, virtual scene includes first virtual scene unit and second virtual scene unit, said device includes:

a path-finding position determining module configured to determine a start path-finding position and a target path-finding position in the virtual scene in response to a path-finding request, wherein the start path-finding position is located in the first virtual scene unit, and the target path-finding position is located in the second virtual scene unit; the first virtual scene unit comprises a first path finding grid, and the first path finding grid is used for finding paths in the first virtual scene unit; the second virtual scene unit comprises a second path finding grid, and the second path finding grid is used for finding paths in the second virtual scene unit;

the path-finding grid editing module is configured to edit the first path-finding grid according to path-finding grid cell data in the first virtual scene cell to obtain a first path-finding path, and edit the second path-finding grid according to path-finding grid cell data in the second virtual scene cell to obtain a second path-finding path;

The target path-finding path acquisition module is configured to obtain a target path-finding path according to the first path-finding path and the second path-finding path, and perform path-finding in the virtual scene based on the target path-finding path.

10. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the method of any one of claims 1 to 8.

11. An electronic device, comprising:

a processor;

a memory for storing executable instructions of the processor;

wherein the processor is configured to perform the method of any one of claims 1 to 8 via execution of the executable instructions.