KR100916221B1 - Method for determining a enhanced moving path on the 3d map - Google Patents

Abstract

The present invention relates to an improved method for setting a character movement path in a three-dimensional map, and in particular, specifying a start point and an end point to move to move a character; Calculating and displaying an optimal path by a predetermined path finding algorithm based on the designated start point and end point; Selecting a point of the path to be modified from the moving path indicated by the optimal algorithm, if desired to change the path; Selecting a modification position to change the selected path to another path; And resetting an optimum path by a predetermined path finding algorithm based on the new node generated according to the corrected position.

3d, map, character, breadcrumb, pathfinding, algorithm, node, change

Description

Improved method for setting character movement path in 3D map {METHOD FOR DETERMINING A ENHANCED MOVING PATH ON THE 3D MAP}

1 is a flow chart showing a general three-dimensional image production procedure.

2 is a view showing a movement path when there is no obstacle in the conventional A-star algorithm.

3 is a diagram showing a movement path when there is an obstacle in the conventional A-star algorithm.

4 is a flowchart illustrating an improved character movement path setting procedure in a 3D map according to the present invention.

5 is a view showing the movement path generation of the character in the three-dimensional map according to an embodiment of the present invention.

6 is a diagram illustrating a route to which a path finding algorithm according to an embodiment of the present invention is applied.

7 to 9 are diagrams illustrating a method for reassigning a set movement path according to an embodiment of the present invention.

The present invention relates to a three-dimensional image production method, and more particularly to a method for setting an improved character movement path in a three-dimensional map in the three-dimensional image production.

In the past, images produced by computers were mostly 2D images due to technical difficulties, but recently, 3D images that can be expressed more realistically have been produced due to development of software and improvement of computer processing speed. In addition, in recent years, 3D computer graphics (CG) and the like are widely used in the production of movies, etc., but the more sophisticated the production technology, the more the astronomical cost. In addition, recently, 3D animation techniques are applied to games, etc., to provide a more realistic game situation.

In general, in order to produce a 3D image (ie, 3D animation), various 3D image production software (eg, 3D MAX, etc.) executed on a computer is used. However, the general 3D image production software is complicated and difficult to use, so it is difficult for the general public to use it without a professional learning process, and it takes a considerable time to produce a simple image.

On the other hand, there are a number of techniques for producing a three-dimensional image. For example, there is a keyframe animation method that creates a storyboard, expresses an object, sets a key frame, and generates an in-between frame. There is an Inverse Kinematics method. The inverse kinematics method is suitable for representing hierarchically structured structures such as humans and robots. In addition, the most natural way to generate human motion is the Motion Capture method, which is the most used technique for generating three-dimensional computer animation. In addition, there is a procedural animation method by creating an algorithm for a specific object and generating a motion.

Hereinafter, a 3D image production process will be briefly described with reference to FIG. 1. Referring to FIG. 1, first, a set is selected and arranged (S101), and various props are arranged (S102) to produce a background for an image. Then, after appropriately placing one or more characters on the set (S103), the action for the arranged character is specified in time order (S104), and at this time, by adding a speech balloon function to each character of the character You can also express metabolism. Then, after properly positioning the camera or the like to perform the shooting (S105). Finally, a three-dimensional image is finally generated by performing an image editing process (S106) such as inserting various effect sounds, background music (BGM), subtitles, and the like into the photographed image.

As described above, the conventional three-dimensional image production is performed by a skilled person through highly difficult work using dedicated software having a fairly complicated function. Therefore, the general public who does not have professional education about the dedicated software is not only hard to produce 3D images, but also requires a considerable amount of production time even for professionals. Thus, there is a need for software that can easily produce 3D images for the general public.

On the other hand, the implementation of character movement is very important in the production of 3D image. In other words, it is essential to develop a story while moving a character according to a scenario envisioned by a user in 3D image production. Therefore, in order to implement the movement of the character, it is possible to indicate the movement by setting each point of the path that the character moves according to each time frame.

However, such a character movement method takes a considerable time and the efficiency of the work is also significantly reduced. Accordingly, it is possible to implement efficient character movement by specifying a start point and an end point for character movement without applying all paths to which the character moves, and applying a predetermined path finding algorithm based on the designated start and end points.

Pathfinding is an algorithm that allows an enemy character or AI unit that is not directly controlled by the user to navigate to a specific destination by avoiding obstacles. For example, in a game program such as StarCraft, it is also possible to find a way for friendly units to avoid the blocked terrain.

Currently, the path finding algorithm that can be applied to the 3D image production is implemented by various methods, and recently, the path finding algorithm called 'A star (A ^* ) algorithm' is applied to many videos or games as an efficient path finding algorithm. It is becoming.

Hereinafter, a path finding method using a conventional A-star algorithm will be described with reference to FIGS. 2 and 3.

2 is a view showing a movement path when there is no obstacle in the conventional A star algorithm, Figure 3 is a view showing a movement path when there is an obstacle in the conventional A star algorithm.

The A star algorithm is one of the path finding algorithms for finding two target points on a map, and the biggest feature of the A star algorithm is to find the shortest path among several paths connecting the two target points. The A star algorithm is characterized by using two lists, one is an open list, a list of nodes that have not been searched yet, and the other is a closed list. List of configured nodes.

In this case, the search was performed, meaning that three values of f, g, and h were evaluated. f, g, and h mean fitness, goal, and heuristic values, respectively. In other words, the A-star algorithm starts searching for a node at a start point, and f, g, and h values of neighbor nodes (g is CostFromStart (), h is CostToGoal (), and f is TotalCost (). In particular, f = g + h), select the most suitable node as the next node, put it in the closed list, and put the rest in the open list.

Then, the next node is searched again for neighboring nodes to get f, g, and h again. This process is repeated until the final target node is reached. If you searched for neighboring nodes and can't go anymore, it starts searching again for unsearched nodes in the open list. If no neighbors exist and the open list is empty, there is no way. In this way, the shortest path between two points is searched.

The A-star algorithm may be implemented by the following program algorithm.

start

push start node to open

if (open is empty) then get directions failed

else

{

     pop node in open

     if (current node is Goal) then

           {Print the contents of the node backwards Ends}

     Explore neighbors of the current node and create new ones (except where you can't go)

     Calculate F = G (x) + H (x) of new node

     if (the new node is open or closed) && (the F value of the new node is greater than the F value of the current node) then continue

     else

     {

          Update if a new node is open

          If it's closed, it's subtracted from closed, put into open and updated

          If neither is present, put it in open.

     }

     Push Node to closed

}

Meanwhile, the above-described conventional A-star path finding algorithm is a path finding algorithm that calculates the shortest distance by searching the paths of the start point and the end point designated by the user, and searches the starting point and the eight points of the starting point on the map. Find the path by calculating the shortest distance between the end points. However, since the conventional path finding algorithms such as the A-star path finding algorithm calculate the shortest distance between the start point and the end point, a path finding path not intended by the user may be generated.

That is, when a user wants to move a character in 3D image production, there are many cases in which the user wants to move a path different from the path searched by the optimal path finding algorithm. Therefore, there is an urgent need for a method that can conveniently implement a character's movement using a conventional pathfinding algorithm and at the same time can be easily reflected to allow the character to move in a path intended by the user.

An object of the present invention is to implement a character movement in a three-dimensional map, while applying the optimal path finding algorithm at the same time when the user does not want to create a path in the three-dimensional map that allows the user to edit the desired movement path An improved character movement path setting method is provided.

In addition, an object of the present invention is to implement a character movement in the three-dimensional map, when the path finding algorithm is generated in the path finding algorithm is generated in the three-dimensional map to create the optimal path by applying the user's desired movement path An improved character movement path setting method is provided.

The method of the present invention for achieving the above object comprises the steps of specifying a starting point and end point to move to move the character; Calculating and displaying an optimal path by a predetermined path finding algorithm based on the designated start point and end point; Selecting a point of the path to be modified from the moving path indicated by the optimal algorithm, if desired to change the path; Selecting a modification position to change the selected path to another path; And resetting an optimum path by a predetermined path finding algorithm based on the new node generated according to the corrected position.

The resetting of the shortest path may include: calculating an optimal moving path by a path finding algorithm between an initial starting point and a newly designated modified position; And calculating an optimum moving path by a path finding algorithm between the newly designated corrected position and the first end point.

The path finding algorithm is characterized in that the A-star algorithm.

The path finding algorithm applied at the resetting may use the same algorithm or a different algorithm as the path finding algorithm applied at the initial path setting.

The selection of the correction position is characterized in that the selection is made by clicking and dragging the mouse from a point of the path to be corrected.

Meanwhile, the information on the improved character movement path setting method in the 3D map may be stored in a recording medium readable by a server computer. Such recording media includes all kinds of recording media on which programs and data are stored so that they can be read by a computer system. Examples include Read Only Memory (ROM), Random Access Memory (RAM), Compact Disk (CD), Digital Video Disk (DVD) -ROM, Magnetic Tape, Floppy Disk, Optical Data Storage, etc. It also includes implementations in the form of (eg, transmission over the Internet). In addition, these recording media can be distributed over network coupled computer systems so that the computer readable code is stored and executed in a distributed fashion.

The present invention generally proposes a method of realizing 3D imagery that is close to reality by adding a new option for each situation to a path finding algorithm that finds the shortest distance and sets a character's movement path.

That is, since the conventional path finding algorithm calculates the shortest distance between the start point and the end point, a path finding path not intended by the user may be generated. Therefore, in order to compensate for this disadvantage, the new path finding algorithm proposed by the present invention to be described later inherits the advantages of the existing path finding algorithm as it is, and when the path path that the user does not want is generated, the user may re-move the desired path. Suggest ways to make it editable. In this case, after the movement path desired by the user is reflected, the shortest distance including the movement path is recalculated.

DETAILED DESCRIPTION Hereinafter, a detailed description of a preferred embodiment of the present invention will be described with reference to the accompanying drawings. In the following description, detailed descriptions of well-known functions or configurations will be omitted when it is determined that the detailed descriptions of the known functions or configurations may unnecessarily obscure the subject matter of the present invention.

First, referring to FIG. 4, a concept of an improved character movement path setting method in a 3D map according to the present invention will be described.

4 is a flowchart illustrating an improved character movement path setting procedure in a 3D map according to the present invention. Referring to FIG. 4, first, a start point and an end point to be moved are designated to move a character (S401). Then, the shortest distance (ie, the shortest path) is calculated (S402) by an optimal path finding algorithm (eg, an A-star algorithm) based on the start point and the end point.

On the other hand, if the path calculated by the optimal path finding algorithm is different from the path intended by the user, the modified path is inserted (S403) according to the present invention. At this time, in the path finding algorithm according to the present invention, it is preferable to display the movement path by the predetermined optimal algorithm to the user.

Therefore, when the user wants to change the moving path, the user selects a point of the path to be modified from the moving path displayed by the optimal algorithm (S404). Then, the modified position to change the selected path to another path is selected (S405). Finally, according to the present invention, the shortest path is reset based on the new node generated according to the modified position (S406).

For example, when a character is to be moved from point A to point B, the shortest path between the points A and B is first set by an optimal path finding algorithm. At this time, if the set path is not the path desired by the user, a point outside the desired path is selected from the set path, and a new point C outside the path to be changed is selected.

Therefore, the path desired by the user becomes A-> C-> B, and according to the present invention, the shortest path between A and C points is calculated by an optimal path finding algorithm, and the shortest path between C and B points is calculated according to the present invention. Is computed by an optimal path finding algorithm. In this case, the path finding algorithm applied at the time of the change may be the same as or different from the path finding algorithm first applied.

In this way, the user can select the desired path and at the same time apply the optimal path finding algorithm. In addition, in the related art, when a user wants to set a desired path, the user should directly designate a point for each moving path. However, in the present invention, only a specific point including a desired path is designated by the user, and an optimal path including the corresponding point is provided. By calculating, it is possible to more easily implement character movement.

Hereinafter, a method of setting an improved character movement path in the 3D map as described above will be described with reference to FIGS. 9 to 9.

5 is a diagram illustrating a movement path generation of a character in a 3D map according to an exemplary embodiment of the present invention. Referring to FIG. 5, when the movement operation is inserted into the character in the 3D map, the movement path display line is displayed on the screen. At this time, the start point is the point where the character is currently located, and the end point may be arbitrarily designated by the user using the movement path display line. Therefore, when the end point is designated, the character movement path is calculated and generated by the optimal path finding algorithm.

6 is a diagram illustrating a route to which a path finding algorithm is applied according to an embodiment of the present invention. Referring to FIG. 6, when an end point to which the character is to be moved is designated as shown in FIG. 5, the shortest distance between the start point and the end point is searched for to display a movement path. In this case, as a method of searching for the shortest distance, the A-star algorithm may be applied as described above, or another path finding algorithm may be applied. Meanwhile, in FIG. 6, since the obstacle lies on the moving path when the moving path is generated, the shortest distance moving path is avoided by the optimal path finding algorithm.

As shown in FIG. 5 and FIG. 6, once the optimal path between the two points is set, if the path is not desired by the user, the path correction operation may be performed according to the present invention as described above.

7 to 9 are diagrams illustrating a method for reassigning a set movement path according to an embodiment of the present invention.

If the movement path currently displayed by FIG. 6 is not the movement path intended by the user, the movement path is edited and modified. In other words, by calculating the shortest distance from the start point and the end point due to the characteristics of the conventional optimal path finding algorithm (for example, the A-star algorithm), the user may create a moving path that is not desired by the user. If a moving route is generated, the user may be able to reassign the desired movement route through a new way finding algorithm provided in accordance with the present invention.

In order to reassign the movement path, first, the movement path to be corrected is designated as shown in FIG. When the point to be corrected is selected as described above, a path correction display line for modifying an existing moving path is displayed on the mouse as shown in FIG. 8. At this time, if a new moving path is set (for example, double-clicking with the left of the mouse), a new moving path is set around the point designated by the mouse. That is, the shortest path via the first starting point-> newly designated point-> the first end point is newly set.

That is, an optimal moving path is calculated and generated between the first starting point and a newly designated point by the path finding algorithm, and an optimal moving path is calculated and generated between the newly designated point and the first ending point. .

By doing so, it is possible to effectively reflect the movement path desired by the user while applying the conventional optimal path finding algorithm. Accordingly, the 3D video can be easily produced by the user.

On the other hand, in the embodiment of the present invention has been described with respect to specific embodiments, various modifications are possible without departing from the scope of the invention. Therefore, the scope of the present invention should not be limited to the described embodiments, but should be defined not only by the appended claims, but also by the equivalents of the claims.

According to the present invention, by adding a new option for each situation to the optimum path finding algorithm used in a general game, etc., there is an advantage of facilitating the realization of 3D rendering.

In addition, according to the present invention there is an advantage that it is possible to easily implement the efficient character movement by applying a path finding algorithm to the desired path without specifying all the paths that the character moves.

Claims (6)

Designating a start point and an end point to move to move the character; Calculating and displaying an optimal path by a predetermined path finding algorithm based on the designated start point and end point; Selecting a point of the path to be modified from the moving path indicated by the optimal algorithm, if desired to change the path; Selecting a modification position to change the selected path to another path; And And resetting an optimal path by a predetermined path finding algorithm based on the new node created according to the corrected position. The method of claim 1, wherein resetting the optimal path comprises: Calculating an optimal moving path by the path finding algorithm between the first starting point and the newly designated corrected position; And harm And calculating an optimum moving path by a path finding algorithm between the newly designated corrected position and the first end point. The method of claim 1, wherein the path finding algorithm, An improved character movement path setting method in a three-dimensional map, characterized in that the A-star algorithm. The method of claim 1, wherein the path finding algorithm applied at the time of resetting uses the same algorithm as the path finding algorithm applied at the initial path setting. The method of claim 1, wherein the path finding algorithm applied at the time of resetting uses a different algorithm from the path finding algorithm applied at the initial path setting. The method of claim 1, wherein the selection of the correction position, Improved character movement path setting method of the three-dimensional map, characterized in that for selecting by clicking and dragging the mouse from the point of the path to be modified.

Images