JPH10170288A - Boarding information providing system - Google Patents

Abstract

PROBLEM TO BE SOLVED: To permit a passenger to arrive at the destination station at the desired time by showing an optimum get-on station for changing from a car to the railroad. SOLUTION: From a car A, the current place and target station and also the desired arrive time are transmitted to the center. The center makes a search for a train which can arrive at the Z-station as destination at the desired time and selects candidate stations B, C, D. Upon checking if any parking area is available around each station, the center narrows the candidates and calculates if the person can be in time for the train scheduled time at each station on the basis of the requisite time data from the current place of the car A to each station. Finally the optimum station to meet the conditions is decided, and answer is sent to the car.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a boarding information providing system, and more particularly to a system for providing a user traveling by vehicle or the like with an optimal boarding station for arriving at a destination station.

[0002]

2. Description of the Related Art Conventionally, there has been proposed a system for recommending the use of a railroad for a vehicle occupant to arrive at a destination.

For example, Japanese Unexamined Patent Publication No. 7-55484 discloses a route to a destination, and if a vehicle cannot reach the destination by a desired arrival time, a station (eg, a parking lot around the current location) is provided. A technique of presenting the nearest station to a user is disclosed. Specifically, it is first determined whether there is a station around the destination, and if there is a station around the destination, the time required to travel from the nearest station to the station around the destination or the transfer station is given to the user. It is presented.

[0004]

This prior art proposes the use of a railway as an alternative means of transportation when a vehicle cannot be reached, and the probability of reaching a destination within a desired time increases. Since the boarding station presented to the user is fixed at the station where the nearest parking lot is located, there is a problem that using the station does not necessarily lead to arrival at the destination within the desired time. For example, suppose that the station around the destination is Z station, the nearest station (with a parking lot) is A station, and the next station is B station. There is a limited express that can arrive at Z station within a desired time on the route, and it is assumed that even if the limited stop is not station A but station B, it is necessary to board at station A which is the nearest station in the prior art. Therefore, there is a problem that this express cannot be used.

The present invention has been made in view of the above-mentioned problems of the related art, and has as its object to provide an optimal boarding station that can more reliably arrive at a destination station (ground) within a desired time. It is to provide a system that can do it.

[0006]

According to a first aspect of the present invention, there is provided a system for providing a train ride station to a traveler based on the destination station and the desired arrival time of the traveler. Input means for inputting the destination station and desired arrival time, and search means for searching for a train that can arrive at the destination station by the desired arrival time based on railway schedule information and searching for a station that can take the train And output means for providing the station with the station obtained by the search.

[0007] In a second aspect based on the first aspect, the input means further inputs a current location of the mover, and the search means further transmits to the train based on a required time from the current location. It is characterized by searching for available stations.

[0008] In a third aspect based on the first and second aspects, the search means further searches for a station on which the train can be boarded based on the presence or absence of a parking lot.

In a fourth aspect based on the first to third aspects, the search means further searches for a departure time at the station where the train can be boarded, and the output means further comprises the departure time. Is provided to the mover.

According to a fifth aspect of the present invention, in the first to fourth aspects, the input means, the search means, and the output means are provided in a center which can be connected to the mobile phone by telephone. .

In a sixth aspect based on the first to fifth aspects, the search means searches for a station which can arrive at the destination station in the shortest time when there is no available station. It is characterized by the following.

[0012]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, embodiments of the present invention will be described with reference to the drawings, taking as an example a case where information is provided to a vehicle occupant.

FIG. 1 is a block diagram showing the configuration of the present system on the vehicle side. Information such as the destination station and the desired arrival time is input from the input device 10 such as a microphone and supplied to the electronic control unit ECU14. The current position data of the vehicle detected by the GPS 12 is also supplied to the ECU 14. EC
U14 is composed of a CPU, ROM, RAM and the like, and transmits the data of the destination station, the desired arrival time, and the current location together with the ID of the own vehicle to the center side via the wireless device 16. The radio 16 is preferably, for example, a car phone. On the other hand, data transmitted from a center, which will be described later, is received by the wireless device 16 and supplied to the ECU 14. The ECU 14 outputs the received data to an output device 18 such as a display or a speaker and presents the data to a user (vehicle moving person). In addition, an input device such as a touch switch can be used instead of the microphone,
In addition, the microphone, the ECU 14, the display, and the like can be used also as a vehicle-mounted navigation device.

FIG. 2 is a block diagram showing the configuration of the center of the present system. On the center side, the telephone company 100 and the calculation center 20 function as input means and output means.
0, a railway manager 300 that stores railway schedules, a road administrator 400 that stores road data, and a parking manager 500 that stores the status of parking lots around the station are connected via a network, and transmitted from the vehicle. The received data is received by the telephone company 100 and supplied to the calculation center 200. In the calculation center 200, the railway manager 300 and the road manager 4
00, the parking lot manager 500 is sequentially accessed to search for a train that can arrive at the destination station by the desired arrival time, the boarding station thereof, and the departure time, and supply them to the telephone company 100. The telephone company 100 transmits these data to the vehicle that has transmitted the data. The telephone company 100 and the calculation center 200 may be connected by a dedicated line, or another service company may be connected to a network.

FIG. 3 shows a processing flowchart on the vehicle side and the center side. On the vehicle side, the current location detected by the GPS 12 and data on the destination station, the desired arrival time, and the necessity of the parking lot (P) are reported to the center side by the user (S101). The notification of the necessity of the parking lot is made in consideration of the case where it is not necessary to secure the parking lot because the user is using a taxi. When the calculation center 200 obtains a request from a user (driver) (S201), it first checks whether train information is necessary (S202). If train information is required, a boarding (candidate) station and a route (railroad line) are selected from the current location (S203). The selection is made by selecting an appropriate route from a list of routes predetermined for the current location and the destination station, and the boarding (candidate) station does not necessarily have to be the nearest station around the current location. Any number of stations that can be reached can be selected. Then, the selected route data is transmitted to the railway manager 300 to inquire whether there is a corresponding train.

In the railway manager 300, the calculation center 200
When the data of the boarding (candidate) station, getting off station, and desired arrival time are obtained from (S301), the train that can arrive at the getting off station at the desired arrival time based on the railway schedule, the boarding station and the departure time at that station are searched. , And the vacancy status and the delay information (if any) are reported to the calculation center 200 (S302). If there are a plurality of trains that can arrive at the getting off station at the desired arrival time, for example, the train that arrives at the getting off station latest is selected.

When the calculation center 200 obtains the information (S204), it checks whether information on the parking lot (P) is required (S205). If the user needs a parking lot, the calculation center 200 selects the parking lot manager 500 around the boarding station (S206) and inquires of the parking lot manager 500 about the availability of the parking lot. When there are a plurality of boarding stations, the parking manager 500 is selected for each boarding station.

The parking lot manager 500 checks the congestion status of the parking lot around the boarding station, and reports the location of the parking lot, the time required to walk to the station (on foot) and the parking fee to the calculation center 200 if there is a vacancy. (S401). Calculation Center 2
At 00, the boarding station is further narrowed down based on the boarding station and parking lot information (S207). For example, P station, Q station can be used to get on the train that can arrive at the getting off station by the desired arrival time.
There are a station and an R station, and the parking lot manager 50 around each station
As a result of making an inquiry to 0, if the notification that there is no parking at R station is received, the calculation center 200 excludes R station from the boarding station. After narrowing down the boarding stations based on the presence or absence of a parking lot, the calculation center 200 further selects a route between the remaining boarding stations (hereinafter, referred to as use stations) and the current location, and inquires of the road manager 300 about the road conditions (S208). .
For the selection of a route, a route search method (for example, Dijkstra method) known by a navigation device can be used.

When the road manager 300 obtains routes from the current location of the vehicle to the use station (S501), it calculates the required time of each route and notifies the calculation center 200 (S5).
02). The calculation of the required time is calculated in consideration of the traffic conditions that change from moment to moment. For example, the required time to arrive at the P station is 30 minutes, and the required time to the Q station is 10 minutes. Note that the required time from the current location to the selected parking lot may be calculated instead of the required time from the current location of the vehicle to the use station.

When the calculation center 200 obtains the required time to the use station (or to the parking lot) (S20)
9) Based on the required time, the time to the use station (or parking lot) is calculated, and the station that can be used by the user is finally determined and reported to the vehicle (S210). That is,
The departure time at each station of the selected train is compared with the estimated time of arrival at the station (current time + required time), and the station that is in time for the departure time is determined as the final station to be used.

In the vehicle, the use station, the departure time, the parking lot position, and the fee are obtained from the calculation center 200 via a telephone line (S102), and output to the output device 18 such as a display and presented to the user. Therefore, the user only needs to transmit the destination station and the desired arrival time to the center side, and the station to be used to arrive at the destination station at the desired arrival time, the parking lot to be used, and the train to be used are required. You can know the departure time.

The processing described above will be described more specifically with reference to the schematic diagram of FIG. It is assumed that a request to arrive from the vehicle A to the destination station Z station by 12:00 at time 8:30 is transmitted. At the center, based on the relationship between the current location of the vehicle A and the destination station, the route is the Y line, the stations B, C,
Select station D and search for a train that can arrive at station Z by 12:00. As a result of the search, the corresponding train T exists on the Y line, and the stations B, C, and D are connected at 9:00, 9:30, and 1
Depart at 0:00. On the center side, B
Check whether there is a vacancy in the parking lot around the station, C station and D station. Then, if the parking lot around the station D is full and there is no space, the station D is deleted and the stations B and C are left as the use stations. On the center side, furthermore, from the current position of vehicle A to B
Calculate the time required to station C, and the time required for each is 4
It is 0 minutes and 50 minutes. Therefore, if it is assumed that the trains will arrive at the station B at 9:10 and the station C at 9:20, the train T cannot be used when the station B is used. The station is deleted from the use station, and the station C is determined as the final use station. Then, the vehicle is notified of the location and price of the use station C and the surrounding parking lot, and the departure time of the train T at 9:30.

As described above, in this embodiment, a train that can arrive at a desired time at a desired station is searched based on a railway schedule, and a boarding station that can surely get on the train is presented to the user. You can surely arrive at the desired time. In particular, in the present embodiment, since the final boarding station is determined in consideration of not only the presence or absence of a parking lot around the station but also the required time from the current location of the vehicle to the boarding station, the train may be stopped due to traffic congestion or the like. The risk of being missed can be reduced. In addition, since the departure time of the train at the boarding station is also presented at the same time, the user does not need to worry about the departure time.

In the above example, if the time required to reach the stations B and C is 20 minutes, and both stations can take the train T, the waiting time at the boarding station is minimized. In order to do so, it is also possible to determine the station B as the ultimate use station.

When the user inputs not only the desired arrival time at the destination station but also the desired return time, the center can further search for a train to be boarded from the destination station when returning home and transmit it to the vehicle. . Specifically, the road condition around the use station at the desired return time is obtained from the road manager 400, and the required time between the use station and the house is calculated from the road condition. Next, in consideration of the required time, it is determined when to depart from the use station to return home at the desired return time. Then, the train arriving before the departure time and the departure time of the train at the destination station may be retrieved from the railway schedule and presented to the vehicle. The same applies when using a taxi to the boarding station.If data such as the business hours of the destination at the destination station exists on the network, the center will take this business hours into account and take into account the business hours. It is also possible to determine the departure time at, so it is also possible to present the expected return time to the vehicle.

Furthermore, in this embodiment, if there is no station that can get on the train that can arrive at the destination station at the desired arrival time, the center side will determine the next best station that can arrive at the destination station in the shortest time. Is preferably determined and presented to the vehicle. Specifically, in FIG. 4, when all of the candidate stations B, C, and D are the passing stations of the train T, the stations B and C are the stopping stations, but the current location of the vehicle A is shown in FIG. If it is not possible to get on the train T in consideration of the time required from the station to each station, it is not possible to arrive at the destination station Z at the desired arrival time, but according to the railway schedule of the railway manager 300, There is S, this train S
If it is possible to arrive at the Z station earlier than by another method (for example, when traveling to the Z station by the vehicle A) if the user gets on the B station, the calculation center 200 transmits the vehicle A to the B station.
What is necessary is just to show the station and the train S, and the departure time. At this time, since the train S can be boarded at the stations B and C, if it is possible to arrive at the destination station at the same time, the departure times at the stations B and C and the respective stations are presented to the vehicle side. ,
It is also preferable that the user can make a selection.

[0027]

As described above, according to the present invention,
Since it is possible to provide an optimal boarding station when using a railway, it is possible to more reliably arrive at a desired station (ground) at a desired time.

[Brief description of the drawings]

FIG. 1 is a configuration block diagram of a vehicle side.

FIG. 2 is a configuration block diagram of a center side.

FIG. 3 is a processing flowchart on the vehicle side and the center side.

FIG. 4 is an explanatory diagram showing a relationship between a vehicle and a destination station.

[Explanation of symbols]

10 input device, 12 GPS, 14 ECU (electronic control device), 16 radio, 18 output device, 100 telephone company, 200 calculation center, 300 railway manager, 4
00 Road manager, 500 Parking manager.

Claims (6)

[Claims] 1. A system for providing a train boarding station to a traveler based on the destination station and the desired arrival time of the traveler, comprising: input means for inputting the destination station and the desired arrival time; Search means for searching for a train that can arrive at the destination station by the desired arrival time based on the desired arrival time, and an output means for providing the station obtained by the search to the mobile station; A ride information providing system, comprising: 2. The method according to claim 1, wherein the input unit further inputs a current position of the mover, and the search unit further searches for a station that can take the train based on a required time from the current position. The boarding information providing system according to claim 1. 3. The boarding information providing system according to claim 1, wherein said searching means further searches for a station on which said train can be boarded based on the presence or absence of a parking lot. 4. The system according to claim 1, wherein said search means further searches for a departure time of said train at said boardable station, and said output means further provides said departure time to said mobile. The ride information providing system according to any one of 2, 3 and 4. 5. The apparatus according to claim 1, wherein the input means, the search means, and the output means are provided in a center which can be connected to the mobile phone by telephone. Ride information providing system. 6. The system according to claim 1, wherein said search means searches for a station which can arrive at said destination station in the shortest time when said available station does not exist.
5. The boarding information providing system according to any one of 5.