JPH07168995A - Route search and display device - Google Patents

Abstract

PURPOSE:To provide a route search and display device which is capable of correcting the reference of a route search, adding and storing bypath data, etc., for route search data and is provided with a learning function. CONSTITUTION:This device is composed of a destination input means 2 making a user perform an input, a reading exclusive storage means 3 storing route search data 34, etc., a reading and writing possible storage means 6 storing auxiliary route search additional data 41 and link cost corrected amount 48 correcting link cost data to be used at the time of a route search, a route search means 4 searching an optimum route including a bypath, etc., based on these data and a display means 5 displaying the obtained optimum route.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a route search display device for an automobile or the like.

[0002]

2. Description of the Related Art As a route search display device for searching a route to a destination for a moving mechanism, especially an automobile, and displaying an optimum route, a conventional route search display device as shown in FIG. 500 is used. In FIG.
The azimuth sensor 11 includes a geomagnetic sensor that detects the absolute traveling azimuth of the automobile and an optical gyro that detects the relative traveling azimuth of the automobile. Reference numeral 12 is a distance sensor that generates a pulse according to the rotation speed of the wheel, and 13 is various sensor signals such as an ON / OFF signal of a brake switch and a parking switch, and a power supply voltage monitoring signal.

Reference numeral 14 is a sensor signal processing section for processing sensor signals input from the direction sensor 11, distance sensor 12, etc., and 15 is a GPS (Global Positioni).
ngSystem) receiver, which can obtain the position (latitude, longitude) of the reception point by receiving and calculating radio waves transmitted from a plurality of satellites.

A CD-ROM drive 16 reads the map data from a CD-ROM 17 in which the map data is recorded. Reference numeral 18 denotes a display / operation unit installed in the passenger compartment, which is a liquid crystal display 18A for displaying a map and the current traveling position and direction of the automobile.
A touch panel 18B provided on the front surface of A.

An enlarged map is displayed on the touch panel 18B,
A switch for instructing reduction or the like, a switch for instructing route search, a switch for selecting a destination from the place names displayed on the liquid crystal display 18A, and the like are provided. Reference numeral 19 denotes a main body of the apparatus, which is installed in a trunk room or the like.

Next, the structure of the apparatus main body 19 will be described. 20 is a CPU (central processing unit) for performing various calculations,
Reference numeral 21 denotes a ROM (read only memory) in which programs for various calculations performed by the CPU 20 are stored, and 22 denotes a direction sensor 11, a distance sensor 12, a GPS receiver 15, a CD.
A memory (DRAM) for storing data from the ROM drive 16 and the like, a calculation result in the CPU 20, and the like.

Reference numeral 23 is a backup memory (SRAM) for holding necessary data even when the power supply to the apparatus main body 19 is stopped, and 24 is the liquid crystal display 18
It is a memory (kanji, font ROM) in which patterns such as characters and symbols to be displayed on A are stored.

Reference numeral 25 is an image processor for forming a display image based on map data, current position data of an automobile, etc. 26 is map data output from the image processor 25, current position data and kanji, and font ROM 24. This is a memory (VRAM) for storing an image to be displayed on the liquid crystal display 18A by synthesizing Chinese characters and fonts such as place names and road names.

Reference numeral 27 is an RGB conversion circuit for converting the output data of the VRAM 26 into a color signal, and the converted color signal is supplied from the RGB conversion path 27 to the liquid crystal display 18A.
Is output to. 28 is a communication interface.

FIG. 9 shows a format of data stored in the CD-ROM 17. In the figure, 120 is a disk label, 121 is a drawing parameter, 122 is the leaf management information, and 123 is the leaf.

In this map sheet 123, background data for each unit map obtained by dividing a topographic map of Japan by latitude and longitude,
Character data, road data, etc. are stored.

These map leaves are set from map leaves that roughly describe a wide area to those that describe a narrow area in detail. Each map leaf is a map display level A2 that describes the same area.
00, B201, C202.

Map display levels A200, B201, C2
02 is B201 from A200 and C202 from B201
Is described in more detail. In addition, each map display level A
200, B201, and C202 are, for example, B201, map display management information 230 and a plurality of units 2
It is composed of 31.

The unit 231 describes a divided area obtained by dividing the area of each map display level into a plurality of areas. Each unit 231 includes a unit header 301 and a character layer 3.
02, a background layer 303, a road layer 304, an option layer 305, and the like.

The character layer 302 stores the place names, road names, facility names, etc. displayed on the map, and the background layer 30
Data for drawing roads, facilities, etc. is recorded in 3 and road layers 304 relate to coordinate points (nodes) and lines (links) that describe roads including intersections, as shown in FIG. Data such as node number, latitude, longitude, link number of link, link distance, etc. are stored.

In FIG. 10, circles indicate nodes, and lines between the nodes indicate links. Also, the black circle with the node number 4 indicates an intersection node. The data recorded in the road layer 304 is not directly involved in the map display, but is used as road network information such as map matching.

In FIG. 9, reference numeral 124 denotes route search data, which are search data 125 to 127 for each layer from layer 0 for a narrow region to layer n for a wide region.
Is recorded.

The search data of each of the layers 125 to 127 is composed of node connection data 128, route search evaluation value (link cost) data 129, and route display data 130. The node connection data 128 is, as shown in FIG.
It is data indicating which node each of the nodes a to g, x, and y is connected to. For example, node c is no, and data indicating that the node is connected to a, d, f, and y.

The link cost data 129 is shown in FIG.
As shown in, the link cost of the link between each node is, for example, [5], and the link cost of the link between node a and node b is [5]. [10] indicates that the link cost of the link between the node a and the node b is [20].

The link cost is obtained from link cost link = distance / set speed, and the set speed is set according to the road type and the road width as shown in FIG. 12, for example. As is clear from the link cost formula, the link cost is an evaluation value indicating the expected transit time of the link.

The route display data 130 is recorded with data for displaying the route selected by the route search on the display map.

Next, this operation will be described. In FIG. 8, the output of the azimuth sensor 11 and the output of the distance sensor 12 are sent to the CPU 20 via the sensor processing unit 14. CP
At U20, the current position of the vehicle is calculated and the latitude and longitude of the current position are obtained. Further, the current position is corrected based on the data from the GPS receiver 15.

On the basis of the present position thus obtained, the map data of the unit corresponding to the present position is stored in the CD.
-The ROM data is read from the CD-ROM 17 by the ROM drive 16 and the map data is transferred to the communication interface 28.
It is stored in the memory (DRAM) 22 via the.

A part of the map data stored in the DRAM 22 is read by the CPU 20, converted into image data by the image processor 25, and written in the image memory 26. The image data stored in the image memory 26 is R
It is converted into a color signal by the GB conversion circuit 27 and sent to the liquid crystal display 18A to display a map in a predetermined range centering on the current position.

If the map data read from the DRAM 22 includes character codes, patterns corresponding to these character codes and symbol codes are read from the Kanji / font ROM 24 and the liquid crystal display 18A is displayed.
On the map, letters such as place names and symbols such as schools are displayed.

The liquid crystal display 18 is also based on the traveling speed and traveling direction which are sequentially obtained as the automobile travels.
The current position displayed on A is sequentially changed.

Next, regarding the route search operation of the conventional example,
This will be described with reference to FIGS. 13 and 14. As shown in FIG. 13, the destination is set in step S130. The destination is set by operating the touch panel 18B, for example, by inputting the address of the destination or by designating a point on the map displayed on the liquid crystal display 18A.

In step S131, it is determined whether or not to start the route search. This determination is made based on whether or not the route search switch on the touch panel 18B of the display device 18 has been operated. When it is determined in step S131 that the route search switch has been operated, the process proceeds to step S132, and route search is performed.

As shown in FIG. 11, this route search is performed from the starting point (current position node) x to the destination node y.
The link cost of all the routes is added and the route with the lowest link cost is selected. In the case of FIG. 11, the total link cost of the links x-a-c-d-g-y (1
Since 0 + 5 + 5 + 5 + 5 + 5 = 35) is the smallest, the route connecting the links x-a-c-d-g-y is selected.

The route selected in step S132 is displayed in red, for example, on the display map of the liquid crystal display 18A in step S133.

FIG. 14 shows the step S132 of route search in FIG. 13 in more detail.

In FIG. 14, first, in step S140, a departure place node and a destination node closest to the positions of the departure place and the destination are selected. In FIG. 11, the node x is selected as the departure node and the node y is selected as the destination node.

Next, in step S141, the route search data including the departure node x is read from the CD-ROM 17,
In step S142, a route search on the departure side is performed. In this route search, as described above, the route with the lowest total link cost is selected.

Next, in step S143, it is determined whether or not the route searched in step S142 is connected to the destination node. Since the distance from the starting point to the destination is relatively short, as shown in FIG. 11, in step S141,
When the destination node y is included in the data read from the CD-ROM 17, it is determined as YES in step S143, but when the departure place is far from the destination,
No determination is made in step S143, and step S144
Proceed to.

In step S144, the route search data including the target node y is read from the CD-ROM 17,
In step S145, a route search on the destination side is performed. In step S146, it is determined whether or not the route selected by the route search on the destination side in step S145 is connected to the route search on the departure side.

If the result of this determination is NO, the search hierarchy is set to 1 in step S147 in FIG.
Rank up. If the read data in steps S141 and S144 is the route search data of layer 0, the rank of rank 1 is increased in step S147.

Next, in step S148, the starting node and the destination node are reset, and the process returns to step S141.

In FIG. 15, the distance between the starting point and the destination is long, and steps S143 and S1 in FIG.
It is the figure which showed the operation | movement when it is determined by No that it is 46 in an easy-to-understand manner.

When the route selected in the route search on the departure side is not connected to the destination node and the route selected in the route search on the destination side is not connected to the route searched in the departure route search , The route search data 126 of the layer 1 is read, and the departure node 131 and the destination node 132 are set.

When the route shown by the solid line is searched by the route search in the layer 1, it is determined as YES in step S147 of FIG. 14, the process proceeds to step S149, and step S149 is executed.
In 149, the route from the starting point to the destination is constructed, and the display data of the route searched in step S150 is created,
This ends the route search.

FIG. 16 shows a display example on the liquid crystal display 18A. In FIG. 16, 131 indicates a departure place (current position), 132 indicates a destination, and a broken line indicates a route selected by the route search.

[0042]

However, the route search in the above-mentioned conventional example is aimed at the basic road or more (for example, the road width of 5.5 m) or more. Therefore, the route search data is not prepared for the basic road or less, The route could not be searched. Further, even if the route is equal to or more than the basic road, the route is searched at a predetermined cost for each link. Therefore, when searching the route from the same starting point to the same destination, the route search evaluation value ( Only the same route could be searched depending on the (link cost) data.

In the above conventional route search to the destination,
Although there is a route that the driver wants to search, such as a loophole, a route that is more than the basic road and that depends only on the link cost data is the search target,
The driver's intention was not reflected.

In the route search in the above-mentioned conventional example, route search data below the basic road and link cost correction amount data, which are information about routes such as loopholes, cannot be exchanged. There is also a problem in that the route such as a loophole cannot be reflected in one's route search.

The present invention is intended to solve the above problems, and a first object thereof is to provide a route search display device capable of performing route search by modifying the route search criteria. is there.

A second object of the present invention is to provide a route search display device capable of reflecting information such as loopholes of others on route search during route guidance.

[0047]

In order to achieve the above object, a route search display device according to the present invention comprises a destination input means for inputting a destination and a set of links connecting a road network with nodes. In addition to recording the road data, the read-only storage means that stores the route search evaluation value set corresponding to each link, and the route from the departure point to the destination are searched based on the route search evaluation value. A route search means and a display means for displaying the route searched by the route search together with a map, the auxiliary route search additional evaluation value of the route search evaluation value, and the route search evaluation value. And a route readable / writable storage unit storing at least one of the route search additional evaluation value and the correction amount, and the route search unit records the route in the read-only storage unit. Characterized by being configured for searching for a route based on the route search additional evaluation value and the correction amount to be stored in the search evaluation value and the read-write memory means.

A second aspect of the present invention is a readable / writable storage means for storing at least one of the auxiliary route search additional evaluation value and the route search evaluation value and the correction amount for the route search additional evaluation value. Is configured to be interchangeable.

[0049]

In the route search display device according to the present invention, the route search means stores the route search data stored in the read-only storage means and the readable / writable storage means based on the destination information input from the destination input means. The optimum route is searched using the supplementary route search additional data and the link cost correction amount for correcting the link cost data used during the route search, and the obtained optimum route is displayed on the display means.

Further, the route search display device according to the present invention is
By replacing the readable / writable storage means storing at least one of the route search additional evaluation value, the route search evaluation value and the correction amount for the route search additional evaluation value,
The optimum route including the route such as a loophole based on the data created by another person is displayed on the display means.

[0051]

Embodiments of the present invention will be described below with reference to the accompanying drawings.

FIG. 1 shows a route search display device 1 according to the present invention.
3 is a functional block configuration diagram of FIG. In the figure, a route search display device 1 according to the present invention includes a destination input means 2 for a user to input a destination, a read-only storage means 3 for storing route search data and the like, and an auxiliary route search. A readable / writable storage means 6 for storing additional data, a link cost correction amount for correcting link cost data used at the time of route search, and a route search means 4 for searching for an optimum route including a route such as a loophole based on these data. , And display means 5 for displaying the obtained optimum route. FIG. 2 shows the configuration blocks of the route search display device 1 shown in FIG.
Is used as the read-only storage means 3 in the present embodiment, C
Data format stored in the D-ROM 17,
FIG. 4 shows a part of the data format stored in the readable / writable storage device 29 such as a mini disk (MD) or an IC card used as the readable / writable storage means 6.

The route search data 34 shown in FIG. 3 is the same as the conventional example, from the hierarchy 0 search data 35 to the hierarchy n search data 3.
Each layer 35 to 37 is composed of node connection data 38, standard link cost data 39, and route display data 40.

The data stored in the readable / writable storage device 29 is composed of the route search additional data 41 and the link cost correction amount 48 shown in FIG. Route search additional data 4
Reference numeral 1 is route search data below the basic road, which is not used in the route search data of the CD-ROM 17, which is used for route search.

The route search additional data 41 consists of additional data from the layer 0 additional search data 42 to the layer n additional search data 44, which are respectively layer 0 shown in FIG.
This corresponds to the search data 35 to the hierarchy n search data 37.

That is, the node connection additional data 45 corresponding to the node connection data 38 and the standard link cost additional data 4 corresponding to the standard link cost data 39.
6, and further comprises route display additional data 47 corresponding to the route display data 40.

The link cost correction amount 48 has the same number corresponding to the standard link cost data 39 and the standard link cost additional data 46.

In the conventional route search data, new route search data cannot be added or created, and
Although there is only one type of link cost data in each layer, in the route search of this embodiment, new route search data can be created and added, and standard link cost data 39 and standard link cost addition This is different from the conventional one in that the combination of the data 46 and the link cost correction amount 48 is used as the link cost data in the route search.

The node connection additional data 41 and the route display additional data 47 are newly created and added in the same format as the conventional example based on the data of the road layer. The standard link cost additional data 46 is the actual time spent traveling between nodes.

The link cost correction amount 48 is such that when the driver travels on a route such as a loophole in which the standard link cost data 38 or the standard link cost additional data 46 is prepared in advance, the loophole or the like at the time of future route search. The link cost is reduced and corrected so that the route is selected.

The link cost correction amount 48 is used when the driver wants to record a route from the designated route by way of a route such as a loophole until the driver returns to the route of the route guidance as a route. Be changed.

The value at this time is calculated so that the link cost amount of the route such as a loophole deviating from the route guidance route becomes smaller than the link cost amount of the route guidance route which should have originally traveled. The route and the like are selected when the route is searched.

Since the link cost amount of the route such as a loophole is smaller than the link cost amount of the route guidance route, if a coefficient is multiplied by α, then α <link cost of the route guidance route which should have originally traveled / It becomes the link cost of the route such as the loophole, and the link cost correction amount to the standard link cost of the route such as the loophole is the link cost correction amount = (α-1) * standard link cost of the route such as the loophole. With the above configuration, it becomes possible to reflect the driver's preference during route search.

FIG. 5 shows the flow of the route search operation of the above embodiment, and FIG. 6 shows the change of the link cost correction amount 48, the creation of new route search data 41, and the addition at the time of route guidance. It shows the flow.

In FIG. 5, in the present embodiment, step S
At 51, the destination is set. This is performed by operating the switch of the touch panel 18B. In step S52, it is determined whether or not to start the route search.

When the route search switch is operated on the touch panel 18B, the determination in step S52 is YES, and the process proceeds to step S53. In step S53, the standard link cost data 39 from the CD-ROM 17
Is read, the link cost correction amount 48 is read in step S54, and the standard link cost additional data 46 is read in step S55.

In the next step S56, the route search is performed only by the standard link cost data 39, and the route data selected by the route search is held in the storage device.
In the next step S57, the standard link cost data 39
Then, the route search is performed by the link cost data including the link cost correction amount 48 and the standard link cost additional data 46, and the selected route data is held in the storage device.

In the next step S58, the standard route selected only by the standard link cost data 39 and the route selected by the link cost data obtained by combining the standard link cost data 39 and the link cost correction amount 48 are different from each other. It is displayed on the liquid crystal display 18A in different colors.

FIG. 7 shows a liquid crystal display 1 having two paths.
8A shows a display example displayed in 8A, where N is a standard route and M
Is the modified route. By displaying the two routes, the driver can select the route according to his / her preference and road conditions.

Furthermore, by exchanging the link cost correction amount 48 and the route search additional data 41 with those of others, routes such as loopholes that have never been traveled in the past are candidates for route search. It becomes possible to

Next, referring to FIG. 6, in the present embodiment, it is determined in step S61 whether or not it is route guidance. If the determination in step S61 is yes, step S6
Go to 2. In step S62, it is determined whether or not the current position is off the route. In step S62, if the current position is off the route and the determination is yes, the process proceeds to step S63.

If the current position does not deviate from the route, it is determined to be no, and the process returns to step S61.

In step S63, the time required for passing between each node is updated and stored based on the standard link cost additional data 46.

In step S64, it is determined whether or not there is a return to the route guided route. If the determination in step S64 is yes and the route is guided back,
It proceeds to step S65.

If the route has not been returned to the guided route, the determination is NO, the process returns to step S63, and the time required for passage between the nodes is updated. Step S65
Then, the driver is made to determine whether or not to add a route such as a route through which the vehicle has run to future route search.

In step S65, the touch panel 1
By 8B, the switch for adding the route such as the route through which the vehicle has traveled to the future route search is operated, and if the determination is yes, the process proceeds to step S66. If the determination in step S65 is NO, there is no need to reflect it in future route searches, so the process returns to step S61 with the link cost amount unchanged.

In step S66, it is determined whether the road is equal to or more than the basic road, or whether the road has already been recorded. It is judged as YES in step S66, and the road is a road above the basic road or a thin line below the basic road, but it is already recorded as a loophole, and standard link cost data 39 and standard link cost additional data 46 already exist. To change the link cost correction amount 48 corresponding thereto.

If it is determined as NO in step S66 and it is a new loophole or the like below the basic road, the node connection additional data 45 and the route display additional data 47 are newly created based on the data of the road layer as in the conventional example. Created on the storage device 2
Add to 9.

As described above, according to the above-described embodiment, since the standard link cost data, the standard link cost additional data, and the link cost correction amount data are used, a loop route or the like is used as a candidate when searching for a route to a destination. Is possible. Further, it becomes possible to reflect the route of one's liking at the time of route guidance.

[0080]

Since the route search / display apparatus according to the present invention is configured as described above, it has an advantage that the driver himself / herself can correct the route search to the destination.

Further, by exchanging with another storage device in which the link cost correction amount and the route search additional data are recorded, which is created by another person, the information such as the escape route of the other person can be reflected at the time of one's route search. It has the advantage of being possible.

[Brief description of drawings]

FIG. 1 is a functional block diagram of an embodiment of a route search display device according to the present invention.

FIG. 2 is a block diagram of the embodiment of FIG.

FIG. 3 is a diagram showing a storage data format of a read-only storage means.

FIG. 4 is a diagram showing a storage data format of a readable / writable storage means.

5 is a flowchart of the route search process of the embodiment of FIG.

FIG. 6 is a flow chart of route search processing of the embodiment of FIG.

7 is a diagram showing a display example of the liquid crystal display of the embodiment of FIG.

FIG. 8 is a block configuration diagram of a conventional route search display device.

FIG. 9 is a diagram showing a conventional CD-ROM storage data format.

FIG. 10 is a diagram showing road data recorded in a CD-ROM.

FIG. 11 is an explanatory diagram of node connection data.

FIG. 12 is an explanatory diagram of set speed.

FIG. 13 is a flowchart of a conventional route search process.

FIG. 14 is a flowchart of conventional route search processing.

FIG. 15 is an explanatory diagram of route search processing.

FIG. 16 is a diagram showing a display example of a conventional liquid crystal display.

[Explanation of symbols]

 1 route search display device 2 destination input means 3 read-only storage means 4 route search means 5 display means 6 readable / writable storage means

Claims (2)

[Claims] 1. A destination input means for inputting a destination, and road data which records a road network as a set of links connecting nodes to each other, and a route search evaluation set corresponding to each link. A read-only storage unit that records a value, a route search unit that searches a route from a departure place to a destination based on the route search evaluation value, and a display unit that displays the route searched by the route search together with a map. And an auxiliary route search additional evaluation value of the above route search evaluation value,
The route search evaluation value stored in the read-only storage means is provided with a readable / writable storage unit that stores at least one of the route search evaluation value and the correction amount for the route search additional evaluation value. And a route search display device configured to search a route based on the route search additional evaluation value stored in the readable / writable storage unit and the correction amount. 2. A readable / writable storage means that stores at least one of a supplementary route search additional evaluation value and a route search evaluation value and a correction amount for the route search additional evaluation value is configured to be replaceable. Claim 1 characterized by
The described route search display device.