JP2861974B2 - Railway transfer navigation system - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

[0001] The present invention relates to a railway transfer navigation system.

[0002]

2. Description of the Related Art A conventional railway transfer navigation system is configured to obtain a shortest route from a departure station to a destination station and a minimum fare route. Such a system is described in, for example, JP-A-60-8974 and JP-A-4-171570.

[0003]

The first problem is that, in the conventional system, there is a case where the difference between the required time on the shortest route obtained and the actually required time is large, and the reliability of the calculation result is low. There is a problem that it is low.

[0004] The reason is that, in the conventional system, the shortest route is obtained based only on the distance between stations and the actual running time of the railway, and the time required at each station, especially the time required for transfer at the transfer station, is taken into consideration. It is not done.

[0005] The second problem is that the actual required time may be shorter when another route is used than when the shortest route obtained by the conventional system is used, and the reliability is not high. .

The reason is the same as the reason for the first problem.

SUMMARY OF THE INVENTION It is an object of the present invention to provide a railway transfer navigation system capable of improving the reliability of calculation results by enabling efficient transfer and obtaining a more reliable shortest time route. I do.

[0008]

According to the present invention, an input means, a route information table in which information on a railway route connecting a plurality of stations is registered, and a shortest route from a departure station to a destination station input from the input means. In a railway transfer navigation system, comprising a route candidate searching means for searching for a route that can be reached in time by referring to the route information table, for each of the plurality of stations, a vehicle number that stops at a position closest to a ticket gate for each line. Registered, and, for a station that can be a transfer station of the plurality of stations, registered a vehicle number that stops at the most convenient position for transfer, a station premises information table and a search for the station premises information table, A boarding vehicle position determining unit that determines an optimal boarding vehicle from information corresponding to a station included in the route searched by the route candidate searching unit. Navigation system can be obtained.

According to the present invention, a place name, a destination table in which a station name and a ticket gate name corresponding to the place name are registered,
A train transfer navigation system comprising: a station name determining unit that searches the destination table and determines a station name and a ticket gate name respectively corresponding to the departure point and the destination input from the input unit. can get.

Further, according to the present invention, the station yard information table includes a passage distance from a ticket gate to a nearest boarding position,
A railway transfer navigation system characterized in that information indicating the number of steps and the presence or absence of an escalator is registered.

[0011]

When the departure place and the destination are input from the input / output device, the destination station determination unit refers to the destination information table and determines the nearest station of the departure place and the destination and an appropriate ticket gate at each station. And decide.

The route candidate searching unit refers to the route information table and extracts several routes connecting the nearest station of the departure place and the nearest station of the destination determined by the destination determining unit.

The on-board vehicle position determining means refers to the station premises information table for each route, finds an optimal vehicle for each railway to be used, and determines the shortest route.

The input / output device displays and prints the determined route and predetermined information at each station.

[0015]

Next, embodiments of the present invention will be described in detail with reference to the drawings.

FIG. 1 shows an embodiment of a railway transfer navigation system according to the present invention. The system shown in FIG. 1 includes an input / output device 11, a CPU 12, and a storage device 13. Then, the CPU 12 controls the parameter input unit 12
1, a destination station determination unit 122, a route candidate search unit 123, a boarding vehicle position determination unit 124, and a calculation result display unit 125. The storage device 13 has a destination information table 131, a route information table 132, and a station premises information table 133.

Next, the operation of the system shown in FIG. 1 will be described with reference to FIG. First, in step S21, the input / output device 1
When a departure place name and a destination name are input from 1, the input departure place name and destination name are provided to the destination station determination unit 122 via the parameter input unit 121.

The destination station determining unit 122 determines in step S22
Then, the destination information table 131 is searched. In the destination information table 131, at least a place name, a station name and a ticket gate name (number) corresponding to the place name are registered. Location and destination) and the name of the ticket gate (number). At this time, if each of the departure place and the destination is not registered in the destination information table 131, the destination station determination unit 122 determines in step S
At 23, it is determined that the search is not possible. In addition, the nearest station for each of the departure place and the destination is the destination information table 1
Also, it is determined that the search is not possible even when a plurality of items are registered in 31.

The destination station determining unit 122 determines in step S23
In the case where it is determined that search is impossible, one or both of the departure place name and the destination name are stored in the destination information table 13.
1 is not registered in the input / output device 11
And prompts for the station name instead of the departure or destination name that could not be searched. If a plurality of departure place names and destination names are registered in the destination information table 131, the fact is displayed on the input / output device 11 and either one of the registered plural stations is selected or Prompts the user to determine if a route search should be performed for that station. If the station name is input in step S24 or the determination result is input, the information searched in step S22 is included together with the information, if any, and if not, only the newly input station name is used as the route candidate. The search unit 123 is notified.

In step S25, the route candidate search section 123 determines a route candidate by searching the route information table 132 using a method adopted in a conventional railway transfer navigation system. That is, the route information table 132 includes a plurality of stations (for example, all stations in Japan).
And information about the railway connecting them are registered, and the route candidate search unit 123, based on these information,
Search and determine the route that can be reached from the departure station to the destination station in the shortest time or the lowest fare. Then, the determined route candidate is notified to the boarding vehicle position determining unit 124.

The on-board vehicle position determining unit 124 determines in step S
At 26, the route candidate search unit 123 refers to the station premises information table 133 to search for the premises information of the passing station for each of the route candidates determined. Station premises information table 1
33, for each station, the number of the vehicle that stops at the nearest position (optimum vehicle), the path distance from the optimal vehicle to the ticket gate, the number of steps, and the presence or absence of an escalator for each ticket gate;
At the transfer station, the passage distance between the optimal vehicles on each railway,
The number of steps and the presence / absence of an escalator are registered. Then, the boarding vehicle position determination unit 124 determines in step S
At 27, based on the retrieved information, a boarding position at which the transfer can be made most efficiently (for example, a position closest to the stairs at the getting off station) is obtained. The obtained result is displayed on the calculation result display means 125.
Is displayed on the input / output device 11 and printed out as necessary. As a result, the optimal boarding position is clarified, and the time required for the transfer can be reduced since the vehicle can be moved to the optimal vehicle between the time of waiting for the train or the like before boarding and the time from arriving to arriving at the disembarkation station. It is also possible to shorten the time required to get to a ticket gate near the destination at the station closest to the destination. Therefore, it is possible to arrive at the destination in real time which is not much different from the time of the searched shortest route as in the conventional case. That is, the required time obtained by the calculation is highly reliable.

In addition, the input / output device includes a passage distance (from the ticket gate to the nearest boarding position) at each station, the number of steps,
By displaying and printing information such as the presence / absence of an escalator, it is also possible to select a route with the easiest transfer (for example, with few stairs) from some of the shortest route candidates.

Further, in addition to the information on the walking section distance (passage distance), the number of steps, the presence or absence of an escalator, and the like, information such as a walking speed and an elevator operating speed is registered in the station premises information table 133. Alternatively, by inputting from the input / output device 11, the required time at each station can be determined, and a more accurate shortest time route can be determined.

In addition, instead of the optimum boarding position, the shortest time route can be searched by using a silver seat position or a wheelchair riding position.

Furthermore, the average waiting time at each station can be taken into consideration.

[0026]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of the present invention will be described with reference to FIGS. 3 to 5 in addition to FIG.

Here, an example of searching for the shortest route from the place where this system is installed to Building D will be described.

First, a destination is input from the input device 11. Note that the departure place is a place where this system is installed, so that it can be omitted.

The parameter input unit 121 inputs the
The destination “D building” is given to the destination station determining unit 122.

When only the destination place name is given, the destination determination unit 121 automatically determines "A station, ticket gate 1" as the departure station. Then, the input destination "D Building"
From the destination information table 131. As shown in FIG. 4, in the destination information table 131, the station name and the ticket gate name are registered for the building D, so the destination station “C station, ticket gate 1” is determined as the nearest station to the destination. The information on the determined departure station and destination station is stored in the route candidate search unit 12.
3 is notified.

The route candidate search unit 123 searches for the shortest route connecting station A and station C with reference to the route information table 132 using a conventional method. As a result, “A
Station-E line-F line-C station "is searched as the shortest route.
Then, the route candidate search unit 123 determines that the route “A station, ticket gate 1
-E line-F line-C station, ticket gate 1 "
Notify 24.

The onboard vehicle position determining unit 124 refers to the station premises information table 133 as shown in FIG. 5 and arrives at the station C from the station B by using the F line (in the case of an upbound vehicle).
In addition, the vehicle that stops at the position closest to the ticket gate 1 of the station C (near the stairs closest to the ticket gate 1), that is, the optimal vehicle is “first car”
Search for As a result, the boarding vehicle position determining unit 124 determines the optimal boarding position on the F line at the station B as “first car”.

Next, the boarding vehicle position determination unit 124 obtains a transfer route from the E line to the F line at the B station “E line—gate ticket 1—gate ticket 2—F line” from the station premises information table 133.
Also, in the case of a transfer from the E line to the F line (or in the case of going from the E line to the ticket gate 1), and when arriving at the B station from the A station using the E line (in the case of an upbound vehicle) Obtain the optimal vehicle "6 eyes". As a result, the boarding vehicle position determination unit 12
4 is "6th car" for the optimal boarding position for E line at station A
Is determined.

As a final result, the on-board vehicle position determining unit 1
24 is "A station, ticket gate 1-E line, sixth car-B station, ticket gate 1
-A route is obtained from B station, ticket gate 2-F line, 1st station-C station, ticket gate 1 ". The result and further information such as the length of the passage, the number of steps and the presence or absence of an escalator are calculated. The result is displayed on the result display means 125 and displayed on the input / output device 11.

[0035]

The first effect is that the difference between the time required for the shortest route by calculation and the time actually required is reduced, and the reliability of the calculation result by the system is improved.

The reason is that, at each station, the optimum boarding position is determined, so that the waiting time until the vehicle arrives and that it is possible to move while riding, so that the transfer can be performed efficiently. is there.

The second effect is that a more realistic route can be searched.

The reason is that, for each station, the required time can be calculated on the basis of information such as the passage distance, the number of steps, the presence or absence of an escalator, the position of a silver seat, the position of a wheelchair, the position of a wheelchair elevator. This is because information such as the above can be used.

[Brief description of the drawings]

FIG. 1 is a block diagram showing one embodiment of the present invention.

FIG. 2 is a flowchart illustrating the operation of the railway transfer navigation system in FIG. 1;

FIG. 3 is a route diagram for explaining an embodiment of the present invention.

FIG. 4 is a diagram showing an example of a destination information table.

FIG. 5 is a diagram showing an example of a station premises information table.

[Explanation of symbols]

 Reference Signs List 11 input / output device 12 CPU 13 storage device 121 parameter input unit 122 destination station determination unit 123 route candidate search unit 124 boarding vehicle position determination unit 125 calculation result display unit 131 destination information table 132 route information table 133 station yard information table

Claims (2)

(57) [Claims] (1) From a departure station closest to the departure place to a transfer station
To find the shortest train route to the nearest destination station
A railway transfer navigation system, in which a place name, a station name and a ticket gate name corresponding to the place name are registered.
A destination table and a departure station closest to the departure point with reference to the destination table
And the ticket gate and the nearest destination station and ticket gate of the destination
Route information that has registered information on a destination route that determines
The destination determining unit refers to the information table and the route information table to determine
From the designated departure station to the destination station via the transfer station
A route candidate search unit for determining the shortest railway route to stop at the nearest position to the ticket gate for the plurality of stations
While registering the vehicle number for each line,
Cars that stop at the best transfer location for transfer stations within
Refer to the station premises information table for registering both numbers for each route and the station premises information table, and depart from the transfer station.
A second row that stops at the nearest gate to the destination station
Determine the car number and depart from the departure station.
The best place to transfer to the second train at the transfer station
Riding vehicle that determines the vehicle number of the first train that stops at
The transfer from the departure station determined by the position determining unit and the route candidate searching unit;
Information on the shortest railway route to reach the destination station via the station
At the departure station determined by the boarding vehicle position determination unit.
Get on at the transfer station and the number of the first train
And information on the vehicle number of the second train on the display device
And a calculation result display unit that performs
Replacement navigation system. 2. The station premises information table includes:
Passage distance to the nearest boarding position, number of steps, and es
A contractor that includes information indicating the presence or absence of a curator.
The railway transfer navigation system according to claim 1.