JP3456129B2 - Route search device - Google Patents

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a route search device for performing a route search from a starting point to a destination.

[0002]

2. Description of the Related Art In recent years, route search devices have become portable and have been used for multiple purposes. For example, there is a vehicle-mounted navigation device as a route search device for only roads.
This on-vehicle navigation device can search only roads, and can display the route from the departure place to the destination in the map displayed on the monitor or the like as the search result.

Further, as a route search only for routes, there is a route search for a railway, for example. For example, it is possible to know the charge from the departure station to the arrival station by searching the route of the railway. Further, recently, there is one that can search a route by combining a road and a track.

[0004]

By the way, it is sometimes desired to know the time required from the departure point to the arrival point. For example, it is effective to know the shortest required time when wanting to quickly reach a destination.

However, in any of the above route search devices, the route search target is limited, and when actually moving to the destination, considering the use of a taxi or walking, the range of use is limited. I will be lost.

Therefore, the present invention has been made in view of the above circumstances, and an object of the present invention is to provide a route search device which does not limit the means of transportation and can perform a route search close to the actual case. To do.

[0007]

In order to solve the above-mentioned problems, a route search device according to the present invention includes operation data holding means for holding operation data of transportation facilities, a departure point, a destination point, and the departure point. Movement information input means for inputting information about movement other than transportation between points from the point to the destination point, and a boarding point on transportation means close to the departure point input to the movement information input means based on operation data Departure point selection means for selecting the candidate of the, and the departure point selection means for selecting the candidate of the exit point in the transportation facility close to the destination point input to the movement information input means based on the operation data, the departure point, the destination point , Departure other than transportation, departure point based on the information about the boarding point selected by the boarding point selection means and the boarding point selected by the boarding point selection means It includes a required time calculation means for calculating the travel time between the route to the destination, and display means for displaying a required time required time calculation means has calculated.

This route search device is close to the departure point by the boarding point selection means based on the information of the departure point and the destination point input to the movement information input means and the operation data stored in the operation data storage means. Select a boarding point,
The drop-off point is selected by the drop-off selection means. In this route search device, the moving means and the moving speed of the moving means are input to the movement information input means as information regarding movement other than transportation.

In this route search device, information about a departure point, a destination, a movement other than transportation, a boarding point selected by the boarding point selecting means, and an exiting point selected by the boarding point selecting means by the required time calculating means. Based on, the required time between the routes from the departure point to the destination point is calculated. At this time, the required time calculating means calculates the required time for movement other than transportation based on the moving speed of the moving means.

Further, the route search device displays the required time between the routes from the starting point to the destination calculated by the required time calculating means on the display means.

With the route search device thus constructed, the operator can know the route that can travel from the departure point to the destination point in the shortest time, with reference to the required time displayed on the display means. .

[0012]

BEST MODE FOR CARRYING OUT THE INVENTION Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings. In the present embodiment, a case where a route search is executed by a personal computer or the like by a route search program recorded in a recording medium such as a disk will be described.

For example, a personal computer capable of executing a route search program is constructed as shown in FIG.

The personal computer 1 is a memory 3 which is an operation data holding means for holding operation data of transportation facilities, a starting point, a destination point, and movements other than transportation facilities between routes from the starting point to the destination point. Keyboard 7 which is a movement information input means for inputting information regarding
Based on the operation data, a boarding point selection unit 4a that selects a candidate for a boarding point in the transportation facility near the departure point input on the keyboard 7, based on the operation data,
Drop-off point selection unit 4 for selecting a drop-off point candidate in the above-mentioned transportation facility that is close to the destination point input on the keyboard 7
b, and a departure point, a destination point, a movement other than transportation, a departure point selected by the boarding point selection unit 4a and an exit point selected by the exit point selection unit 4b. CPU 4 having a required time calculating unit 4c for calculating the required time between the routes
And a monitor 5 which is a display unit for displaying the required time calculated by the CPU 4.

By having such a configuration unit, the personal computer 1 can execute a route search program to search for a route from a departure place to a destination.

Here, the transportation means is, for example, a train, and thus the operation data stored in the memory 3 is corresponding to the operation data of the train. The operation data is composed of data necessary for route search such as station name, position, travel time between stations, and the like.

Further, the movement other than the above-mentioned transportation means is such that the movement time and the movement distance such as movement by foot or movement to a taxi are temporarily determined.

Hereinafter, each component of the personal computer 1 will be described in detail.

In the personal computer 1, the CP
U4 has a memory 3, an interrupt controller 9 and a DMA.
(Direct Memory Acces) Controller 11 is connected.

The memory 3 is a data storage means for the CPU 4 to read and execute a program and temporarily store data.

In the memory 3, the above-mentioned route search program is written and operation data is written.
The DMA controller 11 is connected to the memory 3.

The DMA controller 11 has a function of directly transferring data to the memory 3 without passing through the CPU 4.

The interrupt controller 9 controls an IRQ (interputReQuest) signal line for performing interrupt processing. For example, the interrupt controller 9
While the CPU 4 is executing the processing, the expansion card (such as the video card 13 described later) performs the processing C by itself.
Process the interrupt triggered by the IRQ signal calling PU4.

The interrupt controller 9 is connected to a clock generator 6 for generating a fixed timing and a bus controller 10.

The bus controller 10 and the expansion bus 10 connected to the bus controller 10 are ISA (Industrial Standard Ar).
chitecture), PCI (Peripheral Component Interco)
nnect Bus) is implemented by an expansion bus such as nnect Bus) to control each expansion card. A keyboard 7 is connected to the bus controller 10.

The keyboard 7 is an input means for inputting data when the operator operates it. As described above, the departure place, the destination and the like required in the route search program are input from the keyboard 7. Depending on the various information input here, the CPU 5 executes the route search program.

The expansion bus 12 has a video card 1
3, an IDE controller 16, a disk drive controller (FDC) 17, and an I / O 18 are connected.

The video card 13 is equipped with a video chip, performs complicated video processing in place of the CPU 4, and outputs it to the monitor 5 connected to the video card 13. For example, when the route search program is executed, the map graphic is output to the monitor 5 via the video card 13.

The IDE controller 16 is a connection interface for the disk drive 14 of the hard disk.

Controller of the above disk drive (F
The DC) 17 is an interface with the disk drive 15 of the floppy disk, and also has a function as a controller of the disk drive 15.

For example, the personal computer 1 executes the route search program and the operation data recorded on the disc of the disc drive 14. Alternatively, the personal computer 1 executes the route search program and the operation data recorded on the floppy disk mounted in the disk drive 15.

A mouse 19, a printer 20, a modem and the like are connected to the I / O 18, and the I / O
Reference numeral 18 is a serial I / O for the mouse 19 and the modem, and parallel I / O for the printer 20.

For example, the mouse 19 is used for selecting a departure place and a destination in the route search program.

In the personal computer 1, the DMA controller 11, the interrupt controller 9 and the bus controller 10 described above are the chip set 8
Configured as.

Further, the memory 3, the CPU 4, the chipset 8, the expansion bus 12, the clock generator 6, the video card 13, the hard disk drive 1
4, the IDE controller 16, the floppy disk drive 15, the floppy disk controller 17, and the I / O 18 constitute the pixel data processing device 2.

The personal computer 1 configured as described above executes the route search program and performs the route search based on the information input by the operator.

The personal computer 1 executes the following processing by the route search program to calculate the required time of the selected route. This route search program is intended to calculate the time required for the route from the departure place to the destination based on the information about the departure place, the destination, and the operation data of the transportation facility input by the operator.

Specifically, a station near the departure place is selected from the departure place according to the flowchart shown in FIG. In addition, a station near the destination is selected according to the flowchart shown in FIG.

First, in the processing of selecting a station (nearest station) near the departure place from the departure place, as shown in the flowchart of FIG. 1, the departure place is designated in step S1. For example, the designation of the departure place is designated by the operator using the mouse 19 on the map displayed on the monitor 5. For example,
The information on the map displayed on the monitor 5 is incorporated in this route search program.

Then, step S2 following step S1
At, it is determined whether or not to perform a route search. Then, for example, in response to a route search continuation instruction from the operator, in a subsequent step S3, a search for a station (departure station) near the designated departure place is started. For example, the search for the departure station is performed for the stations within a radius of 2 km from the designated departure place.

Regarding the above retrieval result, the following step S
5 is displayed on the monitor 5. Here, if there are multiple stations within a certain area from the place of departure by the above search,
As the search result, the search results are displayed with the plurality of stations as candidates.

After the search, the operation by the operator is waited for, and in step S6, it is waited until one departure station is selected from the plurality of selected stations. Here, when one departure station is selected, the operator is requested to input the transportation means to the selected departure station and the traveling speed thereof.
Here, for example, an input request is made for a means other than the above-mentioned means of transportation such as a taxi or walking. Regarding the moving speed, for example, the input of the moving speed of the taxi or the walking speed is requested corresponding to the moving means.

When the moving means and the moving speed are input, in step S9, a route which can reach the destination earliest is searched. That is, the time required to reach each station listed as a candidate is calculated based on the transportation means and the traveling speed information, and the route that can reach the destination in the shortest time is searched.

That is, a route that can reach the target station in the shortest time is selected from the result of calculating the time required from the departure place to each station and the result of the time required from each station to the target station.

Then, in step S11, the search result is displayed on the monitor 5. For example, the route to the departure station that can reach the destination in the shortest time is displayed.

In a succeeding step S12, selection judgment of this search result is performed. Here, when the operator selects this search result, the route from the departure place to the selected departure station is determined and the route and the departure station are stored in the memory 3 in the following step S13.

If the search result is not selected in step S12, the already displayed route is excluded,
Perform a search again. Then, the re-search result is the above step S
At 11, the monitor 5 displays.

The above step S2 or step S6
In the selection step of No, if the determination is negative, that is, if the selection is not made, the process proceeds to step S4 or step S8, shifts to the manual input mode, and the main process is performed by the input of the operator. That is, the operator operates the keyboard 7
By the operation of, the nearest station, the means of transportation to the nearest station and the moving speed thereof are input. Specifically, as shown in FIG. 4, the operator selects the manual input mode (step S41) and inputs the nearest station (step S41).
42) 、 Transportation to the station (Taxi or walk)
And the speed thereof are input (step S43), and the return key of the keyboard 7 is pressed (step S44) to manually input each data.

Further, in step S10, the required time can be calculated in step S9 based on each data input in the manual input mode as described above.

Next, the process of selecting a station (nearest station) near the destination will be described. In this process, as shown in the flowchart of FIG. 3, the destination is designated in step S21. For example, the destination is designated by the operator using the mouse 19 on the map displayed on the monitor 5.

Then, a step S following the step S21.
In step 22, it is determined whether or not a route search is to be carried out. For example, in response to an instruction to continue the route search from the operator, in step S23, the search for a station near the designated destination (target station) is started. For example, the search for the destination station is performed for the stations within a radius of 2 km from the designated destination in the same manner as when the station near the departure place is searched.

Regarding the above retrieval result, the following step S
Displayed on monitor 5 at 25. For example, if there are a plurality of stations within a certain area from the destination by the above search, the search result is displayed with the plurality of stations as candidates.

After the search, the operation by the operator is waited for, and in step S26, it waits until one destination station is selected from the plurality of selected stations. Here, when one destination station is selected, the operator is requested to input the moving means to the selected destination station and the moving speed thereof. For example, as for the transportation means, an input request is made for a means other than the above-mentioned transportation means such as a taxi or a walk. Regarding the moving speed, it corresponds to the moving means, in this case,
Prompt for taxi speed and walking speed.

When the moving means and the moving speed are inputted, in step S29, the route which can reach the destination earliest is searched. That is, the time required to reach each station listed as a candidate is calculated based on the transportation means and the traveling speed information, and the route that can reach the destination in the shortest time is searched.

Then, in step S31, the search result is displayed on the monitor 5. That is, the route to the station that can reach the destination in the shortest time is displayed.

In a succeeding step S32, selection judgment of this search result is performed. Here, when the operator selects this search result, the route from the destination to the selected destination station is determined and the route and the destination station are stored in the memory 3 in the following step S33.

If the search result is not selected in step S32, the already displayed route is excluded,
Perform a search again. Then, the re-search result is the above step S
At 31, the monitor 5 displays.

The above step S22 or step S
In the selection step of 26, when the determination is negative, that is, when the selection is not made, the process proceeds to step S24 or step S28, shifts to the manual input mode, and the main process is performed by the input of the operator. That is, the operator operates the keyboard 7 to input the nearest station, the transportation means to the nearest station, and the moving speed thereof. In particular,
The operator performs the operation as shown in FIG.

Further, in step S30, the required time can be calculated in step S29 based on the data input in the manual input mode as described above.

The search results selected as described above and the selected route (starting point to starting station, destination to destination station)
Is printed out by the printer 20.

For example, when printing out, as shown in FIG. 5, in step S51, the station search mode is started, and in the following step S52, the search from the departure station to the destination station is performed. Then, in step S53, the search result is displayed on the monitor 5, and in the following step S54, the route selected by the operator is shown on the map and printed out.

The search result is, for example, as shown in FIG.
A window is displayed on the monitor 5. Specifically, as a search result, the departure station 51, the destination station 52, the used line 53, the total required time 54, the transportation means 55 to the departure station, the moving speed degree 56 or the speed designation 57, and the movement from the destination station The means 58, the moving speed degree 59 or the speed designation 60 are displayed.

Further, when there are a plurality of search results, the plurality of search results are displayed on the monitor 5 as "search 1" 50 and "search 2" 70.

Specific route search will be described with reference to FIG. For example, a case will be described where a destination M is set as a destination from a station D (not shown) that is on the same route as station A, station B, and station C.

Here, the route search program previously holds the following data as information.

Distance from station A to destination M is 1200k
It holds information that the distance from the B station to the destination M is 800 m, and the distance from the C station to the destination M is 400 m.
In addition, the information that the boarding time from the A station to the D station is about 10 minutes, the boarding time from the B station to the D station is about 14 minutes, and the boarding time from the C station to the D station is about 15 minutes is held.

When the destination M is selected as the destination in such a situation, the station A, the station B, and the station C are selected as candidate destination stations near the destination M in step S3 of FIG. It

Here, it is assumed that, as the movement by walking, a value such that the walking speed is 12 km / h (the walking speed is 5 km at 1 km) is input. In step S9 shown in FIG. 3, the required time from each selected station to the destination is calculated based on this information, and the shortest route is searched based on the calculation result.

That is, the walking time (moving time) is calculated by the calculation of walking speed × walking distance. When the movement of a taxi is included, the boarding time of the taxi and the walking time are calculated as the traveling time. As a result, D
It takes 16 minutes to get to M from the station and get off at A station, 18 minutes to get to M from D station to B station, and 18 minutes from D station to C station. The time required to get to the destination M by getting off is 17.5 minutes, and this result is displayed as the search result in step S31 shown in FIG.

Therefore, when the walking speed is 12 km / h, the destination M can be reached in the shortest time when the station A is set as the disembarkation station. This allows the operator to reach the destination in the shortest time based on this information.

Further, for example, when the walking speed is set to 6 km / h (the walking speed is assumed to take 10 minutes at 1 km), the time required when going to the destination M from the D station to the A station is 22 minutes or 22 minutes from D station to B station to destination M, and 19 minutes from D station to C station to destination M.
It will be a minute. That is, when the walking speed becomes 6 km / h, the person who gets off the station C can reach the destination M in the shortest time.

Therefore, the operator can search for a route that is close to the actual one in consideration of the moving speed such as the walking speed.
It is possible to accurately select the route that can be reached in the shortest time.

In the present embodiment, the operation data held may include data for subways and private railways, and may also include data for transportation such as buses. In this way, by increasing the amount of transportation operation data held for various types, it becomes possible to perform a more practical route search.

Information concerning the route search program,
Here, the above operation data and map data are stored on a CD-ROM.
You can also use the one recorded in. in this case,
The personal computer 1 is equipped with a CD-ROM drive.

Further, the moving distance on the map can be calculated by tracing the moving route in the map figure displayed on the monitor 5 with the mouse 19 and calculating the traced length according to the scale.

In addition, GPS (Global Positioning System)
By combining with m), it is possible to have a function to correct the route when the route is changed or get lost.

In the present embodiment, the case where the personal computer 1 executes the route search program to perform the route search has been described. However, the present invention is not limited to this, and the route search device may be configured from the beginning for the purpose of route search.

[0078]

The route search device according to the present invention is not limited to the operation data holding means for holding the operation data of the transportation means, the starting point, the destination point, and the transportation means between the routes from the starting point to the destination point. Movement information input means for inputting information regarding movement of the vehicle, a boarding point selection means for selecting a candidate for a boarding point in a transportation facility near the departure point input to the movement information input means, and operation data. Based on the, the exit point selection means that selects the candidate of the exit point in the transportation facility close to the destination point entered in the movement information input means, and the departure point, the destination point, the movement other than the transportation means, the selection point by the departure point selection means The required time between the routes from the departure point to the destination point is calculated based on the information about the picked-up point and the picked-up point selected by the pick-up point selection means. By providing the required time calculating means and the display means for displaying the required time calculated by the required time calculating means, the departure point, the destination point, the movement other than the transportation means, the boarding point and the getting off point selected by the boarding point selecting means. Based on the information about the exit point selected by the point selecting means, the required time calculating means calculates the required time between the routes from the departure point to the destination point, and the calculation result and the like can be displayed on the display means. .

Therefore, the route search device allows the operator to know the route that can travel from the departure point to the destination point in the shortest time, with reference to the required time displayed on the display means. Further, since the means of transportation is not limited, it is possible to search for a route that is closer to the actual case.

[Brief description of drawings]

FIG. 1 is a circuit diagram showing a configuration of a personal computer capable of executing a route search according to an embodiment of the present invention.

FIG. 2 is for executing a route search,
It is a flow chart for searching a station near a departure place.

FIG. 3 is for executing a route search,
It is a flow chart for searching a station near a destination.

FIG. 4 is a flowchart showing a procedure procedure in a manual operation mode.

FIG. 5 is a flowchart showing a processing procedure for searching a route from a departure station to a destination station.

FIG. 6 is a diagram showing an example of search results displayed on a monitor.

FIG. 7 is a diagram showing a map used for specific description of route search.

[Explanation of symbols]

4 CPUs, 5 memories, 7 keyboards, 11 monitors

─────────────────────────────────────────────────── ─── Continuation of front page (58) Fields surveyed (Int.Cl. ⁷ , DB name) G01C 21/00 G06F 17 / 30,17 / 60 G09B 29/00-29/10

Claims (4)

(57) [Claims] 1. An operation data holding means for holding operation data of transportation means, a starting point, a destination point, and information about movements other than the transportation means between routes from the starting point to the destination point are inputted. Based on the movement information input means and the operation data, based on the operation data, a boarding point selection means for selecting a candidate for a boarding point in the transportation facility near the departure point input to the movement information input means, Drop-off point selection means for selecting a candidate for a drop-off point in the transportation facility close to the destination point input to the movement information input means, the departure point, the destination point, movement other than the transportation means, the boarding point selection means From the departure point to the destination point based on the information on the boarding point selected by the vehicle and the exiting point selected by the exiting point selecting means. And a display means for displaying the required time calculated by the required time calculating means, wherein the movement information input means is information regarding movement other than the transportation means. As the route, the moving means and the moving speed by the moving means are input, and the required time calculating means calculates the required time for the movement other than the transportation based on the moving speed by the moving means. Search device. 2. The route search device according to claim 1, wherein the operation data holding means holds operation data of the transportation facility including position information of a train station. 3. The route search device according to claim 1, wherein the display means displays a map of the vicinity of the departure point and the vicinity of the destination input by the movement information input means. 4. The walking speed information is included in the information regarding the movement other than the transportation.
The route search device described.