KR100865072B1 - Method and system for controlling traffic car in multi-player online game - Google Patents

Abstract

The present invention relates to a method and system for controlling a traffic car in a multiple access online game. According to the present invention, a method of controlling a traffic car in a game system connected through a network with a user client, the method comprising: (a) a list of one or more traffic cars influenced by each other on one or more paths corresponding to the movement path of the traffic car; Dynamically generating; (b) determining a calculation start traffic car from the list; (c) sequentially calculating movement information of traffic cars existing in the list on the basis of the calculation start traffic car; And (d) transmitting the calculated movement information to the user client, wherein steps (a) to (c) are performed at a predetermined time period, and a game application installed on the user client is included in the movement information. Accordingly, there is provided a traffic car control method, which simulates the traffic car. There is an advantage that can efficiently control a large number of traffic cars according to the present invention.

Traffic Cars, Racing Games, Lists, Events, Impact

Description

METHOD AND SYSTEM FOR CONTROLLING TRAFFIC CAR IN MULTI-PLAYER ONLINE GAME}

1 is a diagram showing the configuration of a multi-access online game system according to an embodiment of the present invention.

2 is a diagram showing a detailed configuration of a game server according to an embodiment of the present invention.

3 is a diagram showing a detailed configuration of a traffic car control unit according to an embodiment of the present invention.

4 is a diagram showing the detailed configuration of the list generating unit according to an embodiment of the present invention.

5 is a diagram illustrating a detailed configuration of a game application according to the present invention.

6 is a flow chart of a basic path generation process according to an embodiment of the present invention.

7 is a flowchart of a traffic car control process in a basic pass according to an embodiment of the present invention.

8 is a flowchart of a traffic car control process in a path considering an intersection according to an exemplary embodiment of the present invention.

9 is a flow chart of a traffic car control process at a bottleneck in accordance with one preferred embodiment of the present invention.

10 is a flowchart illustrating a traffic car control process when changing lanes according to an exemplary embodiment of the present invention.

11 is a flow chart of a signal time change process according to the present invention.

12 is a diagram illustrating an example of a basic pass according to the present invention;

FIG. 13 shows an example of a screen for stopping at a traffic light on each pass according to the present invention; FIG.

14 illustrates a plurality of passes at an intersection in accordance with the present invention.

The present invention relates to a method and system for controlling a traffic car in a multi-access online game, and more particularly, to a method and system for efficiently controlling a traffic car, which is an important element of a game, in a multi-access racing game.

Recently, with the development of network technology, high-speed transmission of large-capacity multimedia data becomes possible, and according to the universal spread of the user terminal which can be connected to the network, a contents provider (CP) that provides various kinds of contents to the user is rapidly developed. The trend is increasing.

Content providers offer a wide range of content, such as search, shopping, games, and chat services. In particular, game services are a great source of revenue for content providers, as they can attract a large audience of users, even for paid services. Perched.

The dual racing game is a reality that has been replaced by the actual racing sports, such as virtual reality, compared to other games in the situation that is very popular with users in that it can provide a high speed and a sense of reality.

Racing games, unlike other games, require high quality graphics, and in the past, they were mainly provided only for console games. However, in recent years, the development of graphics processing technology has made it possible to play multiplayer games online.

However, the general multi-party racing game is made by a method in which one or more players race a predetermined track, but such a simple racing method has a problem that does not make the user interested for a long time.

In recent years, efforts have been made to add a RPG (Role Playing Game) format to grow a character by playing a given role in a racing game for any purpose. It is evolving into the MMORPG (Massively Multi-Player Online Role Playing Game) format.

In this MMORPG racing game, each user selects a predetermined character (vehicle), performs a quest provided by NPC (Non Player Character), or acquires experience while racing in a certain place to grow his player character. .

MMORPG racing game is not just a race to complete a certain track, but increases the experience while performing quests in an environment similar to the real world.

For this reason, there are many traffic cars as well as the user's vehicle on the road in the MMORPG racing game.

Traffic cars are often used as NPCs in games, and they are essential to MMORPG racing games because they function as an obstacle to users' road driving.

According to the prior art, the control of the traffic car is performed using fuzzy logic in each user computer or game server.

Fuzzy logic applies two concepts from fuzzy rules (fuzzy implication or fuzzy relation) and compositional rule of inference to output inference values appropriate to the control environment.

However, when using fuzzy logic as in the prior art, the user's computer or game server controls the speed by considering only a few vehicles in each traffic car. However, when there are a large number of traffic cars, there is no consistent control. There was a problem.

In addition, according to the prior art, the calculation is made 30 times per second, the problem may not occur when racing only a certain track without other obstacles, for example, when the traffic car must be stopped by traffic lights during road driving In the case of collision with another vehicle or another vehicle, the number of calculations has to be increased drastically to simulate this.

On the other hand, in the prior art, the position of the traffic car is represented by using at least two parameters, such as x, y coordinates in the case of two-dimensional on the path corresponding to the road, x, y, z coordinates in the case of three-dimensional As a result, the calculation for representing the movement of the traffic car on the path has been complicated.

In order to solve the problems of the prior art as described above, the present invention proposes a traffic car control method and system in a multiple access online game that can efficiently control the traffic car.

It is another object of the present invention to provide a traffic car control method and system in a multi-access online game that can reduce the number of calculations related to the movement of a large number of traffic cars in an MMORPG racing game.

It is another object of the present invention to provide a traffic car control method and system in a multi-access online game that can express the traffic car location on a path using fewer parameters.

Another object of the present invention is to provide a method and system for controlling a traffic car in a multi-access online game that can perform control in consideration of all traffic cars that may affect each other.

In order to achieve the above object, according to a preferred embodiment of the present invention, a method for controlling a traffic car in a game system connected through a network with a user client, (a) one corresponding to the movement path of the traffic car Dynamically generating a list of one or more traffic cars affected by each other on the at least one pass; (b) determining a calculation start traffic car from the list; (c) sequentially calculating movement information of traffic cars existing in the list on the basis of the calculation start traffic car; And (d) transmitting the calculated movement information to the user client, wherein steps (a) to (c) are performed at a predetermined time period, and a game application installed on the user client is included in the movement information. Accordingly, there is provided a traffic car control method, which simulates the traffic car.

According to another aspect of the present invention, a computer readable recording medium for performing the above method is provided.

According to another aspect of the present invention, a device connected to a user client through a network to perform control of a traffic car, comprising: a list of one or more traffic cars influenced by each other on one or more paths corresponding to the movement path of the traffic car; A list generation unit for dynamically generating a; A movement information calculation unit for determining a calculation start traffic car from the list and sequentially calculating movement information of traffic cars existing in the list based on the calculation start traffic car; And a timer unit for determining whether a preset time has elapsed, wherein the calculation of the movement information is performed at a predetermined period, and a game application installed in the user client simulates the traffic car according to the movement information. A traffic car control device is provided.

The above objects, features and advantages will become more apparent from the following detailed description taken in conjunction with the accompanying drawings. First of all, in adding reference numerals to the components of each drawing, it should be noted that the same components have the same number as much as possible even if displayed on different drawings. Hereinafter, a preferred embodiment of a method and system for controlling a traffic car in a multiple access online game according to the present invention will be described in detail.

1 is a diagram showing the configuration of a multi-access online game system according to a preferred embodiment of the present invention.

Referring to FIG. 1, a multi-access online game system according to the present invention may include an authentication server 100, a game server 102, a database server 104, and a plurality of real-time message processing servers 106.

The multiple access online game system according to the present invention is connected with the user client 108 via a network.

The network may include both the Internet, a wired network including a dedicated line, and a wireless network including a wireless Internet, a mobile communication network, and a satellite communication network.

The user client 108 is a plurality of terminal devices equipped with a game application 110 that can be connected to a network and receive a multi-access online game service. The user client 108 includes a desktop PC, a notebook computer, a mobile phone, a PDA, and a mobile broadcast system (MBS) phone. And the like.

The present invention may be applied to various types of multiplayer online games, but may be particularly applied to a multiplayer online role playing racing game in which a traffic car moving on a road with a player character (vehicle) is present. Hereinafter, a case where the multi-access online game system according to the present invention is applied to an MMORPG racing game will be described as an example.

In FIG. 1, the authentication server 100 performs a function of authenticating whether a user who wants to access a game system is a user who has authority to access a game system.

The authentication server 100 receives authentication request information from the user client 108 and determines whether the authentication request from the user client 108 is valid. The authentication request information may include user ID and password information, and the authentication server 100 determines whether the ID and password included in the authentication request information are valid.

In order to determine whether the ID and password are valid, the authentication server 100 may communicate with the database server 104, or may communicate with another database (not shown) that stores authentication information.

Authentication between the user client 108 and the authentication server 100 may be used in a variety of known authentication methods as well as authentication by ID / password.

If the authentication request information from the user client 108 is valid, the authentication server 100 allows the user server to access the game server 102.

Game server 102 functions to process game messages sent from user clients 108 and to control game progress. The game server 102 may include game command messages such as attacking player characters, chat messages between user clients, quest messages such as accepting and completing quests from a non-player character (NPC), and leveling up player items and obtaining items. It receives various types of game messages such as status information messages and processes the received game messages according to preset game logic.

For example, when receiving an attack message for a specific target from the user client 108, the game server 102 treats the target as being attacked, and in another example, a status information message such as a player's level up is displayed. When received, the game server 102 sends the user's level up information to the database server 104 so that the user's level information is updated.

In particular, the game server 102 provides the client's clients with event information that occurred to a specific user so that a plurality of users can share various events that occur during the game (eg, the state of the player character). Function

According to a preferred embodiment of the present invention, information that needs to be stored in a database, such as character status information, such as character level up, and quest information, and which is not necessary to be provided to other users in real time, is processed by the game server 102. do.

On the other hand, the game server 102 according to the present invention may perform a control function of the traffic car, which serves as NPC or obstruction of the racing game.

According to one preferred embodiment of the present invention, the game server 102 dynamically generates a list of traffic cars that can affect each other on one or more passes corresponding to the movement path of the traffic cars, based on the list. The mobile information calculation process for each traffic car is performed.

The traffic car travels on a plurality of paths, each of which has a starting position and an ending position.

In the present invention, a pass may correspond to one lane of a road in a racing game, and when the roads are divided into intersections or the like, a straight lane, a right turning lane, or a left turning lane in the intersection may exist as separate passes. . However, the present invention may not be limited to this, and each path may be defined as a path in which traffic cars can logically distinguish movement.

According to one preferred embodiment of the present invention, each pass is represented by time information based on a preset speed.

For example, for a path having a total length of 1000 m, the present invention is expressed as a time when the start position and the end position of the path are moved to 100 km / h, in which case, the start position is 0 seconds and the end position is 1000 3600/100 = 36 seconds, and the position between the start and end positions may also be expressed in time.

When the path is generated in this manner, since the location of each traffic car can be expressed using a single parameter such as time information, the location calculation process of the traffic car can be easily performed.

Traffic cars are arranged in chronological order on the plurality of passes generated as described above, and each traffic car is independently managed in a list corresponding to each pass.

Processes managed as a list will be described in detail below.

Meanwhile, in an MMORPG racing game, since an environment similar to a real road is provided, there may be a traffic light, an intersection, or a bottleneck on the road.

When a traffic car moves in an environment similar to the real world, a situation in which a traffic car must accelerate, decelerate, or stop may occur frequently unlike other racing games.

According to the present invention, in order to efficiently control the movement of the traffic car as described above, the game server 102 performs a process of calculating the movement information of the traffic car at a predetermined time interval (for example, one second interval). .

As described above, the calculation of the movement information may be performed based on traffic cars affecting each other.

The movement information of the traffic car may be information for simulation of the traffic car in the user client 108, for example, acceleration for acceleration or deceleration of the traffic car.

When a stop event occurs in the game (for example, when a traffic light becomes a stop signal or a collision occurs), the game server 102 searches for traffic cars that affect each other on the path where the stop event occurs, and According to the set algorithm, the movement information of the found traffic car is sequentially calculated.

The process of calculating the movement information of the traffic car will be described in more detail below.

On the other hand, the plurality of real-time message processing server 106 is dedicated to process the message of the real-time importance of the message transmitted from the user client 108.

Unlike other games, racing games have a very fast movement of player characters, and collisions occur frequently, so it is important to process each player character's movement or collision messages in real time.

When the game server 102 processes a real-time message such as a moving message for N player characters, the load may be increased because event information should be provided to N user clients for one player character.

Accordingly, a real-time message processing server 106 is provided separately from the game server 102 to receive a real-time message such as a player character's movement or collision message, and transmit it to another user client.

Preferably, the real-time message processing server 106 does not simply receive and transmit the real-time message, but performs a process of determining a player character existing at a predetermined distance with respect to the player character that has transmitted the movement or collision message. .

For example, when a movement message of the first player character is transmitted, the real-time message processing server 106 determines a player character existing within a predetermined distance from the first player character, and then the user client 108 of the character. Selectively transmits movement information of the first player character.

Accordingly, the system load can be further reduced than unconditionally transmitting the movement information of the player character to other user clients.

The above process may be equally applied to not only mobile messages but also chat messages sent to other users in the same space.

Meanwhile, in the above description, the game server 102 controls the traffic car. However, it will be apparent to those skilled in the art that the traffic car control process may be performed on the real-time message processing server 106. It will also be apparent to those skilled in the art that if the load is not an issue, the game server 102 can handle it.

The database server 104 stores information related to a game and provides the stored information in response to a request of the game server 102 or a user client.

The database server 104 may store state information, item information, quest information, and the like of the player character, and update the corresponding information when receiving update information related to the character status, items, quests, and the like from the game server 102.

2 is a block diagram showing the module configuration of a game server according to an embodiment of the present invention.

2, a game server according to an embodiment of the present invention includes a plurality of player objects 200, a channel manager 202, a game logic controller 204, a traffic car controller 205, and a message controller 206. , An online player character manager 208, an NPC manager 210, a quest manager 212, an item manager 214, a character manager 216, and a guild manager 218.

The player object 200 functions to control message transmission and reception with the user clients 108 connected to the game server. The player object 200 is created corresponding to the connection of the user client when the user client connects to the game server 102, and is destroyed when the user client is disconnected.

The channel manager 202 manages a game area that can exist in various ways in the racing game. Here, the game area means an area that can be distinguished from each other in the game, such as a quest execution area, a race area, and a shop area.

The game logic control unit 204 performs a control process necessary for game progression such as determining whether a player character completes a quest or a race winner in the game.

The traffic car control unit 205 controls the traffic car existing on the game.

The traffic car controller 205 according to the present invention performs a control process for generating a path, calculating movement information for deceleration or acceleration of a traffic car, processing at a bottleneck point, and changing lanes of the traffic car. It demonstrates below.

The player object 200 provides a game related message transmitted from the user client 108 to the message controller 206 and transmits a game related message of the game server provided from the message controller 206 to the user client. .

The message control unit 206 receives game-related messages transmitted from the user client from the player object 200 and distributes the received message to the component to process it. For example, when a wear item change message of a specific player character is received, the message controller 206 provides the received wear item change message to the item manager 214 and the character manager 216. In addition, when the received message is a quest acceptance message of a specific user, the message controller 206 transmits the quest acceptance message to the quest manager 212.

In addition, when the message controller 206 wants to transmit a message to a specific connected user client, the message controller 206 provides the message to a player object associated with the corresponding user client. For example, if the message controller 206 receives a chat message to a specific user, the message controller 206 sends the chat message to a player object associated with the user corresponding to the receiver of the chat message, so that the chat message is sent to that user. To be sent to the client. As another example, when receiving a collision message of a specific player character, the message controller 206 determines the users of the character located close to the point where the collision can be seen, and simulates the collision scene and the collision corresponding to the clients of the users. Provides information for

The online player character information management unit 208 manages information about the online player character connected to the game server.

The online player character information management unit 208 manages the information of the online user connected to the game server. The player character information may include state information of a character such as an identifier, a location, a level, and an item of a player character existing online.

The information of the online player character information management unit 208 is used when the message control unit 206 determines the receiver to which the message is to be sent. For example, when changing a character wearing item of a specific user, it is necessary to provide worn item change information to nearby users. At this time, the message controller 206 extracts player characters in the vicinity of the player character that has changed the worn item by using the information managed by the online player character information management unit 208 and wears the player characters corresponding to the corresponding player characters. Provide an item change message.

As another example, when a specific player character moves, the message controller 206 extracts player characters in the vicinity of the character moved from the online player character information management unit 208 and provides a movement message to a player object corresponding to the player character. do.

When the message control unit 206 receives a state change message (eg, including a moving message, a worn item change message, a conflict message, etc.) of a specific player character, the state change information is transmitted to the online player character information management unit 208. To provide the status information of the player character that is online.

The NPC (None Player Character) management unit 210 functions to manage NPC information appearing in the game. For example, in the case of a racing game, the NPC management unit 210 manages NPC information providing quests and information on traffic cars appearing on the game.

The quest manager 212 manages information about quests provided to users in a multi-access online game, and information about quest acceptance and quest completion.

When a specific user accepts a specific quest, the quest accept message is provided to the message controller 206, and the message controller 206 provides the quest accept message to the quest manager 212. The quest manager 212 transmits the quest acceptance information to the database server 104 so that the quest acceptance information is reflected. Also in the case of the quest completion message, the quest management unit 212 is reflected to the database server 104 in the same manner as the quest acceptance message described above.

The item manager 214 manages information on items provided during the game and item change information (including item acquisition, item drop, etc.) of the player character. When a specific player character acquires an item, an item acquisition message is provided to the message controller 206, and the message controller 206 provides an item acquisition message to the item manager 214. The item manager 214 transmits the item acquisition information to the database server 104 so that the item acquisition information is reflected.

The character manager 216 manages the information of the player characters generated by the user, and receives a state change message (including character level up, item acquisition information, etc.) for the character and provides the function to the database server 104. do.

The guild manager 218 manages guild information formed by the multi-access online game users. The guild manager 218 receives a guild related message such as a guild member's join / leave message and a guild member's level change message, and provides the guild related information included in the received message to the database server 104. In addition, the guild manager 218 provides guild information through communication with the database server 104 when there is guild related request information such as a guild member status and a guild member list.

3 is a diagram showing a detailed configuration of a traffic car control unit according to an embodiment of the present invention.

As shown in FIG. 3, the traffic car controller according to the present invention includes a path generator 300, a list generator 302, a timer 304, a controller 306, a movement information calculator 308, and a bottleneck. The point search unit 310 may include a lane change unit 312 and a traffic light change unit 314.

The path generation unit 300 generates a path corresponding to the moving path of the traffic car.

As described above, a path according to the present invention has a start position and an end position, and each position on the path is represented by a position time based on a preset speed.

In addition, the path generation unit 300 locates the traffic light at a specific position on the path. At this time, the traffic lights may be arranged sorted in the order of distance from the start position.

In this way, after the path where the traffic lights are arranged is generated, the path generation unit 300 arranges the traffic cars on each path in chronological order. As described above, since each position of the path according to the present invention is represented by time, traffic cars can also be arranged according to time information.

On the other hand, the racing game according to the present invention may include an intersection consisting of a plurality of lanes (straight lane, left turn and right turn lane) to reflect the real world. As shown in FIG. 14, the path generation unit 300 according to the present invention may generate a path that is distinguished from an intersection.

At this time, an intersection traffic light is disposed at the path ending at the intersection, and no traffic light is disposed at the path inside the intersection.

The list generator 302 dynamically generates a list of traffic cars existing on each path.

4 is a detailed view of the list generating unit 302 according to the present invention. As shown in FIG. 4, the list generating unit 302 includes a vehicle list generating unit 400 and a candidate list generating unit 402. ), The expected path list generator 404 and the stop light list generator 406.

The vehicle list generator 400 generates a list of all traffic cars existing on each path, regardless of events occurring on the path.

Here, the vehicle list sequentially records the positions of all traffic cars existing in each pass, and may include a path identifier field, a traffic car identifier field, a location field, and a traffic information field of the traffic car.

Information for identifying a plurality of paths may be recorded in the path identifier field, and information for identifying a plurality of traffic cars is recorded in the traffic car identifier field.

The location field records the location of each traffic car on a specific path, and the location may be recorded as time information on the path.

In the movement information field of the traffic car, distance information, current speed information, and acceleration information of the preceding traffic car existing on the same path may be recorded for each traffic car.

In FIG. 4, the candidate list generating unit 402 and the expected path list generating unit 404 are cases in which a specific situation occurs while the actual game is in progress (for example, when acceleration / deceleration of a traffic car is required, a stop event, The traffic car list is dynamically generated, which may include a pass identifier field, a traffic car identifier field, a location time field, a movement information field, and the like.

On the other hand, as described above, when there are a plurality of traffic lights changed to stop signals among the traffic lights arranged corresponding to each path, the stop traffic light list generating unit 406 dynamically generates a list regarding the stop traffic lights.

The candidate list generator 402, the expected path list generator 404, and the stop signal list 406 will be described in more detail below.

The timer unit 304 may determine whether the calculation time for controlling the traffic car has been reached.

For example, when the movement information of the traffic car is set to be performed in units of 1 second, the timer unit 304 may count the elapsed time, and output a time elapsed signal to the controller 306 after 1 second elapses. can do.

The controller 306 may output the calculation start signal to the movement information calculator 308 when the time elapsed signal is received.

The movement information calculator 308 performs a calculation process for controlling the movement of the traffic car on a predetermined time basis as described above.

Here, the calculation of the movement information may be a process of calculating the acceleration of each traffic car for a preset time (for example, 1 second). For example, the acceleration information should be accelerated or decelerated in consideration of the distance to the vehicle ahead. It can be a process.

In particular, the movement information calculation unit 308 according to the present invention performs a calculation process required in a situation where a plurality of traffic cars must accelerate and decelerate due to road conditions (stopping, collision, occurrence of bottlenecks, etc.).

For example, when a stop event such as a change or a collision to a stop signal of a traffic light occurs in one pass, the movement information calculator 308 determines the calculation start traffic car with reference to the candidate list.

Here, the candidate list is dynamically generated by the candidate list generation unit 402 described above and is a list of traffic cars to be stopped by the stop event.

For example, in the case of a signal change, the candidate list may include information about a plurality of traffic cars that cannot pass through the traffic light converted to the stop signal and must be decelerated by the stop light, but the traffic light is considered when considering the speed of the current traffic car. Traffic cars that are expected to be able to pass through are far from traffic lights and do not require a stop.

On the other hand, the calculation start traffic car means a traffic car that must be stopped first among the traffic cars existing in the candidate list. For example, the traffic car located closest to the traffic light among those that do not pass the traffic light may be determined as the calculation start traffic car. .

The movement information calculation unit 308 calculates the acceleration of the traffic car using data on the current speed, the current position, the distance to the stop line, and the like for the calculation start traffic car.

After the acceleration calculation for the calculation start traffic car is completed, the movement information calculation unit 308 calculates the acceleration of the k th (k is a natural number of 1 or more) traffic car, and the k th traffic for the following k + 1 th traffic car. The acceleration is calculated using the car's acceleration.

The calculated acceleration information is transmitted to the user client 108, and the game application 110 installed in each user client uses the acceleration information for a predetermined time, that is, for a time until the next control information of the traffic car comes. As shown, each traffic car can be simulated to move according to the calculated acceleration.

As a result, the acceleration information is sequentially calculated for traffic cars that may affect each other instead of simply considering the front vehicle, and there is no need to increase the number of calculations. It can improve the accuracy of the calculation compared to

The above calculation is repeated for all the passes until the calculation is completed.

Although the above calculation of the movement information is described as calculating the acceleration of the traffic car, the present invention is not limited thereto, and the movement information may be information about a gradual position change or a speed change.

If the player character and the traffic car collide during the game, the crashed traffic car plays the same role as the traffic light and the same calculation process can be performed using the crashed traffic car as the stop line.

Meanwhile, the movement information calculator 308 according to the present invention may calculate movement information of the traffic car in consideration of a plurality of paths crossing each other as shown in FIG. 14.

As described above, when referring to the intersection shown in FIG. 14, a path according to the present invention may be generated separately in and out of the intersection and for each lane.

The path generation unit 300 according to the present invention generates a graph connecting the nodes (start and end) of the path with respect to the intersection. Referring to FIG. 14, the graph according to the present invention includes a plurality of graphs corresponding to straight lanes. Graph connecting paths 1400, 1402, 1404, graph connecting a plurality of paths 1406, 1408, 1404 corresponding to left turn lanes, and connecting a plurality of paths 1400, 1410, 1412 corresponding to right turn lanes. It may include a graph or the like.

Also, the graph is not only generated for intersections, but may be generated separately for paths connected to each other.

When a graph in which a plurality of paths are connected as described above is generated, the predicted path list generation unit 404 may calculate a path corresponding to a moving path of the traffic car until the next calculation time (for example, 1 second) for each traffic car. Generate a list of expected paths.

Based on the expected path list, the distance to the preceding traffic car can be calculated for each traffic car.

According to the present invention, even when a stop event occurs in a state where a plurality of passes are connected, the traffic information of the traffic car is calculated in a similar manner to the above.

Hereinafter, a case in which a stop event occurs by a plurality of traffic lights will be described.

When a stop event occurs, the stop signal list generator 406 traverses the entire path to create a stop light list, and the candidate list generator 402 simultaneously generates a candidate list that should stop for each stop signal. .

The movement information calculator 308 determines the calculation start traffic car that should be stopped first by each stop light.

Then, the movement information calculation unit 308 calculates the acceleration from the calculation start traffic car for each pass, and sequentially calculates the acceleration using the acceleration of the preceding traffic car for the other traffic car to be stopped. do.

The movement information calculator 308 calculates the acceleration of the traffic cars included in each graph while traversing the graph, and each graph may include the same path. Thus, the movement information calculation unit 308 stops the calculation when it encounters a path that has already been calculated during the calculation.

Meanwhile, while the traffic car is moving, the bottleneck may exist at a bottleneck point due to a decrease in lanes, etc. According to the present invention, the bottleneck point search unit 310 detects whether a bottleneck point exists in the movement path of the traffic car.

For example, the bottleneck point search unit 310 may determine whether there is a road in which the lane decreases due to the crossing of an intersection in the expected path list for each traffic car.

After all the paths that may cause the bottleneck are detected by the bottleneck point search unit 310, the movement information calculator 308 is located behind the excluded traffic car, except for the traffic car that may escape the bottleneck in the path. The acceleration calculation for deceleration is performed on the traffic car.

The lane change unit 312 performs a function of controlling the traffic car to change the lane in consideration of the traffic car existing in the path corresponding to the next lane.

For example, if the road consists of one or more lanes, the lane change unit 312 retrieves a vehicle list of a pass corresponding to the lane next to a specific traffic car, and when the traffic car satisfies the conditions for changing lanes. Change lanes for traffic cars.

Here, whether or not the condition for changing the lane is satisfied may be determined based on whether the traffic car located in the lane next to the traffic car to change the lane is located at a predetermined safety distance or more.

When the lane change is made, the lane change unit 312 removes the corresponding traffic car from the vehicle list of the previous pass and adds it to the vehicle list of the changed path.

The traffic light changing unit 314 controls the change cycle and signal time of the traffic light.

For example, when the traffic light is present on the straight road, the traffic light changing unit 314 changes the signal for a preset period and a preset time.

However, when a lot of traffic cars are crowded to generate a congestion zone, the traffic light changing unit 314 may adjust the signal change period and the signal time.

For example, when the traffic light changer 314 turns to the straight signal after turning left to the traffic light on the intersection, the left turn signal time is increased while the traffic cars that are turning left can pass through the intersection.

That is, the traffic light changing unit 314 according to the present invention may search the number of traffic cars in each direction and increase the signal time for a path corresponding to a section where congestion is intensified.

5 is a block diagram illustrating a module configuration of a game application installed in a user client according to an exemplary embodiment of the present invention.

Referring to FIG. 5, a game application according to an embodiment of the present invention may include a command interpreter 500, a game logic processor 502, a server communicator 504, a simulation unit 506, and a game data extractor 508. It may include.

The command interpreter 500 receives game command information input by a user, interprets the game command, and provides the interpreted information to the game logic processor 502. For example, the game command interpreter 500 analyzes whether the game command input by the user is a quest accept command or a move command, and provides the interpreted information to the game logic processor 502.

The game logic processor 502 functions to execute game logic preset in response to a user's game command input. If the command does not need to be transmitted to the server such as a game environment setting command, the game logic processing unit 502 performs a game environment setting process inside the client. In the case of a command that needs to be transmitted to the server, such as a player character's movement message, the game logic processing unit 502 generates a movement message corresponding to the movement command and provides it to the server communication unit 504.

The server communication unit 504 transmits a game message generated by the game logic processing unit 502 to the game server 102 or the real-time message processing server 106, and transmits a game message transmitted from the game server or the real-time message processing server. Functions to provide to the game logic processing unit 502.

The simulation unit 506 performs a simulation of the player character according to the user's command. When the movement information about the traffic car is received, the simulation unit 506 performs the simulation on the traffic car according to the movement information.

For example, when acceleration information for deceleration of the traffic car is received by the stop event, the simulation unit 506 simulates the traffic car corresponding to the acceleration, and thus the user may check the traffic car decelerating on the screen. Make sure

In addition, when the lane change information of the traffic car is received, the simulation unit 506 may generate a lane change line to express that the traffic car changes lanes.

The simulation unit 506 may generate an S-shaped lane change line through an interpolation process by using the progress direction of the previous lane and the changed lane and the position information of both lanes, and interpolation uses Bezier spline interpolation. Can be.

The game data extraction unit 508 functions to extract game data necessary for game execution. For example, under the control of the game logic processor 502, the game data extractor 508 extracts map data, character information data, and the like.

Hereinafter, a process of performing a traffic car controller will be described in detail with a flowchart.

6 is a flowchart illustrating a basic path generation process according to an exemplary embodiment of the present invention.

FIG. 6 illustrates a process of generating one path. Referring to FIG. 6, the traffic car controller 205 generates a path having a location time (step 600).

As described above, the path according to the present invention may be expressed as a time taken when each position moves at a preset speed.

After the path is generated, the traffic car control unit 205 places a traffic light on the path (step 602). In this case, the traffic lights may be arranged in a sorted order (distance order) at a distance from the start of the path.

After arranging the traffic lights, traffic cars are placed on the path in chronological order (step 604), and a vehicle list for the placed traffic cars is generated (step 606).

As described above, the identification information, the location and the movement information (acceleration, distance from the preceding traffic car, speed, etc.) of all traffic cars existing in the path may be recorded in the vehicle list.

FIG. 7 is a flowchart illustrating a traffic car control process in a basic path according to an exemplary embodiment of the present invention, and illustrates a traffic car control process when a stop event occurs in one path. Referring to FIG.

Referring to FIG. 7, the traffic car controller 205 according to the present invention determines whether a predetermined time has elapsed (step 700). Herein, the preset time is a time for determining whether the calculation time has been reached, for example, 1 second.

When the preset time has elapsed, the traffic car controller 205 determines whether a stop event has occurred in the corresponding path (step 702), and generates a candidate list for the traffic car that should be stopped when the stop event occurs. (Step 704).

As described above, even if a traffic car is located before a stop event (for example, a traffic light) in the current state, the candidate list may be displayed at a next time point (for example, when the traffic of the traffic is displayed in the user client). Excludes traffic cars that can pass through a point.

The traffic car control unit 205 determines the traffic car that should first stop at the stop event point on the candidate list as the calculation start traffic car (step 706), and calculates the acceleration for the traffic car located later from the calculation start traffic car (step 708). ).

The acceleration is calculated using the stop position or the distance from the preceding traffic car, the current speed, and the like.

8 is a flowchart illustrating a traffic car control process in a path considering an intersection according to an exemplary embodiment of the present invention.

FIG. 8 illustrates a traffic car control process when a stop light is present on a road including a crossroad.

Referring to FIG. 8, the traffic car controller 205 generates a path based on the intersection (step 800).

Step 800 is a step of generating a path corresponding to each lane by dividing the inside and the outside of the intersection.

After the path is generated, nodes of each path are connected to generate a graph (step 802), and the graph is initialized when driving the traffic car (step 804).

Thereafter, the traffic car control unit 205 creates an expected path list for each traffic car that can go to the next calculation time (for example, 1 second) (step 806).

Next, based on the expected path list, the distance with the preceding traffic car is calculated for each traffic car (step 808).

If there are stop lights in a plurality of passes at the time of calculation, the traffic car controller 205 creates a stop light list while traversing the entire path (step 810), and determines each calculation start traffic car while traversing the stop light list. (Step 812).

The determination of the calculation start traffic car may be performed in the same process as in step 706 described above.

After the calculation start traffic car is determined, an acceleration calculation process of the traffic car is performed on a path included in each stop light list (step 814).

If there is a previously calculated path during the acceleration calculation, the traffic car controller 205 stops the acceleration calculation process in the corresponding path (step 818).

At this time, the traffic car controller 205 traverses the graph for each traffic car whose calculation is missing for the graph, and creates a list of advanced traffic cars that may affect each traffic car, and performs the acceleration calculation process as in step 814. Can be done.

9 is a flow chart of a traffic car control process at the bottleneck in accordance with one preferred embodiment of the present invention.

9 may be performed after generating the expected path list in step 806. Referring to FIG. 9, the traffic car controller 205 searches for a bottleneck point for each expected path list (step 900).

As described above, the search for the bottleneck is a process of checking whether there are roads with decreasing lanes in the expected path list.

If there is a bottleneck, the traffic car controller 205 determines the bottleneck escape point (step 902) and calculates the acceleration for the traffic car located before the bottleneck escape point (step 904).

As a result, traffic cars close to the bottleneck escape point may pass through the bottleneck point without deceleration.

Then, it is determined whether or not the calculation process is completed for all the expected pass lists of all the traffic cars (step 906).

The acceleration information of the traffic car calculated above is transmitted to the user client. Accordingly, the user may confirm that the traffic car decelerates when a stop event occurs or in a bottleneck point section.

10 is a flowchart illustrating a traffic car control process when changing lanes according to an exemplary embodiment of the present invention.

Referring to FIG. 10, the traffic car control unit 205 searches a vehicle list of adjacent paths (lanes) for the same direction lane of a specific traffic car (step 1000).

The traffic car controller 205 determines whether the lane change condition is satisfied after searching the vehicle list (step 1002).

As described above, the lane change condition may be determined based on whether or not the traffic cars located in the adjacent lanes are located beyond the safety distance.

If the lane change condition is satisfied, the traffic car control unit 205 updates the vehicle list in passes before and after the change (step 1004).

The lane change information of the traffic car is transmitted to the user client 108 (step 1006), and the game application 110 installed in the user client interpolates the location of the traffic car according to a preset algorithm (step 1008). A S-lane change line is generated for the traffic car with the changed lane (step 1010).

Accordingly, the user can confirm that the traffic car changes lanes in the S-shape.

11 is a flowchart of a signal time change process according to the present invention.

FIG. 11 illustrates a signal time change on an intersection, and illustrates a process of changing the signal time even for a congestion section that is not an intersection.

Referring to FIG. 11, the traffic car controller 205 searches for the number of traffic cars based on the intersection (step 1100), and determines whether the traffic car is expected to exist on the path in the intersection (step 1102).

If it is expected that the traffic car will not cross the intersection for a predetermined signal time, the traffic car control unit 205 updates (extends) the signal time (step 1116), otherwise changes the traffic light (step 1104).

On the other hand, the traffic car control unit 205 can search the traffic number for each direction separately from the intersection, thereby determining the congestion section, it is possible to flexibly change the signal time in the section.

Preferred embodiments of the present invention described above are disclosed for purposes of illustration, and those skilled in the art will be able to make various modifications, changes, and additions within the spirit and scope of the present invention. Additions should be considered to be within the scope of the following claims.

As described above, according to the present invention, there is an advantage that it is possible to efficiently control the traffic car that is essentially present on the racing game.

In addition, according to the present invention, since the control of the traffic car is performed at a predetermined time interval, there is an advantage that can reduce the load on the server.

In addition, according to the present invention, since the path is expressed in time, the position of the traffic car can be easily expressed by a one-dimensional variable, and thus, the calculation time can be shortened.

In addition, according to the present invention, there is an advantage that the traffic car control can be efficiently performed by managing the traffic cars that may affect each other as a list.

Claims (22)

A method of controlling traffic cars in a game system connected with a user client via a network. (a) dynamically generating a list of one or more traffic cars affected by each other on one or more paths corresponding to the movement path of the traffic car; (b) determining a calculation start traffic car from the list; And (c) sequentially calculating movement information of traffic cars existing in the list on the basis of the calculation start traffic car; And (d) transmitting the calculated movement information to the user client, The steps (a) to (c) are performed at a predetermined time period, and the game application installed in the user client simulates the traffic car according to the movement information. The method of claim 1, Before step (a) above Generating a path having a position time based on a preset speed; Sorting traffic lights in order of distance from the start and end positions of the path; And And placing at least one traffic car on the pass in a predetermined time sequence. The method of claim 1, Determining whether a stop event occurs in the one or more passes; The step (a) is a traffic car control method, characterized in that for generating a candidate list of traffic cars to be stopped on the path where the stop event occurs. The method of claim 1, In step (c), Starting with the calculation start traffic car, calculating the acceleration of the k + 1 th traffic car using the acceleration calculated for the k th (k is a natural number of 1 or more) traffic cars located on the list. Traffic car control method. The method of claim 1, Before step (a) above, Generating a pass belonging to at least one of a straight lane, a right turn lane, and a left turn lane; And And generating an expected pass list that can move for a predetermined time for the traffic car. The method of claim 1, Generating a stop light list while traversing the one or more passes if a plurality of stop light events occur; The step (a) is a traffic car control method, characterized in that for generating a list of traffic cars that should be stopped while traversing the list of each traffic light. The method of claim 1, After step (a) and before step (b), Determining whether a bottleneck exists in the pass; And If a bottleneck exists, further comprising determining a bottleneck escape point, And (b) to (c) the traffic car located before the bottleneck escape point. The method of claim 1, After step (a) and before step (b), Generating a vehicle list for each traffic car present on the one or more passes; Determining whether a predetermined traffic car satisfies a lane change condition when a lane is to be changed; And If the traffic car changes lanes, updating the list of vehicles in previous and changed paths. The method of claim 8, The lane change condition is determined based on whether the traffic car on a path corresponding to the adjacent lane is located above a preset safety distance. The method of claim 8, The game application, when the lane change information of the traffic car is received, traffic car control method, characterized in that to interpolate the position of the traffic car using the direction of the previous path and the changed path and the respective position information. The method of claim 1, Before the step (a), the step of changing the traffic light disposed on the path for a predetermined time in a predetermined period, wherein the steps (a) to (c) is performed when the traffic light is changed to a stop signal Traffic car control method, characterized in that. The method of claim 11, wherein after the step of changing the traffic light, before the step (a), Determining a congestion section by searching the number of traffic cars located on each path for each travel direction; And And extending the progress signal time for the determined congestion section. A computer-readable recording medium having recorded thereon a program for performing the method according to any one of claims 1 to 12. A device connected to a user client through a network to control traffic cars. A list generator for dynamically generating a list of one or more traffic cars affected by each other on one or more paths corresponding to the movement path of the traffic car; A movement information calculation unit for determining a calculation start traffic car from the list and sequentially calculating movement information of traffic cars existing in the list based on the calculation start traffic car; And Further comprising a timer for determining whether a predetermined time has elapsed, The calculation of the movement information is performed at a predetermined period, the game application installed in the user client is a traffic car control apparatus, characterized in that for simulating the traffic car according to the movement information. The method of claim 14, Generate a path belonging to at least one of a straight lane, a right-turn lane and a left-turn lane with a position time based on a preset speed, and sort the traffic lights in order of distance from the start position and the end position of the pass, And a path generation unit for arranging one or more traffic cars in a predetermined time sequence on the path. The method of claim 14, The list generation unit, An expected path list generation unit generating an expected path list that can move for a predetermined time with respect to the traffic car; A stop light list generator for generating a stop light list while circulating the one or more passes; A candidate list generation unit for generating a list of traffic cars that should be stopped while traversing the list of the traffic lights; And And a vehicle list generator for generating a vehicle list for each traffic car existing on at least one path. The method of claim 14, And when the stop event occurs in the one or more paths, the list generator generates a list of traffic cars that should stop on the path where the stop event occurred. The method of claim 14, The movement information calculation unit, Starting with the calculation start traffic car, the acceleration of the k + 1th traffic car is calculated using the acceleration calculated for the k th (k is a natural number of 1 or more) traffic cars located on the list. Device. The method of claim 14, Further comprising a bottleneck point search unit for determining whether there is a bottleneck point in the pass, and, if there is a bottleneck point, determine a bottleneck escape point, And the movement information calculator calculates an acceleration for deceleration with respect to a tropic car located before the bottleneck escape point. The method of claim 14, If the predetermined traffic car is to change lanes, it is determined whether the lane change condition is satisfied, and if the traffic car changes lanes, further comprising a lane change unit for updating the list of vehicles in the previous pass and the changed path. Traffic car control device. The method of claim 20, The game application, when the lane change information of the traffic car is received, the traffic car control device, characterized in that to interpolate the position of the traffic car by using the progress direction and the respective position information of the previous path and the changed path. The method of claim 14, Further comprising a traffic light changing unit for changing the traffic lights arranged on the path for a predetermined time at a predetermined period, The traffic light changing unit determines a traffic congestion section by searching the number of traffic cars located on each path for each travel direction, and extends a traffic signal time for the determined traffic congestion section.

Images