JP3278102B2 - Electronic timetable system - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION The present invention is, the timetable data of transportation such as trains and electronic form, an electronic time table system which facilitates the search of electronic timetable.

[0002]

2. Description of the Related Art Conventionally, there has been a train timetable, which is a collection of the departure times and arrival times of destinations of transportation such as trains and airliners, and binding them.
Normally, the user checks the timetable by hand to find the desired departure time. However, it is extremely difficult for a person who has not used the timetable to quickly find a desired transportation system or route, and there is a problem that the bound timetable is inconvenient. Therefore, instead of such a bound timetable, this timetable data is digitized,
There has been proposed a so-called electronic timetable in which desired data can be immediately displayed on a screen. For example, JP
This is the electronic timetable described in Japanese Patent Application No. 92962/92. This electronic timetable displays necessary data such as route selection by simply inputting the departure station, destination station, and desired departure time, and can easily respond to timetable revisions. Things. Specifically, the route between the departure station and the destination station is searched, the fare of each searched route is calculated, the route is limited by the fare, and the time for each route is determined based on the desired departure time. Assemble the table. Then, software for calculating the arrival time at the destination station and data necessary for performing the calculation, for example, timetables such as departure times of all trains, types of express trains, express trains, operation sections, and average travel time between stations. By providing a storage device that stores the timetable data necessary to assemble the train, you can simply enter the departure station, destination station and desired departure time,
The type of express, express, departure time, arrival time, and fare can be displayed on the screen. Further, in this electronic timetable, by providing communication means capable of communicating with a database or a personal computer, when the timetable is revised, the timetable data is directly received from the database using this communication means, and the timetable data in the storage device is converted. Can be rewritten.

[0003]

As described above, the conventional electronic timetable has a shorter retrieval time and is more convenient to use than the method of turning over a bound timetable. Items to be entered by the user when assembling the table and displaying it on the screen (for example, line names and train nicknames)
There is a problem that it is not possible to search from the site and lacks flexibility. In addition, the conventional electronic timetable calculates fares for multiple routes between these stations based on the input departure station and destination station,
Since the route is selected according to the size of the fare and the timetable is assembled, for example, when the departure station is input as A and the destination station is input as B, if the processing is performed according to the above-described conventional technique, the same route is always selected. Will be. However, when calculating trips, it varies from person to person, and it is possible to go to a destination while performing various sightseeing without necessarily selecting a cheap route or a shortest route to the destination. In such a case, it is very convenient if the user can determine his or her own route while looking at the map, but there is a problem that conventional technology cannot cope with such a case. The purpose of the present invention is
An object of the present invention is to provide an electronic timetable system that solves these conventional problems and that can easily search electronic timetable data based on route names and station names displayed on a map.

[0004]

An electronic timetable according to the present invention
To achieve the above objectives, the system will
Page as image data, and the time
Multiple station names that exist on each page of the table
The earliest time data and the earliest time data
The corresponding first station name and the latest time on the page
Second station name corresponding to the time data and the latest time data
Storage means for storing information about
While displaying map information including the route connecting the station,
Displays the page corresponding to the timetable data finally searched.
Display means for indicating, and the location displayed by the display means.
From the map information, the line name, boarding station, getting off station, desired boarding time and
Is a designation input means for designating a desired disembarkation time;
The plurality of station names and the earliest time data stored in a row
Data, the first station name, the latest time data, and the
Refer to the station name of No. 2 and specify the
Line name, boarding station, and getting off station.
The estimated posting time of the page is calculated, and the estimated
The time specified by the specification input means with reference to the mounting time
Request a page that corresponds to the desired boarding time or desired boarding time
Search means . As a result, the timetable can be searched more quickly.

[0005]

[0006]

Embodiments of the present invention will be described below in detail with reference to the drawings. FIG. 1 is an overall configuration diagram of an electronic timetable system showing one embodiment of the present invention. In FIG. 1, reference numeral 1 denotes a mouse and a keyboard for designating and inputting a line name, a boarding station, a getting off station, a desired boarding time, a desired getting off time, etc. from the map information displayed on the screen (click directly on the screen or input characters). , 2, 3, 4 are search engine (drive) units, 5, 6, 7, and 10 are storage units, 9 is a display unit, 12 is a print unit, and 8 and 11 are display and print control units. It is. The message (input information) input from the input control unit 1 is passed to the route search engine unit 2, the timetable search engine unit 3, or the content search engine unit 4. As a result, the information is retrieved from the station / route information storage / storage unit 5, the timetable page storage / storage unit 6, or the content storage / storage unit 7, and is guided to the display unit 9 via the display control unit 8. The display unit 9 displays a blinking display of a route in a map information, a display of a timetable, and guidance information (content holding) of a station, a route, an airfield, a sightseeing spot, and the like as a still image, a moving image, and a 3D image.
(3D), and are displayed by CG (computer graphic), and are realized by a CRT or the like. Also, C
By specifying the information displayed on the RT or the like by the input control unit 1, the information is stored in the search result history storage unit 10;
Further, the stored information is guided to the display unit 9 or the printing unit 12 via the display control unit 8 or the printing control unit 11.

FIG. 7 is a diagram showing an example of map information displayed on the display unit of FIG. As the initial screen of the display unit 9,
The entire map of Japan such as 601 is displayed. By picking the area desired by the user from this screen 601, for example, the area around "Hokkaido" with a mouse or the like,
As shown in 602, an enlarged map of the picked portion and the route and station name are displayed (note that only the navigation route is displayed on the map 602, and the route on land is omitted). On this screen 602, the route is first determined.
If the route is clearly known, the route may be specified by picking the route on the map or directly inputting the route. However, if the route is not clearly understood, the user can input the station name desired by the user in a dialog box or the like as shown at 603 or pick a station on the map as shown at 604. The name of the line passing through the station is displayed (in FIGS. 603 and 604, Sapporo is picked up, so the Hakodate Main Line is displayed).

[0008] In the case of FIG. 603, a search from the station name (when the station name is entered in the upper two boxes, the line name is displayed in the lower box) and a search from the line name (in the upper box, When you enter the district name (ride station and drop-off station), the name of the line passing through those stations will be displayed in the box at the bottom, and search from the train nickname (if you enter the train nickname in the top box, The name of the line having the nickname of the train is displayed in the box of). In addition, guidance information is stored for each point such as a station, a line, an airfield, and a sightseeing spot displayed on the map 604, and when a point in those points is designated, or when the map 604 is designated.
When picked above, guidance information for each point is displayed in the box. The user selects a desired route from among them, and the selected route is displayed on the map 60.
4 is blinked. When the route is determined, the boarding station, the disembarking station, the desired departure time, and the like are input from the screen 605. As described above, the time table data is searched and displayed based on the information such as the route name and the time selected on the map. An outline of a method for realizing this will be described. A transparent sheet is placed on top of the map data as image data, and a transparent object is written from above on the transparent sheet at the location to be selected on the map, and as a property of the object, it corresponds to the page on the route Index information for the image data is provided as code information. When the relevant part is selected, necessary code information is acquired by the object covered thereon, and an action is performed.

FIG. 2 is a diagram showing a timetable data file according to the present invention. (A) Timetable data (page)
And (b) shows a page management index. When retrieving a timetable data (image data) file, the file is managed in page units using page numbers as key values, and each page is a route code and upper and lower division code (up train, down train classification) Is managed as a key value, the corresponding page is specified, and a route code and an upper and lower division code are specified as search keys. In (a), in order to realize image data for each page of the timetable and screen operations on the page,
Transparent object buttons and sheets pasted,
Page numbers are managed and stored in page units as key values. The boxes on the left side of FIG. 2A are the object buttons and the sheets, and these are held for the pages of the timetable using the page numbers as key values. In (b), the information required for searching the timetable page is stored in the form of a page number /
The number of stations, the start station time, and the end station time are managed as page management indexes. In FIG. 2B, a search key is described on the left side, and stored information is described on the right side.

FIG. 3 is an operation flowchart of the route search engine unit in FIG. As input data from the input control unit 1, a route name, a boarding station, a drop-off station, a desired boarding time, a desired getting-off time, and whether the vehicle is going up or down are input. First, the route search engine unit 2 acquires a route code corresponding to a route name stored in the station / route information storage unit 5 (step 301). Next, it is determined whether the boarding station and the disembarking station are both input (step 30).
2) If both are input, up / down is determined from the station information for each route in the station / route information storage 5 (step 303). On the other hand, when only one of the boarding station and the disembarking station is input, the up / down specified by the user is adopted, and then the timetable search engine unit uses the route code, the station code, the time, and the up / down as parameters. 3 is started (step 304).

FIGS. 4 and 5 are operation flowcharts of the timetable search engine unit in FIG. As described above, the route search engine 2 to the timetable search engine 3
Are activated, the route code, the station code, the time, and the up / down are input as parameters. First, the timetable search engine unit 3 obtains the first timetable page of the posting unit from the route code and the information on the up / down (for example, the code of the Keiyo line + up) (step 401). next,
The specified time is compared with T _if (step 402).
T _if is the earliest estimated time at station i, and T _il is i
This is the latest estimated time at the station. If the specified time ≦ T _if , that is, if it is determined that the specified time is before the first departure of the route, the first page is set as the search page (step 4).
03). On the other hand, in other cases, that is, the specified time> T _if
In the case of, it is determined whether the T _{an if} ≦ specified time ≦ T _il (step 404), if it is true, and the current page search page (step 405). If false, it is further determined whether the specified time> _Til and the last page is reached (step 406). If true, it is determined that the time after the last train is specified, and the last page is determined. Is set as a search page (step 408). If false, time table information for the next page is acquired (that is, T _if and T _il are updated) (step 407). And
The processing after the determination in step 404 is repeatedly performed. Then, when the page has been searched, the display control unit 8 and the print control unit 11 are activated (step 409).

FIG. 8 is a diagram showing timetable data stored in the timetable page storage. The timetable page storage unit 6 stores timetable data as shown in FIG. Using this storage unit 6, a page search of the timetable will be described in detail. As shown in FIG. 8, the time table has a time T1 at the top of the page and a time T2 at the bottom right corresponding to each page of the timetable. Further, assuming that the average required time from the station 1 to the station n is h, the estimated publication time of each page at the station i (1 ≦ i ≦ n) is obtained by the following equation. Earliest estimated time T _if = T1 + {(i-1) / (n-1)} * h (1) Latest estimated time T _il = T2-｛(ni-1) / (n- 1)｝ * h (2) Accordingly, it is possible to estimate a page at a station designated by the user and at which the designated time is published.

FIG. 6 is an operation flowchart of the content search engine unit in FIG. As data input from the input control unit 1 to the content search engine unit 4, any one of a station name, a line name, and a train nickname is input. First, the content search engine unit 4 converts the input data of the station name, the line name, and the train nickname into the corresponding codes by referring to the station / line information storage unit 5 (step 501). Next, it is determined whether or not the content corresponding to the code exists based on the information in the content storage unit 7 (step 502). If there is, the display control unit 8 is started (step 503). As a result, a map around the station, a train configuration, sightseeing spot information, and the like can be displayed from the main station, the line, and the like, which is useful for improving services. If there is no content, the process ends without displaying anything. Although the electronic timetable system has been described in the present embodiment, each engine unit and each storage unit for achieving the present system may be, for example, a CD.
The above-described electronic timetable system can be realized by storing the information in a storage medium such as a ROM and reading the information by a computer.

[0014]

As described above, according to the present invention,
Specify the desired route, boarding station, and getting off station from the map including the stations, routes, etc. displayed on the screen, and specify the desired page and either the desired boarding time or the desired getting off time, and the corresponding page of the timetable Can be searched and displayed, so that the user can visually select the route, and the usability is improved. Furthermore, since the designation method can also be specified from the nickname of the train or the line from the station name, flexible search is possible.

[Brief description of the drawings]

FIG. 1 is an overall configuration diagram of an electronic timetable system showing one embodiment of the present invention.

FIG. 2 is a diagram showing a timetable data file in the present invention.

FIG. 3 is an operation flowchart of a route search engine unit in FIG. 1;

FIG. 4 is a part of an operation flowchart of a timetable search engine unit in FIG. 1;

FIG. 5 is another part of the operation flowchart of the timetable search engine unit.

FIG. 6 is an operation flowchart of a content search engine unit in FIG. 1;

FIG. 7 is a diagram showing an example of map information displayed on the display unit of FIG. 1;

FIG. 8 is a diagram of timetable data stored in a timetable page storage according to the present invention.

[Explanation of symbols]

DESCRIPTION OF SYMBOLS 1 ... Input control part, 2 ... Route search engine part, 3 ... Timetable search engine part, 4 ... Content search engine part, 5 ...
Station / route information storage / storage unit, 6: timetable page storage / storage unit, 7: content storage / storage unit, 8: display control unit, 9 ...
Display unit, 10: search result history storage and storage unit, 11: print control unit, 12: printing unit.

Continuation of front page (56) References JP-A-2-123392 (JP, A) JP-A-8-87236 (JP, A) JP-A-2-123393 (JP, A) JP-A-63-239565 (JP) JP-A-2-62688 (JP, A) JP-A-7-229980 (JP, A) JP-A-2-3856 (JP, A) JP-A-56-165182 (JP, A) 7-302283 (JP, A) Japanese Utility Model Showa 62-161271 (JP, U) (58) Fields investigated (Int. Cl. ⁷ , DB name) G09D 1/00

Claims (1)

(57) [Claims] 1. A timetable that stores each page as image data and exists for each page of the timetable.
Multiple station names and earliest time data on the page
And the first station name corresponding to the earliest time data,
The latest time data and the latest time on the page
Storage means for storing information relating to the second station name corresponding to the data ; display means for displaying map information including at least the stations and the routes connecting the stations; Display means for displaying a corresponding page; and a route name, a boarding station, and the like from map information displayed on the display means.
A designation input means for designating a disembarkation station, a desired boarding time, and a desired disembarkation time, the plurality of station names stored in the storage means, and the earliest
Time data, the first station name and the latest time data
The second station name and the second station name, and
Line name, boarding station, and getting off station
Estimated publication time of each page in each page, and found each page
With reference to the estimated publication time of the hour,
It corresponds to the specified desired boarding time or desired drop-off time
An electronic timetable system comprising: a search unit for obtaining a page .