JP3036162B2 - Virtual space sharing method and virtual space sharing server - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method of sharing data in a virtual space using a computer network and a virtual space sharing server, and more particularly to a communication close to reality when a large number of people have a conversation using a virtual space. And a virtual space sharing server.

[0002]

2. Description of the Related Art Conventionally, a three-dimensional space has been created by a model, and three-dimensional space has been created around a user using display means and sound means.
Various utilization forms using a virtual space reproduced as if there is a dimensional space have been considered.

[0003] As one of the utilization forms, a real-life communication system or the like is known in which a remote place is used for a meeting or work as if a remote person met a room in combination with a high-speed communication network.

Several schemes have been proposed for a real-time communication system using network communication. One of them is talk at UNIX (T
alk) Two users interact one-to-one like a program, and other systems use one virtual space (for example, a room, (Work space) is shared by many users simultaneously in one virtual space, so that all users can know the message issued by one user. Also, in designing a shared window for a teleconferencing workstation, you can see the same thing as what others are looking at.
at I See) and the like have been proposed.

[0005]

According to the above-described immersive communication system having the conventional configuration, it is possible to obtain a feeling that a person in a remote place is having a meeting in the same virtual space. Also, considering that the message is used as an LL or a teaching machine (TM) using a chat or the like, the range of the virtual space is limited to, for example, a room because a message issued by one person reaches all users. However, in terms of TM and the like, there was no utility value other than dialogue between a large number of students and educators.

SUMMARY OF THE INVENTION The present invention has been made to solve the above-mentioned problems, and an object of the present invention is to allow a virtual space to be expanded more and realize communication communication that is more realistic than a large number of users. Is to provide a virtual space sharing method and a virtual space sharing server that can be performed by the user.

[0007]

A virtual space sharing method according to the present invention is a virtual space sharing method in which a single virtual space is shared by a plurality of terminals, and a message receiving process step of receiving a message from a user of each terminal. An update processing step of updating state information of each user in the virtual space based on a message arriving from each terminal; and a predetermined processing in a predetermined virtual space based on the updated state information of each user. A message transmitting step of transmitting a message corresponding to the updated status information of each user to a terminal of another user located within the message reach. The virtual space sharing server of the present invention is a virtual space sharing server in which a single virtual space is shared by a plurality of terminals. Updating means for updating the status information of each user on the virtual space; and updating the status information of each user located within a predetermined message reach on the virtual space based on the updated status information of each user. Message transmitting means for transmitting a message corresponding to the updated state information of each user to the user terminal.

[0008]

According to the virtual space sharing method and the virtual space sharing server of the present invention, a plurality of terminals are connected by Ethernet, and a display means (hereinafter referred to as CRT) 2A, 2B # of the terminal displays a three-dimensional virtual space such as a town. The image is projected via the server 3, but the projected pattern is limited to a range where the message transmitted by the user can reach, and can be transmitted and received only with other users within the range, so that there is a sense of reality. It is designed to communicate.

[0009]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS A description will now be given of a virtual space sharing method and a virtual space sharing server according to an embodiment of the present invention applied to a TM.

According to the present invention, a virtual space is set on a computer network, and when a plurality of users communicate within the space, the reach of a message is limited. In other words, a message is sent to a certain user, and a message is sent to another user, and a virtual space sharing method and a virtual space sharing server which can realize a control of a dialogue such that a message does not reach another user. The present invention will be described in detail.

FIG. 1 is a schematic diagram for explaining an outline of a virtual space sharing method and a virtual space sharing server system according to the present invention, and FIG. 2 is a hardware configuration diagram.

In FIG. 2, reference numeral 4 denotes an Ethernet.
The transmission device (server) 3 which is the same terminal as the terminals 5A, 5B, etc. is connected to the bus 4 in the bus of FIG. As these terminals 5A and 5B and the transmitting device 3, U
A NIX workstation or the like is used. Each workstation is a CRT 2A, 2B @ 2 as a display means.
A workstation (EWS) 6A, 6B @ 6M including a microcomputer (CPU) as well as keyboards 7A, 7B @ 7M, etc., and a bus 4 is connected to each EWS 6
A, 6B @ 6M are connected to form a computer network.

The operating environment is BSD UNIX.
An operation system and an X window system are required.

In such a hardware configuration, in this embodiment, for example, a virtual space of a three-dimensional townscape is created as a background database using a CPU and stored in a memory.
In FIG. 1, a two-dimensional map is shown as the virtual space 1. In the town displayed on the CRTs 2A, 2B @ 2M, a road 8 through which a user (user) can pass and an obstacle 9 such as a building are displayed. In this case, the memory of the CPU of the transmission device 3 has map data, and each user A, user B, user C, and user C in the town displayed on the CRTs 2A and 2B.
The user 10 is arranged like the user D.

For example, on the CRT 2A of the terminal 5A of the user A, only the map showing the arrangement of the road 8 and the obstacle 9 around the user A is displayed, and on the CRT 2B of the terminal 5B of the user B, the road around the user B is displayed. The terminal of the transmitting device 3 controls so as to display only the map indicating the arrangement of the obstacles 8 and the obstacles 9.

The users A to D can move along the road 8 by a movement command. CRT2 by moving
The maps displayed on A and 2B are sequentially rewritten.

Further, the messages 11A and 11B can be transmitted to the other users A and B by the message transmission command. When a message transmitted by another user is received, it is displayed on the CRTs 2A and 2B. By transmitting and receiving such messages 11A and 11B, the user AB
It is made so that communication between them can be realized.

The software configuration for configuring the system as described above will be described with reference to FIGS.

As shown in FIG. 3, the software of the virtual space sharing method and the virtual space sharing server system of the present embodiment receives a command such as a message transmission from each of the users 10 such as the user A and the user B and transmits the command. In response to commands from the client processes 20A and 20B # and the respective client processes 20A and 20B #, necessary processing is performed, and the result is returned to the client that transmitted the result, or the transmitted messages 11A and 11B are transmitted to another client. Server process 2 for distribution to appropriate users A and B
1 is composed of two types of processes.

The client processes 20A and 20B
‥‥ requires one process for each user, and client processes 20A, 20A as shown in FIG.
B # receives a command from user 10 as input. The main commands from each user 10 are a message transmission command 10A for transmitting a message and a movement command 10B for moving on a map.

Client processes 20A, 20B
Receives these commands 10A and 10B, the client processes 20A and 20B # receive the commands and necessary information (contents of the message, moving direction, etc.) 22A and 2B.
2B is transmitted to the server process 21.

Further, the client processes 20A, 20
B # receives the screen redraw request 23A transmitted from the server process 21 and the command of the incoming message 23B from another user, and responds to each user 10 according to the message display 24B from the other user and the result of the movement. Redisplay the map.

This map displays a part of the map information of the server process 21 as described above. For example, there is only a map around the position of each user 10 on a map held by the server process 21.

Also, only one server process 21 exists in a LAN such as Ethernet, and this server process 21
Receives commands from the client processes 20A, 20B # and processes them. As shown in FIG. 5, the server process 21 includes the map information and the position information 26 of each user 10.
have. The map information is information on a virtual city map provided on the CPU. Each user 10 is arranged on a road on this map, and the position of the user is managed as position information.

The program operation of this embodiment will be described below with reference to FIGS.

When the movement command 10B, 10B # of each user is received from the client processes 20A, 20B, the server process 21 determines the user 10 based on the map information and the position information 26 from the movement direction and the user's position information.
Is determined to be movable (whether or not deviated from the road 8).
The position information is changed according to B and 10B. A map to be displayed by the client processes 20A and 20B due to the change (a map around the position of the user 10).
Is changed, the new screen redraw display data 34A is sent to the client process 20A, 20B #.

The client processes 20A and 20B
When a message transmission command 22B is received from a user 10, a user 10 to send a message is determined by a method described in detail in an actual flowchart described below, and a message transfer 25 is performed to the client processes 20A and 20B of the user 10. Has been established.

That is, as shown in FIG.
And each of the client processes 20A and 20B # operate independently, and a dialogue between users is realized in cooperation with the transmission and reception of commands.

The above-described client process 20A, for example,
Is a system in which the server process 21 distributes a message 22B transmitted by the server process 21 to all the client processes 20B #.
B is weighted. As the weighting method, a parameter such as “loudness of voice” is added.

If the "loudness of voice" is low, message 22
The message reaches only the user who is in the immediate vicinity of the user who transmitted B (close to the distance on the map information of the server process). If the "loudness of the voice" is large, it is determined that the message can reach a user who is located a little away.

FIG. 7 shows a process of determining a limit range when the server process 21 determines such a message transmission 22B and delivers a message to the other client processes 20A and 20B.

The inputs In the first step ST ₁ given user A, for example, a caller name via the client process 20A in FIG. 7, a message, a level keyboard.

The server process 21 receives such a message originating 22B is as shown in the second step ST _2,
Search the location information from the caller name to find out the location and number of the user.

The client process 20A, 20B is provided to the server process 21 in an image as shown in Table 1, for example.
, The position (x, y) in the virtual space, the direction, and the number are stored. Here, since there are a plurality of client processes 20A, 20B #, these numbers are used to represent the client i. Second step ST
_{In 2} , the client number is selected as x.

[0035]

[Table 1]

In the third step ST ₃ , the reach of the message is determined according to the level and the direction. That is, specifically, the range in which the message arrives is set as shown in FIG. 8 according to the “loudness” level of the message transmission 22B of the predetermined user 10. In FIG. 8, 30 is a specific user 1
0 indicates a position on the screen 29, 31 indicates a range where the message transmission 22B reaches when the voice volume is low, 32 indicates a range where the message transmission 22B reaches when the voice volume is medium, and 33 indicates a range where the message transmission 22B reaches when the voice volume is medium. It shows a range where the message transmission 22B reaches when the voice is loud.

As described above, even in the vicinity of the same user 10, the control that the message transmission 22B reaches or does not reach depending on the volume of the voice can be easily realized. For example, as shown in FIG. 9, when a message of a specific user A of the user 30 is transmitted with a “loudness” level, the message reaches both the users B and C as indicated by 34.
On the other hand, the message issued by the user C in the “loudness” does not reach the user A as in 35.

Since the reach of the message is determined by the "loudness of the voice", a situation close to a real conversation can be created.

Further, as shown in FIG.
0 position and taking both well third step ST ₃ levels and orientation even in consideration of the conditions for defining a range 36 reach of messaging 22B in the orientation shows a case defining a reach of the message .

As described above, in order to limit the range of the message transmission 22B based on the “loudness” level and the position and orientation of the user, the coordinates at which the message arrives are determined in advance by the CPU of the server process 21 as shown in Table 2. Keep in memory
According to the level and the direction, the table 2 is searched to determine the reach of the message. The coordinates in Table 2 are different from the coordinates of the sender, so that the message reaches the range of coordinates obtained by adding the coordinates obtained by searching to the coordinates of the sender.

[0041]

[Table 2]

Now, let the coordinates of the client x be (X _X ,
Y _Y ), based on Table 2, when the level is 1 and the direction is north, ( _XX- 1, Y _X +3), ( _XX , Y _{X
+3), (X X + 1} , Y X +3), (X X -2, Y X +
2) Make sure that the message reaches the range of coordinates (1).

Next, the fourth step ST_FourProceed to Claire
And the fifth step ST _FiveThen i ≧ client
Is determined as the number of events, and if YES, the first step ST
₁Is returned to. If NO, the sixth step ST_FiveProceed to
Can be

[0044] In the sixth step ST ₆ client i =
Determine x, the process proceeds to a seventh step ST _7, if NO. Position of the seventh step ST ₇ the client i is determined it is within the reach of the message. Coordinate values used herein are client x (caller) _{(X X, Y} Y) coordinates (X _i, Y _i) of the client i the difference between (X _X -
X _i , Y _Y -Y _i ) in the data obtained in Table 2,
The message transmission 22B reaches the client i.

If the seventh step ST ₇ is YES, the eighth step ST ₇
Obstacle between the client X and other clients i that originated in step ST ₈ is determines whether there. A flowchart for determining this obstacle will be described later with reference to FIG.
The client coordinate values x (caller) _(X X, Y X) and coordinate values of the client _i (X i, Y i) an equation for a straight line connecting the two points, obstacles is present in the straight line Find out if.

Sixth step ST ₆ , eighth step ST ₈
If the answer is YES and the seventh step ST ₇ is NO, the first
0 proceeds to step ST _10, is returned to the fifth step ST _5. Eighth step ST ₈ is advanced to a ninth step ST ₉ if NO. Send a message at the ninth step ST ₉ to the client i, i in the tenth step ST ₁₀
→ as i + 1 is returned to the fifth step ST _5.

In the eighth step ST ₈ , the obstacle or the obstacle 38 is determined. The message arrives at the position of the user 30 in the direction of the obstacle 38 as shown in FIG. As shown in 37, the range in which the message reaches is cut off. In consideration of such a point, a dialog control closer to reality can be easily performed.

Referring to FIG. 12, a flowchart for checking the presence or absence of the obstacle 38 will be described. The first step STP ₁ the client x (caller) and the client i (to be examined whether a message received from a client x)
Husband of coordinates s _{(X X,} Y _X), and (X _i, Y _i).

[0049] In the second step STP _{2 X X} -X _i / Y
_X− Y _i = a is determined.

[0050] In the third step STP ₃ Y _i -a · Y _i
= B.

[0051] In the fourth step STP ₄ X _min = _{min
(X X, X i),} X max = max (X X, X i) maximum as X, obtaining the minimum.

[0052] The following fifth step STP ₅ in X _min +1
Is obtained as X.

[0053] Request Y as the sixth step the STP ₆ a · X + b

[0054] In a seventh step STP ₇ (X, Y) checks whether the there is an obstacle. If YES here, there is an obstacle 38 between the client x and the client i (eighth step STP ₈ ), and if NO, proceed to the ninth step STP ₉ .

In the ninth step STP ₉ , X = X + 1, and in the next tenth step STP ₁₀ , it is checked whether X ≧ X _max . In NO it is returned to the sixth step STP _6, Y
In ES proceeds to the eleventh step STP _11. It is determined there is no obstacle 38 between the first 11 step STP ₁₁ in the client x and the client i.

In each of the above-described embodiments, since a virtual space, that is, a town is created in a 32 × 32 square, one unit is a unit, and the movement of the user 10 is also one unit, so that a message arrives. The range is a rectangular range as shown in FIGS. 9 to 11, but as shown in FIGS. 13 to 15, the range is specified by a distance based on the unit with the distance smaller than the square. Is also good.

FIG. 13 shows a case in which the range 34A of the message reaching the volume of the voice is substantially circular, and FIG.
FIG. 15 shows a case where the range 36A where the message reaches is fan-shaped by the direction of 0, and FIG.

According to the virtual space sharing method and the virtual space sharing server of the present invention, the virtual space is expanded from the level of one-on-one conversation in a room to the level of a town, in which a large number of people realize a conversation with each other. Therefore, it has become possible to create a virtual town in a population, and to use it in such a way that a large number of users participate in the town and enjoy it while communicating. Furthermore, it can create realistic dialogues such as asking for directions, so LL for language education
And TM tools.

[0059]

When a large number of users exist simultaneously in one virtual space, the reachable range of a message transmitted by each user is limited, and the message is transmitted only to other users within the range. As a result, a virtual space sharing method and a virtual space sharing server that can realize more realistic communication can be obtained.

[Brief description of the drawings]

FIG. 1 is a schematic diagram of a virtual space sharing method and a system of a virtual space sharing server according to the present invention.

FIG. 2 is a hardware configuration diagram of a virtual space sharing method and a virtual space sharing server of the present invention.

FIG. 3 is a program configuration diagram of a virtual space sharing method and a virtual space sharing server of the present invention.

FIG. 4 is an explanatory diagram of a virtual space sharing method and a client process used for a virtual space sharing server according to the present invention.

FIG. 5 is an explanatory diagram of a server process used for a virtual space sharing method and a virtual space sharing server of the present invention.

FIG. 6 is a diagram showing an operation example of a program of a virtual space sharing method and a virtual space sharing server of the present invention.

FIG. 7 is a flowchart illustrating an algorithm for determining a client to which a message reaches in a virtual space sharing method and a virtual space sharing server according to the present invention.

FIG. 8 is a diagram illustrating a range in which a message reaches;

FIG. 9 is an explanatory diagram showing a difference in message delivery depending on the volume of voice.

FIG. 10 is a diagram illustrating a message reach range according to a user's orientation on a map.

FIG. 11 is a diagram showing the reach of a message when there is an obstruction;

FIG. 12 is a flowchart for checking the presence or absence of an obstacle.

FIG. 13 is an explanatory diagram showing another example of determining a range based on a distance.

FIG. 14 is an explanatory diagram showing another example of determining a range based on a distance and a direction of a user.

FIG. 15 is an explanatory diagram of another example of determining a range based on a distance and a shield.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 1 Virtual space 2A, 2B @ 2M Terminal display means (CRT) 3 Transmission apparatus 6A, 6B @ 6M EWS 8 Road 9 Building 10 User

Continuation of the front page (56) References JP-A-4-256243 (JP, A) JP-A-3-232354 (JP, A) JP-A-3-119476 (JP, A) JP-A-2-186737 (JP) , A) JP-A-2-84860 (JP, A) Suzuki Gen, "Visual Communication Environment Using Virtual Space Technology", Information Processing Society of Japan Vol. 93 No. 34, (1993.04.28) (58) Fields investigated (Int. Cl. ⁷ , DB name) G06F 13/00 355 G06T 15/00 G06F 3/14-3/153 G06F 15/00 H04L 12/40

Claims (6)

(57) [Claims] 1. A virtual space sharing method for sharing a single virtual space among a plurality of terminals, comprising: a message receiving processing step of receiving a message from a user of each terminal; and a message receiving process from each terminal. An update processing step of updating state information of each user on the virtual space; and a position within a predetermined message reach on the virtual space set in advance based on the updated state information of each user. Transmitting a message corresponding to the updated state information of each user to a terminal of another user who performs the virtual space sharing. 2. The message is information indicating a moving direction of a user in the virtual space, which is input by each user operating each of the terminals, and status information updated in the update processing step is A message reach range determination process for determining the message reach range in accordance with the position information of each user in the virtual space updated in the update process step, The method according to claim 1, further comprising a step. 3. The message is information indicating a moving direction and a line-of-sight direction of the user in the virtual space, which is input by each user operating each of the terminals, and is updated in the update processing step. The state information is position information and gaze direction information of each user on the virtual space, and according to the position information and gaze direction information of each user on the virtual space updated by the update processing step, The virtual space sharing method according to claim 1, further comprising a message reach determination process step of determining the message reach. 4. A virtual space sharing server for sharing a single virtual space among a plurality of terminals, comprising: a message receiving means for receiving a message from a user of each of the terminals; Updating means for updating the status information of each user on the virtual space; and, based on the updated status information of each user, being located within a predetermined message reach on the virtual space set in advance. A virtual space sharing server comprising: a message transmitting unit that transmits a message corresponding to the updated state information of each user to a terminal of another user. 5. The message receiving means receives, as a message, information indicating a moving direction of the user in the virtual space, which is input by each user operating each of the terminals, and the updating means The information processing apparatus further includes a message arrival range determination unit that updates position information of the user on the virtual space, and determines the message arrival range in accordance with the position information of each user on the virtual space updated by the updating unit. The virtual space sharing server according to claim 4, wherein: 6. The message receiving means receives, as a message, information indicating a moving direction and a line-of-sight direction of the user in the virtual space, which are input by each user operating each of the terminals. Updates the position information and gaze direction information of each user on the virtual space, and according to the position information and gaze direction information of each user on the virtual space updated by the updating unit,
The virtual space sharing server according to claim 4, further comprising a message reach determination unit that determines the message reach.