JP2013059422A - Object control program, computer readable storage medium storing object control program therein, object controller, and object control method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To set a destination to an object of interest according to the type of the object of interest, an action the object of interest makes, and the position of an obstacle, etc.SOLUTION: An object control program causes a computer to function as: an object of interest specifying unit which identifies an object of interest in a virtual space and acquires position information and identification information of object of interest, a destination candidate information memory means storing therein the identification information of the object of interest associated with destination candidate information for acquiring position information of a destination candidate group consisting of candidates for a destination to the move of an object; and a destination information acquiring unit which acquires position information of the destination candidate group for the object of interest based on the acquired position information and identification information of the object of interest and on the destination candidate information, and acquires destination information indicative of position information of the destination from the position information of the destination candidate group.

Description

  The present invention relates to an object control program, a computer-readable recording medium storing the object control program, an object control apparatus, and an object control method.

  A game is known in which a character is moved to a predetermined destination to perform a predetermined action. For example, in the virtual space, a character that is not an operation target of the player is moved to the location of a specific item, and the item is held.

  In this case, for example, depending on the position of the holding unit (for example, a handle) in the item, the type of the item, etc., in order to express a more natural movement, There is a case where it is desired to move and perform a predetermined operation such as an item holding operation. In this case, for example, when the character has a certain amount of space in the virtual space, it is desirable to avoid interference with an obstacle during the predetermined action. Furthermore, the destination is preferably closer to the character.

  In view of the above problems, the present invention sets a destination for the item according to, for example, the type of item, the action to be performed on the item, the position of an obstacle, etc. It is an object to realize an object control program that can be moved to perform the predetermined operation, a computer-readable recording medium that stores the object control program, an object control apparatus, and an object control method.

  (1) An object control program of the present invention specifies an object of interest in a virtual space, an interest object specifying means for acquiring position information and identification information of the object of interest, and an object movement object in the identification information of the object of interest. Destination candidate information storage means in which destination candidate information for obtaining position information of a destination candidate group that is a candidate for a location is associated and stored; and the acquired position information and identification information of the object of interest; Based on the destination candidate information, the position information of the destination candidate group for the object of interest is acquired, and the destination information indicating the position information of the destination is acquired from the position information of the destination candidate group The computer is made to function as destination information acquisition means.

  (2) In the object control program according to (1), further, route information specification that specifies one route information among the plurality of route information based on the position of interest and the plurality of route information. And the destination information acquisition unit acquires the destination information based on the position information indicated by the specified one route information and the position information of each destination candidate group. It is characterized by that.

  (3) In the object control program according to (1) or (2), the destination information is acquired based on position information of an obstacle object that forms an obstacle to the object in the virtual space. Features.

  (4) In the object control program according to (3), the destination information acquisition unit is arranged in each destination candidate group and has position information of a box having a predetermined size and shape, and the obstacle The destination information is acquired based on the position information of the object.

  (5) In the object control program according to (3) or (4), the route information specifying unit further determines whether the route information of 1 can be specified based on position information of the obstacle object. If it is determined that it is not identifiable, one route information of the route information is identified as proxy route information based on the interest and position information of the route information, and the object control program Further, proxy point acquisition that acquires position information of a plurality of proxy points based on the position information of the proxy route information, the position information of the object of interest, the position information of the object, and the position information of the obstacle As a means, a computer is made to function, and the destination information acquisition means acquires the destination information based on position information of the plurality of proxy points. It is characterized in.

  (6) In the object control program according to any one of (1) to (5), the destination candidate information storage unit further associates and stores action identification information for identifying an action to be performed by the object. It is characterized by that.

  (7) In the object control program according to (6), the object control program further includes arrival determination means for determining whether the object has reached the destination, and the arrival determination means. When it is determined that the destination has arrived, the computer is caused to function as an object motion control unit that performs an operation identified by the motion identification information stored in association with the destination candidate information.

  (8) In the object control program according to any one of (1) to (7), the destination candidate information includes distance information and direction information indicating a distance and direction from the position information of the object of interest. It is characterized by.

  (9) In the object control program according to (8), the destination candidate information is a radius indicating a radius of the shape in a shape formed around a center position obtained from the distance information and the direction information. Information, angle information indicating the center angle of the shape, and division number information for dividing the center angle.

  (10) A computer-readable storage medium storing the object control program according to any one of (1) to (9).

  (11) An object control device according to the present invention specifies an interest object in a virtual space, and obtains position information and identification information of the interest object. Destination candidate information storage means in which destination candidate information for obtaining position information of a destination candidate group that is a destination candidate is stored in association with each other; the acquired position information and identification information of the object of interest; Based on the destination candidate information, the position information of the destination candidate group for the object of interest is acquired, and the destination information indicating the position information of the destination is acquired from the position information of the destination candidate group And destination information acquisition means.

  (12) The object control method of the present invention specifies an object of interest in a virtual space, acquires position information and identification information of the object of interest, and acquires the position information and identification information of the acquired object of interest, and the interest Based on the destination candidate information stored in association with the destination candidate information for obtaining the location information of the destination candidate group that is a candidate for the destination of the movement of the object to the target identification information, In addition, the position information of the destination candidate group is acquired, and the destination information indicating the position information of the destination is acquired from the position information of the destination candidate group.

It is a figure for demonstrating the outline | summary of a structure of the object control apparatus in embodiment of this invention. It is a figure for demonstrating the functional structure implement | achieved by the control part, memory | storage part, etc. of the object control apparatus shown in FIG. It is a figure which shows an example of the virtual space in this Embodiment. It is a figure for demonstrating the functional structure of the operation control part shown in FIG. It is a figure which shows an example of the storage format of AVD information in this Embodiment. It is a figure for demonstrating an example of the AVD information in this Embodiment. It is a figure which shows an example of the storage format of the ranking information in this Embodiment. It is a figure for demonstrating an example of the nearest edge acquisition process in this Embodiment. It is a figure for demonstrating an example of the nearest edge acquisition process in this Embodiment. It is a figure for demonstrating an example of the nearest edge acquisition process in this Embodiment. It is a figure for demonstrating an example of the nearest edge acquisition process in this Embodiment. It is a figure for demonstrating an example of the nearest edge acquisition process in this Embodiment. It is a figure for demonstrating an example of the nearest edge acquisition process in this Embodiment. It is a figure for demonstrating an example of the nearest edge acquisition process in this Embodiment. It is a figure for demonstrating an example of the nearest edge acquisition process in this Embodiment. It is a figure for demonstrating an example of the nearest edge acquisition process in this Embodiment. It is a figure for demonstrating an example of the bounding box in this Embodiment. It is a figure for demonstrating an example of the proxy point acquisition process in this Embodiment. It is a figure for demonstrating the outline | summary of the flow of the object control apparatus in this Embodiment. It is a figure for demonstrating the outline | summary of the flow of the object control apparatus in this Embodiment. It is a figure for demonstrating the outline | summary of the flow of the object control apparatus in this Embodiment. It is a figure for demonstrating the outline | summary of the flow of the object control apparatus in this Embodiment.

  Embodiments of the present invention will be described below with reference to the drawings. In addition, about drawing, the same code | symbol is attached | subjected to the same or equivalent element, and the overlapping description is abbreviate | omitted.

  FIG. 1 is a diagram for explaining an outline of a configuration of an object control apparatus according to an embodiment of the present invention. As shown in FIG. 1, the object control apparatus 100 is configured by a computer including, for example, a CPU, a memory, and the like. Have. Note that the control unit 101, the storage unit 102, the communication unit 103, the operation unit 104, and the display unit 105 are connected to each other via an internal bus 106.

  The control unit 101 is, for example, a CPU, MPU, or the like, and operates according to a program stored in the storage unit 102. The storage unit 102 is an information recording medium that includes an information recording medium such as a ROM, a RAM, and a hard disk, and holds a program executed by the control unit 101.

  The storage unit 102 also operates as a work memory for the control unit 101. The program may be provided by being downloaded via a network (not shown), or provided by various information recording media that can be read by a computer such as a CD-ROM or a DVD-ROM. May be.

  The communication unit 103 connects the object control device 100 to another terminal device (not shown), a database (not shown), or the like via a network (not shown). The operation unit 104 includes, for example, a keyboard, a mouse, a controller, or the like, and outputs the content of the instruction operation to the control unit 101 in accordance with a user instruction operation. The display unit 105 is a liquid crystal display, an organic EL display, or the like, for example, and displays information in accordance with an instruction from the control unit 101. The configuration of the object control apparatus 100 is an example and is not limited to this. For example, the terminal device may be configured to input a user instruction operation to the object control device 100 via a network.

  FIG. 2 is a diagram for explaining a functional configuration realized by a control unit, a storage unit, and the like of the object control apparatus shown in FIG. As shown in FIG. 2, the object control device 100 functionally includes a motion control unit 201, a spatial DB 202, a spatial information generation unit 203, an interest target identification unit 204, an AVD information acquisition unit 205, a ranking information storage unit 206, an AC Position information acquisition unit 207, area division unit 208, nearest neighbor determination unit 209, raycast determination unit 210, nearest edge acquisition unit 211, AP expansion unit 212, space check determination unit 213, AP acquisition unit 214, arrival determination unit 215 A shortest edge acquisition unit 216, an AP creation unit 217, a proxy point acquisition unit 218, and an AVD information storage unit 219.

  In the following, for the sake of simplicity of explanation, the virtual space generated by the object control device 100 is shown in FIG. 3, for example, when a non-operation object is moved toward the object of interest. Will be described as an example. FIG. 3 is a diagram illustrating an example of a virtual space. As shown in FIG. 3, an operation object 301, a non-operation object 302, an interest object 303, a wall 304, a way collision 305, and the like are represented in the virtual space. Here, the operation object corresponds to, for example, a character or the like operated by the user, and the non-operation object corresponds to, for example, a character or the like that is not an operation target of the user, such as an enemy character. The object of interest corresponds to, for example, an item held or used by a character, an enemy character, or the like. Walls and way collisions correspond to objects that become obstacles to enemy characters and the like, but will be described later in detail.

  In the virtual space, movement and movement of the operation object 301, the non-operation object 302, and the object of interest 303 are performed by the movement control unit 201. Specifically, the motion control unit 201 includes an operation object motion control unit 401, a non-operation object motion control unit 402, and an interest target motion control unit 403 as illustrated in FIG.

  The operation object motion control unit 401 moves and operates the operation object in accordance with operation information input to the operation unit 104.

  The non-operation object movement control unit 402 moves and moves a non-operation object that is an object that is not an operation target of the user. Specifically, for example, in the case illustrated in FIG. 3, the non-operation object motion control unit 402 includes non-operation objects 302 including nodes 306, 307, and 308 and edges 309 and 310 arranged in the virtual space. Move based on configured path. That is, when the non-operation object 302 is moved toward the target of interest 303, the edge 309 is moved to the edge 310, and the like. Here, the non-operation object may be configured such that, for example, a so-called Bezier curve or the like is applied to both end points of the edge so that the non-operation object moves along the Bezier curve. Further, the path is configured not to be displayed in the virtual space actually displayed on the display unit 105 or the like. Also, information indicating the position of the node, edge, or the like is held in the space DB 202, for example. Details of other movements and movements of the non-operation object will be described later.

  The interesting object operation control unit 403 displays and moves the interesting object in the virtual space. Specifically, for example, the position information and image information of the object of interest are held in the space DB 202, and the object of interest operation control unit 403 displays the object of interest based on the position information and the like.

  The space information generation unit 203 generates image information representing the virtual space. Specifically, for example, a background such as a wall in a virtual space, an operation object, a non-operation object, position information and image information of an object of interest are held in the space DB 202, and the position information and image information of the wall or the like are included in the space information. Based on this, image information representing the virtual space is generated. Note that position information such as operation objects, non-operation objects, and interests stored in the space DB 202 is updated by, for example, the movement of the operation objects by the motion control unit 201. The image information may be displayed on the display unit 105, for example, or may be transmitted via a network and displayed on a display unit (not shown) of a terminal device connected to the network.

  Similarly, the spatial information generation unit 203 generates a way collision or the like in the virtual space. Here, the term “way collision” corresponds to, for example, a wall that is not actually displayed, that is, an invisible wall, and is arranged at a predetermined distance along a wall that is displayed in the displayed virtual space. . For example, the non-operation object motion control unit 402 regards the way collision as an obstacle to the non-operation object, and does not move the non-operation object to the wall side or the like from the way collision. In addition, the position information and the like are set so that the way collision is arranged at a predetermined distance from the wall or the like in consideration of the size of the object in advance. Therefore, it is possible to prevent the non-operation object movement control unit 402 from moving the non-operation object into the wall.

  Under the above premise, first, a functional configuration realized in a process of acquiring nearest edge information described later will be mainly described.

  The interest target specifying unit 204 specifies the interest target of the non-operation object according to a predetermined criterion, and acquires the interest target identification information (interest target ID) and the position information of the target object. Specifically, for example, the identification of the target of interest is based on the non-operation object from the motion control unit 201 or the space DB 202 and the position information of the target of interest. It may be configured to identify and acquire the interest object ID and its position information.

  Further, for example, when the non-operation object represents an animal or the like, it may be configured to identify an interest object that is present at a closer position from among the interest objects that enter the field of view. Further, score information may be associated and stored for each object of interest, and the object of interest may be specified according to the score information or according to the score information and the distance. Here, in FIG. 3, an example in which the interest target specifying unit 204 specifies the interest target 303 (interest target identification information (interest target ID), K1) will be described as an example.

  The AVD information acquisition unit 205 acquires AVD (Approach Volume Data) information stored in association with the interest target ID acquired by the interest target specifying unit 204 based on the priority order information. Specifically, the AVD information of the next priority is acquired when the nearest edge (to be described later) cannot be acquired or when the destination (AP: Approach Point) for moving the non-operation object cannot be acquired.

  Here, the AVD information corresponds to information indicating a position that is a candidate (hereinafter referred to as an AP candidate) of a destination (hereinafter referred to as an AP) to which a non-operation object is moved with respect to the specified interest of interest. . Specifically, for example, as shown in FIG. 5, each AVD information includes AVDID, angle information, division number information, AP radius information, direction information, and AC distance information. Each AVD information is stored in the AVD information storage unit 219, for example.

Here, the AVD information will be described taking the AVDID 1-1 shown in FIG. 5 as an example. As shown in FIG. 6, the distance indicated by the AC distance information in the direction (x ₁ , y ₁ , z ₁ ) indicated by the direction information from the position information of the object of interest 601 acquired by the interest target specifying unit 204. 2, an approach center (hereinafter referred to as AC) 602 is arranged. Then, a sector having a radius of 20 indicated by the AP radius information from AC and a position of 20 and having an angle of 60 ° with respect to the direction is formed from AC. Then, an AP candidate group 603 is arranged at a position obtained by dividing the angle 60 ° by the division number 3. That is, the AVD information corresponds to information for obtaining the position of the AP candidate group to be arranged for the identified interest object. That is, the AC distance information corresponds to information representing the distance between the object of interest and the AC, and the AP radius information corresponds to information representing the distance between the AC and the AP candidate. As described above, the position of each AP candidate group is obtained.

  The method for determining each AP candidate group shown in FIG. 6 is an example, and is not limited to this. Other semi-circles or circles having an angle of 180 °, 360 °, etc. are formed, and APs are determined according to the number of divisions. The position of the candidate group may be determined. Furthermore, other methods may be used as long as an AP candidate group located in a predetermined direction or a predetermined distance from the object of interest is acquired.

  For example, as illustrated in FIG. 7, the ranking information storage unit 206 stores priority order information, action ID, and AVDID in association with each interest ID. Here, the action ID is information for identifying each action to be performed by a non-operation object such as smelling, touching, striking, and biting. Further, for example, motion data corresponding to each operation is associated with the action ID, and the non-operation object performs a predetermined operation corresponding to each motion data. The AVD information acquisition unit 205 acquires AVDIDs in descending order of priority information as described above, and acquires corresponding AVD information from the AVD information storage unit 219 based on the acquired AVDID. In addition, you may comprise each motion data so that it may become different data according to angle information etc.

  Specifically, for example, the AVD information acquisition unit 205 is the case shown in FIG. 7, and when the interest target ID and K1 are acquired as in the above example, the AVD information acquisition unit 205 is acquired by the interest target specifying unit 204. AVDID and AVD1 are acquired based on the interest ID and K1. Then, based on the AVDID and AVD1, the AVD information stored in association with the AVD1-1 is acquired.

  FIG. 5 shows a case where two AVDIDs (AVD1-1, AVD1-2) are stored for AVDID and AVD1, but the present invention is not limited to this, and other numbers of AVDIDs may be stored. . In the above description, the AVDID is acquired from the ranking information storage unit 206 and the corresponding AVD information is acquired from the AVD information storage unit 219 via the AVDID. However, the ranking information and the AVD information are associated with each other, Stored in one storage unit, for example, the ranking information storage unit 206 or the AVD information storage unit 219, and the AVD information acquisition unit 205 acquires corresponding AVD information from the one storage unit based on the interest ID. You may comprise.

  The AC position information acquisition unit 207 calculates and acquires AC position information about the acquired AVD information based on the position information of the target of interest acquired by the target of interest specifying unit 204 and the AVD information acquired by the AVD information acquisition unit 205. To do. Specifically, for example, AC position information corresponding to the acquired AVD information is calculated based on AC distance information and direction information stored in association with AVDID and AVD1-1, and position information of interest. ,get. Thereby, for example, as described with reference to FIG. 6, AC position information is calculated and acquired.

  The area dividing unit 208 divides the virtual space into a plurality of areas based on the AC position information acquired by the AC position information acquiring unit 207. Specifically, a case where an AC, a path 801, a wall 802, and a way collision 803 as illustrated in FIG. 8A are arranged in the virtual space will be described as an example. Note that, for example, the AC position information is acquired by the AC position information acquisition unit 207, and the position information of the path 801, the wall 802, and the way collision 803 is acquired from the space DB 202 as described above.

  As shown in FIG. 8B, the area dividing unit 208 divides the virtual space into eight radially around the AC. The number of divisions is an example, and other numbers may be used.

  The nearest edge determination unit 209 determines the nearest edge that is the edge having the closest distance from the AC for each area divided by the area division unit 208. Specifically, for example, the nearest edge determination unit 209 acquires the position information of each edge from the space DB 202, and obtains the nearest point from the AC at each edge based on the position information of the AC and the position information. The nearest edge for each area of the virtual space divided by the area dividing unit 208 is determined.

  Here, the nearest point corresponds to an intersection with each edge when a perpendicular line is drawn from AC to each edge, but when the intersection exists outside the edge, the edge closest to the intersection Corresponds to the end point of. Specifically, for example, in the case shown in FIG. 8C, since the intersection of the edge E0 and the perpendicular line from AC to E0 is on the edge E0, and the intersection belongs to the area 7, the edge E0 has the area 7 And the closest point is the intersection. On the other hand, for example, in the case shown in FIG. 8D, since the intersection of the perpendicular line from the AC to the edge E2 does not exist on the edge E2, the end point (node) of the edge closest to the intersection is set as the nearest point. Since the nearest point belongs to area 1, it is determined that edge E2 belongs to area 1.

  When a plurality of edges exist in the same area, the edge whose nearest point is closer to AC is set as the nearest edge. For example, when the nearest neighbor points of the two edges are included in the same area as edges E3 and E5 shown in FIG. 8E, the edge having the nearest neighbor point closer to AC is set as the nearest neighbor edge. In other words, in the case shown in FIG. 8E, the edges whose nearest neighbor points are included in the area 3 are the edge E3 and the edge E5, of which the edge E3 is the nearest edge. As described above, the nearest edge in each area is determined. FIG. 8F shows the situation at this time.

  The ray cast determination unit 210 performs ray cast determination described later between both end points of the nearest edge of each area determined by the nearest edge determination unit 209 and the AC. If the raycast determination between the AC and either one of the two end points is successful, the edge is acquired by the nearest edge acquisition unit 211 described later as the nearest edge candidate.

  When the raycast determination for the nearest edge of all areas fails, the AVD information acquisition unit 205 is made to acquire AVDID having the next priority information. For example, when a plurality of AVDIDs (AVDID1-1, AVDID1-2) are associated with one priority, as in the above example, other AVDIDs (AVDID1-2 in the above example) If the ray cast determination fails for all the plurality of AVDIDs, the next AVDID (AVDID, AVD2 in the above example) is acquired.

  Here, the raycast determination is, for example, when one point (in this case, one of the end points of the edge) and AC are connected by a straight line, the non-operation object is placed on the straight line. Judgment is made based on whether or not there is a way collision or a wall that becomes an obstacle, and if it does not exist, it is determined that the raycast determination has succeeded, and if it does not exist, it is determined that the raycast determination has failed. .

  Specifically, for example, as shown in FIG. 8G, the edge E0 is determined as the nearest edge candidate because the raycast determination is successful for both end points. Also, for the edge E2, since the raycast determination is successful for one end point, it is determined as the nearest edge candidate. On the other hand, for the edge E3, since there is a way collision on the straight line connecting AC and both ends, the raycast determination unit 210 determines that the raycast determination has failed and does not determine the nearest edge candidate. That is, in the above example, the nearest edge candidates are the edges E0 and E2, and the ray cast determination unit 210 causes the nearest edge acquisition unit 211 to acquire the edges E0 and E2.

  The nearest edge acquisition unit 211 acquires an edge indicating the nearest edge candidate from the raycast determination unit 210, calculates and compares the distance from the AC to the nearest point of each nearest edge candidate, and selects the nearest edge candidate with the shortest distance, Get as the nearest edge. Specifically, for example, as shown in FIG. 8H, when the distance from AC to the nearest point of edge E0 is compared with the distance from AC to the nearest point of edge E2, the distance to the nearest point of E0 is short. As shown in FIG. 8I, the edge E0 is acquired as the nearest edge. The edge position information and the like are acquired from the space DB 202, and the distance and the like are calculated based on the position information. As described above, the load on the object control program can be reduced by dividing the area into a plurality of areas and acquiring the nearest edge. Note that the above is an example, and it is needless to say that the nearest edge may be acquired without dividing the area.

  Next, a functional configuration realized mainly in the process of determining an AP (corresponding to a destination of movement of a non-operation object) will be described. When the nearest edge obtaining unit 211 obtains the nearest edge, the AP developing unit 212 calculates and obtains position information of the corresponding AP candidate group based on the AVD information obtained by the AVD information obtaining unit 205. The AVD information corresponds to the AVD information from which the nearest edge is acquired. Specifically, for example, as described above, the position information of the AP candidate group 603 developed as shown in FIG. 6 is calculated based on the angle information, the division number information, the AP radius information, and the like included in the AVD information. .

  The ray cast determination unit 210 performs ray cast determination between each AP candidate and the AC. In addition, the ray cast determination unit 210 further performs ray cast determination between both ends of the nearest edge. Specifically, for example, raycast determination is performed between the AC 602 and the AP candidate 603 illustrated in FIG. 6, and raycast determination is performed between the nodes 606 and 607 at both ends of the nearest edge 605 and each AP candidate 603. . The details of the raycast determination are the same as described above. On the other hand, if the raycast determination fails for all AP candidates, the AVD information acquisition unit 205 causes the AVD information having the next priority order information to be acquired as in the case where the above-described raycast determination fails. In this case, if there is already AVD information that has failed in the raycast determination for the nearest edge of all the areas described above, the AVD information having the next priority information of the AVD information is used in accordance with the priority information. Get it.

  When the space check determination unit 213 succeeds in the raycast determination between each AP candidate and the AC and between both ends of the nearest edge and the AC, for example, the space check determination unit 213 displays the bounding box stored in association with the non-operation object. Use to check the space.

  Here, the bounding box 604 is, for example, a box 604 corresponding to a space required by a non-operation object arranged on the non-operation object 603 as shown in FIG. The space check determination unit 213 determines that the space check determination is successful when the bounding box does not interfere with a wall or the like in the virtual space, and determines that the space check determination fails when the interference occurs. Note that the shape and size of the bounding box, the arrangement position of the bounding box on the object, and the like are set in advance. Further, when movement control or the like is performed for a plurality of non-operation objects, the shape and size of the bounding box may be different for each non-operation object. Further, a plurality of bounding boxes having different shapes and sizes may be arranged for a non-operation object according to the shape or the like of the non-operation object.

  The AP acquisition unit 214 acquires each AP candidate determined by the space check determination unit 213 to have succeeded in the space check, and calculates the distance from each AP candidate to the non-operation object. Then, the distances from the respective AP candidates to the object are compared, and the AP candidate having the shortest distance is acquired as the AP.

  The non-operation object motion control unit 402 moves the non-operation object in the virtual space using the position indicated by the acquired position information of the AP as the destination. The arrival determination unit 215 determines whether or not the non-operation object has reached the AP based on the position information of the AP and the non-operation object. If the arrival determination unit 215 determines that the AP has reached, the arrival determination unit 215 associates it with the AVDID corresponding to the AP. The operation identified by the stored action ID is performed.

  Accordingly, in the virtual space, the destination (AP) of the non-operation object for the interest of interest is set according to the type of the interest of interest, the action to be performed on the interest of interest, the position of the obstacle, etc. A non-operation object can be moved to a destination and a predetermined action can be performed.

  Next, a description will be given of main functional configurations realized when the nearest edge cannot be acquired for all AVDs or when the AP cannot be acquired for all AVDs.

  The shortest edge acquisition unit 216, based on the position information of the object of interest acquired by the object of interest specifying unit 204 and the position information of the edge, the edge ID of the shortest edge that is the edge closest to the identified object of interest. To get.

  The ray cast determination unit 210 performs ray cast determination between the both end points of the shortest edge acquired by the shortest edge acquisition unit 216 and the AVD AC of which priority information is 1. The AC position information is calculated and acquired by the AC position information acquisition unit 207, for example, in the same manner as described above, and the ray cast determination unit 210 uses the acquired AC position information to determine the ray cast. I do. In addition, when the raycast determination between any one of the end points and the AC is successful, the raycast determination is assumed to be successful, and the like. If the raycast determination is successful, AVDID 360 AVD information is acquired from the AVD information storage unit 219. The AVDID, 360 AVD information includes, for example, 360 ° (that is, a circular shape) as angle information, and division number information different from the division number of the AVD information whose priority information is 1 as division number information. The other information (distance information and the like) is set in advance so as not to cause interference between the non-operation object and the way collision.

  The AP expansion unit 212, the ray cast determination unit 210, the space check determination unit 213, and the AP acquisition unit 214 perform processing similar to the processing for acquiring the AP based on the AVDID and 360 AVD information and the shortest edge. When the AP is acquired, the movement of the non-operation object is started with the AP as the destination, and when the AP is reached, the operation stored in association with the AVDID is performed.

  On the other hand, the AP creation unit 217 creates an AP on the shortest edge based on the position of the object of interest if the AP could not be acquired even using the AVD ID and 360 AVD information. Specifically, for example, an intersection when a perpendicular is drawn from the position of interest to the shortest edge is created as an AP, and the position information of the AP is transmitted to the operation control unit 201 as an AP (final AP). Similarly, the movement of the non-operation object is started with the final AP as the destination, and when the final AP is reached, the operation stored in association with the AVDID 360 is performed.

  Thereby, even when the nearest edge cannot be obtained for all AVDs or when the AP cannot be obtained for all AVDs, the AP can be set and a predetermined operation can be performed.

  On the other hand, the ray cast determination unit 210 performs a ray cast determination between the both end points of the shortest edge and the above AC (AVD AC with priority information of 1), and when the ray cast determination fails, a proxy point is acquired. The unit 218 serves as a proxy (proxy point) of the position information of the interest target specified by the interest target specifying unit 204 based on the position information of the shortest edge, the target of interest, the non-operation object, and the position information of the way collision. Get information.

  Specifically, for example, as illustrated in FIG. 10, the proxy point acquisition unit 218 obtains the position information of the intersection point between the straight line connecting the non-operation object and the object of interest 601 and the boundary line of the way collision 305. Obtained as the first candidate point 111. Further, the position information of each intersection point of the straight line connecting the object of interest 601 and both end points 312 and 313 of the shortest edge 311 and the boundary line of the way collision 305 is represented by the second and fourth candidate points 112 of the proxy point, Obtained as 114. Further, the position information of the intersection of the perpendicular line drawn from the object of interest 601 to the shortest edge 311 and the shortest edge is acquired as the third candidate point 113 of the proxy point. Then, the position information of each candidate point and the AC is calculated, and the position information of the candidate point having the shortest distance from the AC among the first to fourth candidate points 111 to 114 (in this example, The position information of the third candidate point 113) is extracted.

  Also, the AVD information acquisition unit 205 acquires, for example, proxy AVD information, that is, AVDID and DA AVD information from the AVD information storage unit 219. The AVDID and DA AVD information are set in advance so as not to cause interference between a non-operation object and a way collision, for example. Specifically, for example, the proxy AVD information has the same AC distance as the AVD information whose priority information is 1, and the division number information is different.

  The AP deployment unit 212, the ray cast determination unit 210, the space check determination unit 213, and the AP acquisition unit 214 perform the same process as the process of acquiring the AP based on the AVDID and DA AVD information. In this case, AC position information acquisition and the like are calculated using proxy position information instead of position information of interest, and an AP candidate group is developed based on the proxy position information. When the AP is acquired, the movement of the non-operation object is started with the AP as the destination, and when the AP is reached, the operation stored in association with the AVDID is performed. In the above description, the case where proxy AVD information is used has been described. However, the original AVD information may be used.

  On the other hand, the AP creation unit 217 creates an AP on the shortest edge based on the position of interest when the AP cannot be acquired even when using the AVDID and DA AVD information. Same as above. Similarly, the movement of the non-operation object is started with the final AP as the destination, and when the final AP is reached, the operation stored in association with the AVDID and DA is performed.

  As a result, for example, as shown in FIG. 10, the AP of the non-operation object can be set even when the target of interest is inside the way collision (for example, when the non-operation object cannot reach the target of interest). At the same time, when the non-operation object reaches the AP, the non-operation object can be caused to perform a predetermined action.

  Next, a processing flow of the object control apparatus will be described. 11 to 14 are diagrams for explaining the outline of the flow of the object control apparatus.

  As illustrated in FIG. 11, the interest target specifying unit 204 specifies an interest target of a non-operation object according to a predetermined criterion, and acquires an interest target ID of the target object and its position information (S101). The AVD information acquisition unit 205 acquires AVD information stored in association with the interest ID acquired by the interest target specifying unit 204 based on the priority information (S102).

  As shown in S201 to S209, which will be described later, nearest edge acquisition processing for obtaining the nearest edge is performed (S103). Specifically, as illustrated in FIG. 12, first, the AC position information acquisition unit 207 is based on the position information of the target of interest acquired by the target of interest specifying unit 204 and the AVD information acquired by the AVD information acquisition unit 205. AC position information for the acquired AVD information is calculated and acquired (S201).

  The area dividing unit 208 divides the virtual space into a plurality of areas based on the AC position information acquired by the AC position information acquiring unit 207 (S202). The nearest edge determining unit 209 determines the nearest edge that is the edge having the closest distance from the AC for each area divided by the area dividing unit 208 (S203).

  The ray cast determination unit 210 performs ray cast determination between the both end points of the nearest edge of each area determined by the nearest edge determination unit 209 and the AC. Specifically, first, a raycast determination between the first end point (first node) of the nearest edge and the AC is performed (S204). If the raycast determination fails, a raycast determination between the second end point (second node) of the nearest edge and the AC is performed (S205).

  If the raycast determination is successful in either S204 or S205, the process proceeds to S206, and the nearest edge acquisition unit 211 is made to obtain edge identification information for identifying the nearest edge as the nearest edge candidate (S206). ). On the other hand, if the raycast determination fails in S205, the process proceeds to S207.

  Next, it is determined whether or not the raycast determination of the nearest edge in each area is completed (S207). If it is determined that the process has not ended, the process returns to S204. On the other hand, if it is determined that the process has been completed, the process proceeds to S208.

  It is determined whether the nearest edge candidate has been acquired (S208). When it is determined in S208 that the nearest edge has been obtained, the nearest edge obtaining unit 211 calculates and compares the distance from the AC to the nearest point of each nearest edge candidate, and the nearest edge candidate having the shortest distance is obtained. Obtained as the nearest edge (S209). Then, the process proceeds to S104.

  On the other hand, if it is determined in S208 that the nearest edge has not been acquired, it is determined whether there is an unprocessed AVDID (S210). Specifically, for example, it is determined whether or not the nearest edge acquisition processing has been performed for all AVDIDs stored in association with the identified interest ID. If it is determined that there is an unprocessed AVDID, the process proceeds to S102, and AVD information of the next priority is acquired. On the other hand, if it is determined that there is no unprocessed AVDID, the process proceeds to S109 described later.

  AP acquisition processing is performed based on the AVD information corresponding to the nearest edge acquired in S209 (S104). Specifically, as illustrated in FIG. 13, first, the AP expansion unit 212 expands an AP candidate group based on the AVD information, and acquires position information of each AP candidate (S301).

  It is determined whether a determination to be described later has been made for the AP candidate (S302). If it is determined that all AP candidates have not been determined, the ray cast determination unit 210 sequentially acquires the AP candidate position information, and performs a ray cast determination between the AP candidate and the AC (S303). On the other hand, if it is determined that all AP candidates have been determined, the process proceeds to S308 described below.

  On the other hand, if it is determined in S303 that the raycast determination between the AP candidate and the AC is successful, the raycast determination unit 210 determines that the AP candidate and the first node of the nearest edge acquired in S209 are between. The ray cast is determined (S304).

  If the raycast determination in S304 fails, a raycast determination is made between the AP candidate and the second node of the nearest edge acquired in S209 (S305). If it is determined that the raycast determination in S305 has failed, the process returns to S302.

  If the raycast determination is successful in S304 or S305, the space check determination unit 213 performs a space check (S306). If it is determined that the space check has failed, the process returns to S302. On the other hand, if the space check is successful, the AP acquisition unit 214 registers the position information of the AP candidate as an AP candidate (S307). Next, the process returns to S302. Then, as described above, if it is determined that the raycast determination has been performed for all AP candidates, it is determined whether or not the AP candidate is registered (S308), and if it is determined that the AP candidate is registered, the process proceeds to S105. If it is determined that it is not registered, the process proceeds to S109. In the above description, the process of performing the raycast determination between the AP candidate and the node each time the raycast determination between one AP candidate and the AC is successful has been described. However, the present invention is not limited to this. As long as the process is substantially the same, such as performing a raycast determination with the AC and performing a raycast determination with the node on the AP candidate group that has succeeded in the raycast determination, the process is different. Needless to say, it may be.

  The AP acquisition unit 214 calculates each distance from each registered AP candidate to the non-operation object. Then, each distance from each AP candidate to the object is compared, and the AP candidate having the shortest distance is acquired as an AP (S105).

  The non-operation object motion control unit 402 moves the object toward the position indicated by the acquired position information of the AP (S106).

  The arrival determination unit 215 determines, for example, whether or not the non-operation object has reached the AP based on the position information of the AP and the position information of the non-operation object for each predetermined period (S107). And when it determines with not having reached | attained, for example, it returns to S101 and performs the same process as the above again. On the other hand, when the arrival determination unit 215 determines that it has arrived, the operation stored in association with the AVD information corresponding to the AP is performed (S108).

  Next, a processing flow when it is determined in S210 that there is no unprocessed AVDID, or when it is determined in S303 that raycast determination has been performed for all AP candidates will be described with reference to FIG.

  As illustrated in FIG. 14, first, the shortest edge acquisition unit 216 has the closest distance from the identified interest object based on the position information of the interest object acquired by the interest object specifying unit 204 and the edge position information. The edge ID of the shortest edge that is the near edge is acquired (S109).

  The ray cast determination unit 210 performs ray cast determination between the both end points of the shortest edge acquired by the shortest edge acquisition unit 216 and the AVD AC of which priority order information is 1 (S110). If the raycast determination between one of the end points and the AC is successful, the raycast determination is assumed to be successful and the like is the same as described above. .

  If the raycast determination is successful in S110, AVDID 360 AVD information is acquired from the AVD information storage unit 219 (S111). Based on the AVDID acquired in S111, the AVD information of 360, and the shortest edge acquired in S110, the same process as the AP acquisition process in S104 is performed (S112). Then, it is determined whether an AP candidate has been acquired (S113). If it is determined in S112 that an AP candidate has been acquired, the process proceeds to S105.

  On the other hand, if it is determined in S110 that the raycast determination has failed, the AVD information acquisition unit 205 acquires AVDID and DA AVD information (proxy volume) from, for example, the AVD information storage unit 219 (S114). .

  As described above, the proxy point acquisition unit 218 substitutes the position information of the target of interest specified by the target of interest specifying unit 204 based on the position information of the shortest edge, the target of interest, and the non-operation object, and the position information of the way collision. Position information (proxy position information) to be (proxy point) is acquired (S115).

  Based on the AVDID acquired in S114, the AVD information of DA, and the shortest edge acquired in S110, the same process as the AP acquisition process in S104 is performed (S116). In this case, for the acquisition of the AC position information, the AC position information is calculated using the proxy position information instead of the position information of interest, and the AP candidate group is developed based on the AC position information. Etc. Then, it is determined whether an AP candidate has been acquired (S117). If it is determined in S116 that an AP candidate has been acquired, the process proceeds to S105.

  On the other hand, if it is determined in S112 or S116 that an AP candidate has not been acquired, the AP creation unit 217 creates an AP on the shortest edge based on the position of interest (S118). In step S105, the AP acquisition unit 214 acquires the created AP as an AP. The process flow may be configured to be performed every predetermined frame period, for example. The process flow requires a certain amount of time, and thus the process flow is performed every time the process is completed. May be configured to be performed. That is, for example, according to the present embodiment, the interest is specified and the destination is determined with the movement, so the destination changes according to the movement.

  Note that the processing flow shown in FIGS. 11 to 14 is an example, and various modifications can be made. For example, it can be replaced with a flow that is substantially the same as the configuration shown in the above embodiment, a flow that exhibits the same effects, or a flow that can achieve the same purpose.

  Further, the present invention is not limited to the above embodiment, and various modifications can be made. For example, it can be replaced with a configuration that is substantially the same as the configuration described in the above embodiment, a configuration that exhibits the same operational effects, or a configuration that can achieve the same purpose.

  Specifically, for example, the number of operation objects, non-operation objects, and interests is not limited to the number shown above, and may be two or more. In this case, the plurality of operation objects may be operated by one or a plurality of users, and the plurality of non-operation objects may be controlled by the non-operation object control unit independently of each other. In the above description, the operation object and the non-operation object are used. However, the operation object does not necessarily move based on the user's instruction. Instead, it may be configured to operate according to a preset program or the like.

  Note that the destination candidate information storage means described in the claims includes, for example, a ranking information storage unit 206 and an AVD information storage unit 219, and the destination information acquisition unit includes, for example, an AP expansion unit 212, a space check determination The route information specifying unit includes the nearest edge acquisition unit 211.

  DESCRIPTION OF SYMBOLS 100 Object control apparatus, 101 Control part, 102 Storage part, 103 Communication part, 104 Operation part, 105 Display part, 201 Operation control part, 202 Spatial DB, 203 Spatial information generation part, 204 Interest object specific part, 205 AVD information acquisition , 206 ranking information storage unit, 207 AC position information acquisition unit, 208 area division unit, 209 nearest neighbor edge determination unit, 210 raycast determination unit, 211 nearest edge acquisition unit, 212 AP expansion unit, 213 space check determination unit, 214 AP acquisition unit, 215 arrival determination unit, 216 shortest edge acquisition unit, 217 AP creation unit, 218 proxy point acquisition unit, 219 AVD information storage unit, 401 operation object operation control unit, 402 non-operation object operation control unit, 403 Target operation control unit.

Claims (12)

An object of interest specifying means for specifying an object of interest in the virtual space and acquiring position information and identification information of the object of interest;
Destination candidate information storage means stored in association with destination candidate information for obtaining position information of a destination candidate group that is a candidate for a destination of movement of the object in the identification information of the object of interest; and
Based on the acquired position information and identification information of the object of interest and the destination candidate information, the position information of the destination candidate group for the object of interest is acquired, and the position information of the destination candidate group Destination information acquisition means for acquiring destination information indicating the location information of the destination from inside,
An object control program for causing a computer to function as The object control program further includes:
Based on the position information of the object of interest and the plurality of route information, the computer functions as route information specifying means for specifying one route information among the plurality of route information,
The destination information acquisition unit acquires the destination information based on position information indicated by the specified one route information and position information of each destination candidate group. The object control program described.   The said destination information acquisition means acquires the said destination information based on the positional information on the obstruction object which forms the obstruction with respect to the said object in the said virtual space. Object control program.   The destination information acquisition means acquires the destination information based on position information of boxes arranged in the respective destination candidate groups and having a predetermined size and shape and position information of the obstacle object. The object control program according to claim 3. The route information specifying means further determines whether or not the one route information can be specified based on the position information of the obstacle object. Based on the position information of the information, one of the route information is identified as proxy route information,
The object control program further includes:
As proxy point acquisition means for acquiring position information of a plurality of proxy points based on the position information of the proxy route information, the position information of the object of interest, the position information of the object, and the position information of the obstacle Make the computer work,
The object control program according to 3 or 4, wherein the destination information acquisition unit acquires the destination information based on position information of the plurality of proxy points.   6. The object control program according to claim 1, wherein the destination candidate information storage unit further stores action identification information for identifying an action to be performed by the object in association with each other. The object control program further includes:
Arrival determination means for determining whether or not the object has reached the destination; and
Object movement control means for performing an action identified by the action identification information stored in association with the destination candidate information when the arrival determination means determines that the destination has arrived;
7. The object control program according to claim 6, wherein the computer functions as   The object control program according to any one of claims 1 to 7, wherein the destination candidate information includes distance information and direction information indicating a distance and direction from the position information of the object of interest.   The destination candidate information is a shape formed with a center position obtained from the distance information and the direction information as a center, radius information indicating the radius of the shape, angle information indicating the center angle of the shape, and the center angle The object control program according to claim 8, further comprising division number information for dividing.   A computer-readable storage medium storing the object control program according to claim 1. An object of interest specifying means for specifying an object of interest in the virtual space and acquiring position information and identification information of the object of interest;
Destination candidate information storage means stored in association with destination candidate information for obtaining position information of a destination candidate group that is a candidate for a destination of movement of the object in the identification information of the object of interest;
Based on the acquired position information and identification information of the object of interest and the destination candidate information, the position information of the destination candidate group for the object of interest is acquired, and the position information of the destination candidate group Destination information acquisition means for acquiring destination information indicating the location information of the destination from inside;
An object control device comprising: Identify the object of interest in the virtual space, obtain the position information and identification information of the object of interest,
Destination candidate information for obtaining position information of a destination candidate group that is a candidate for a destination of movement of the object is associated with the acquired position information and identification information of the target of interest, and the identification information of the target of interest. Based on the destination candidate information stored in this manner, the location information of the destination candidate group for the object of interest is acquired, and the destination location information is indicated from the location information of the destination candidate group. Get information,
An object control method characterized by the above.

Images