JP2007216696A - Railroad transfer information retrieval system - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To search a route to the destination at a scheduled arrival time at the closest station in consideration of arrival time to the closest station from the present time and the present position. <P>SOLUTION: A railroad transfer information retrieval system performs the destination search related to traffic information by the requirement from a cellular phone. The cellular phone is equipped with a destination acquisition means for holding destination information to be input, a GPS receiving means for receiving the GPS information, a present position acquisition means for acquiring the present position based on the GPS information received, a closest station search means for searching the closest station by using the present position acquired, a present time acquisition means for acquiring the present time, a closest station arrival time calculation means for calculating the scheduled arrival time arriving at the closest station from the present position acquired, the closest station searched, and the present time acquired, and a destination search means which accesses to a traffic information management server through the network, and searches the route to the destination input at the scheduled arrival time at the closest station calculated. <P>COPYRIGHT: (C)2007,JPO&INPIT

Description

  The present invention relates to a railway transfer information search system, and in particular, searches for a route to a destination at a scheduled arrival time at the nearest station in consideration of arrival time to the nearest station from information on the current time and current position. The present invention relates to a railway transfer information retrieval system.

  Conventionally, in a railway transfer information search system in which a traffic information management server and a mobile phone are connected via a network, as a method for searching for a destination related to traffic information in response to a request from a mobile phone, When necessary, a method of inputting a departure time or arrival time from a screen is known.

However, in the above-described method, if the current position is far from the nearest station and the time to reach the nearest station is not known, it is necessary to search with an uncertain departure time. Therefore, an accurate search result cannot be obtained, and there is a problem that, for example, when the user has missed the searched train, re-input must be performed.
The present invention has been made to solve the problems of the prior art, and an object of the present invention is to consider the arrival time from the current time and current position information to the nearest station in the railway transfer information retrieval system. It is another object of the present invention to provide a technique capable of searching for a route to a destination at a scheduled arrival time at the nearest station.
The above and other objects and novel features of the present invention will become apparent from the description of this specification and the accompanying drawings.

Of the inventions disclosed in this application, the outline of typical ones will be briefly described as follows.
In order to achieve the above object, the present invention is a railway transfer information search system in which a traffic information management server and a mobile phone are connected via a network and a destination search for traffic information is performed by a request from the mobile phone. The mobile phone includes destination acquisition means for holding input destination information, GPS reception means for receiving GPS information, and current position acquisition means for acquiring a current position based on the received GPS information. The nearest station search means for searching for the nearest station using the acquired current position, the current time acquisition means for acquiring the current time, the acquired current position, the searched nearest station, and the acquired The nearest station arrival time calculation means for calculating the estimated arrival time to arrive at the nearest station from the current time, and the traffic information management server is accessed via the network. Scheduled arrival time to the calculated nearest, characterized in that it comprises a destination search means for searching a route to the input destination.

The effects obtained by the representative ones of the inventions disclosed in the present application will be briefly described as follows.
According to the railway transfer information search system of the present invention, it is possible to search for a route to a destination at a planned arrival time to the nearest station in consideration of the arrival time to the nearest station from the current time and current position information. It becomes possible.

Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings.
In all the drawings for explaining the embodiments, parts having the same functions are given the same reference numerals, and repeated explanation thereof is omitted.
FIG. 1 is a block diagram showing a schematic configuration of a railway transfer information retrieval system according to an embodiment of the present invention. In the figure, 100 is a traffic information management server, 101 is a mobile phone, and 102 is GPS information.
In the railway transfer information retrieval system of this embodiment, the traffic information management server 100 and the mobile phone 101 are connected via a network, and a destination search for traffic information is performed according to a request from the mobile phone 101.
FIG. 2 is a functional block diagram showing a schematic configuration of the mobile phone 101 shown in FIG.
In FIG. 2, 200 is a mobile phone, 201 is receiving means, 202 is current position acquisition means, 203 is nearest station search means, 204 is current time acquisition means, 205 is nearest station arrival time calculation means, and 206 is a destination. An acquisition unit, 207 is a destination search unit, 208 is a communication unit with the traffic information management server 100, 209 is a display processing unit, and 210 is a mobile phone display unit.

The receiving means 201 shown in FIG. 2 receives GPS (Global Positioning Systems) information. The current position acquisition unit 202 acquires current position information based on the GPS information received by the reception unit 201.
The nearest station search means 203 searches for the nearest station using the current position information acquired by the current position acquisition means 202, and the current time acquisition means 204 acquires the current time information.
The nearest station arrival time calculation means 205 is based on the current position information acquired by the current position acquisition means 202, the nearest station information searched by the nearest station search means 203, and the current time information acquired by the current time acquisition means 204. Calculate the estimated time of arrival at the nearest station.
The destination acquisition unit 206 stores destination information input by the mobile phone.
The destination search means 207 accesses the traffic information management server 100 using the planned arrival time information to the nearest station calculated by the nearest station arrival time calculation means 205 and the input destination information, Search for route information.
The search result of the route to the destination is displayed on the mobile phone display unit 210 by the display processing unit 209.

3 and 4 are flowcharts showing the processing procedure of the railway transfer information search system of the present embodiment.
Hereinafter, with reference to FIGS. 1 to 3, a method for searching for a train at the nearest arrival time and updating the information in consideration of the current time and the arrival time from the current position information to the station will be described. .
First, the user inputs a destination to the mobile phone 101 (step 300). The input destination is stored in the destination acquisition means 206.
The destination is searched by the traffic information management server 100 (step 301), and it is checked whether or not the destination exists (step 302). If the destination does not exist, the destination is input again.
If the destination exists, GPS information 102 is acquired (step 303). The GPS information 102 is repeated until it is acquired (step 304), and the received GPS information is stored in the receiving means 201.
Next, the current position acquisition unit 202 acquires the current position based on the GPS information 102 received by the reception unit 201 (steps 305 and 306). The acquired current position is stored in the current position acquisition unit 202.

Next, the nearest station search means 203 searches for the nearest station using the current position acquired by the current position acquisition means 202 (steps 307 and 308). The searched nearest station information is stored in the nearest station searching means 203.
Here, the nearest station search means 203 acquires the map data in the traffic information management server 100, and searches for the shortest route to the nearest station using the current position and the result of referring to the map data.
Next, the current time acquisition unit 204 acquires the current time from the mobile phone 101 (steps 309 and 310), and stores the acquired current time in the current time acquisition unit 204.
Next, the nearest station arrival time calculation means 205 is based on the current position acquired by the current position acquisition means 202, the nearest station searched by the nearest station search means 203, and the current time acquired by the current time acquisition means 204. The time to arrive at the nearest station is calculated (step 311).
Here, the nearest station arrival time calculating means 205 calculates the estimated arrival time at the nearest station by the following equation (1), and the calculated estimated arrival time at the nearest station is calculated as the nearest station arrival time calculating means. 205 is stored.
[Equation 1]
Current time + (Distance between nearest station and current position) / Walking speed (1)
Here, (the distance between the nearest station and the current position), the nearest station search means 203 searched the shortest route to the nearest station using the current position and the result of referring to the map data. Is the distance.

Next, the destination search means 207 accesses the traffic information management server 100 using the estimated arrival time at the nearest station calculated by the nearest station arrival time calculation means 205 and the input destination, and the destination A route to the ground is searched (step 312).
The display processing unit 209 sets the search result of the route to the destination to the mobile phone display unit 210 (step 313).
Next, it is determined whether or not the user ends the process (step 314), and the above-described processes from step 305 to step 314 are repeatedly executed by timer monitoring until the user ends the process.
As described above, according to this embodiment, it is possible to search for trains based on the current arrival time and the arrival time from the current position to the nearest station, and the estimated arrival time at the nearest station. .
As mentioned above, the invention made by the present inventor has been specifically described based on the above embodiments. However, the present invention is not limited to the above embodiments, and various modifications can be made without departing from the scope of the invention. Of course.

It is a block diagram which shows schematic structure of the railway transfer information search system of the Example of this invention. It is a functional block diagram which shows schematic structure of the mobile telephone shown in FIG. It is a flowchart which shows the process sequence of the railway transfer information search system of the Example of this invention. It is a flowchart which shows the process sequence of the railway transfer information search system of the Example of this invention.

Explanation of symbols

DESCRIPTION OF SYMBOLS 100 Traffic information management server 101,200 Mobile phone 102 GPS information 201 Receiving means 202 Current position acquisition means 203 Nearest station search means 204 Current time acquisition means 205 Nearest station arrival time calculation means 206 Destination acquisition means 207 Destination search means 208 Communication means with traffic information management server 209 Display processing means 210 Mobile phone display unit

Claims (1)

A railway transfer information search system in which a traffic information management server and a mobile phone are connected via a network, and a destination search for traffic information is performed by a request from the mobile phone,
The mobile phone includes destination acquisition means for holding input destination information,
GPS receiving means for receiving GPS information;
Current position acquisition means for acquiring a current position based on the received GPS information;
Nearest station search means for searching for the nearest station using the acquired current position;
Current time acquisition means for acquiring the current time;
Nearest station arrival time calculating means for calculating the acquired current position, the searched nearest station, and the estimated arrival time to arrive at the nearest station from the acquired current time;
Destination search means for accessing the traffic information management server via the network and searching for the route to the input destination at the calculated estimated arrival time at the nearest station. Railway transfer information search system.

Images