JP2003021674A - System for guiding operator of node to present position of another node - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a system and a program capable of acquiring position information of another person by providing a fixed restriction corresponding to a mutual position relation or an operation content, and realizing a new game or a service wherein information in the restricted range is used by many persons. SOLUTION: A client server system by program S for system control program C for a player is constituted. The program S has an information management function, a background display function, a coordinate information function, a coordinate reference function, a position display function, an operation function, and a server control function. The program C has the background display function, the coordinate information function, the coordinate reference function, the position display function, the operation function, a coordinate acquisition function, a client control function or the like.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a system for controlling a computer based on position information.

[0002]

2. Description of the Related Art As a method or means for acquiring own current location information, a satellite positioning system such as GPS for receiving radio waves from a plurality of satellites for radio positioning and a base station for mobile communication such as PHS are identified. A system and the like for obtaining one's own current location information from the position of the base station is known. Then, some systems have been disclosed in which a portable information terminal is equipped with a system for acquiring these current location information to send its own current location information to a server via a computer network. For example, Japanese Patent Laid-Open No. 8-322091 discloses that
As a news gathering support system, a system is disclosed in which information including the current location of a news gathering terminal is transferred to an electronic newspaper server via a network. In addition, JP-A-10-336238
Discloses that current location information is sent from a mobile terminal to a server, and based on the sent information, map data around the position and related information are sent to the mobile terminal. In addition, in Japanese Patent Laid-Open No. 2000-322361, a wireless communication device that can easily use position information and device state information is disclosed.
JP-A-10-221106 and JP-A-08-30107
3, JP-A-07-170346, and JP-A-2000-137.
885 and the like disclose a method of utilizing position information for vehicle theft prevention and self-defense.

On the other hand, a navigation device for playing a game using a means for detecting the current location is disclosed in Japanese Patent Laid-Open No. 9-11437.
0 is disclosed. This navigation device displays a map including the current location and executes an event when the current location reaches an event occurrence point set on the map. Further, Japanese Patent Laid-Open No. 2001-070656 discloses a method of constructing a virtual world by taking a maze as an example.

[0004]

As described above, the present location information of oneself can be easily obtained, and it is considered to use the information to provide various services or entertainment. As services and games that can be carried out using the current location information, things that follow the map of the navigation device as described above, orienteering using a personal navigation device, a virtual world such as a maze, etc. are considered. However, all of them are intended to utilize their own position information exclusively, and there is no one that utilizes position information from the viewpoint of the relative relationship with oneself and others and the restriction of acquisition of information corresponding to the operation. Therefore, in the present invention, unlike the conventional similar invention, it is possible to obtain the position information of another person by setting a certain limit according to the mutual positional relationship, the operation content, etc., and to obtain a large number of information within the limited range. The purpose is to provide systems and programs that realize new games and services used in.

[0005]

At present, a wide variety of portable game machines are commercially available. These game machines display a virtual world, and a mouse, a direction key button, a joystick, or a stylus is displayed. With a pointing device such as a pen, the game is advanced by moving in the virtual world. On the other hand, in the present invention, the limited space information is displayed by displaying the space-time coordinates of the self and the other person in the real world, which are obtained by the GPS or the like, under the fixed condition through the display means of each node. Relying on searching for another person and guiding them to that position, just like "a game with a new feeling like a combination of" tagging game "and" hide and seek "and" searching equipment such as radar and sonar "(hereinafter called" hyper tagging " Note) ”has been realized. This is a great example, so to explain it in a little more detail, "hyper tag" is a method that imitates a radar device or a sonar device, and it does not detect your position as much as "hide and seek", and "tag tag".
It is a game that competes to catch the opponent as quickly as.

Therefore, in the present invention, a client / server system is constituted by a server computer for controlling the entire game and a client computer individually used by each game participant. Hereinafter, for the sake of convenience, “a node that functions as a server computer” is an “S node”, “a program according to the present invention that operates on an S node” is an “S program”, and “a node that functions as a client computer” is “C”. Node "," program according to the present invention that operates on C node "
Is referred to as "C program". The S program stores the space-time coordinates of each node, the node operator identification information, etc., and an information management function for updating or deleting or searching as appropriate, and automatically or in response to an operator's instruction input. The background display function that displays the background map as a background, the notification function that reports the space-time coordinates of each node to other nodes, the reference function that obtains the background map and other space-time coordinates, and the position of each space-time coordinate in the background map. And a position display function of displaying or concealing by converting to displacement etc., calculation of distance between nodes, node status identification processing, node status response processing, other spatiotemporal coordinate estimation processing, and other spatiotemporal coordinate identification processing It has a function and a server control function for controlling each function in the S program. On the other hand, in the C program, in addition to the background display function, the notification function, the reference function, the position display function, the calculation function,
Etc. (hereinafter referred to as "positioning system network") and the corresponding "means on the node side for acquiring current location information (hereinafter referred to as" positioning system interface ")" using the space-time coordinates of the own node And the acquisition function to acquire C
It has a client control function for controlling each function in the program.

Further, according to the present invention, with respect to the above-mentioned calculation function, the emergency notification processing for issuing a rescue request signal to another node when the node operator falls into an emergency situation, and the rescue request signal are dealt with. Then, it is possible to add a rescue support process for taking a rescue measure to the operator. The emergency notification process can be set to "operate by performing a predetermined alert operation (hereinafter referred to as" immediate alert "), and further," perform a predetermined release operation within a predetermined time. It operates by not having it (it is described as "forced alert" below). " On the other hand, the rescue support process displays information such as the position coordinates of the node that issued the alarm, the place name and address, whether it is an immediate alert or a forced alert, and the alert time through the display means of the S node that received the rescue request signal. An emergency display is provided to provide the information necessary for the operator of the S node to notify the police, fire department, security company, family, relatives, or acquaintances.

In the present invention, unless the operator actually moves, that is, the node, ie, the node operator's own body, does not move to such an extent that a significant difference can be obtained by the positioning system interface, the transition is displayed on the display means. It cannot be reflected. For this reason, a real amount of exercise is required as in the case of playing tag, and it is possible to provide a game with a taste that is clearly different from the conventional game that can be performed without moving even one step.

In the current GPS independent positioning, a movement amount of several tens of meters is required as an actual displacement depending on the conditions.
Further, in the case of relative positioning in which correction is performed using the correction value measured by the base station, movement of several meters is required as actual displacement.
Of course, a method of using carrier wave phase shift as a measured value, etc.
There is also a positioning system that can measure the displacement of the current location at a level of a few millimeters, but due to cost and mounting reasons, it is hard to say that it is easily available and has excellent portability. In particular, the present invention is also characterized in that the operator actually travels a certain distance without knowing it while having fun, and there is almost no merit in using such an expensive and highly accurate positioning system. Absent.

The space-time coordinates of the self are obtained from the positioning system network through the positioning system interface as described above. However, according to the present invention, a plurality of game participants can enjoy the "hyper tag". This is possible by exchanging the space-time coordinates of each node acquired by each node with the notification function and the reference function. Incidentally, the notification function from the C node is to notify the S node of its own latest space-time coordinate and store it in the storage means of the S node.
There is no risk that other game participants will find their latest space-time coordinates. On the other hand, the reference function of the C node is used to obtain the latest space-time coordinates of another node via the reference function of the S node, but at this time, the other node is given the latest space-time coordinates of its own node. Bear the risk. This is C
This is because when the node uses the reference function, the space-time coordinates of the C node are automatically notified to other nodes by the notification function of the S node.

The space-time coordinates obtained in this way are used together with a background map that uses a map, a schematic diagram, or the like prepared in advance in the storage means of the S node, or a background map that is appropriately downloaded from the S node to its own node at the C node. At the same time, it is displayed on the display means of each node as a position symbol, an icon, an arrow indicating the amount of displacement, or character information.

Regarding the space-time coordinates of other nodes, the "accuracy", that is, the "accuracy of the position and direction of the node",
If the game is implemented in consideration of "freshness", that is, "the size of the elapsed time after the space-time coordinates of the node are obtained", the depth of the game increases. In the present invention, the spatiotemporal coordinates of the own node can be acquired from the positioning system network via the positioning system interface arbitrarily and without danger of being detected by another person according to the instruction of the operator. Not so easy. As described above, the space-time coordinates of other nodes are obtained in exchange for the space-time coordinates of the own node. The situation around here is easy to understand by recalling a real radar device or sonar device.

In the case of a radar device or a sonar device, there are generally two methods for knowing the position of another person. The first is
It is a method of oscillating "a radio wave or sound wave for search (hereinafter referred to as" search medium ")" from itself to know the distance and direction from the reflected wave to the target, that is, "active search". The second is a "passive search" method, which is to listen quietly, detect a search medium oscillated by another person, and estimate the distance and direction to the oscillation source. In general,
If the accuracy is ignored, the passive search has a wider detection range than the active search. However, in any of the methods, the greater the distance to the other party, the lower the accuracy of the position and direction.

Further, each node owner, that is, the game participant, must naturally be considered to be moving and changing positions from beginning to end so as not to be caught by another person, due to the nature of the game. In other words, even if you get the space-time coordinates of a node at a certain moment, it will change to an uncertain one at the next moment,
The freshness and accuracy of the space-time coordinates are decreasing. Therefore, in order to find the position of the other node and accurately capture the other, it is very important to judge the situation regarding the other and the method to be used at that time. For example, if one wants to know the position of another person accurately, the active search may be exercised closer, but doing so carries the risk of giving more and more opponents their own space-time coordinates. On the other hand, if you rely only on passive search to avoid detection from others, you will just wait for others to use active search, and as a result, the space-time coordinates needed to catch others will be lost. Not only can freshness and precision not be ensured, but it also increases game time and physical fatigue. Therefore, the timely use of a suitable search method in a suitable situation is the best way to enjoy this game. The above is the reason for increasing the depth of the hyper tag game.

Further, according to the present invention, by providing a restriction on the detectable range, it is possible to add complexity and depth which are not found in other similar patents. For example, the range that can be detected by one active search can be limited to a certain range based on the position at that time, instead of the entire movable range in the game. Also, regarding the passive search, the detection range can be limited to a certain area, which is wider than the active search range but not the entire area. These restrictions are set in the initial settings at the start of the game. For example, the effective range of active search is a radius of 500
Up to m, the effective range of passive search is set to 1 km, and in another game, it is set to 5 km and 10 km, respectively. Alternatively, these may be set differently for each participant in order to give a handicap. Then, it is applied in the position display function. That is, whether it is an active search or a passive search, the nodes existing outside the detection range may not be displayed.

The best part of the Hyper Tag is a scene captured by another person. For this purpose, for example, the captureable distance and the error width are set in advance by the initial setting at the start of the game.
Incidentally, this set value may be uniformly applied to the game participants, or may be a different value for each participant. When it is determined that the other node of interest exists near the self, the self node is operated (for example, “capture” instruction input), and the estimated position of the capture target node and the capture request are calculated by the self calculation function and the client. The S node is notified via the control function and entrusted with the determination of capture possibility. At this time, in order to obtain the current space-time coordinates of the capture target node, the S node requests the latest space-time coordinates to the capture target node via the reference function. And by the arithmetic function,
If the acquisition request node is within a distance that can actually acquire the acquisition target node and the current position of the acquisition target node is within a predetermined error from the estimated position indicated by the acquisition request node, it is determined that the acquisition is possible. If not, it is determined that it cannot be captured. The capture target node and its operator captured in this way subsequently lose their qualifications for participation in the game, and only watch the progress of the game continued by the remaining participants. On the contrary, the node operator who succeeds in capturing may be given a predetermined score by setting at the time of starting the game in advance, or may simply compete for the number of captured persons. It should be noted that, regardless of the success or failure of the acquisition, the spatiotemporal coordinates of the acquisition request node at the acquisition request time are notified by the S node to all other nodes within the passive search and detection range.

Generally, a map, a sketch, and the like required by the present invention
Since background maps such as sketches and simulated landscapes (realistic and simplified landscapes inside and outside the route) have a large amount of information, S
A means for acquiring is appropriately provided on the C node side through communication with the node. That is, the range in which the game participants can move is set in advance, and all the background map information is stored in the S node in advance. Then, with the movement of each game participant, only the background map that covers the surroundings of the current location is displayed as C
By downloading to the node each time, the load on the memory resource on the C node side can be reduced. This procedure is S
The information of the current location may be transmitted to the node, and the background map information regarding the current location may be acquired from the S node.
In addition, this procedure is executed automatically or by the operator's instruction input. In addition, the background image is not only prepared by the system in advance, but in order to apply it only to a specific game,
By the time the game starts, it may be separately loaded into the S node by an offer or operation from a prospective participant of the game or a representative.

The system of the present invention is a computer-readable recording medium, for example, an FD (Floppy D), which is a program including instructions for realizing each step of the method.
disk), CD (Compact Disk) or DV
D (Digital Versatile Disk)
Etc. can be recorded and provided. Then, the system of the present invention can be utilized by installing the program in the S node or the C node. Further, the program of the system of the present invention can be provided by being converted or embedded in a transmission medium supplied via a computer network or the like.

The method of advancing hyper tagging may be divided into a plurality of teams in which game participants are distributed and a group battle may be conducted, or an individual battle format in which each participant fights alone with all the rest as enemies. Also, the end of the game has reached a preset end time, has been captured by all the members of one of the other teams leaving one of the team, or leaving one and all other participants. The process ends when it is captured or when the rescue request signal according to claim 10 or claim 18 is issued. Then, if the game ends other than the issuance of the rescue request signal, it is advisable to perform ranking registration, display, etc. according to the points of the participants. Such formations and rules may be processed according to the settings at the start of the game. Further, the area in which the participants can move may be within the town or within the same prefecture. Or if it covers the whole of Japan, it will be a very large scale game. Alternatively, if it is carried out in or around a facility having a vast site such as a theme park, school or amusement park, it can be used as a featured event of the facility. Naturally, the means of transportation is not limited to walking and biking, but if you use trains or passenger cars as well as trains, buses, or public transportation such as ships and aircraft by protecting proper manners, the game will become even more interesting. I can do things.

The node connected to the system of the present invention may be of any type and format as long as the S program and the C program can operate. Therefore, for example, a notebook computer, a mobile phone, etc. are mixed in the system of the present invention. Alternatively, the mobile phone may operate as an S node and the stationary computer may operate as a C node. Further, both the S program and the C program may be executed in the same node. Although there is no particular choice as to the communication network that connects the nodes, currently the most common TCP
(Transfer Control Protocol
l) It is easy to use the Internet (Internet) and i-mode based on IP (Internet Protocol).

[0021]

BEST MODE FOR CARRYING OUT THE INVENTION The present invention will be described below with reference to the drawings. Hereinafter, unless otherwise specified, the hyper tag is described as a suitable application example of the system of the present invention. FIG. 1 shows a mobile phone (2a) and a mobile terminal (3a) as examples of a C node in which the system of the present invention operates.
The PHS (4a), the stationary computer (10a) as an example of the S node, and an example of the environment surrounding them are shown. The mobile phone (2a) of this example is transferred to a stationary computer (10a) which is an S node of the hyper tag, through a mobile phone relay station (5a), a wireless communication network (8a), a wired communication network (9a) and the like. Ready to connect. Similarly, the mobile terminal (3a) and PHS (4a)
The mobile terminal relay station (6a) and PH
It can be connected to the stationary computer (10a) which is an S node via the S relay station (7a), the wireless communication network (8a), the wired communication network (9a) and the like.

Most of the portable terminals (3a) available at the present time are equipped with a PHS unit or a mobile telephone unit. In that case, wireless communication is performed via the PHS relay station (7a) or the mobile telephone relay station (5a). Although it will be connected to the communication network (8a), by providing a communication unit that relies on a unique communication protocol, a unique mobile terminal relay station (6a) and wireless communication network (8a) as in this example It is also possible to use.

Further, the mobile phone (2a), the mobile terminal (3a) or the PHS (4a) of this example uses the existing or future positioning system network (1a) to obtain data (many If the coordinates include longitude and latitude information),
That is, it has a positioning system interface (43) as a means for acquiring position coordinates. Several such positioning system networks (1a) have already been installed, and currently the most accurate and usable ones in a wide area are GPS.
The unit obtains the coordinates of its own current position by radio wave positioning in which the unit receives radio waves from GPS satellites and performs positioning. GPS that determines coordinates based only on information from GPS satellites
In the case of the independent positioning, the error is contained within several tens to 100 m depending on the conditions. In a game such as Hyper Tag, this degree of error is within the allowable range, so GPS single positioning is sufficiently practical.

However, the greatest problem in the case of GPS independent positioning is that when the GPS unit is located underground or inside a building, the radio wave cannot be received or is difficult to receive. Therefore, if the means (relative positioning) for complementing this space by the PHS relay station (7a) or the mobile phone relay station (5a) is sufficiently practical, it is also used as the positioning system interface (43). Examples of this include a mobile terminal (3a) equipped with a PHS unit or a PH.
If it is S (4a), the identification information (CSID) of the closest PHS relay station (7a) is received, and the position of the base station is known from the CSID, whereby the mobile terminal (3a) or PHS is detected.
There is a method of obtaining the current location of (4a). Thus CSI
If D is obtained, the coordinates of the relay station can be easily obtained. On the other hand, in the case of a mobile terminal (3a) or a mobile phone (2a) equipped with a mobile phone unit, a mobile phone relay station (5a)
From the coordinates of the mobile terminal (3a) or mobile phone (2a)
However, the accuracy is not good compared with PHS. However, it is considered that the accuracy is remarkably improved depending on a communication system such as CDMA which will be adopted in the future.

In this example, a mobile phone (2
a), a mobile terminal (3a), a PHS (4a), etc. are shown, and in addition to the above-mentioned positioning system interface (43), a display for displaying a background map, space-time coordinates, etc. at these C nodes. A means (41), a communication means (42) for transmitting and receiving various information, a C program (30) which is a set of client side functions of this game, and the like are mounted.

On the other hand, in the stationary computer (10a) as the S node of this example, a display means (41) for displaying a background diagram, space-time coordinates, etc. and a communication means (42) for transmitting and receiving various information. Besides, storage means (40) for storing background map information, game participant information, and space-time coordinates thereof.
Also, an S program (20), which is a set of server-side functions of this game, and a download means for the C program (30) are installed. Incidentally, theoretically, these means do not necessarily have to be implemented collectively in a single S node, and some means may be implemented separately in another S node or redundantly. good. In particular, the storage means (40)
Depending on the scale, it is often possible to obtain good response performance by arranging distributedly on multiple S nodes, and the S program (2
In the case of 0), a mirror server configuration can be realized by mounting the same on a plurality of S nodes. Such a server configuration may be mainly adopted as one of the solutions to the increase in the load on the S node.

FIG. 2 shows the functional configuration of the S program (20) operating in the S node according to the present invention. The S program (20) includes a server control function (21), an information management function (22), a position display function (23), a background display function (24), a notification function (25), a reference function (26), and a calculation function ( 27) etc. operate by cooperation of various functions.

The server control function (21) controls the initialization processing of the entire S program (20) and the control of other lower functions. The information management function (22) has a server control function (2
Under the control of 1), request processing such as recording and searching of information from other functions is executed with the storage means (40). The position display function (23) executes information display request processing regarding the position from another function to the display means (41) under the control of the server control function (21). The background display function (24) is controlled by the server control function (21).
A background information display request process from another function is executed for the display means (41). The notification function (25) executes the information notification request processing regarding the position from another function with the communication means (42) under the control of the server control function (21). The reference function (26) executes information acquisition request processing regarding a position from another function with the communication means (42) under the control of the server control function (21). Under the control of the server control function (21), the arithmetic function (27) executes a process for responding to a distance calculation request from another function, a situation recognition request, or a request from an operator. By the way, the position display function (23), the background display function (24), the notification function (25), the reference function (26) and the calculation function (27) are the C node, that is, the C program (3
It is also implemented in 0).

The functional configuration of the C program (30) operating on the C node in the present invention is shown in FIG. The C program (30) includes a client control function (31), an acquisition function (32), a position display function (23), a background display function (24), a notification function (25), a reference function (26), and a calculation function (27). ) Etc. operate by cooperation of various functions.

The client control function (31) controls the initialization processing of the entire C program (30) and the control of other lower functions. The acquisition function (32) performs a space-time coordinate acquisition request process from another function under the control of the client control function (31).
To run between. A position display function (23), a background display function (24), a notification function (25) and a reference function (26)
And the calculation function (27) are the client control functions (3
It is the same as that of the S node except that it is controlled by the control of 1) and that it is executed while being conscious of being executed by the C node. Therefore, only a brief summary is given here, and detailed description will be given later. Describe in detail.

S program (20) and C program (3
Each function in (0) is in accordance with the latest programming method, and is a LAN (Local Area Network).
Internet or WAN (Wide Area)
Socket interface based on TCP / IP established as a de facto standard (industry standard) protocol in various networks such as Network or each O / S (Operating System)
It is generally developed as a process using the Message interface based on m), but it can also be developed as a single program by a conventional method that collects subroutines. However, if the O / S of each node cannot be unified to a specific O / S, or if distributed processing or multiple processing at multiple nodes is assumed, a process that uses the Socket interface, especially a daemon for the S node, is used. It is better to design as a (Daemon) process
Higher flexibility and flexibility can be secured in terms of program structure, node configuration, and system operation. In addition, each process uses multi-threading (Multi-Thread).
ing), that is, re-entrant (Re-Entran)
t) in multi-processing (Multi-Proces
Sing) possible implementations in mind. Therefore, in the following, description will be made based on this assumption. Incidentally, the daemon is a general term for processes that are automatically started when a computer is started and are always waiting and monitoring to respond to a new request while the computer is operating.

Each function in the above S program (20) and C program (30) will be described in more detail with reference to FIG. An outline of the operation of the server control function (21) is shown in FIG. The S node program according to the present invention is always in a standby state as a daemon of a very general method in a server process, and receives a new game first setting request or a first participant login etc. from a C node. To start its running process. Therefore,
Hereinafter, unless otherwise specified, the S program (20) refers to the process in this execution state.

When the S program (20) is activated, a server initialization process (100) for initializing various types of counters, pointers, flags and other temporary recording areas and allocating memory is executed. During this initialization processing, the identification information of the participant and the identification information of the C node are sequentially sent from the C node of the game participant. In addition, from the game organizer and representatives, the scheduled start and end times of the game, whether it is an individual battle method or a group battle method, team formation, a movable range as a game area, an active search effective range, a passive search Various conditions applied to the game such as the effective range, the captureable distance, and the allowable miscalculation width thereof are sent. In some cases, background image information to be applied to the game is also transferred. These pieces of information are stored in an appropriate storage mechanism such as an external storage device as first speed information. The default values will be applied to the items that are not specified. After that, in order to receive other functions in the S node and processing requests from the operator, it waits while periodically looping.

When an information management request such as addition / deletion / change / search of space-time coordinates or reference to a background diagram is detected, the information management function (22), which is a subordinate function, is called and the requested content is transmitted and processed. When the position display request of the self and other nodes based on the space-time coordinates is detected, the position display function (23) which is a subordinate function is called to transmit and process the request content. When a background image display request is issued for scrolling or updating the screen, the background display function (2
4) is called to transmit and process the requested content. When a notification request of the space-time coordinates of the self and other nodes is generated, the notification function (25) which is a subordinate function is called to transmit and process the request content. When a reference request for the space-time coordinates of another node is detected, the reference function (26), which is a subordinate function, is called to transmit and process the request content. When a calculation request such as calculation of the distance between the nodes or identification of the node status is detected, the calculation function (27) which is a subordinate function is called and the content of the request is transmitted and processed.

When a request to end the operation as the S node is detected, the server end processing (108) such as discarding flags and memory release is executed to end the S program (20). At this time, the game end instruction is notified to the other S nodes controlling the game and the C nodes participating in the game. Of course, as a game-capable computer, each node is equipped with a touch panel and various input devices such as a pointing device. By operating it, the operator operates a server control function that operates at each node. (21) and the client control function (31).

An outline of the operation of the client control function (31) is shown in FIG. By the way, there are roughly two types of activation methods of the C program (30). The first method is that the C program (30) is previously stored in the C node of its own by FD or the like.
Install C program at any time (30)
Is started to log in to an appropriate S node.
The second is a method in which the C program (30) is downloaded from the S node and activated each time the S node is logged in. Whichever method is used, there is no essential difference, only the distribution method is different.

When the C program (30) is activated, a client initialization process (110) for initializing various variables, counters, pointers, flags, and other temporary storage areas and allocating memory is executed. At this time, operator identification information, node identification information, corresponding S node identification information, and the like are set. Furthermore, when the operator corresponds to the organizer or representative of the game, scheduled start and end times of the game, distinction between individual battle mode and group battle mode, team formation, movable range as game area, active search Effective range, passive search effective range,
It is possible to set various conditions applied to the game, such as a captureable distance and an allowable miscalculation width thereof. In addition, if the game organizer or representative has prepared background map information to be applied to the game, information on surrounding conditions or rescue support, etc., it may be transferred and applied to the game. it can. Ultimately, the various setting information described above is sent to the S node that controls the game, usually the S node that logged in. When the initialization is completed in this way, it waits while periodically looping to receive other functions in the C node and processing requests from the operator.

When an acquisition request for the space-time coordinates of the own node is detected, the acquisition function (32), which is a subordinate function, is called and the requested contents are transmitted and processed. When the position display request of the self and other nodes based on the space-time coordinates is detected, the position display function (23) which is a subordinate function is called to transmit and process the request content. When a background diagram display request is issued for scrolling or updating the screen, the background display function (24), which is a subordinate function, is called and the request content is transmitted and processed. When a request to report the space-time coordinates of its own node is generated,
The notification function (25), which is a subordinate function, is called and the requested content is transmitted and processed. When a reference request for the space-time coordinates of another node is detected, the reference function (26), which is a subordinate function, is called to transmit and process the request content. When a calculation request such as calculation of the distance between the nodes or identification of the node status is detected, the calculation function (27) which is a subordinate function is called and the content of the request is transmitted and processed.

When a request to end the operation as the C node is detected, the client end processing (118) such as discarding flags and memory release is executed to execute the C program (3
0) is ended. This end requirement is usually a game end instruction from the S node, but it can also be done by operating the C node. However, when the emergency notification means according to claim 10 or the emergency notification step according to claim 18 is in the standby state, it is necessary to further perform a predetermined operation for canceling the standby state, for example, input of a cancellation password. . The above is the outline of the interrelationship between the operations of the server control function (21) and the client control function (31) and the subordinate functions. Below, a detailed description will be given of each subordinate function.

First, referring to FIG. 6, an information management function (22)
The outline of the operation of is shown. The parameters passed from the requester are
Type of function to be executed and a series of information groups to be executed (node identification information, operator identification information, space-time coordinates, etc.)
Is. When the initialization request is received from the server control function (21), the information initialization process (121) is executed. In this process, various variables, control counters, pointers, flags, and other temporary storage areas are initialized, and at the time of starting a new game, information related thereto, for example, various conditions of the game (game conditions Area, game progression, active and passive search effective range, background map, scheduled start and end times of games, score calculation method, team formation, individual or group competition, etc.) and participant identification information or C node identification information Etc. are saved as a series of information. When the game is over, the information stored during the game is discarded.

When the addition request is received from the server control function (21), the information addition process (123) is executed. In this process, the information sent from the server control function (21) is stored in the storage means (40). The storage means (40) normally has a DBMS (Data-B) installed in the S node.
Defect and standard SQL (Struct) via asase Management System)
uredQueryLanguage) to access. In addition, a file system having an O / S-dependent unique interface can also be used, but in this case, since the O / S that can be used as the S node is limited, from the viewpoint of system flexibility and expandability. Not very effective. Note that the main information to be processed is the space-time coordinates notified from each C node at every moment as the game progresses.

When the deletion request is received from the server control function (21), the information deletion processing (125) is executed. In this case also, similarly to the information addition process (123), the storage means (40) is accessed via the DBMS while using SQL. As a general rule, since various information is only accumulated during the game, this deletion process is not normally called, but in rare cases when the storage means (40) has run out of capacity or is predicted. This is the required processing. The target of deletion in this processing is mainly the space-time coordinate information of the C node. Most of the space-time coordinate information related to each C node stored in the storage means (40) is the information with the freshness (temporally old) that can be replaced by the latest information.
Therefore, by leaving only some of the latest information and the latest information about each C node and deleting all the other information, there is a margin in the storage capacity of the storage means (40) and there is no practical problem. The information deletion process (125) is used for such a purpose.

When the change request is received from the server control function (21), the information change process (127) is executed. Also in this process, similarly to the information addition process (123), the storage means (40) is accessed via the DBMS while using SQL. The difference is that while the information addition process (123) adds new information records, this process changes the contents of existing information records. The information to be processed is mainly information about the state of the entire game and the state of each game participant. As the game progresses, these information (whether or not it was captured, how many people were captured, who was captured, what is the status of each team, how much time has elapsed, etc.) changes moment by moment, so It is necessary to constantly update the latest situation. The information change process (127) is used for such a purpose.

When the search request is received from the server control function (21), the information search process (129) is executed. This is to search various information stored in the storage means (40) using the search key specified in the search request parameter,
The search result is returned as a tuple or a dynaset (a set of searched records). This process is frequently used, for example, when displaying space-time coordinates, referring to space-time coordinates, or displaying a background diagram. After the above required processing is completed, the processing result is returned to the server control function (21).

FIG. 7 shows the outline of the operation of the background display function (24) operating in the S node and the C node.
This function is automatically activated when there is a certain amount of change in the spatiotemporal coordinates of its own node, in addition to when triggered by an instruction input from the operator. The parameter passed from the requester is the center coordinates (latitude, longitude, altitude, etc.) of the background map to be displayed. Server control function for this function (21)
Alternatively, the request from the client control function (31) occurs when, for example, a display magnification change operation or a screen scroll operation is performed, or the spatiotemporal coordinates of another node are referred to, and a new background diagram required at this time, That is, it is for displaying (when necessary, reacquiring) background map information in a certain range centered on the space-time coordinates indicated by the request parameter. Incidentally, the "fixed range" here means the display magnification applied to the node at that time and the display means (4
1. A display window for this game is a good example)
Of the background image and the display area, and the scale and accuracy of the background image information stored in the storage means (40) of the S node as the original image. For example, set the display magnification to 1
/ 2, resolution is 70 dpi (dot per inc)
h), assuming that the display area is 4 inches wide × 3 inches long and the accuracy of the background image information is 5 m / dot, the displayed range is 2800 m wide (= 70 dots × 4 inches × 5 m ×).
2 times), length 2100m (= 70dot × 3inch × 5)
m × 2) area.

When a background image display request is received from the server control function (21) or the client control function (31), it is first determined whether or not the background image information needs to be reacquired, that is, currently displayed. It is determined whether or not it is possible to display only the held background image information corresponding to the background image. If possible, the background map of the range is displayed again in the background map display (133). If it is impossible, the background image information of the newly required area must be acquired. This procedure is different for S and C nodes. First, in the S node,
A background map information search request is issued to the information management function (22) through the server control function (21), and in response to the response, the background map display (133) displays the background map of the range.
On the other hand, since the C node itself does not have the background map information storage means (40) or the information management function (22), the S node is sent via the reference function (26) of its own node whenever the background map information is needed. A background image information request is transmitted to and acquired. Then, the background map of the range is displayed in the background map display (133). After the above processing is completed, the processing result is returned to the request source.

FIG. 8 shows an outline of the operation of the position display function (23) operating in the S node and C node.
This function is automatically activated when there is a certain amount of change in the spatiotemporal coordinates of its own node, in addition to when triggered by an instruction input from the operator. A request for this function via the server control function (21) or client control function (31) is to display the position corresponding to the space-time coordinates of itself and other nodes by dots or arrows or icons or characters or numerical values indicating coordinates. It is for doing. The parameters passed from the request side are the identification information of the display target node and its space-time coordinates.

Position display function that operates in S node (23)
Does not have any restrictions on the display, but there are certain restrictions on the display content and method on the C node. It is a constraint on the spatiotemporal coordinates themselves to be displayed and their freshness. First,
If the requested space-time coordinate is compared with the current background map and if it is outside the display range, nothing is displayed and the process returns to the request source. This determination process is common to the S node and C node.

If this is not the case, there is a check whether display is prohibited or not as a criterion applied only to the C node. Even if the spatio-temporal coordinates of other nodes are obtained by the notification from the S node to all C nodes, the position of the other node is prohibited from being displayed unless it is detected by the active search or passive search performed by the own node. Be the target. In that case, nothing is displayed and the process returns to the request source.

If the requested spatiotemporal coordinate is outside the display inhibition target, whether or not it is the freshness suppression target is further checked as a criterion applied only to the C node. In other words, it is a determination as to whether to display the position of the node based on the latest space-time coordinates or to display based on the space-time coordinates used last time. The former case corresponds to the case where the latest space-time coordinates have been obtained by the active search or passive search performed by the own node,
If not, it will be treated as the latter. In the former case, the space-time coordinates to be displayed are obtained by the latest information search (145), and in the latter case, the previous display information search (144). The spatiotemporal coordinates of other nodes, which are reported by the S node or obtained by active search or passive search performed by themselves, are
Since it is stored in an appropriate temporary storage area in its own node,
The space-time coordinates of the target node are acquired by searching the area.

On the other hand, in the S node, the display prohibition inspection and the freshness suppression inspection are not executed, and the position display based on the latest space-time coordinates is always performed. In order for the S node to obtain the space-time coordinates of an arbitrary node, a search request designating the identification information of the node is issued to the information management function (22) via the server control function (21). Then, as the response, the latest space-time coordinates of the node are obtained.

In this way, when the S-node and C-node have obtained the space-time coordinates to be displayed, the position display (146) causes the node to be located at the position corresponding to the space-time coordinates in the background map displayed at that time. The space-time coordinates of are displayed, and all processing of this function ends. After the processing is thus completed, the processing is returned to the request source together with the processing result.

FIG. 9 shows the outline of the operation of the notification function (25) operating in the S node and C node. This function is not only triggered by the instruction input from the operator,
It is especially effective when it is automatically activated when there is a certain amount of change in the space-time coordinates of the own node, or after issuing a rescue request signal, but periodically after a certain time has elapsed. It may be activated. The request for this function via the server control function (21) or the client control function (31) is normally for the C node to notify the S node of its latest spatiotemporal coordinate and register it. As a special case, "when any C node performs active search or performs acquisition processing (regardless of success or failure of the result), the S node sends the It is used to notify the latest space-time coordinates (hereinafter referred to as "passive search result notification"). The parameters received from the request side require the identification information of the target node and its latest space-time coordinates, and the identification information of the notification destination node when the passive search result is notified.

First, when the own node is the C node, since it is for notifying and registering the latest space-time coordinates of the own node to the S node, the S node connection (151) processing is performed to the S node. Make a dial-up connection. Then, in the space-time coordinate notification (152), the latest space-time coordinate of the user is sent out,
The space-time coordinate is additionally registered by the space-time coordinate registration (155) of the notification function on the S node side. Finally, in S node connection disconnection (153), the connection with the S node is disconnected. As a matter of course, when the communication network to be used is the constant connection environment or when the connection with the S node has already been established by another process in the C node, the S node connection (151) and the S node connection disconnection ( The procedure of 153) is unnecessary.

On the other hand, when the own node is the S node,
It is determined whether the passive search result notification processing is requested or the space-time coordinate registration processing is requested. If the request is a space-time coordinate registration processing request, the space-time coordinate registration (155) registers the space-time coordinate in the storage means (40) of the S node via the information management function (22). If it is a passive search result notification processing request, the space-time coordinates are notified to all C nodes except the requesting C node. For that purpose, first, dial-up connection with the C node to be notified is performed.
After the connection is established by the node connection (157), the space-time coordinate is sent out by the space-time coordinate notification (152), and is acquired by the space-time coordinate acquisition (168) on the C node side, and then stored in the temporary storage area of the C node. . Finally, the connection is broken by disconnecting the C node (158). As a matter of course, when the communication network to be used is a constant connection environment or when the connection with the C node has already been established by another process in the S node, the C node connection (157) and the C node connection The disconnection (158) procedure is unnecessary.

FIG. 10 shows an outline of the operation of the reference function (26) operating in the S node and C node. The parameters passed from the request side are the type of target information and the node identification information or the background center coordinate. A request for this function via the server control function (21) or the client control function (31) is issued for the purpose of obtaining background map information or space-time coordinates of a node.

First, when the background map information is requested, if the own node is the S node, the background map search (162) covers the corresponding coordinates from the storage means (40) via the information management function (22). Get background map information. When the own node is the C node, first, the S node connection (15
In step 1), dial-up connection is made to the S node, and after the necessary background coordinate notification (163), the background map information is received (164) to receive the background map information, and finally S
The node connection disconnection (153) disconnects the dial-up connection with the S node. As a matter of course, when the communication network to be used is an always connected environment or when the connection with the S node has already been established by another process in the C node, the S node connection (151) and the S node connection disconnection ( 153)
Procedure is unnecessary.

Next, when the space-time coordinates of the node are requested, if the self-node is the S node, the latest space-time coordinates are acquired from each C node by the space-time coordinate collection (167) and the information management function ( 22) to the storage means (40). On the other hand, when the own node is the C node,
First, dial-up connection is made to the S node by the S node connection (151), and then the space-time coordinate acquisition (1
68) receives the space-time coordinates of the corresponding node, and finally disconnects the dial-up connection with the S node by disconnecting the S node (153). As a matter of course, when the communication network to be used is an always connected environment or when the connection with the S node has already been established by another process in the C node, the S node connection (151) and the S node connection disconnection ( 1
The procedure of 53) is unnecessary. When the necessary processing is completed in this manner, the processing result and the relevant information are brought back to the request source.

FIG. 11 shows the outline of the operation of the arithmetic function (27) operating in the S node and C node. The parameters passed from the request side are the type of processing to be executed and the information necessary for the processing. The request for this function via the server control function (21) or the client control function (31) is to calculate the actual distance between different space-time coordinates, identify the status and status of the own node and other nodes, and set various settings and status. It determines the action based on the state, or issues a rescue request signal to other nodes, or displays the necessary information for taking rescue measures for the operator in response to the rescue request signal. , Is issued for the purpose of estimating and specifying other space-time coordinates. In most cases, the server control function (21) or the client control function (31) that receives an instruction input from the operator judges the instruction content and requests the necessary processing, but the passage of time, the change in position, etc. May be required periodically or automatically based on the.

First, when the actual distance calculation is requested, the actual distance between two points is obtained by the distance calculation processing (171) from the two space-time coordinates given as parameters.
The result is returned. Next, when the identification of the state or situation of the node is requested, the situation identification processing (173)
For example, whether the node is alive or dead (whether or not it is captured), the score, the elapsed time, the position of the node on the screen, etc. are searched or compared, or a condition to activate periodically or automatically is established. It is judged whether or not it is done and the result is returned to the request source. Further, when an operation based on various settings and a situation or a state is requested, the situation response process (175) causes a scroll request of the background diagram, a position display request, a passive search result notification request, setting information, a state of life or death, or a score. And the like, or the activation of processing or the like that should be activated periodically or automatically, the change of the display magnification and the display range, and the activation of the re-display request accompanying it.

Further, when the condition for immediate or forced notification of the rescue request signal is satisfied, the emergency notification processing (177) is called and the rescue request signal is sent to the S node. On the other hand, the S node side receiving the rescue request signal calls the rescue support process (179),
Emergency display is displayed to the node operator, and rescue assistance information (reporting date and time, reporting space-time coordinates, place name / address, immediate reporting or forced reporting) is provided so that rescue measures can be taken for the C node operator. Is displayed). Furthermore, if information such as contact information of the police station, fire department, etc. is registered, it can be displayed together.

In addition, in the case of a request to estimate the current space-time coordinates of another node, the position estimation process (181) calculates the current position coordinates from the latest and previous space-time coordinate groups of the node stored in the own node. Estimate and display multiple or singular candidates. When the operator judges that the specific position coordinate is the most effective as the current position and inputs the instruction to that effect, the position specifying process (183) determines that the position coordinate is the current time of the node. It is stored as a space coordinate (temporary), and thereafter, it is treated as an ordinary space-time coordinate until it is invalidated by another instruction input. Of the above processes, the emergency notification process (177) is unique to the C node, and the rescue support process (179) is unique to the S node, but the others are processes common to the C node and the S node.

FIG. 12 shows the outline of the operation of the acquisition function (32) operating in the C node. A request for this function via the client control function (31) is issued for the purpose of acquiring the current location information of the own node.
This request is issued periodically and at the instruction of the operator. Upon receiving the request, the position information acquisition (190) process acquires the position coordinates indicated by, for example, longitude and latitude from the positioning system interface (43) equipped in the own node, and the space-time coordinates considering the acquisition date and time. To the request source.

[0064]

[Example] As a preferred example of the present invention, the hyper tag was already shown. Although some examples have been mentioned throughout, other examples will be shown below. In the present invention, by storing the individual space-time coordinates for each game participant, it is possible to grasp the total amount of movement in the horizontal direction. Therefore, by preparing a means or process for totalizing the distance actually moved by the node operator and a means or process for displaying the total distance, the distance depending on the distance actually moved by the node operator It is possible to add a function such as a pedometer (registered trademark) by knowing the amount of exercise of an individual and dividing it by an appropriate stride. Therefore, it is possible to exercise while enjoying a game such as hyper tag playing according to the present invention and to confirm the amount of exercise. Furthermore, a means or process for calculating calories corresponding to the movement amount may be prepared and the calculation result or the like may be displayed.

When the node operator reaches a predetermined place or approaches a predetermined place, it is automatically or by an operator's instruction input,
It is also useful to provide a means or process for displaying information about the game, for example, information such as points, team formation, team or participant status or rules. This allows
You can keep playing the game without getting tired. Then, by storing in the storage means (40) detailed information in the game area that has been registered in advance or collected in a timely manner, the latest information and detailed information around the current location is acquired from the S node and the current location is acquired. By displaying it as an icon or character information related to, it is possible to obtain information on traffic conditions such as nearby facilities / stores, traffic volume, traffic restrictions, and the like. With this information, the node operator can obtain information on the next action, for example, selection of a moving route or a resting place.

Further, when the node has a built-in direction sensor or the like capable of knowing the direction of north, south, east, west, etc., the moving direction of the operator, the background map displayed on the display means (41), and the own node position. It is also possible to rotate and display the display content so that the moving direction of the display item matches the moving direction of the display item.

Further, the positioning system interface (4
Depending on the information that can be obtained from 3), it is possible to incorporate not only horizontal movement but also vertical movement, that is, three-dimensional transition into the game. As a result, for example, a game using a structure having a sufficient height difference such as a high-rise building can be provided.

[0068]

As described above, according to the system and method of the present invention, it is possible to obtain a mobile phone such as a PHS or CDMA system equipped with a positioning system interface such as GPS or a mobile terminal using a unique communication network. It is possible to provide a new game or service system of an unconventional system with a proper amount of exercise by using the position information and the background map. In addition, even if you get lost in the game and get lost or in an unexpected emergency, such as illness or kidnapping or other danger, it is possible to respond appropriately by immediate or forced notification of the rescue request signal. , It is also an effect that cannot be overlooked that the operational safety in this type of outdoor game can be secured.

[Brief description of drawings]

FIG. 1 is a diagram showing an example of an environment of a system of the present invention.

FIG. 2 is a diagram showing a configuration of an S program.

FIG. 3 is a diagram showing a configuration of a C program.

FIG. 4 is a flowchart showing an outline of operation of a server control function.

FIG. 5 is a flowchart showing an outline of operation of a client control function.

FIG. 6 is a flowchart showing an outline of operation of an information management function.

FIG. 7 is a flowchart showing an outline of operation of a background display function.

FIG. 8 is a flowchart showing an outline of operation of a position display function.

FIG. 9 is a flowchart showing an outline of the operation of a notification function.

FIG. 10 is a flowchart showing an outline of operation of a reference function.

FIG. 11 is a flowchart showing an outline of the operation of the arithmetic function according to claim 10;

FIG. 12 is a flowchart showing an outline of operation of an acquisition function.

[Explanation of symbols]

1 Positioning System Network 2 Mobile Phone 3 Mobile Terminal 4 PHS 5 Mobile Phone Relay Station 6 Mobile Terminal Relay Station 7 P
HS relay station 8 Wireless communication network 9 Wired communication network 10 Stationary computer 20 S program 21 Server control function 22
Information management function 23 Position display function 24 Background display function 25
Notification function 26 Reference function 27 Arithmetic function 30 C program 31 Client control function 32 Acquisition function 4
0 storage means 41 display means 42 communication means 43 positioning system interface 100 server initialization processing 108 server termination processing 110 client initialization processing 118 client termination processing 121 information initialization processing 123 information addition processing
125 information deletion processing 127 information change processing 129 information search processing 1
31 Background Diagram Reference Request 133 Background Diagram Display 144 Previous Display Information Element
145 Latest information search 146 Position display 151 S node connection 152
Space-time coordinate notification 153 S node disconnection 155 Space-time coordinate registration
157 C-node connection 158 C-node connection disconnection 162 Background map search 1
63 Background coordinate notification 164 Background drawing acquisition 167 Space-time coordinate collection 16
8 Space-time coordinate acquisition 171 Distance calculation processing 173 Situation identification processing 1
75 Situation response processing 177 Emergency notification processing 179 Rescue support processing 1
81 Position estimation processing 183 Position identification processing 190 Position information acquisition

Front page continuation (51) Int.Cl. ⁷ identification code FI theme code (reference) G09B 29/10 G09B 29/10 A 5K067 H04Q 7/20 H04Q 7/04 Z 7/34 H04B 7/26 106A (72) Inventor Yoshinobu Makino 3-5-1 Kofudai, Fujishiro-cho, Kitasoma-gun, Ibaraki F-term (reference) 2C001 AA00 AA15 AA17 BA06 CA01 CB01 CB08 CC03 2C032 HB22 HB25 HC11 HC23 HC27 HC38 HD03 HD12 2F029 AC16 AC09 AC07 AB07 AB07 AB07 AB07 AB12 5H180 AA21 BB05 CC12 FF05 FF22 FF25 FF33 5J062 AA03 AA07 AA08 BB05 CC07 FF01 5K067 BB04 BB21 BB36 DD51 EE02 FF01 FF31 JJ52 JJ56

Claims (18)

[Claims] 1. A plurality of "terminals capable of acquiring own current location information (hereinafter referred to as" nodes ")" are connected by a communication network, and the current "node current location information and current time (hereinafter referred to as" space-time coordinates "). ")" To other nodes, means for referencing other space-time coordinates by the node, means for estimating other space-time coordinates by the node, means for displaying a background map, and other space-time for the node. A system for guiding an operator of a node to the present location of another node, which has means for selecting and displaying coordinates. 2. A system for guiding an operator of a node to a current position of another node according to claim 1, wherein the background map is a map, a schematic diagram, a sketch or a pseudo landscape. 3. The node according to claim 1, wherein the node is a mobile phone or P
A system for guiding an operator of a node to the current location of another node, which is a substantial computer capable of executing the present system such as a mobile communication device such as an HS, a computer equipped with communication means, or a portable terminal equipped with communication means. . 4. The method according to claim 1, wherein the means for selecting and displaying the other space-time coordinates does not display some or all of the other space-time coordinates according to the operation history of the node.
A system that guides a node operator to the current location of another node. 5. The device according to claim 1, wherein the means for notifying the other node of its own space-time coordinates automatically operates when the node operates the means for referring to the other space-time coordinates. , A system that guides a node operator to the current location of another node. 6. The means for displaying the background map and the means for selecting and displaying the other space-time coordinates according to claim 1,
Furthermore, a system for guiding an operator of a node to the current location of another node, which is a means capable of changing a display magnification and a display range. 7. The operator of a node according to claim 1, characterized in that the operator is means for specifying other estimated space-time coordinates instead of or further for estimating the other space-time coordinates. System that guides the current location of other nodes. 8. The means for estimating the other space-time coordinates in claim 1 and / or the others in claim 7, wherein the space-time coordinates to be selected and displayed are the means for estimating the other space-time coordinates. A system for guiding an operator of a node to the current position of another node, including the space-time coordinates obtained by the means for specifying the estimated space-time coordinates of. 9. The system according to claim 1, wherein the communication network is a wired or wireless communication network or a mixed communication network thereof, which guides an operator of a node to the present location of another node. 10. The node according to claim 1, further comprising emergency notification means for issuing a rescue request signal to another node, and rescue support means corresponding to the rescue request signal. A system that guides a node operator to the current location of another node. 11. A method in which a plurality of nodes are connected by a communication network, the step of notifying another node of its own space-time coordinates, the step of referring to another space-time coordinate by the node, and the step of estimating another space-time coordinate by the node. And a step of displaying a background diagram, and a step of selecting and displaying another space-time coordinate of the node, the method of guiding the operator of the node to the current location of another node using a computer. . 12. A method for guiding an operator of a node to a current location of another node by using a computer according to claim 11, wherein the background map is a map, a schematic diagram, a sketch or a pseudo landscape. 13. The node according to claim 11, wherein the node is a mobile communication device such as a mobile phone or a PHS, a computer equipped with communication means, or a portable terminal equipped with communication means, which is a substantial computer capable of executing the present system. A method of using a computer to guide the node operator to the current location of another node. 14. The computer according to claim 11, wherein the step of selecting and displaying the other space-time coordinates does not display some or all of the other space-time coordinates according to the operation history of the node. A method of guiding the node operator to the current location of another node using. 15. The method according to claim 11, wherein the step of notifying another node of its own space-time coordinates is automatically executed when the node executes the step of referring to the other space-time coordinates. , A method of guiding a node operator to the current location of another node using a computer. 16. The computer according to claim 11, wherein the step is a step in which the operator can specify other estimated space-time coordinates instead of or in addition to the step of estimating the other space-time coordinates. A method of guiding the operator of a node to the current location of another node. 17. The method according to claim 11 or 14, wherein the space-time coordinates to be selected and displayed are the step of estimating the other space-time coordinates in claim 11, and / or the other estimated space-time coordinates in claim 16. The method of guiding the operator of a node to the current location of another node by using a computer, characterized in that it also includes the space-time coordinates obtained in the step of specifying. 18. The node according to claim 11, further comprising an emergency notification step of issuing a rescue request signal to another node and a rescue support step corresponding to the rescue request signal. A method of guiding a node operator to the current location of another node using a computer.