Video game processing program and video game processing system

The video game processing system addresses excessive processing loads by setting navigation meshes, placing waypoints, and grouping them into regions to efficiently search for movement routes, thereby reducing computational demands.

JP7577437B2Active Publication Date: 2024-11-05SQUARE ENIX HLDG CO LTD
View PDF 14 Cites 0 Cited by

Patent Information

Application Number
JP2019161054
Authority / Receiving Office
JP · JP
Patent Type
Patents
Current Assignee / Owner
Filing Date
2019-09-04
Publication Date
2024-11-05
Estimated Expiration
2039-09-04

AI Technical Summary

Technical Problem

Conventional video game technologies face excessive processing loads when searching for movement routes due to the increased number of waypoints, leading to inefficient movement control in virtual spaces.

Method used

A video game processing system and program that sets a navigation mesh for an object's movable range, places waypoints according to a predetermined rule, generates regions by grouping these waypoints, determines a movement area, and searches for routes based on these areas to reduce processing load.

Benefits of technology

The system efficiently reduces the processing load required to search for movement routes by organizing waypoints into manageable regions, allowing for staged route searching and minimizing overall computational burden.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 0007577437000001
    Figure 0007577437000001
  • Figure 0007577437000002
    Figure 0007577437000002
  • Figure 0007577437000003
    Figure 0007577437000003
Patent Text Reader

Abstract

To reduce a processing load required by a search for a moving path of an object.SOLUTION: A plurality of areas are generated by grouping waypoints, which are arranged on a navigation mesh, on the basis of a predetermined classification rule, a moving area of an object is determined on the basis of an arrangement of the plurality of generated areas, and a moving path of the object is searched for on the basis of the waypoints included in the determined moving area. Information indicative of connection between one of the waypoints and another of the waypoints may be used in the determination of the moving area.SELECTED DRAWING: Figure 3
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] At least one embodiment of the present invention relates to a video game processing program and a video game processing system for causing a server to realize a function related to searching for a movement path in a virtual space. [Background technology]

[0002] Conventionally, various techniques have been proposed for moving characters in video games.

[0003] Among these technologies, there is one that searches for a character's movement route using position information related to a virtual space that constitutes a video game, and uses a navigation mesh and waypoints. In order to suppress an increase in the processing load required for searching for a movement route, there is also one that determines the arrangement of the route candidate positions in a search area so that the intervals between route candidate positions located outside a predetermined range of the search area are greater than the intervals between route candidate positions located within the predetermined range of the search area (see Patent Document 1). [Prior art documents] [Patent documents]

[0004] [Patent Document 1] JP 2012-213485 A Summary of the Invention [Problem to be solved by the invention]

[0005] However, in conventional technology, the processing load required for placing waypoints and searching for routes through the placed waypoints increases as the number of waypoints (candidate intermediate locations) to be searched increases, which can result in excessive processing load when controlling the movement of objects that can move through virtual space, such as characters.

[0006] An object of at least one embodiment of the present invention is to solve the above problem and reduce the processing load required to search for a movement path of an object. [Means for solving the problem]

[0007] From a non-limiting perspective, a video game processing program according to one embodiment of the present invention is a video game processing program for causing a server to realize functions related to searching for a movement path in a virtual space, and causes the server to realize a setting function of setting a navigation mesh corresponding to a movable range of an object in the virtual space, a placement function of placing a plurality of waypoints on the set navigation mesh in accordance with a predetermined placement rule, a generation function of generating a plurality of areas by grouping the plurality of waypoints placed in the virtual space based on a predetermined classification rule, a determination function of determining an area in which the object moves (hereinafter referred to as a "movement area") based on the placement of the generated plurality of areas, and a search function of searching for a movement path for the object based on the waypoints included in the determined movement area.

[0008] From a non-limiting perspective, a video game processing system according to one embodiment of the present invention is a video game processing system that includes a communication network, a server, and a user terminal, and performs processing related to searching for a movement path in a virtual space, and is characterized in including: a setting means for setting a navigation mesh corresponding to a movable range of an object in the virtual space; an arrangement means for arranging a plurality of waypoints on the set navigation mesh in accordance with a predetermined arrangement rule; a generation means for generating a plurality of areas by grouping the plurality of waypoints arranged in the virtual space based on a predetermined classification rule; a determination means for determining an area in which the object moves (hereinafter referred to as a "movement area") based on the arrangement of the generated plurality of areas; and a search means for searching for a movement path of the object based on the waypoints included in the determined movement area.

[0009] From a non-limiting perspective, a video game processing program according to one embodiment of the present invention is a video game processing program for enabling a user terminal to realize functions related to searching for a movement path in a virtual space, and for enabling the user terminal to realize a setting function for setting a navigation mesh corresponding to a movable range of an object in the virtual space, a placement function for placing a plurality of waypoints on the set navigation mesh in accordance with a predetermined placement rule, a generation function for generating a plurality of areas by grouping the plurality of waypoints placed in the virtual space based on a predetermined classification rule, a determination function for determining an area in which the object moves (hereinafter referred to as a "movement area") based on the placement of the generated plurality of areas, and a search function for searching for a movement path for the object based on the waypoints included in the determined movement area. Effect of the Invention

[0010] Each embodiment of the present application addresses one or more of the deficiencies. [Brief description of the drawings]

[0011] [Figure 1] 1 is a block diagram showing an example of a configuration of a video game processing system corresponding to at least one of the embodiments of the present invention. [Diagram 2] FIG. 2 is a block diagram showing a configuration of a server corresponding to at least one of the embodiments of the present invention. [Diagram 3] 11 is a flowchart illustrating an example of a game process corresponding to at least one of the embodiments of the present invention. [Figure 4] 11 is a flowchart showing an example of a server-side operation in a game process corresponding to at least one of the embodiments of the present invention. [Diagram 5] 10 is a flowchart showing an example of an operation on the terminal side in a game process corresponding to at least one of the embodiments of the present invention. [Figure 6] FIG. 2 is a block diagram showing a configuration of a server corresponding to at least one of the embodiments of the present invention. [Figure 7] 11 is a flowchart illustrating an example of a game process corresponding to at least one of the embodiments of the present invention. [Figure 8] FIG. 2 is a block diagram showing a configuration of a server corresponding to at least one of the embodiments of the present invention. [Figure 9] 11 is a flowchart illustrating an example of a game process corresponding to at least one of the embodiments of the present invention. [Figure 10] FIG. 2 is a block diagram showing a configuration of a server corresponding to at least one of the embodiments of the present invention. [Figure 11] FIG. 11 is an explanatory diagram for explaining an example of thinning out waypoints corresponding to at least one of the embodiments of the present invention. [Figure 12] FIG. 11 is an explanatory diagram for explaining an example of waypoints that should not be thinned out according to at least one of the embodiments of the present invention. [Figure 13] FIG. 11 is an explanatory diagram for explaining an example of a method for generating a region corresponding to at least one of the embodiments of the present invention. [Figure 14] FIG. 2 is an explanatory diagram for explaining an example of a storage state of information corresponding to at least one of the embodiments of the present invention. [Figure 15] 11 is a flowchart illustrating an example of a game process corresponding to at least one of the embodiments of the present invention. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0012] Hereinafter, examples of embodiments of the present invention will be described with reference to the drawings. Note that the various components in the examples of the embodiments described below can be appropriately combined to the extent that no inconsistencies or the like arise. In addition, the contents described as an example of one embodiment may be omitted in other embodiments. In addition, the contents of operations and processes that are not related to the characteristic parts of each embodiment may be omitted. Furthermore, the order of various processes that make up the various flows described below is random to the extent that no inconsistencies or the like arise in the process contents.

[0013] [First embodiment] Fig. 1 is a block diagram showing an example of the configuration of a video game processing system 100 in one embodiment of the present invention. As shown in Fig. 1, the video game processing system 100 includes a video game processing server 10 (server 10) and user terminals 20, 201 to 20N (N is an arbitrary integer) used by users of the video game processing system 100. Note that the configuration of the video game processing system 100 is not limited to this, and it may be configured so that a single user terminal is used by multiple users, or may be configured to include multiple servers.

[0014] The server 10 and the multiple user terminals 20, 201 to 20N are each connected to a communication network 30 such as the Internet. Although not shown, the multiple user terminals 20, 201 to 20N are connected to the communication network 30 by performing data communication with a base station managed by a communication carrier via a wireless communication line.

[0015] The video game processing system 100 includes a server 10 and a plurality of user terminals 20, 201 to 20N, and thereby realizes various functions for executing various processes in response to user operations.

[0016] The server 10 is managed by an administrator of the video game processing system 100, and has various functions for providing information on various processes to the multiple user terminals 20, 201 to 20N. In this example, the server 10 is configured by an information processing device such as a WWW server, and has a storage medium for storing various information. The server 10 has general components for performing various processes as a computer, such as a control unit and a communication unit, but the description thereof will be omitted here. In addition, in the video game processing system 100, it is preferable that the server 10 manages various information from the viewpoint of reducing the processing load on each of the multiple user terminals 20, 201 to 20N. However, the storage unit that stores various information only needs to have a storage area accessible by the server 10, and may be configured to have a dedicated storage area outside the server 10, for example.

[0017] 2 is a block diagram showing a configuration of a server 10A, which is an example of the configuration of the server 10. As shown in FIG. 2, the server 10A includes at least a setting unit 11, an arrangement unit 12, a generation unit 13, a determination unit 14, and a search unit 15.

[0018] The setting unit 11 has a function of setting a navigation mesh that corresponds to a movable range of an object in a virtual space.

[0019] Here, the object means something that can be placed in the virtual space. The configuration of the object is not particularly limited, but it is preferable that the object be recognizable by the user (or player) of the terminal 20. Examples of the object include a character that can be operated by the user (player character) and a character that cannot be operated by the user (non-player character).

[0020] The movable range means a range in which an object is permitted to move in a virtual space. The configuration of the movable range is not particularly limited, and may be a 2D map or a 3D map.

[0021] Also, setting a navigation mesh corresponding to the movable range means associating the navigation mesh with the movable range in the virtual space. The configuration for setting the navigation mesh is not particularly limited, and one example is a configuration in which a passable flag is set for polygons that are continuous from the initial position of the player.

[0022] The placement unit 12 has a function of placing a plurality of waypoints on the set navigation mesh in accordance with a predetermined placement rule.

[0023] Here, a waypoint means location information to which information related to a video game can be associated. In other words, a waypoint serves as a base for embedding information required for a game. The configuration of a waypoint is not particularly limited as long as it can identify a position on a navigation mesh, but it is preferable that the waypoint is configured to be associated with information that may be useful depending on the purpose of route search. An example of such a configuration includes an XYZ position in 3D space and a navigation mesh polygon ID below the waypoint.

[0024] In addition, the configuration for arranging a plurality of waypoints according to a predetermined arrangement rule is not particularly limited, and a plurality of arrangement rules may be used. An example of the arrangement rule is a rule for arranging waypoints using a floodfill algorithm based on the player's initial position.

[0025] The generation unit 13 has a function of generating a plurality of areas by grouping the plurality of waypoints arranged in the virtual space based on a predetermined classification rule.

[0026] Here, the configuration for grouping according to a predetermined classification rule is not particularly limited, and may be a configuration for classifying based on the arrangement of waypoints, or a configuration for classifying based on information associated with the waypoints. An example of such a configuration is a configuration for classifying the distance of each waypoint from an unmovable area (e.g., a wall) using a watershed algorithm (or dividing the navigation mesh according to the arrangement of each waypoint after classification).

[0027] Furthermore, generating multiple regions by grouping means defining the range in the virtual space (or the set navigation mesh) in which the waypoints belonging to the group are located as a region. The configuration for generating multiple regions is not particularly limited, and may be a configuration in which information indicating a group of waypoints belonging to a group is generated as a region, or a configuration in which information indicating a part of the navigation mesh from the arrangement of the waypoints belonging to a group is generated as a region.

[0028] The determination unit 14 has a function of determining an area (movement area) into which an object moves, based on the arrangement of the generated multiple areas.

[0029] Here, the configuration for determining the moving area is not particularly limited, and it is sufficient that the configuration can determine a plurality of areas connecting an area including a moving start position and an area including a moving end position as the moving area. An example of such a configuration is a configuration that uses a known route search technology with each area as a node. Note that the connection relationship between each area may be determined using information associated with waypoints located at the boundaries of each area.

[0030] The search unit 14 has a function of searching for a movement path of the object based on waypoints included in the determined movement area.

[0031] Here, the configuration for searching for a travel route based on waypoints included in the travel area is not particularly limited, but it is preferable that the configuration is capable of searching for one or more routes that satisfy the search conditions. An example of such a configuration is a configuration that employs a known route search technology with each waypoint included in the travel area as a node.

[0032] Each of the multiple user terminals 20, 201 to 20N is managed by a user and is configured as a communication terminal capable of playing a network distribution type game, such as a mobile phone terminal, a PDA (Personal Digital Assistant), a portable game device, or a so-called wearable device. The configuration of the user terminal that may be included in the video game processing system 100 is not limited to the above-mentioned example, and may be configured in any way that allows the user to recognize the composite image. Other examples of the configuration of the user terminal include a combination of various communication terminals, a personal computer, and a stationary game device.

[0033] Each of the multiple user terminals 20, 201 to 20N is connected to the communication network 30 and includes hardware (for example, a display device that displays a browser screen or a game screen according to coordinates) and software for executing various processes by communicating with the server 10. Note that each of the multiple user terminals 20, 201 to 20N may be configured to be able to communicate directly with each other without going through the server 10.

[0034] Next, the operation of the video game processing system 100 (system 100) of this embodiment will be described.

[0035] 3 is a flowchart showing an example of game processing executed by the system 100. In the game processing in this example, processing related to controlling the progress of a video game is performed. Below, an example will be described in which the server 10A and the user terminal 20 (terminal 20) execute the game processing.

[0036] The game process is started, for example, when the terminal 20 that has accessed the server 10A satisfies the arrangement condition of the waypoint. Hereinafter, an example will be described in which a user operating the terminal 20 inputs a search request for a travel route.

[0037] In the game processing, the server 10A first sets a navigation mesh (step S11). In this example, the server 10A specifies a virtual space to be provided to the terminal 20, and sets a navigation mesh corresponding to a range in which an object can move in the specified virtual space.

[0038] After setting the navigation mesh, the server 10A arranges waypoints (step S12). In this example, the server 10A arranges a plurality of waypoints on the set navigation mesh in accordance with a predetermined arrangement rule.

[0039] After arranging the waypoints, the server 10A generates a plurality of regions (step S13). In this example, the server 10A generates a plurality of regions by grouping the plurality of waypoints arranged in the virtual space according to a predetermined classification rule.

[0040] After generating the multiple regions, the server 10A determines a movement region (step S14). In this example, the server 10A determines a movement region suitable for movement from a region including a movement start position to a region including a movement end position based on the arrangement of the generated multiple regions.

[0041] When the server 10A determines the movement area, the server 10A searches for a movement route based on the waypoints included in the movement area (step S15). In this example, the server 10A searches for a movement route from a movement start position to a movement end position based on the waypoints included in the determined movement area.

[0042] 4 is a flowchart showing an example of the operation of the server 10A in the game processing. Here, the operation of the server 10A in the system 100 will be explained again.

[0043] In game processing, the server 10A first sets a navigation mesh (step S101), places waypoints on the set navigation mesh (step S102), generates a number of areas by grouping the placed waypoints based on predetermined classification rules (step 103), determines a movement area based on the arrangement of the generated areas (step 104), and searches for a movement route based on the waypoints included in the movement area (step 105).

[0044] 5 is a flowchart showing an example of the operation of the terminal 20 when the terminal 20 executes the game processing. The following describes an example in which the terminal 20 executes the game processing by itself. Note that the configuration of the terminal 20 has the same functions as the configuration of the server 10, except for receiving various information from the server 10, and therefore will not be described in order to avoid duplication.

[0045] In the game processing, the terminal 20 first sets a navigation mesh (step S201), arranges waypoints on the set navigation mesh (step S202), generates a plurality of areas by grouping the arranged waypoints based on a predetermined classification rule (step 203), determines a movement area based on the arrangement of the generated plurality of areas (step 204), and searches for a movement route based on the waypoints included in the movement area (step 205). In this example, the terminal 20 communicates with the server 10A to obtain information used in each step. Note that the terminal 20 may be configured to specify information used in each step by referring to a storage unit included in the terminal 20 itself.

[0046] As described above, as one aspect of the first embodiment, the server 10A having a function for searching for a movement path in a virtual space is configured to include a setting unit 11, a placement unit 12, a generation unit 13, a determination unit 14, and a search unit 15. Therefore, a navigation mesh corresponding to a movable range of an object in the virtual space is set, a plurality of waypoints are placed on the set navigation mesh in accordance with a predetermined placement rule, the plurality of waypoints placed in the virtual space are grouped based on a predetermined classification rule to generate a plurality of areas, an area in which the object moves (movement area) is determined based on the placement of the generated plurality of areas, and a movement path of the object is searched for based on the waypoints included in the movement area, thereby reducing the processing load required for searching for the movement path of the object.

[0047] In other words, rather than simply placing waypoints, the travel area is determined and then a travel route is searched for, making it possible to search for a travel route in stages, thereby reducing the processing load required to search for a travel route compared to when all placed waypoints are searched for.

[0048] Although not specifically mentioned in the above-mentioned embodiment, the timing of the processing by the setting unit 11, the placement unit 12, the generation unit 13, and the determination unit 14 is not particularly limited, and may be when the video game is developed or when the video game is played. That is, the search unit 15 may be configured to read information generated before the player plays the video game, update the read information according to the situation of the video game, and search for a moving path. Also, the search unit 14 may be configured to search for a moving path using information generated in real time according to the progress of the video game (for example, the placement of waypoints and the generated area).

[0049] [Second embodiment] 6 is a block diagram showing a configuration of a video game processing server 10B (server 10B) which is an example of the video game processing server 10. In this example, the server 10B includes at least a setting unit 11, an arrangement unit 12, a generation unit 13, a determination unit 14B, and a search unit 15.

[0050] The determination unit 14B has a function of referring to a specified memory unit (not shown) that stores connection information between each of a plurality of waypoints and other waypoints, and determining a travel area based on the connection information of waypoints located on the boundaries of a plurality of areas.

[0051] Here, the connection information means information about connections with a plurality of waypoints. The configuration of the connection information is not particularly limited as long as it is a configuration that can specify whether an object can move from one waypoint to another. An example of the connection information is identification information of other waypoints that can be moved from a waypoint.

[0052] Furthermore, the boundary between multiple regions means the boundary between multiple virtual spaces that satisfy the adjacency condition in the virtual space. If a waypoint belonging to one region is connected to a waypoint belonging to another region, it can be determined that movement between the two regions is possible. On the other hand, even if the two regions are adjacent, if the waypoints belonging to each region are not connected, it can be determined that movement between the two regions is not possible. By making it possible to identify the connection relationship between multiple regions in the virtual space, it is possible to determine the movement region in the same way as searching for a movement route.

[0053] 7 is a flowchart showing an example of game processing executed by the system 100. The following describes an example of the operations of the server 10B and the terminal 20. Note that flowcharts showing the operations of the server 10B and the terminal 20 will be omitted to avoid redundant description.

[0054] After generating the multiple regions, the server 10B determines the movement region based on the connection information of the waypoints (step S2-11). In this example, the server 10B searches for a movement route from the movement start position to the movement end position based on the connection information of the waypoints arranged on the boundaries of each region among the waypoints included in the multiple generated regions.

[0055] As described above, as one aspect of the second embodiment, the server 10B is configured to include a setting unit 11, a placement unit 12, a generation unit 13, a determination unit 14B, and a search unit 15. Therefore, by referring to a predetermined storage means that stores connection information between each of a plurality of waypoints and other waypoints, a travel area is determined based on the connection information of waypoints placed on the boundaries of a plurality of areas, and the travel area can be determined without generating new information to identify the connection relationship between a plurality of areas, thereby reducing the processing load required to determine a travel area for searching a travel route.

[0056] [Third embodiment] 8 is a block diagram showing a configuration of a video game processing server 10C (server 10C) which is an example of the video game processing server 10. In this example, the server 10C includes at least a setting unit 11, an arrangement unit 12, a generation unit 13C, a determination unit 14, and a search unit 15.

[0057] The generating unit 13C has a function of dividing an area that satisfies a predetermined division condition among the multiple areas, and merging an area that satisfies a predetermined merging condition with another area. That is, the generating unit 13C has a function of adjusting the multiple areas.

[0058] Here, dividing an area means that a plurality of waypoints belonging to one area are made to belong to two or more areas. Also, merging areas means that a plurality of waypoints belonging to two or more areas are made to belong to one area. In other words, the generation unit 13C has a function of changing the affiliation of waypoints belonging to the generated area.

[0059] In addition, the configuration for dividing an area that satisfies a specified division condition and merging an area that satisfies a specified merging condition into another area is not particularly limited, and may be a configuration in which all generated areas are sized to fall within a certain range, or a configuration in which division conditions and merging conditions are set so that the adjusted area satisfies one of a number of size conditions.

[0060] 9 is a flowchart showing an example of game processing executed by the system 100. The following describes an example of the operations of the server 10C and the terminal 20. Note that flowcharts showing the operations of the server 10C and the terminal 20 will be omitted to avoid redundant description.

[0061] After generating a plurality of regions, server 10C adjusts (divides and merges) the regions (step S3-11). In this example, server 10C adjusts the sizes of all the generated regions to fit within a certain range.

[0062] As described above, as one aspect of the third embodiment, the server 10C is configured to include a setting unit 11, a placement unit 12, a generation unit 13C, a determination unit 14, and a search unit 15. Therefore, among a plurality of areas, areas that satisfy predetermined division conditions can be divided, and areas that satisfy predetermined merging conditions can be merged with other areas, so that the generated areas can be treated as units, thereby increasing the usefulness of the areas.

[0063] [Fourth embodiment] 10 is a block diagram showing a configuration of a video game processing server 10Z (server 10Z) which is an example of the video game processing server 10 in the system 100 (see FIG. 1). In this example, the server 10Z includes at least a setting unit 11Z, an arrangement unit 12Z, a generation unit 13Z, a determination unit 14Z, a search unit 15Z, and a thinning unit 16Z.

[0064] The setting unit 11Z has a function of setting a navigation mesh corresponding to a movable range of an object in a virtual space. Hereinafter, an example of setting a navigation mesh in a virtual space of a 3D cover shooting game in which soldiers and weapons appear will be described.

[0065] In this example, enemy soldiers can search for the player from the edge of the map, and combat can take place anywhere on the map, so normal movement (walking, running, etc.) is done on the navigation mesh.

[0066] Here, to realize the enemy function, the server 10Z can search for a long path from one end of the map to the other. In this example, a hierarchical path search is performed to suppress the path search load. Also, enemies can go anywhere the player can go, not just near the placement position. In other words, they can jump over and climb covers, and move through doors, windows, and ladders. In this example, to ensure freedom of movement, jump links are used to pass through places where the navigation mesh is not continuous.

[0067] In addition, as navigation-related functions, this example also describes movement between adjacent locations using a navigation mesh (NaviMesh), movement outside the mesh using jump links, a hierarchical structure to reduce the load of searching for long paths, and a function to automatically generate the above data.

[0068] Examples of terrain representations used in the above functions include a navmesh, a waypoint, a connection graph, and a higher-level graph based on the waypoints.

[0069] A well-known technology (for example, recast navigation) is used for the navi mesh, so a detailed explanation will be omitted here. In this example, a passable flag is set for polygons that are contiguous to the player's initial position. Since the player can climb walls of a certain height, a passable flag is also set for polygons that are not contiguous after climbing. In this case, for example, a search is made for meshes near a position shifted by the climbable height from an edge with no adjacent polygons, and if a matching mesh is found, a contiguous flag is set from that position.

[0070] The placement unit 12 has a function of placing a plurality of waypoints on the set navigation mesh in accordance with a predetermined placement rule. Below, an example will be described in which waypoints are automatically placed offline on the navigation mesh.

[0071] Here, a waypoint serves as a base for embedding information necessary for the game. In this example, the waypoint is associated with information such as the XYZ position, the navmesh polygon ID below the point, LOF (Line of Fire), point attributes, point connection information, nearby cover ID, nearby door ID, nearby ladder / window ID, shooting cover list, height from the point position to the ceiling, height when climbing over nearby cover, distance to the wall, and the ID of a destructible gimmick above the point, as necessary.

[0072] In this example, waypoints are automatically placed by placing points using a floodfill algorithm based on the player's initial position. Note that in a grid-like format, points may not be placed at required locations, so a configuration may be used in which points are added at will. In this case, a configuration may be used in which waypoints can be added to locations where various objects (e.g., doors, low cover, high cover ends, ladder attachment positions) are located in the virtual space.

[0073] The thinning unit 16Z has a function of thinning out waypoints selected according to a predetermined selection rule from among the multiple waypoints that have been placed. Below, an example of thinning out waypoints as a process after the points have been laid out will be explained. Note that after thinning out, it is preferable to have a number that keeps the index within 16 bits. This is because point indexes are stored in various places, so it is not desirable to increase them, and simply having a large number of them increases the load during searches too much.

[0074] FIG. 11 is an explanatory diagram for explaining an example of thinning out waypoints. In this example, after automatically arranging a plurality of waypoints (for example, waypoint 1111 and waypoint 1112) based on a player initial position 1101 (see FIG. 11A), points are randomly selected to thin out the arranged waypoints (see FIG. 11B). Also, in this example, points that should not be thinned out are not thinned out. That is, for example, when a waypoint is selected that corresponds to a point where the distance after thinning becomes too large if thinned out, a point where the graph is disconnected if thinned out, a point where the path becomes too detour if thinned out, the boundary of an upper layer graph node, a place that triggers an action such as a door, etc., the waypoint is not thinned out.

[0075] Fig. 12 is an explanatory diagram for explaining an example of a waypoint that should not be thinned out. As shown in Fig. 12, if waypoint 1211 is removed from range 1201 in which a navi mesh is set, the connection between the top and bottom will be lost. In other words, raycasts on the navi mesh from waypoint 1212 and waypoint 1213 to waypoint 1211 will not pass through. For this reason, waypoint 1211 will not be thinned out.

[0076] The search unit 15Z has a function of searching for a moving path of an object based on the arrangement of the plurality of waypoints after thinning. Hereinafter, a case will be described in which a route search is realized using a known route search technique with the arranged waypoints as candidate points for a route from a start point to an end point, such as a route from an enemy position to a player position, a route from an enemy position to a target object, or a route from a player to a position selected by the player, by way of an example.

[0077] The generation unit 13Z has a function of generating multiple areas by grouping multiple waypoints arranged in the virtual space according to a predetermined classification rule. Below, we will explain an example of generating an area (AI area) in which points that are close to each other in position are grouped together and labeled to a certain extent as the top-level structure for hierarchical path search. Note that the connection information uses point connections at the label boundaries.

[0078] In this example, the AI ​​area is responsible for treating points as a certain amount of chunks. It is preferable that the configuration is such that the positions are roughly expressed, without being too detailed. The AI ​​area also serves as a cost-added target that prevents players from taking the same path, and can also be used as an influence map for players and enemies. Furthermore, the AI ​​area is expected to reduce the load of path search by hierarchizing the position expression.

[0079] FIG. 13 is an explanatory diagram for explaining an example of a method for generating an area. As shown in FIG. 13A, when generating an area (AI area in this example) from a terrain 1301, waypoints are laid out on the terrain 1301, the waypoints are connected, a distance from a wall is set for each waypoint, and the set distance is divided by a watershed algorithm, so that an area S1 and an area S2 can be generated as shown in FIG. 13B. In addition, to supplement the watershed algorithm, if the distance from a wall is considered as a height, a mountain with a vertex at waypoint 1311 and a mountain with a vertex at waypoint 1312 are generated, and if evaluation is performed from the highest point, a label is first attached to waypoint 1311 (label 1). Next, if the evaluation altitude is lowered, two points on the middle of the mountain on the left side of the paper and the top of the mountain on the right side of the paper (waypoint 1312) are evaluated. At this time, the mountain on the right side of the paper is a top, so a label is attached (label 2). The middle of the mountain on the left side of the paper is part of the mountain on the left side of the paper, so it is given the same label as the peak of the mountain on the left side of the paper (label 1). Whether it is part of the mountain can be determined by checking whether adjacent points have already been labeled. Next, the altitude is lowered again and the same process is repeated to label the points at the base of the mountain on the left side of the paper and the base of the mountain on the right side of the paper. Finally, labels are added from adjacent points to parts that are not mountains (i.e. parts where the distance from the wall is determined to be 0 or the minimum). This allows labeling down to the lowest altitude. In other words, an upper layer graph can be generated using nodes with label 1 and nodes with label 2.

[0080] In this example, the generated regions are adjusted based on a predetermined adjustment rule. That is, among the multiple regions, those that meet a predetermined division condition are divided, and those that meet a predetermined merging condition are merged with other regions. With this configuration, regions that are too small are attached to the larger regions next to them, and regions that are too large are repeatedly "cut in half by the long side" until they reach a certain size, allowing them to be loosely treated as "units."

[0081] The determination unit 14Z has a function of determining an area (movement area) in which an object moves based on the arrangement of the generated multiple areas. In this example, a case will be described in which each area is a node and a known route search technique is used.

[0082] As a result of the above, data can be created in the order of navigation mesh, waypoint graph, and upper layer graph, and path search can be achieved in the order of upper layer graph, waypoint graph, and navigation mesh.

[0083] The path search ultimately requires a smooth path as intended by the video game designer. In other words, it is preferable that the configuration can derive a Bezier curve, a straight line, or a line that is not continuous from the current position of the object to the target position and requires an action, depending on the type of object. In this example, various lines can be derived by specifying the necessary action and position at the upper layer graph level, specifying the necessary action and position at the waypoint level, and searching for a path of continuous movement between the specified positions. Note that the path of continuous movement can be derived by passing through the upper layer path, creating a path of waypoints in the upper layer node, combining the waypoints of all nodes, creating a navmesh polygon list along the point path, creating a list of edges to be passed through, and creating a Bezier curve using the midpoints of the edges.

[0084] Fig. 14 is an explanatory diagram for explaining an example of a storage state of information stored in a storage unit (not shown) included in the server 10. As shown in Fig. 14, the storage unit stores area numbers and identification information of waypoints belonging to the areas in association with each other as area-related information.

[0085] Here, the area number means identification information of the generated area (for example, AI area). The configuration for creating the area number is not particularly limited, but it is preferable that each of the multiple areas can be uniquely identified. An example of an area number is a label attached to a waypoint.

[0086] 15 is a flowchart showing an example of a game process executed by the system 100Z including the server 10Z. In the game process in this example, a process related to the arrangement of waypoints is performed. Each process is explained below. The order of each process is random as long as no inconsistency occurs in the process contents.

[0087] The game process is started, for example, when the terminal 20 that has accessed the server 10Z satisfies the arrangement condition of the waypoint. Hereinafter, a case where a user operating the terminal 20 inputs a search request for a travel route will be described as an example.

[0088] In the game processing, the system 100Z first sets a navigation mesh (step S301). In this example, the server 10Z specifies a virtual space to be provided to the terminal 20, and sets a navigation mesh corresponding to a range in which an object can move in the specified virtual space.

[0089] After setting the navigation mesh, the system 100Z places waypoints (step S302). In this example, the server 10Z places a plurality of waypoints on the set navigation mesh in accordance with a predetermined placement rule.

[0090] After arranging the waypoints, the system 100Z thins out the waypoints (step S303). In this example, the server 10Z thins out the waypoints selected from the arranged waypoints according to a predetermined selection rule.

[0091] After thinning out the waypoints, the system 100Z generates a plurality of regions (step S304). In this example, the server 10Z generates a plurality of regions by grouping the plurality of waypoints arranged in the virtual space according to a predetermined classification rule.

[0092] After generating the multiple areas, the system 100Z determines a movement area (step S305). In this example, the server 10Z determines a movement area suitable for movement from an area including a movement start position to an area including a movement end position based on the arrangement of the generated multiple areas.

[0093] After determining the movement area, the system 100Z searches for a movement route (step S306). In this example, the server 10Z searches for a movement route for the object based on the arrangement of a plurality of waypoints arranged in the virtual space.

[0094] As described above, as one aspect of the fourth embodiment, the server 10Z having a function for searching for a movement path in a virtual space is configured to include a setting unit 11Z, a placement unit 12Z, a generation unit 13Z, a determination unit 14Z, a search unit 15Z, and a thinning unit 16Z. Therefore, a navigation mesh corresponding to a movable range of an object in the virtual space is set, a plurality of waypoints are placed on the set navigation mesh according to a predetermined placement rule (e.g., a filling algorithm), and a plurality of areas are generated by grouping the plurality of waypoints placed in the virtual space based on a predetermined classification rule (e.g., random selection), and an area (movement area) in which the object moves is determined based on the placement of the plurality of generated areas, and a movement path of the object is searched for based on the waypoints included in the movement area, thereby reducing the processing load required for searching for the movement path of the object.

[0095] In other words, rather than simply placing waypoints, the travel area is determined and then a travel route is searched for, making it possible to search for a travel route in stages, thereby reducing the processing load required to search for a travel route compared to when all placed waypoints are searched for.

[0096] Furthermore, in the example of the fourth embodiment described above, the server 10Z is configured to use a watershed algorithm that sets the distance of each of the multiple waypoints from the unmovable area as a parameter to group the multiple waypoints and generate each of the multiple areas based on the position information of the waypoints that belong to the same group. Therefore, multiple areas can be generated more efficiently than, for example, when a video game developer classifies waypoints and generates areas.

[0097] Although not specifically mentioned in the above-mentioned fourth embodiment, the timing of the processing by the server 10Z, the setting unit 11Z, the arrangement unit 12Z, the generation unit 13Z, the determination unit 14Z, and the thinning unit 16Z is not particularly limited, and may be during the development of the video game or during the playing of the video game. Specifically, the setting of the navigation mesh, the arrangement of the waypoints, and the generation of the AI ​​area may be configured to be performed independently of the route search, or may be configured to be performed in a series with the route search. That is, for example, the search unit 15Z may be configured to read information (e.g., area-related information) generated before the player plays the video game according to the progress of the video game, update the read information according to the situation of the video game (e.g., change the movable area), and search for a movement route based on the updated information. Also, for example, the search unit 14 may be configured to set the navigation mesh according to the progress of the video game, and search for a movement route using the information generated in real time.

[0098] Although not specifically mentioned in the example of the fourth embodiment described above, the server 10Z may set a navigation mesh corresponding to a movable range of an object in a virtual space, arrange a plurality of waypoints on the set navigation mesh according to a predetermined arrangement rule (e.g., a filling algorithm), thin out waypoints selected according to a predetermined selection rule (e.g., random selection) from the arranged plurality of waypoints, and store search information (e.g., a representation of the terrain of the virtual space) including the arrangement of the thinned out waypoints in a storage means. In this case, the video game processing device that has acquired video game-related information including the search information may search for a movement path of the object in the virtual space based on the search information.

[0099] As described above, each embodiment of the present application solves one or more deficiencies. Note that the effects of each embodiment are non-limiting effects or examples of effects.

[0100] In each of the above-described embodiments, the multiple user terminals 20, 201 to 20N and the server 10 execute the above-described various processes in accordance with various control programs (for example, a video game processing program) stored in their own storage devices.

[0101] The configuration of the system 100 is not limited to the configurations described as examples of each of the above-mentioned embodiments, and may be configured such that the server 10 executes some or all of the processes described as processes executed by the user terminal, or such that any one of the multiple user terminals 20, 201-20N (e.g., the user terminal 20) executes some or all of the processes described as processes executed by the server 10. Also, any one of the multiple user terminals 20, 201-20N may have some or all of the storage unit included in the server 10. In other words, the system 100 may be configured such that some or all of the functions included in either the user terminal 20 or the server 10 are included in the other one.

[0102] Furthermore, the program may be configured to realize some or all of the functions described as examples of each of the above-mentioned embodiments in a standalone device that does not include a communication network.

[0103] [Note] The above-mentioned embodiment has been described so as to enable at least one person having ordinary skill in the art to which the invention pertains to practice the invention. [1] A video game processing program for causing a server to realize a function related to searching for a moving path in a virtual space, comprising: The server, A setting function that sets the navigation mesh corresponding to the movable range of an object in virtual space; a placement function for placing a plurality of waypoints on the set navigation mesh in accordance with a predetermined placement rule; A generation function that generates a plurality of areas by grouping the plurality of waypoints arranged in the virtual space based on a predetermined classification rule; A determination function for determining an area (hereinafter referred to as a "movement area") into which the object moves based on the arrangement of the plurality of areas that have been generated; A search function for searching a movement path of the object based on waypoints included in the determined movement area. A video game processing program to make this happen. [2] The determination function includes a function of referring to a predetermined storage means that stores connection information between each of the plurality of waypoints and other waypoints, and determining the movement area based on the connection information of waypoints arranged on the boundaries of the plurality of areas. [1] A video game processing program for achieving this. [3] The generating function includes a function of dividing an area that satisfies a predetermined division condition among the plurality of areas, and merging an area that satisfies a predetermined merging condition into another area. A video game processing program according to [1] or [2] for achieving this. [4] The generation function uses a watershed algorithm that sets a parameter of the distance of each of the plurality of waypoints from a non-movable area to group the plurality of waypoints, and generates each of the plurality of areas based on position information of waypoints that belong to the same group. A video game processing program for realizing the above-mentioned object. [5] A video game processing program for causing a user terminal capable of communicating with the server to realize at least one of the functions that the video game processing program described in any one of [1] to [4] causes the server to realize. [6] A server on which a video game processing program according to any one of [1] to [5] is installed. [7] A video game processing system comprising a communication network, a server, and a user terminal, the video game processing system performing processing related to searching for a moving path in a virtual space, A setting means for setting a navigation mesh corresponding to a movable range of an object in a virtual space; a placement means for placing a plurality of waypoints on the set navigation mesh in accordance with a predetermined placement rule; a generation means for generating a plurality of areas by grouping the plurality of waypoints arranged in the virtual space based on a predetermined classification rule; A determination means for determining an area (hereinafter referred to as a "movement area") into which the object moves based on the generated arrangement of the plurality of areas; and a search means for searching a movement path of the object based on waypoints included in the determined movement area. A video game processing system comprising: [8] the server includes the setting means, the arrangement means, the generation means, the determination means, and the search means; The user terminal includes an output means for outputting a game screen showing the travel route searched by the search means onto a display screen of a display device. [7] A video game processing system as described above. [9] A video game processing program for enabling a user terminal to realize a function related to searching for a moving path in a virtual space, comprising: a setting function for setting a navigation mesh corresponding to a movable range of an object in a virtual space, an arrangement function for arranging a plurality of waypoints on the set navigation mesh in accordance with a predetermined arrangement rule, a generation function for generating a plurality of areas by grouping the plurality of waypoints arranged in the virtual space based on a predetermined classification rule, a determination function for determining an area (hereinafter referred to as a "movement area") in which the object moves based on the arrangement of the plurality of generated areas, and a search function for searching for a movement path of the object based on the waypoints included in the determined movement area, the user terminal is provided with a function for receiving information about functions provided by the server and performing input / output corresponding to the functions from the server; A video game processing program to make this happen.

[10] A video game processing program for enabling a user terminal to realize a function related to searching for a moving path in a virtual space, comprising: The user terminal, A setting function that sets the navigation mesh corresponding to the movable range of an object in virtual space; a placement function for placing a plurality of waypoints on the set navigation mesh in accordance with a predetermined placement rule; A generation function that generates a plurality of areas by grouping the plurality of waypoints arranged in the virtual space based on a predetermined classification rule; A determination function for determining an area (hereinafter referred to as a "movement area") into which the object moves based on the arrangement of the plurality of areas that have been generated; A search function for searching a movement path of the object based on waypoints included in the determined movement area. A video game processing program to make this happen.

[11]

[10] A video game processing program for causing a server capable of communicating with the user terminal to realize at least one of the functions that the video game processing program described in the present invention causes the user terminal to realize.

[12] A user terminal having the video game processing program described in

[10] or

[11] installed.

[13] A video game processing method for performing processing related to searching for a moving path in a virtual space, comprising: A setting process for setting a navigation mesh corresponding to a movable range of an object in a virtual space; a placement process for placing a plurality of waypoints on the set navigation mesh in accordance with a predetermined placement rule; a generation process for generating a plurality of areas by grouping the plurality of waypoints arranged in the virtual space based on a predetermined classification rule; A determination process for determining an area (hereinafter referred to as a "movement area") into which the object moves based on the arrangement of the generated plurality of areas; and a search process for searching for a movement path of the object based on waypoints included in the determined movement area. A video game processing method comprising:

[14] A video game processing method in which a video game processing system including a communication network, a server, and a user terminal performs processing related to searching for a movement path in a virtual space, the method comprising: A setting process for setting a navigation mesh corresponding to a movable range of an object in a virtual space; a placement process for placing a plurality of waypoints on the set navigation mesh in accordance with a predetermined placement rule; a generation process for generating a plurality of areas by grouping the plurality of waypoints arranged in the virtual space based on a predetermined classification rule; A determination process for determining an area (hereinafter referred to as a "movement area") into which the object moves based on the arrangement of the generated plurality of areas; and a search process for searching for a movement path of the object based on waypoints included in the determined movement area. A video game processing method comprising:

[15] A video game processing program for causing a computer to realize a function related to searching for a moving path in a virtual space, comprising: The computer includes: A setting function that sets the navigation mesh corresponding to the movable range of an object in virtual space; a placement function for placing a plurality of waypoints on the set navigation mesh in accordance with a predetermined placement rule; A generation function that generates a plurality of areas by grouping the plurality of waypoints arranged in the virtual space based on a predetermined classification rule. A video game processing program to make this happen.

[16] A video game processing program for causing a computer to realize a function related to searching for a moving path in a virtual space, comprising: The computer includes: a determination function that determines a movement area of ​​an object placed in the virtual space based on information generated using a setting function that sets a navigation mesh corresponding to a movable range of an object in a virtual space, a placement function that places a plurality of waypoints on the set navigation mesh in accordance with a predetermined placement rule, and a generation function that generates a plurality of areas by grouping the plurality of waypoints placed in the virtual space based on a predetermined classification rule; A search function for searching a movement path of the object based on waypoints included in the determined movement area. A video game processing program to make this happen.

[17] A video game processing program for causing a computer to realize a function of generating information used to search for a moving path in a virtual space, comprising: The computer includes: A setting function that sets the navigation mesh corresponding to the movable range of an object in virtual space; a placement function for placing a plurality of waypoints on the set navigation mesh in accordance with a predetermined placement rule; A generation function that generates a plurality of areas by grouping the plurality of waypoints arranged in the virtual space based on a predetermined classification rule; A storage function for storing search information including the generated multiple regions in a storage device. A video game processing program to make this happen. [Industrial Applicability]

[0104] According to one embodiment of the present invention, it is useful to reduce the processing load required to search for a movement path of an object. [Explanation of symbols]

[0105] 10 Video Game Processing Server 20,201~20N User terminals 11 Setting section 12 Placement section 13 Generation part 14 Decision Section 15 Exploration Department 16 Thinning Section 30 Communication Network 100 Video Game Processing System

Claims

1. A video game processing program for causing a server to realize a function related to searching for a moving path in a virtual space, comprising: The server, A setting function that sets the navigation mesh corresponding to the movable range of an object in virtual space; a placement function for placing a plurality of waypoints on the set navigation mesh in accordance with a predetermined placement rule; A generation function that generates a plurality of regions by grouping the plurality of waypoints arranged on the set navigation mesh based on a predetermined classification rule; A determination function for determining an area (hereinafter referred to as a "movement area") into which the object moves based on the arrangement of the plurality of areas that have been generated; A search function for searching a movement path of the object based on waypoints included only in the determined movement area is realized; The determination function determines a travel area suitable for travel by treating each of the generated multiple areas as a node and searching for a route from an area including a travel start position to an area including a travel end position. A video game processing program to make this happen.

2. The determination function includes a function of referring to a predetermined storage means that stores connection information between each of the plurality of waypoints and other waypoints, and determining the movement area based on the connection information of waypoints arranged on the boundaries of the plurality of areas.

2. The video game processing program according to claim 1 for implementing the video game processing program.

3. The generating function includes a function of dividing an area that satisfies a predetermined division condition among the plurality of areas, and merging an area that satisfies a predetermined merging condition into another area.

3. The video game processing program according to claim 1 or 2 for realizing the above.

4. A video game processing system comprising a communication network, a server, and a user terminal, and performing processing related to searching for a moving path in a virtual space, A setting means for setting a navigation mesh corresponding to a movable range of an object in a virtual space; a placement means for placing a plurality of waypoints on the set navigation mesh in accordance with a predetermined placement rule; a generation means for generating a plurality of regions by grouping the plurality of waypoints arranged on the set navigation mesh based on a predetermined classification rule; A determination means for determining an area (hereinafter referred to as a "movement area") into which the object moves based on an arrangement of the generated plurality of areas; a search means for searching a movement path of the object based on waypoints included only in the determined movement area; The determining means determines a travel area suitable for travel by treating each of the generated multiple areas as a node and searching for a route from an area including a travel start position to an area including a travel end position. A video game processing system comprising:

5. A video game processing program for enabling a user terminal to realize a function related to searching for a moving path in a virtual space, comprising: The user terminal, A setting function that sets the navigation mesh corresponding to the movable range of an object in virtual space; a placement function for placing a plurality of waypoints on the set navigation mesh in accordance with a predetermined placement rule; A generation function that generates a plurality of regions by grouping the plurality of waypoints arranged on the set navigation mesh based on a predetermined classification rule; A determination function for determining an area (hereinafter referred to as a "movement area") into which the object moves based on the arrangement of the plurality of areas that have been generated; A search function for searching a movement path of the object based on waypoints included only in the determined movement area is realized; The determination function determines a travel area suitable for travel by treating each of the generated multiple areas as a node and searching for a route from an area including a travel start position to an area including a travel end position. A video game processing program to make this happen.

Citation Information

Patent Citations

  • Channel selector

    JP1981027526A

  • Production of 6-halogeno-hydroxyquinoxaline

    JP1986044877A

  • Semi-real-time simulation type video game device

    JP1999267361A

  • Group character movement control method, recording medium, simulation device and game device

    JP2005342360A

  • Program, character move controlling method, and character move controlling device

    JP2006271786A