JP2009156656A - Map display apparatus and program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To make a user know whether matching or mismatching is completed in the early stage as possible, reduce wasted tracing operations, efficiently implement a matching process, and reduce the number of mismatching. <P>SOLUTION: A map display apparatus for displaying a route comprises: an information storing means (3) for storing road map data including a link for connecting nodes; a display means (6) for reading the road map data stored in the information storing means, and displaying it on a road map; a tracing mode selecting means (4a) for designating use of tracing on a screen in a route designation; a matching process means (4b) for obtaining a coordinate traced in a tracing mode, and matching the traced coordinate with the link; and a control means (4c) for controlling the matching process, and predicting and guiding a next candidate link intended by a user when it determines that the matching is completed. <P>COPYRIGHT: (C)2009,JPO&INPIT

Description

The present invention relates to a map display device and a program for displaying a route intended by a user by a tracing operation on a road map display screen.

Conventionally, a navigation device that traces a road on a map display screen with a finger or the like, designates the traced trajectory as a passage route, and performs a route search according to the user's intention by using the designated passage route. It has been proposed (Patent Document 1).
JP2000-111354A

In Patent Document 1, the matching between the coordinates traced by the user and the link (road) is simply performed according to which link the coordinates are close to. However, for the user, it is not known whether or not matching has been achieved when the tracing operation has progressed, and therefore, there is a possibility that the tracing operation will be advanced with incorrect matching.

In addition, even when the user performs a tracing operation halfway through a link and a single link has already been sufficiently identified, the acquisition of the traced coordinates until reaching the next node of the link is performed with the identified link. Since matching processing is performed, it is useless. For this reason, the matching process is not performed efficiently, and when a plurality of links are close to each other, it is conceivable that acquisition of the traced coordinates in the vicinity of the end node of the specified link may cause an incorrect matching.

The present invention is intended to solve the above-mentioned problems, and allows the user to know whether matching is possible or incorrect matching at the earliest possible stage, reduces unnecessary tracing operations, improves matching processing, and reduces erroneous matching. The purpose is to let you.
The present invention provides a map display device for displaying a route, an information storage means storing road map data including links connecting nodes, and a road map displayed by reading the road map data stored in the information storage means. Display means to perform, trace mode selection means for specifying that the trace on the screen is used for route specification, and coordinates traced in the trace mode,
Matching processing means for matching the traced coordinates and links, and control means for controlling the matching processing and predicting and guiding the next candidate link intended by the user when it is determined that the matching has been achieved. Features.
According to the present invention, in a program for controlling a map display device that displays a route, a step of reading road map data stored in the information storage means and displaying a road map, and a tracing operation on the displayed road map are detected. The step of acquiring the traced coordinates, the step of matching the acquired traced coordinates with the link, and the step of predicting and guiding the next candidate link intended by the user when it is determined that the match has been taken to the computer It is made to perform.

According to the present invention, it is possible for the user to know whether matching is possible or incorrect matching at the earliest possible stage, reduce unnecessary tracing operations, improve matching processing, and reduce erroneous matching.

Embodiments of the present invention will be described below.
FIG. 1 is a block diagram illustrating an example of a navigation device as a map display device according to the present embodiment. Input device 1 composed of a keyboard, mouse, touch panel, operation keys, etc. for inputting information such as the starting point, destination, vehicle size, etc., current position detecting device 2 for detecting information on the current position of the vehicle, and a link connecting nodes Including road map data, intersection data, navigation data necessary for route search, display / audio guidance data necessary for route guidance, and a program for performing map display, route search, voice guidance, etc. (
The information storage device 3 storing the application and / or OS), the tracing mode selection means 4a for designating the use of the tracing on the screen in routing, the coordinates traced in the tracing mode are obtained, Matching processing means 4b for matching with a link, control means 4c for controlling matching processing and predicting and guiding the next candidate link intended by the user when it is determined that matching is achieved, and displaying a map as navigator processing means Processing, route search processing, display / voice guidance processing necessary for route guidance, and central processing unit 4 that controls the entire system, information related to vehicle travel, such as road information and traffic information, Information transmission that detects information related to the current position and transmits / receives information related to the current position. Communication apparatus 5, and a display and a speaker other output device 6 for outputting information on route guidance.

FIG. 2 is a diagram for explaining the overall flow of this embodiment.
A route search cost is calculated by a method such as the Dijkstra method by setting a starting point and a destination, and a route that minimizes the cost is searched. In this embodiment, the tracing mode is selected. It is possible to select a tracing mode and perform a search by specifying a route by tracing with a finger etc. on the road map displayed on the guidance screen. Therefore, the starting point node and the ending point node to be searched for a tracing route are selected (step S1), the tracing operation with a finger or the like is started (step S2), and the link exiting from the starting point node is determined as a candidate link (step S3). Next, step S4 and step S5 are looped to match the traced coordinate with the link (step S4), and whether the destination node of the matched link is the end point node of the trace route search (step S5), Matching the coordinates traced to the end point node and the link is performed, and the process is terminated. In the above explanation, for the explanation from the start to the end of the tracing operation, the start point node and the end point node are selected for convenience. However, since the traced coordinates are detected by the system, the start point node and the end point node are determined. Needless to say, the tracing operation may be performed without matching, and matching with the link may be performed.

3 and 4 are diagrams showing a matching processing flow between the traced coordinate and the link.
In FIG. 3, first, the traced coordinates are acquired (step S11). For example, FIG.
As shown in (2), if the tracing operation is performed from the link L0 along the link L1 and the trace is T0, the coordinates of the trace T0 are obtained by sampling at a predetermined interval.
Next, a matching process between the acquired coordinates and the link L1 is performed (step S12). In this case, the link L0 is a route link that has already been matched and confirmed, and the original node N1,
The link L1 between the previous nodes N2 is a candidate link. Next, the tracing operation is a candidate link L1.
It is determined whether or not the destination node near the destination node N2 has been reached (step S13), and if it can be determined that the destination link has arrived near the destination node, the most likely candidate link, in this example, the link L1 is routed. A link is determined (step S14). If it has not reached the vicinity of the destination node of the candidate link, it is determined whether or not the link is sufficiently matched (step S15). If it cannot be determined that the link has been sufficiently specified, the process goes to step S11. Return and repeat the above process. If the link can be specified sufficiently in step S15,
The process proceeds to the process shown in FIG.

In FIG. 4, although it has not reached the vicinity of the previous node N2, if it is determined that matching has been achieved to such an extent that the link can be specified sufficiently, the next candidate link of the candidate link L1 is determined (step S21). For example, as shown in FIG. 5 (b), the tracing arrival point P is the destination node N.
Even if it is before 2, if the matching is taken to the extent that the link L1 can be specified sufficiently,
A color is added to the matched link and the next candidate link (step S22), and an arrow toward the next candidate link is displayed (step S23). The user's tracing operation is directed to the next candidate link by adding the color of the next candidate link and predictive display using an arrow. In the example of FIG. 5B, here, instead of adding a color, the next candidate link is displayed with a broken line and a line thickness. The matched link is L1, and the next candidate links are the link L2 indicated by a broken line with the previous node N2 as the original node, and the links L3 and L4 indicated by bold lines. Assuming that the reaching point of the tracing operation at the time of the prediction display is P, arrows A1, A2, from the reaching point P to the next candidate links,
A3 is displayed. A trajectory T1 in the figure is a trajectory of the tracing operation after predicting and displaying the next candidate link.

Next, the coordinates of the tracing operation after predicting and displaying the next candidate link are acquired (step S24).
), It is determined which range of the links L1, L2, L3, and L4 the coordinates of the acquired tracing operation are in (steps S25, S27, S29, and S31). In the example of FIG. 5B, the boundary lines connecting the arrival point P, the destination node N3 of the link L2, and the destination node N4 of the link L4 are D1, D
2 and the boundary lines that bisect the angle between the boundary lines D1 and D2 and the link L1 are D3 and D4, the coordinates of the obtained tracing operation are within the range of the link L2 between the boundary lines D1 and D3. Arrow A
1 is in this range, the boundary line D3-D4 is in the range of the link L3, the arrow A2 is in this range, the boundary line D4-D2 is in the range of the link L4, and the arrow A3 is in this range, The range other than is the range of the link L1. In step S25, the acquired range is the link L1.
, It means that the tracing operation returns from the reaching point P toward the node N1, and this is a case where the link L1 determined to be sufficiently matched is different from the user's intention. The point selected for the link L1 and the next candidate link are discarded (step S2).
6). Note that the process of step S26 is not performed when the tracing operation returns to the node N1 even a little, but is performed when it is clear that the operation has returned. In step S27, step S29, and step S31, the acquired ranges are the link L2 and the link L, respectively.
3. If the link is in the range of the link L4, the points at which the link L2, the link L3, and the link L4 are selected are raised (steps S28, S30, and S32). In the example of FIG. 5B, when there is no link L4, the boundary line D4 cannot be drawn, and the next candidate link is predicted when the tracing operation is directed to the lower side of the link L1 in the figure. It becomes difficult. Therefore, when there is no link L4, a virtual boundary line symmetrical to the boundary line D3 is set for the link L1, and the boundary line D4 is set.
It is good. In the above example, the trace reaching point and the next node of the next candidate link are connected to form a boundary line. However, a line of a predetermined angle is formed from the previous node of each next candidate link to each next candidate link. It may be drawn as a boundary line. For example, by drawing a 45 degree line from the previous node N3 to the link L2, and a 45 degree line from the previous node N3 to the link L4, the boundary lines D1 and D2 are obtained.
The boundary lines that bisect the angle between the boundary lines D1 and D2 and the link L1 may be D3 and D4.

For example, as shown in FIGS. 6 (a) and 6 (b), the process for setting the point at which the link is selected is selected as the shortest distance between the tip of the tracing operation and the links La, Lb, and Lc is shorter. In FIG. 6A, the link La is 60 points, the link Lb is 25 points, the link Lc is 15 points (the total of the points is 100), and in FIG. Link La 90 points, link Lb 6 points, link Lc
Becomes 4 points, and the probability that the link La is selected increases. In addition, FIG.
In the example, a point to be selected is set in consideration of the direction of tracing and the distance between the tip node of each link. In this example, the tracing operation is directed toward and approaching the tip node of the link La, 50 points, and the links Lb and Lc are directed to the direction away from the leading node, respectively, -20 points. Set it to -30 points (the total number of points is 0).

In this way, the points are set, and it is determined whether or not the vicinity of the original node of the next candidate link has been reached (step S33). If not, the process returns to step S23 to display an arrow toward the next candidate link. However, since the tracing operation is in progress, the arrow display is updated according to the progress. Here, the process returns to step S23, but the process may return to step S24. In this case, the arrow display is not updated, and the coordinates associated with the advanced tracing operation are acquired. When the tracing operation reaches the vicinity of the original node of the next candidate link, the sufficiently specified link is determined as the route link (step S34), and the next link is selected while retaining the selected points of the next candidate link. The process proceeds to matching (step S35).

In steps S22 and S23, color addition and arrow display are performed for the next candidate link. However, either color addition or arrow display may be used, and the arrow display for the next candidate link may be displayed by the user. If the tracing operation is directed to the next candidate link, it may not be performed. For example, the next candidate link having the highest probability of being selected may be predicted by adding a balloon “Next is this road” or the like. When the prediction is contrary to the user's intention, a change occurs in the user's operation. Therefore, this movement is detected and used for the matching process of the next candidate link. Alternatively, the arrow itself may be regarded as a virtual link, and the link may be predicted depending on which virtual link the tracing operation is close to.
Also, when there is enough matching with the link, by scrolling the screen to the next node,
It is also possible to reduce the false matching by avoiding the tracing operation at the position where the links intersect in a complicated manner.
In step S26, if the sufficiently matched link is different from the user's intention, the point selected for the link and the next candidate link are discarded, but the tracing operation is not directed to the next candidate link. It is also possible to make a recommendation or recommend that the finger is released from the screen and return to the previous node, and the tracing operation of the corresponding section is executed again so that the erroneously matched link is not selected again.

FIG. 7 is a diagram for explaining an example in which the screen during the tracing operation is displayed in two screens.
The left screen of the figure is a detailed scale map screen for the user to trace, and the right screen is a wide scale map screen that can display the entire trace section (for example, the section from the departure place to the destination), for example, Each time the traced link is determined, the result is reflected on the right screen. In the example of FIG.
An example in the case where a part of a route that has already been set is reset by a tracing operation is shown, and a route other than the zone L10 indicated by a bold line is reset by a tracing operation, L1 indicated by a broken line
1 is the original route of the tracing section, and the very thick line T is the tracing route. The original route L11 of the tracing section is displayed on the left screen of the two screens. In FIG. 7A, the tracing route T is still in the short section at the initial stage of the tracing operation, and in FIG. This shows a case where the operation has progressed and the trace coordinates have moved along the original route L11. When the trace coordinate is on the original route, the original route switch SW is displayed (FIG. 7B). When the switch SW is pressed, the remaining original route L11 ′ is determined as a route. Further, when the remaining part of the original route on the right screen is touched while the original route switch SW is displayed, the route up to that point may be determined. in this way,
Since the tracing operation is performed on the detailed scale map screen, it is easy to smoothly perform the tracing operation along the target link, and at the same time, the tracing locus can be confirmed on the wide scale map screen. Therefore, the accuracy of the tracing operation can be expected.

It is a block diagram which shows the example of the navigation apparatus which concerns on this embodiment. It is a figure explaining the whole flow of this embodiment. It is a figure which shows the matching process flow of the traced coordinate and link. It is a figure which shows the matching process flow of the traced coordinate and link. It is a figure explaining a tracing operation and a candidate link. It is a figure explaining the setting of the point from which a link is selected. It is a figure explaining the example which made the screen in trace operation into 2 screen displays.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 ... Current position detection apparatus, 2 ... Control apparatus, 3 ... Information storage apparatus, 4 ... Central processing unit, 4a ... Tracing mode selection means, 4b ... Matching processing means, 4c ... Control means, 5 ... Information transmission / reception apparatus, 6 ... Output device.

Claims (8)

In a map display device that displays a route,
Information storage means for storing road map data including links connecting nodes;
Display means for reading the road map data stored in the information storage means and displaying the road map;
Tracing mode selection means for designating the use of on-screen tracing in routing
Matching processing means for acquiring the traced coordinates in the tracing mode and matching the traced coordinates with the link;
Control means for controlling the matching process and predicting and guiding the next candidate link intended by the user when it is determined that the matching is achieved;
A map display device characterized by comprising: The map display device according to claim 1, wherein the control means uses the traced coordinates immediately after guiding the next candidate link for the matching process of the next candidate link. The map display device according to claim 1, wherein the control means guides the next candidate link by displaying an arrow directed to the next candidate link. The control means is characterized in that the display means is a two-screen display, one screen is a detailed map display screen for tracing operation, and the other screen is a wide-area map screen for displaying the entire section. 1. The map display device according to 1. 5. The map display device according to claim 4, wherein each time the traced link is determined, the control means reflects the result on a wide-area map screen. The control means, when it is determined that the link determined to have been matched is different from the user's intention by a subsequent tracing operation, guides the tracing operation not to go to the next candidate link. 1. The map display device according to 1. 2. The map display device according to claim 1, wherein the control means scrolls the screen to the next node when it is determined that matching is achieved. In a program for controlling a map display device that displays a route,
Reading road map data stored in the information storage means and displaying the road map;
Detecting a tracing operation on the displayed road map and obtaining the traced coordinates;
A step of matching the acquired traced coordinates with the link;
A step of predicting and guiding the next candidate link intended by the user when it is determined that the matching is achieved;
A program that causes a computer to execute.

Images