JP4450418B2 - Navigation system, route search server and program - Google Patents

Description

  The present invention relates to a navigation system, a route search server, and a program for searching and guiding an optimum route from a departure place to a destination, and in particular, using a train time DB (database) and using a train (train). The present invention relates to a navigation system, a route search server, and a program capable of correctly searching for a guide route (train) that satisfies a route search condition when searching and guiding a route.

  2. Description of the Related Art Conventionally, there are known navigation devices and navigation systems that guide users by searching for map data, road data, a route from a desired departure point to a desired destination, and such navigation devices and navigation systems are known. Is a car navigation device that is installed in a car and guides the route to the driver. A mobile navigation device that uses a mobile phone as a navigation terminal, sends a route search request to the route search server, receives the result, and receives route guidance. Systems etc. have been put into practical use.

  In particular, the communication-type navigation system is a system that uses a mobile terminal such as a mobile phone as a navigation terminal, and is also used as a navigation system for pedestrians. As a navigation system for pedestrians, it is preferable to add a route guidance function including transportation, and in addition to searching and guidance for walking routes, train time data is stored in a route search server, There is also a navigation system that has a function of guiding a route (boarding candidate train) to a desired destination station in addition to searching and guiding a walking route.

  In addition, there is one having a function of searching and guiding a route of a transportation facility to an information distribution server that provides a data communication service to a terminal such as a personal computer via a network. In the present invention, the following description will be made on the assumption that such an information distribution server is also included in the route search server constituting the navigation system in a broad sense. Further, the following description will be given on the assumption that the navigation system targeted by the present invention also includes a stand-alone navigation device having the functions of a route search server and a navigation terminal.

  In a navigation system that searches and guides the route of transportation, specify the departure date and arrival date and time from the desired departure point (or departure station) to the desired destination (or destination station), including transit connections. The route search server requests the route search server to set a desired search condition, for example, required time, number of transfers, fare, etc., and the route search server uses the train time data to specify the starting point and destination. Search for route sections and trains to be connected, and create multiple guide route candidates as a guide route data by ranking them (in order of shorter required time, order of decreasing number of transfers, order of lowest required fare, etc.), and request source navigation It is configured to be distributed to terminals (including terminals such as personal computers as described above).

  As such a navigation system, for example, an operation guidance device disclosed in the following Patent Document 1 (Japanese Patent Laid-Open No. 10-78981) is known. The operation guidance device includes an operation guidance DBMS (database management unit) that stores information for determining an optimum operation route in an area where a plurality of types of transportation such as trains, trains, buses, and airplanes coexist, and a main control unit The operation guide device is configured with the above. Then, the main control unit displays the route map of the search target area on the display device, identifies the characters of the station designated by the operator on the route map, acquires information on the operation between the stations, and acquires the acquired information. A plurality of operation route candidates are determined based on the display form of the portion corresponding to the operation route candidate in the route map displayed on the display device, and the relay blinking is changed along the operation direction. Is.

  Further, as a system for editing an operation timetable of transportation facilities such as trains, trains, and buses, a timetable editing system disclosed in the following Patent Document 2 (Japanese Patent Laid-Open No. 2001-315643) is known. This timetable editing system consists of a normal business processing section that processes regularly when creating a timetable, a revised business processing section that processes from the revised data of the revised timetable obtained from the revised timetable, and the end of the revised work and normal work. In a timetable editing system comprising a database to be stored later, a first file storing timetable information not copied to the revised work in the timetable information at the end of the revised work in the normal work processing unit; Merge processing for merging for the normal business using the second file storing the timetable information that has not been deleted by the revised business and the third file storing the timetable information created by the revised business Means are provided.

  Generally, train time data for route search is created based on a train timetable created by the editing system described in Patent Document 2 above. Train time data for route search created based on the train timetable is created for each route section as shown in FIG. In other words, Fig. 7 shows the route sections between Sengakuji, Misakiguchi, Uraga, and Haneda Airport on the Keihin Kyuko Line, and each route section is shown in Fig. 7 on the Keikyu Main Line (Sengakuji to Uraga). , Keikyu Kurihama Line (Horinouchi to Misakiguchi) and Keikyu Airport Line (Haneda Airport to Keikyu Kamata), and the operation database is also divided by the route section.

  And when there is a train that runs from one route section to another route section, and a train from one route section is operated in combination with a train from another route section at a predetermined combined station When a train that has been operated on the same route section is divided and operated at a predetermined division station, and when these combinations occur, for example, a train that has been operated on a certain route section is moved to another route section. Entered and operated with other trains that have been operated on other route sections at a certain combined station and operated as a single train, divided at a predetermined division station, operated again as a separate train, and moved to another route section There are also cases of boarding.

  For example, when a train departing from Haneda Airport in FIG. 7 enters the Keikyu Main Line from the Keikyu Airport Line, the train operated on the Keikyu Airport Line enters the Keikyu Main Line and the train operated on the Keikyu Main Line When the trains are operated in conjunction with the sudden Kawasaki, the trains operating on the Keikyu Main Line are divided at the Kanazawa Bunko and operated on the Keikyu Kurihama Line and the Keikyu Main Line within the Keikyu Horinouchi. Operated trains entered the Keikyu Main Line, operated in conjunction with Keikyu Main Line trains and Keikyu Kawasaki, and further split at Kanazawa Bunko and operated Keikyu Kurihama Line and Keikyu Main Line in Keikyu Horinouchi There are modes of operation such as In the train time data of the trains accompanied by these divisions and consolidations, the trains to be merged and divided are treated as separate trains, and the time data is registered as train time data.

  For example, in FIG. 8 showing train time data in a certain time zone in the route section shown in FIG. 7, the train with the train number AAA is a train that runs from Keisei Takasago to Misaki Exit. , Keisei Takasago-Sengakuji route section (Keisei Line / Toei Subway Line), Sengakuji-Horinouchi route section (Keikyu Main Line), Horinouchi-Misakiguchi route section (Keikyu Kurihama Line), train For the train of number AAA, the departure time of the section start station, the arrival time of the section end station, and the arrival time (or departure time) of each station (not shown) in the section are converted into data.

  Similarly, the train with the train number BBB is a train that runs from Haneda Airport to Uraga, but on the train time data, the route between Haneda Airport and Keikyu Kamata (Keikyu Airport Line), Keikyu Kamata to Keikyu It is divided into the section of Kawasaki (in the Keikyu Main Line), the section of Keikyu Kawasaki to Kanazawa Bunko (in the Keikyu Main Line), and the section of Kanazawa Bunko to Uraga (in the Keikyu Main Line). The departure time of the section start station, the arrival time of the section end station, and the arrival time (or departure time) of each station (not shown) in the section are converted into data. In the example of FIG. 8, the train AAA and the train BBB are joined together at Keikyu Kawasaki and divided at the Kanazawa library. Therefore, the train AAA and the train BBB are operated as one train between Keikyu Kawasaki and Kanazawa Bunko, but the train time data is converted into data as separate trains. For this reason, in route search, the train with the train number AAA and the train with the train number BBB are treated as separate trains.

  FIG. 9 is an extract of train time data for each route section of several trains including the trains with the train numbers AAA and BBB shown in FIG. As shown in FIG. 9, the train BBB leaves Haneda Airport at the start of the section at 19:47 and arrives at the end of the section at Keikyu Kamata at 19:53 minutes, and Keikyu Kamata will become the section start of the next route section. 19:55 and arrive at Keikyu Kawasaki at the end of the section at 20:03. In the next route section, the arrival time of the train BBB at each station in the section from Sengakuji to Horinouchi (Keikyu Main Line) ( Or departure time) is registered as train time data, the route section starts at Kanazawa Bunko, which is a divided station with train AAA, leaves Kanazawa Bunko at 20:29, and arrives at Uraga at the end of the section (end) 20:55 The time data is accumulated so as to arrive at

  Similarly, train AAA leaves Sengakuji at the start of the section at 19:49, arrives at Horinouchi at the end of the section at 20:39 minutes, and departs at Horinouchi at the end of the next section at 20:39. Time data is accumulated so that it arrives at the end of Misakiguchi at 20:57. Then, in the route section from Sengakuji to Horinouchi, the train BBB is combined in Keikyu Kawasaki, and the train AAA and the train BBB are operated as one train to Kanazawa Bunko. This combined train (train AAA and train BBB) is split at Kanazawa Bunko, train AAA enters the section of Keikyu Kurihama Line to Misaki Exit, and train BBB runs to the final Uraga on Keikyu Main Line. .

Japanese Patent Laid-Open No. 10-78981 Japanese Patent Laid-Open No. 2001-315643

  When the route search is performed by specifying the desired route search conditions using the conventional train time data described with reference to FIGS. 7, 8, and 9, for example, the Haneda airport is departed at 19:46. A route search result when a route search is performed in the shortest time to Uraga and with a small number of transfers will be described. As shown in FIG. 10, the route route used in this case is Haneda Airport-Keikyu Kamata (Keikyu Airport Line / Route 0), Keikyu Kamata-Keikyu Kawasaki-Kanazawa Bunko-Horinouchi-Uraga (Keikyu Main Line) / Route 2). Based on the train time data of FIG. 8, the train that leaves Haneda Airport the earliest after departure time 19:46 is the train BBB (bound for Uraga / route 0) from 19:47, followed by 19:50 Train DDD (bound for Inba Nippon Medical University). Of course, there are also trains after 19:50 as shown in the time table of Haneda Airport Station shown in FIG. 11, so the route search server uses each train BBB, train DDD, etc. Follow the connected (transferable) train that runs the route section, and count the total time and number of transfers until you arrive at the destination Uraga.

  As shown in the example of Fig. 9, the train AAA (Keisei Takasago to Misakiguchi) arrives at Keikyu Kamata at 19:59 and departs at 20:00. To do. This train AAA arrived at Keikyu Kawasaki at 20:03 and was combined with train BBB from Haneda Airport Line (departing from Haneda Airport 19:47, Keikyu Kawasaki 20:03 via Keikyu Kamata). Train BBB leaves Keikyu Kawasaki as one train at 20:04. This train arrived at Kanazawa Bunko at 20:27 and was split at Kanazawa Bunko. Train AAA departed Kanazawa Bunko at 20:28, from Horinouchi (20:39 departure) to Keikyu Kurihama Line (route in Fig. 10) 3)) and head towards Misakiguchi (20:57). Train BBB leaves Kanazawa Bunko at 20:29 and operates the Keikyu Main Line, leaves Horinouchi at 20:50 and arrives at the final Uraga at 20:55.

  Departing Haneda Airport by train BBB at 19:47, Keikyu Kawasaki to Kanazawa Bunko will be operated in conjunction with train AAA. If the connecting portion is a penetration type vehicle organization, the train moves from the train BBB to the train AAA by the Kanazawa Bunko, or moves to the train AAA using the platform at a stop station on the way. Train AAA is bound for Misakiguchi, but if you get off at Horinouchi and change to the following train CCC connected at 20:40, you will arrive at Uraga at 20:46 and will be the earliest route to reach your destination, Uraga. .

  If you want to go to the destination while sitting on the train BBB, you can select the Uraga 20:55 route without changing once from the beginning. Train BBB is a realistic and practical option because the difference in arrival time is only 9 minutes from train CCC at 20:46 Uraga. In particular, passengers at Haneda Airport often have lots of luggage and want to reduce the number of transfers. As another route, there is a route using a train DDD that leaves Haneda Airport at 19:50. This train DDD arrives at Keikyu Kamata at 19:59 and connects to the train AAA at Keikyu Kamata. If you change to train AAA at Keikyu Kamata, train AAA will leave Keikyu Kamata at 20:00, train CCC at Horinouchi (20:19 from Kanazawa Bunko and 20:40 from Horinouchi to Uraga 20:46) You can change to a train.

  A case will be described in which the above route is searched by various navigation systems that are currently serving the route search of transportation facilities. FIGS. 12, 13, and 14 are diagrams showing examples of route search condition setting screens on the navigation terminal side in the various navigation systems currently in service. When the navigation terminal 20 requests the route search server 30 to make a route search using a transportation facility, the navigation terminal 20 connects to the route search server 30 and inputs route search condition inputs as shown in FIGS. 12, 13, and 14 from the route search server. A screen is received, and on this screen, route search conditions such as a departure place (Haneda Airport), a destination (Uraga), a departure date and time are input and transmitted to the route search server 30. The number of display cases in FIG. 12 and the number of answers in FIG. 13 are the number of guide routes answered by the route search server 30, the priority display of the search results in FIG. 12, and the priority display condition in FIG. It is a button to set what to prioritize among items. In the example in the figure, “Time (required time)”, “Fare (fare)”, “Number of transfers” can be set, and the route search server according to this setting 30 orders the searched guide routes and distributes them to the navigation terminal 20, and the navigation terminal 20 displays the guide routes according to this order.

  On the route search condition setting screen as shown in FIG. 12, FIG. 13, or FIG. 14, the search condition “Priority is given to the number of transfers (minimum number of transfers)” is entered into the search condition, and a route search request is made from Haneda Airport to Uraga at 19:46. FIG. 15, FIG. 16, and FIG. 17 show the route search results obtained by the route search server 30 in this case. In FIG. 15, as the first guide route, we leave Haneda Airport with a 19:50 train DDD (see FIG. 8), change trains at Keikyu Kamata to 20:00, and leave at Horinouchi at 20:40. The route to arrive at Uraga at 20:46 after changing to the train CCC. In addition, as shown in FIG. 16, the train departs from Haneda Airport by 19:47 train BBB (see FIG. 8), is connected with train AAA at 20:00 at Keikyu Kamata, and train at 20:50 at Horinouchi. A route that is divided into BBB and arrives at Uraga at 20:55 is also guided as a route with two transfers. In addition, as shown in FIG. 17, we leave Haneda Airport by train BBB at 19:47 (see FIG. 8) and go to Horinouchi by a train that runs in conjunction with train AAA at 20:04 in Keikyu Kawasaki. Also, the route to Horanouchi that changes to the 20:40 train CCC and arrives at Uraga at 20:46 is also shown as two transfers.

  That is, the route as described above is entered into the search condition of “minimum number of transfers” in various navigation systems that currently provide route search for transportation facilities, leaving Haneda Airport at 19:46 to Uraga. When a route search request is made, if the route search is performed correctly, the train BBB (from Haneda Airport 19: 47 / Uraga 20:55) will be searched as the first guide route with the least number of transfers (no transfers). There is actually a two-way guide route that departs Haneda Airport at 19:50 using the train DDD described above, transfers to the train AAA at Keikyu Kamata, and then transfers to the train CCC at Horinouchi. There is a problem that the train BBB is searched as a guide route having the same number of transfers.

  As a result of analyzing the cause of this route search result, train BBB train time data, which is a direct train bound for Uraga from Haneda Airport 19:47, was combined with train AAA (Keikyu Kawasaki) on the way, and further on the way The train numbers of the two trains AAA and BBB differ when they are split at Kanazawa (Kanazawa Bunko), so they are treated as separate trains and counted as transfers at the combined and split stations. .

  Based on the above analysis results, the inventor of the present application has conducted various studies to solve the above-described problems. As a result, in addition to the train number in the train time data, an internal train number is provided as additional data used in the route search. If the same internal train number is added to trains to be combined and / or divided and the number of transfers is counted only when the internal train number changes in the route search, the above problem can be solved. Thus, the present invention has been completed.

  That is, the present invention aims to solve the above-mentioned problems, and guides satisfying the route search condition when searching and guiding a route using the train (train) using the train time DB (database). An object of the present invention is to provide a navigation system, a route search server, and a program that can search for a route correctly.

In order to solve the above-mentioned problem, the invention according to claim 1 of the present application relates to a train time database storing train time data, and a route from a departure place to a destination by referring to the train time database based on a search condition. In a navigation system comprising a route search server that includes a train search including a train transfer, and a navigation terminal that transmits a route search request including a search condition to the route search server, the train time database is The train time data of each train and the train time data of each train combined and / or divided in a predetermined route section are configured by adding the same internal train identifier, and the route search means For the searched guide route , count the number of times the internal train identifier changes as the number of transfers, When trains having the same internal train identifier are continuously included in the guide route , the number of transfers is not counted.

The invention according to claim 2 of the present application includes a train time database in which train time data is accumulated, and a train transfer from a departure point to a destination by referring to the train time database based on a search condition. A navigation system comprising: a route search server provided with a route search means, and a navigation terminal that transmits a route search request including a search condition to the route search server. The train time database includes train time data of each train. If, constructed by adding each of the trains of the train time data to the same internal train identifier併結and / or split in a given route segment, the route search unit, when the route search, the searched guide route, Counts the number of times the internal train identifier changes as the number of transfers , and is the same in the guide route When the train having the internal train identifier is included without being continuous , the guide route is excluded from the guide route candidates.

The invention according to claim 3 of the present application includes a train time database in which train time data is accumulated, and a train transfer from a departure point to a destination by referring to the train time database based on a search condition. A navigation system comprising: a route search server provided with a route search means, and a navigation terminal that transmits a route search request including a search condition to the route search server. The train time database includes train time data of each train. If, constructed by adding each of the trains of the train time data to the same internal train identifier併結and / or split in a given route segment, the route search unit, when the route search, the searched guide route, Counts the number of times the internal train identifier changes as the number of transfers , and is the same in the guide route If the train with the internal train identifier is continuously included, the number of transfers is not counted,
The navigation terminal is characterized in that it does not display an item that makes the user imagine a transfer, or performs a display that prompts the vehicle to move within the train.

The invention according to claim 4 of the present application is the invention according to claim 3, wherein the train time database includes train time data of each train and trains combined and / or divided in a predetermined route section. In addition to adding the same internal train identifier to the train time data, and further adding the final destination data of each train, the route search means is configured so that the internal train identifier for the searched guide route is counted as the number of times transfer a number of changes, when the train with the same internal train identifier to the guide pathway is included in succession, without counting the number of times of transfer, the medium Noritsugu train the guide pathway If all have the same internal train identifier and the last destination of the first train and the last train is the same,
The navigation terminal does not display an item that makes the user imagine a transfer.

The invention according to claim 5 of the present application is the invention according to claim 3, wherein the train time database includes train time data of each train and trains combined and / or divided in a predetermined route section. An internal train identifier is added to the train time data, and the final destination data of each train is also added, and the route search means changes the internal train identifier for the searched guide route during the route search. The number of transfers is counted as the number of transfers, and when trains having the same internal train identifier are continuously included in the guide route, the number of transfers is not counted, and all trains to be transferred in the guide route are the same. If it is an internal train identifier and the final destination of the first train and the last train are different,
The navigation terminal performs display for prompting vehicle movement in a train.

The invention according to claim 6 of the present application is a route search server that receives a route search request including a search condition from a navigation terminal and performs a route search, the train time database storing train time data, and the search condition In a route search server comprising route search means for searching for a route from a departure place to a destination including a train transfer with reference to the train time database based on
The train time database is configured by adding the same internal train identifier to the train time data of each train and the train time data of each train combined and / or divided in a predetermined route section, and the route search means , upon route search, the searched guidance route, if the internal train identifiers counted as the number of times transfer a number of changes, the train having the same internal train identifier to the guide pathway is included in succession, The number of transfers is not counted.

The invention according to claim 7 of the present application is a route search server for receiving a route search request including a search condition from a navigation terminal and performing a route search, the train time database storing train time data, and the search condition In a route search server comprising route search means for searching for a route from a departure place to a destination including a train transfer with reference to the train time database based on
The train time database is configured by adding the same internal train identifier to the train time data of each train and the train time data of each train combined and / or divided in a predetermined route section, and the route search means , upon route search, the searched guidance route, if the internal train identifiers counted as the number of times transfer a number of changes, the train having the same internal train identifier to the guide pathway is included without successive The guide route is excluded from the guide route candidates.

The invention according to claim 8 of the present application is a route search server that receives a route search request including a search condition from a navigation terminal and performs a route search, the train time database storing train time data, and the search condition In a route search server comprising a route search means for searching for a route from a departure place to a destination including a train transfer with reference to the train time database, and a guide route data creation means,
The train time database is configured by adding the same internal train identifier to the train time data of each train and the train time data of each train combined and / or divided in a predetermined route section, and the route search means , upon route search, the searched guidance route, if the internal train identifiers counted as the number of times transfer a number of changes, the train having the same internal train identifier to the guide pathway is included in succession, Without counting the number of transfers,
The guide route data creation means adds to the guide route data display data that does not display an item that makes the user image a transfer, or displays display that prompts the vehicle to move within the train. .

The invention according to claim 9 of the present application is the invention according to claim 8, wherein the train time database includes train time data of each train and trains combined and / or divided in a predetermined route section. In addition to adding the same internal train identifier to the train time data, and further adding the final destination data of each train, the route search means is configured so that the internal train identifier for the searched guide route is The number of times of change is counted as the number of transfers, and when trains having the same internal train identifier are continuously included in the guide route, the number of transfers is not counted, and all the trains connecting in the guide route are the same is an internal train identifier of, and, in the case where the final destination of the first train and last train of the same,
The guide route data creating means adds display data that does not display an item that makes the user imagine a transfer to the guide route data.

The invention according to claim 10 of the present application is the invention according to claim 8, wherein the train time database includes train time data of each train and trains combined and / or divided in a predetermined route section. In addition to adding the same internal train identifier to the train time data, and further adding the final destination data of each train, the route search means is configured so that the internal train identifier for the searched guide route is When the number of times of change is counted as the number of transfers, and trains having the same internal train identifier are continuously included in the guide route, the number of transfers is not counted, and all trains connecting in the guide route are all If they have the same internal train identifier and the final destination of the first train and the last train are different,
The guide route data creating means adds display data for performing display for prompting vehicle movement in the train to the guide route data.

The invention according to claim 11 of the present application is a route search server that receives a route search request including a search condition from a navigation terminal and performs a route search, and train time data of each train and a predetermined route section A train time database configured by adding the same internal train identifier to the train time data of each train to be combined and / or divided, and from the departure point to the destination with reference to the train time database based on search conditions A computer that constitutes a route search server comprising: route search means for searching for a route including train transfer;
In the route search, the searched guidance route, if the internal train identifiers counted as the number of times transfer a number of changes, the train having the same internal train identifier to the guide pathway is included in succession, the number of times of transfer It is a program characterized by executing a function as a route search means that does not perform counting.

Further, the invention according to claim 12 of the present application is a route search server that receives a route search request including a search condition from a navigation terminal and performs route search, and train time data of each train and a predetermined route section A train time database configured by adding the same internal train identifier to the train time data of each train to be combined and / or divided, and from the departure point to the destination with reference to the train time database based on search conditions A computer that constitutes a route search server comprising: route search means for searching for a route including train transfer;
In the route search, for the searched guide route , the number of times the internal train identifier changes is counted as the number of transfers , and when the trains having the same internal train identifier are included in the guide route without being consecutive , it is a program for causing to execute a function of the route searching means to exclude from the guidance route candidates guide route.

The invention according to claim 13 of the present application is a route search server for receiving a route search request including a search condition from a navigation terminal and performing a route search, wherein train time data of each train and a predetermined route section A train time database configured by adding the same internal train identifier to the train time data of each train to be combined and / or divided, and from the departure point to the destination with reference to the train time database based on search conditions A computer that constitutes a route search server comprising: route search means for searching for the route including train transfer; and guide route data creation means;
In the route search, the searched guidance route, if the internal train identifiers counted as the number of times transfer a number of changes, the train having the same internal train identifier to the guide pathway is included in succession, the number of times of transfer The function as a route search means that does not count is executed,
Do not display an item that makes the user image a transfer to the guide route data, or execute a function as a guide route data creation means for adding display data for prompting vehicle movement in the train. It is a featured program.

The invention according to claim 14 of the present application is the invention according to claim 13, wherein the train time database includes train time data of each train and trains combined and / or divided in a predetermined route section. In addition to adding the same internal train identifier to the train time data, and further adding the final destination data of each train, the computer device,
In the route search, the searched guidance route, if the internal train identifiers counted as the number of times transfer a number of changes, the train having the same internal train identifier to the guide pathway is included in succession, the number of times of transfer Process as route search means that does not count
When the trains to be connected in the guide route are all the same internal train identifier, and the final destination of the first train and the last train is the same, display of an item that makes the user image transfer in the guide route data A function as a guide route creation means for adding display data that is not performed is executed.

The invention according to claim 15 of the present application is the invention according to claim 13, wherein the train time database includes train time data of each train and trains combined and / or divided in a predetermined route section. In addition to adding the same internal train identifier to the train time data, and further adding the final destination data of each train, the computer device,
In the route search, the searched guidance route, if the internal train identifiers counted as the number of times transfer a number of changes, the train having the same internal train identifier to the guide pathway is included in succession, the number of times of transfer The function as a route search means that does not count is executed,
Display data that displays information that prompts vehicle movement in the train in the guide route data when all the trains that are transited in the guide route have the same internal train identifier and the final destination of the first train and the last train are different. And a function as a guide route creation means for adding.

In the invention according to claim 1, the same internal train identifier is added to the train time database of the train time data of each train and the train time data of each train combined and / or divided in a predetermined route section. The route search means counts the number of times the internal train identifier changes for the searched guide route as the number of transfers for the searched guide route , and trains having the same internal train identifier are consecutive in the guide route. In such a case, the number of transfers is not counted. For this reason, even if trains that are combined or divided are included in the guide route, they are identified as the same train, and the number of transfers is not counted, so an accurate guide route according to the route search conditions can be searched. become.

Further, in the invention according to claim 2, the train time database includes the same internal train identifier in the train time data of each train and the train time data of each train combined and / or divided in a predetermined route section. The route search means counts the number of times the internal train identifier changes for the searched guide route as the number of transfers in the route search, and trains having the same internal train identifier in the guide route. Are included without being consecutive , the guide route is excluded from the guide route candidates. For this reason, even if trains with merged or divided trains are included in the guide route, they are identified as the same train, transfer from that train to another train, and routes that involve unnecessary transfers to get on that train again are excluded from the guide route Will be able to.

In the invention according to claim 3, the train time database includes the same internal train identifier for the train time data of each train and the train time data of each train combined and / or divided in a predetermined route section. The route search means counts the number of times the internal train identifier changes for the searched guide route as the number of transfers in the route search, and trains having the same internal train identifier in the guide route. Are continuously included, the number of times of transfer is not counted, and the navigation terminal is configured not to display a display indicating a transfer or to display a prompt to move the vehicle in the train. For this reason, even if trains that are combined or divided are included in the guide route, they are identified as the same train, and the number of transfers is not counted, so an accurate guide route according to the route search conditions can be searched. become. Moreover, since the display of the item which makes a user image transfer is not performed, or the display which prompts the vehicle movement in a train is performed, a user is not confused.

Further, in the invention according to claim 4, in the navigation system according to claim 3, the train time database is further configured by adding the final destination data of each train, and the route search means performs the route search. for searched guidance route, if the internal train identifiers counted as the number of times transfer a number of changes, the train having the same internal train identifier to the guide pathway is included in succession, a count of the number of times of transfer The navigation terminal makes the user imagine a transfer when all the trains that transit in the guide route are the same internal train identifier and the final destination of the first train and the last train is the same. It is configured not to display items. Further, the display indicating no transfer is not performed. For this reason, trains with combined or divided trains are continuously included in the guide route, and when the final destination is the same for the first train and the last train, the number of transfers is not counted, and the display indicating the transfer is not performed. Therefore, it becomes possible to search for an accurate guide route according to the route search condition, and the user is not confused.

Further, in the invention according to claim 5, in the navigation system according to claim 3, the train time database is further configured by adding the final destination data of each train, and the route search means performs the route search. For the searched guide route , the number of times the internal train identifier changes is counted as the number of transfers, and the number of transfers is counted when trains having the same internal train identifier are continuously included in the guide route. not, train Noritsugu in the guide pathway are all the same internal train identifier, and, if the final destination of the first train and the last of the train are different, the navigation terminal performs a display to prompt the vehicle moving in the train It is configured as follows. For this reason, trains with combined or divided trains are continuously included in the guide route, and when the final destination is the same between the first train and the last train, the number of transfers is not counted, and vehicle movement within the train is not performed. Since the prompting is performed, the user is not confused with transfer.

In the inventions according to claims 6 to 10 , it is possible to provide route search servers constituting the navigation systems according to claims 1 to 5 , respectively. Also, even if trains with combined or divided trains are included in the guide route, they are identified as the same train, and the number of transfers is not counted, so that an accurate guide route according to the route search conditions can be searched. Become.

The invention according to claims 11 to 15, it is possible to provide a program for realizing the route search server constituting each navigation system according to claims 1 to 5. Also, even if trains with combined or divided trains are included in the guide route, they are identified as the same train, and the number of transfers is not counted, so that an accurate guide route according to the route search conditions can be searched. Become.

  Hereinafter, specific examples of the present invention will be described in detail with reference to examples and drawings. FIG. 1 is a block diagram showing a configuration of a navigation system according to an embodiment of the present invention. FIG. 2 is a diagram showing a configuration of train time data accumulated in the train time DB used in the embodiment of the present invention. FIG. 3 is a schematic diagram in which some of the trains shown in FIG. 2 are extracted and their train times are shown on the route section. FIG. 4 is a flowchart showing a route search procedure in the embodiment of the present invention. FIG. 5 is a screen configuration diagram showing an example of a screen for displaying a guidance route in the navigation terminal. FIG. 6 is a screen configuration diagram showing another example of a screen for displaying a guidance route in the navigation terminal.

  A navigation system 10 according to an embodiment of the present invention includes a navigation terminal 20 and a route search server 30 connected via a network as shown in FIG. A search request is created and sent to the route search server 30. The route search server 30 searches for an optimum route from the departure point to the destination in accordance with the route search request, and sends a guidance route as a result of the search to the navigation terminal 20. Deliver (send).

  The navigation terminal 20 includes a control unit 21, a communication unit 22, a route search request processing unit 23, an input unit 24, and a display unit 25. The navigation terminal 20 performs a desired input and operation instruction from the input unit 24, and displays a map and a guidance route distributed from the route search server 30 on the display unit 25. The communication unit 22 is a communication unit for transmitting and receiving information to and from the route search server 30. When the navigation terminal 20 is a mobile phone, the communication unit 22 is a radio for wireless communication with a mobile phone base station. Consists of communication units. The control unit 21 is mainly composed of a microprocessor, and includes storage means such as a RAM and a ROM, as in a general computer device, and controls each part by a program stored in these storage means.

  The route search request processing unit 23 sends route search requirements such as a departure point, a destination, and a moving unit to the route search server 30 and requests a route search. The starting point and destination are generally specified by latitude and longitude. However, the address or telephone number is input and converted into latitude and longitude information in the database of the route search server 30, or the navigation terminal 20 is used. For example, a point is specified on the displayed map and converted into latitude and longitude information. In this embodiment, when the departure station and the destination station are designated, the route / station name selection screen is displayed on the display means 25 by connecting to the route search server 30 and using the service menu screen or the like. A designation method, a method of directly inputting a station name and transmitting it to the route search server 30 can be used.

  On the other hand, the route search server 30 includes a control unit 31, a communication unit 32, a route search request analysis unit 33, a guide route data creation unit 34, a route search unit 35, and a train time DB (database) 36. The control unit 31 is mainly composed of a microprocessor, and includes storage means such as a RAM and a ROM similarly to a general computer device, and controls each part by a program stored in these storage means.

  The communication unit 32 receives data and a service request from the navigation terminal 20, and transmits (distributes) the requested data and data necessary for the service to the navigation terminal 20, and the navigation terminal 20 In the case of a mobile phone, the information is distributed via an information distribution server operated by a communication carrier via the Internet or a dedicated line. It is also possible to provide the function of the route search server 30 to the information distribution server operated by the communication carrier. The train time DB (train time database) 36 is a database in which operation times of trains (trains) used in route search using transportation facilities are accumulated, and train time data created from transportation timetable data is accumulated. It is a thing.

  The configuration of the train time data stored in the train time DB 36 is basically the same as the train time data conventionally used as explained in FIG. 8, but in this embodiment, as shown in FIG. The difference is that an internal train number is added. This internal train number is an identifier for recognizing trains that are operated together and divided in route search as the same train. As described later, trains that are combined and divided are used as guide routes for route search. In some cases, it is used not to count the number of transfers at the time of consolidation or division.

  In this embodiment, only the train time DB 36 is shown in order to focus on route search using transportation facilities, but the route search server 30 is from the departure point to the departure station or from the destination station to the destination. When searching for an optimal route including a walking route and delivering a guidance route, a map database (route data consisting of node data, link data, and cost data) for route search is used in the same way as a normal pedestrian navigation system. And a train network database, and the route searching means 35 may be configured to search for an optimal walking route from the departure point to the departure station or from the destination station to the destination. As a method for searching for an optimum route using these train network database and map database, a general method using a label determination method called a Dijkstra method can be employed.

  The route search request analyzing means 33 is for analyzing the route search request received from the navigation terminal 20 and specifying the route search conditions. From the received route search request, the departure station, the destination station, the departure date and time, guidance Analyzes the number of routes (number of responses / how many response routes to answer as a result of route search) and priority route search conditions (required time, number of transfers, fares, etc.) and conveys them to the route search means 35 is there. The route search means 35 obtains route candidates from the train network using a technique such as the Dijkstra method described above, refers to the train time DB 36, and sequentially selects a train that can be boarded from the departure station, the destination station, and the departure time. Then, follow the train to the destination station, including transit trains, and search for multiple optimal routes along with required time, fares, number of transfers, and so on.

  Next, a route search procedure according to the present embodiment, in particular, a route search procedure when priority is given to the number of transfers in the route search will be described with reference to FIGS. FIG. 3 is a schematic diagram showing some of the trains shown in FIG. 2 and their route times along with their operation times. FIG. 4 is a flowchart showing a route search processing procedure in the route search server. . When the route search server 30 receives the route search request from the navigation terminal 20, as shown in the flowchart of FIG. 4, first, in step S10, the route search request analysis means 33 analyzes the route search request, and the departure station and the destination station are analyzed. Route search means by extracting departure date and time, number of guide routes (number of answers / how many multiple guide routes are returned as a result of route search), priority route search conditions (required time, number of transfers, fare, etc.) Tell 35.

  For example, a description will be given of a route search in the case where a route search is started in 19:46 at Haneda Airport and reaches Uraga in the shortest time and the number of transfers is small. As described above, the route route used in this case is Haneda Airport-Keikyu Kamata (Keikyu Airport Line / Route 0), Keikyu Kamata-Keikyu Kawasaki-Kanazawa Bunko-Horinouchi-Uraga (Keikyu Main Line) / Route 2) (see FIG. 7). Based on the train time data in FIG. 2, the earliest train that leaves Haneda Airport after the departure time 19:46 is the train BBB departing from 19:47 (Uraga / Route 0), followed by 19:50 Train DDD (bound for Inba Nippon Medical University) (see Fig. 3). Of course, since there are also trains after 19:50, the route search means 35 uses each train BBB, train DDD, and other trains as starting trains in order to connect (changeable) trains that operate the next route section. Traces the total time to reach the destination Uraga and the number of transfers. In this way, the route search means 35 advances the route search in step S11.

  As shown in Fig. 3, the train AAA (Keisei Takasago to Misakiguchi) arrives at Keikyu Kamata at 19:59 and departs at 20:00. . This train AAA arrived at Keikyu Kawasaki at 20:03 and was combined with train BBB from Haneda Airport Line (from Haneda Airport 19:47, Keikyu Kawasaki via Keikyu Kamata 20:03) and train AAA. Train BBB leaves Keikyu Kawasaki as one train at 20:04. This train arrives at Kanazawa Bunko at 20:27 and is split at Kanazawa Bunko. Train AAA departs Kanazawa Bunko at 20:28 and goes from Horinouchi (20:39 departure) to Keikyu Kurihama Line (route in Fig. 10). 3)) and head towards Misakiguchi (20:57). Train BBB leaves Kanazawa Bunko at 20:29 and operates the Keikyu Main Line, leaves Horinouchi at 20:50 and arrives at the final Uraga at 20:55.

  Here, in the train time data of the train AAA and the train BBB, the same identifier aaa is added as the internal train number as shown in FIGS. 2 and 3, and the route search means 35 has the same internal train number in step S12. The route where the boarding section is discontinuous is excluded from the guide route. For example, if you want to arrive early at the destination station where only the trains at each station stop, get on the train [X] at each station that departs first at the departure station, and follow the express or rapid train [Y] at the middle station. There is often a boarding action of changing to, and changing to the train [Z] at each subsequent station at an express or rapid train stop in front of the target station. Even if you take this kind of boarding behavior, if you are not familiar with the operating time relationship between the trains at each station and the trains, such as express and rapid, get off at the express train [Y] at each station stop before the destination station and get on As a result, there are cases where the train at each subsequent station stops and becomes the same train [X] as the train at the departure station and heads for the destination station. The data of the guide route in this case is discontinuous while the boarding section of the train [X] gets on another express on the way, the rapid train [Y]. Such a route is the same as having traveled from the departure station to the destination station by the same train [X], and the transfer behavior in the middle becomes meaningless behavior.

  After excluding the routes as described above, the route search means 35 counts the number of times the internal train number changes for the searched guide route as the number of transfers in step S13. By adopting such a counting method, the number of transfers at the combined station or divided station when a train with combined or divided trains is used as the guide route is not counted. That is, in the above example, the same internal train number “aaa” is added to the train BBB and the train AAA (see FIG. 2), and the train BBB is boarded and connected to the train AAA in the middle to the division station. Since the internal train number does not change during the ride, the number of transfers is not counted. This makes it possible to accurately count the number of times the guide route is changed.

  Next, when the number of guide route candidates (number of answers) is specified as a condition for the route search request, it is determined whether the guide route has reached the number of guide routes N to be answered after the search, and N must be reached. Return to step S11 to search for the next guide route. If it has reached N, the process proceeds to step S15, where the guide route data creation means 34 receives the data of a plurality of guide routes searched by the route search means 35, sorts these guide routes in ascending order of the number of transfers, Guide route data is created, and the guide route data is transmitted to the navigation terminal 20 via the communication unit 32 in step S17.

  When the guide route data is received from the route search server 30, the navigation terminal 20 displays the guide route on the display means 25. For example, the display screen is sequentially displayed from the first candidate guide route as shown in FIG. The first candidate guide route (the first route) is the guide route with the minimum number of transfers of “0”. Board the train BBB at Haneda Airport at 19:47 and continue on the train BBB. This is the route to arrive at Uraga at 20:55. In this case, the required time is 68 minutes and the fare is 860 yen. The second candidate guide route (second route) is a route with one transfer, takes Haneda Airport on the 19:47 train BBB, arrives at Horinouchi at 20:39, and travels through Horinouchi at 20:40. Change to the train CCC bound for Uraga, leaving at 20:46 in Uraga. In this case, the required time is 59 minutes and the fare is 860 yen.

  Although not shown in FIG. 5, the third candidate guide route (third route) is a route using a train DDD that leaves Haneda Airport at 19:50. This train DDD arrives at Keikyu Kamata at 19:59 and connects to the train AAA at Keikyu Kamata. If you change to train AAA at Keikyu Kamata, train AAA departs from Keikyu Kamata at 20:00, train CCC at Horinouchi (20:19 from Kanazawa Bunko and 20:40 from Horinouchi to Uraga 20:46) You can change to a train. In this case, the number of transfers is 2 times, the required time is 56 minutes, and the fare is 860 yen.

  In the above-described conventional route search, when a train with combined and divided trains (train AAA and train BBB) is used as a guide route, if you display a guide route that makes you think of a transfer, get off at the transfer station and May be misleading to get on the train. In order not to cause such misunderstandings, display indicating the transfer is not performed, or display such as “Please move to a vehicle bound for Uraga or Misakiguchi” as shown in FIG. Further, in addition to the internal train number added according to the present invention, the train time DB 36 further stores data indicating the final destination of each train (see FIG. 2), so different trains having the same internal train number. Even if you use the train, if the destination of the first train and the destination of the last train are the same, you can see that there is no need to move within the train. If this is not done, the user will not be confused.

  As described above in detail, according to the navigation system of the present invention, when the train time DB (database) is used to search and guide the route using the time train (train), the guide satisfying the route search condition. It is possible to provide a navigation system, a route search server, and a program that can search for a route correctly.

  The present invention can be applied to all route search systems including train transfer guidance. That is, the present invention can be widely applied to the provision of route search in a server and client PC system using the Internet, or a navigation system such as a server and a mobile phone, and a stand-alone route search application.

It is a block diagram which shows the structure of the navigation system concerning the Example of this invention. It is a figure which shows the structure of the train time data accumulate | stored in train time DB used in the Example of this invention. It is the schematic diagram which extracted some of the trains illustrated in FIG. 2, and described the train time on the route section. It is a flowchart which shows the procedure of the route search in the Example of this invention. It is a screen block diagram which shows an example of the screen which displays the guidance route in a navigation terminal. It is a screen block diagram which shows the other example of the screen which displays the guidance route | root in a navigation terminal. It is explanatory drawing in order to demonstrate an example of the route section of a train. It is a figure which shows the structure of the train time data for the conventional route search. It is explanatory drawing which extracted the train time data containing the train of FIG. 8, and wrote it with the route section. It is explanatory drawing for demonstrating the route area where the train to board is operated. It is a figure which shows an example of the normal train timetable posted on a specific station. It is a figure which shows an example of the route search condition input screen in the conventional navigation terminal. It is a figure which shows the other example of the route search condition input screen in the conventional navigation terminal. It is a figure which shows the further another example of the route search condition input screen in the conventional navigation terminal. It is a figure which shows an example of the guidance route display screen in the conventional navigation terminal. It is a figure which shows the other example of the guidance route display screen in the conventional navigation terminal. It is a figure which shows the further another example of the guidance route display screen in the conventional navigation terminal.

Explanation of symbols

10. Navigation system 20 ... Navigation terminal 21 ... Control unit 22 ... Communication unit 23 ... Route search request processing means 24 ... Input means 25 ... Display means 30 ... Route search server 31 ... Control unit 32 ... Communication unit 33 ... Route search request analysis means 34 ... Guide route data creation means 35 ... Route Search means 36 ··· Train time DB (train time database)

Claims (15)

A route provided with a train time database that stores train time data, and route search means that searches the route from the departure point to the destination, including train transfers, with reference to the train time database based on search conditions. In a navigation system comprising a search server and a navigation terminal that transmits a route search request including a search condition to the route search server, the train time database is combined and / or divided in train time data of each train and a predetermined route section. The same internal train identifier is added to the train time data of each train to be configured,
In the route search, the route search means counts the number of times the internal train identifier changes for the searched guide route as the number of transfers , and trains having the same internal train identifier are continuously included in the guide route. In the navigation system, the number of transfers is not counted. A route provided with a train time database that stores train time data, and route search means that searches the route from the departure point to the destination, including train transfers, with reference to the train time database based on search conditions. In a navigation system comprising a search server and a navigation terminal that transmits a route search request including a search condition to the route search server, the train time database is combined and / or divided in train time data of each train and a predetermined route section. The same internal train identifier is added to the train time data of each train, and the route search means uses the number of times the internal train identifier changes for the searched guide route as the number of transfers. Count and trains with the same internal train identifier continue in the guide route . If it included without Rukoto a navigation system characterized in that to exclude the guide route from the guide route candidates. A route provided with a train time database that stores train time data, and route search means that searches the route from the departure point to the destination, including train transfers, with reference to the train time database based on search conditions. In a navigation system comprising a search server and a navigation terminal that transmits a route search request including a search condition to the route search server, the train time database is combined and / or divided in train time data of each train and a predetermined route section. The same internal train identifier is added to the train time data of each train, and the route search means uses the number of times the internal train identifier changes for the searched guide route as the number of transfers. Counting, trains having the same internal train identifier continue in the guide route. If that is included Te does not perform a count of the number of times of transfer,
The navigation system, wherein the navigation terminal does not display an item that makes a user image transfer, or performs a display that prompts the vehicle to move within the train. The train time database adds the same internal train identifier to the train time data of each train and the train time data of each train combined and / or divided in a predetermined route section, and further the final destination of each train The route search means counts the number of times the internal train identifier changes for the searched guide route as the number of transfers for the route search, and the same internal train identifier is included in the guide route. when the train with is included in succession, without counting the number of times of transfer, the medium Noritsugu train all at the guide path in a same internal train identifier, and the final first train and last train If the destination is the same,
The navigation system according to claim 3, wherein the navigation terminal does not display an item that makes a user image transfer. The train time database adds the same internal train identifier to the train time data of each train and the train time data of each train combined and / or divided in a predetermined route section, and further the final destination of each train The route search means counts the number of times the internal train identifier changes for the searched guide route as the number of transfers for the route search, and the same internal train identifier is included in the guide route. Is not included in the number of transfers, all the trains to be transferred in the guide route have the same internal train identifier, and the final destination of the first train and the last train Are different,
The navigation system according to claim 3, wherein the navigation terminal performs display for prompting vehicle movement in a train. A route search server for receiving a route search request including a search condition from a navigation terminal and performing a route search, wherein the train time database stores train time data, and refers to the train time database based on the search condition. In a route search server provided with route search means for searching for a route from the ground to the destination including transfer of trains,
The train time database is configured by adding the same internal train identifier to the train time data of each train and the train time data of each train combined and / or divided in a predetermined route section, and the route search means , upon route search, the guide route which had been searched, when the internal train identifiers counted as the number of times transfer a number of changes, the train having the same internal train identifier to the guide route is included in succession, A route search server characterized by not counting the number of transfers. A route search server for receiving a route search request including a search condition from a navigation terminal and performing a route search, wherein the train time database stores train time data, and refers to the train time database based on the search condition. In a route search server provided with route search means for searching for a route from the ground to the destination including transfer of trains,
The train time database is configured by adding the same internal train identifier to the train time data of each train and the train time data of each train combined and / or divided in a predetermined route section, and the route search means , upon route search, the searched guidance route, if the internal train identifiers counted as the number of times transfer a number of changes, the train having the same internal train identifier to the guide pathway is included without successive A route search server , wherein the guide route is excluded from guide route candidates. A route search server for receiving a route search request including a search condition from a navigation terminal and performing a route search, wherein the train time database stores train time data, and refers to the train time database based on the search condition. In a route search server comprising route search means for searching for a route from the ground to the destination including train transfer, and guide route data creation means,
The train time database is configured by adding the same internal train identifier to the train time data of each train and the train time data of each train combined and / or divided in a predetermined route section, and the route search means , upon route search, the searched guidance route, if the internal train identifiers counted as the number of times transfer a number of changes, the train having the same internal train identifier to the guide pathway is included in succession, Without counting the number of transfers,
The guide route data creation means adds to the guide route data display data that does not display an item that makes the user image a transfer, or displays display that prompts the vehicle to move within the train. Route search server. The train time database adds the same internal train identifier to the train time data of each train and the train time data of each train combined and / or divided in a predetermined route section, and further the final destination of each train The route search means counts the number of times the internal train identifier changes for the searched guide route as the number of transfers for the route search, and the same internal train identifier is included in the guide route. Is not included in the number of transfers, all trains to be transferred in the guide route have the same internal train identifier, and the final destination of the first train and the last train is If they are the same,
9. The route search server according to claim 8, wherein the guide route data creation means adds display data that does not display an item that makes a user image transfer to the guide route data. The train time database adds the same internal train identifier to the train time data of each train and the train time data of each train combined and / or divided in a predetermined route section, and further the final destination of each train The route search means counts the number of times the internal train identifier changes for the searched guide route as the number of transfers for the route search, and the same internal train identifier is included in the guide route. Is not included in the number of transfers, all the trains to be transferred in the guide route have the same internal train identifier, and the final destination of the first train and the last train Are different,
The route search server according to claim 8, wherein the guide route data creating unit adds display data for performing display for prompting vehicle movement in the train to the guide route data. A route search server that receives a route search request including a search condition from a navigation terminal and performs a route search, and train time data of each train and trains of each train combined and / or divided in a predetermined route section A train time database configured by adding the same internal train identifier to time data, and a route for searching for a route from a departure place to a destination including a train transfer with reference to the train time database based on a search condition And a computer constituting a route search server provided with search means,
In the route search, the searched guidance route, if the internal train identifiers counted as the number of times transfer a number of changes, the train having the same internal train identifier to the guide pathway is included in succession, the number of times of transfer A program for executing a function as route search means that does not count the number of times. A route search server that receives a route search request including a search condition from a navigation terminal and performs a route search, and train time data of each train and trains of each train combined and / or divided in a predetermined route section A train time database configured by adding the same internal train identifier to time data, and a route for searching for a route from a departure place to a destination including a train transfer with reference to the train time database based on a search condition And a computer constituting a route search server provided with search means,
In the route search, for the searched guide route , the number of times the internal train identifier changes is counted as the number of transfers , and when the trains having the same internal train identifier are included in the guide route without being consecutive , a program characterized by executing the function of the route searching means excluding the guidance route from the guide route candidates. A route search server that receives a route search request including a search condition from a navigation terminal and performs a route search, and train time data of each train and trains of each train combined and / or divided in a predetermined route section A train time database configured by adding the same internal train identifier to time data, and a route for searching for a route from a departure place to a destination including a train transfer with reference to the train time database based on a search condition A computer constituting a route search server provided with search means and guide route data creation means,
In the route search, the searched guidance route, if the internal train identifiers counted as the number of times transfer a number of changes, the train having the same internal train identifier to the guide pathway is included in succession, the number of times of transfer The function as a route search means that does not count is executed,
Do not display an item that makes the user image a transfer to the guide route data, or execute a function as a guide route data creation means for adding display data for prompting vehicle movement in the train. A featured program. The train time database adds the same internal train identifier to the train time data of each train and the train time data of each train combined and / or divided in a predetermined route section, and further the final destination of each train Data is also added to the computer device.
In the route search, the searched guidance route, if the internal train identifiers counted as the number of times transfer a number of changes, the train having the same internal train identifier to the guide pathway is included in succession, the number of times of transfer Process as route search means that does not count
When the trains to be connected in the guide route are all the same internal train identifier, and the final destination of the first train and the last train is the same, display of an item that makes the user image transfer in the guide route data 14. The program according to claim 13, wherein a function as guide route creation means for adding display data not to be executed is executed. The train time database adds the same internal train identifier to the train time data of each train and the train time data of each train combined and / or divided in a predetermined route section, and further the final destination of each train Data is also added to the computer device.
In the route search, the searched guidance route, if the internal train identifiers counted as the number of times transfer a number of changes, the train having the same internal train identifier to the guide pathway is included in succession, the number of times of transfer The function as a route search means that does not count is executed,
Display data that displays information that prompts vehicle movement in the train in the guide route data when all the trains that are transited in the guide route have the same internal train identifier and the final destination of the first train and the last train are different. The program according to claim 13, wherein a function as a guide route creation unit for adding is executed.

Images