JP2545403Y2 - Mobile body route display 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 display device for guiding the operation of a moving body such as an automobile.

[0002]

2. Description of the Related Art A conventional route display device for a moving body calculates an azimuth and a straight-line distance to a target point when a target point of the moving body is set, and as shown in FIG. Displays the current location, the target location, the azimuth to the target location, and the linear distance. In such a route display device,
Since the route to the target point is not shown, the route must be determined during the operation, and there is a problem that the operation guidance is not sufficient.

[0003]

[Problems to be Solved by the Invention] This invention has been made in view of the above points, and its purpose is to input a starting point and a destination of a moving object into an input device in advance. It is an object of the present invention to provide a route display device for a moving object that displays a route determined by a computing device according to whether toll road selection set by a user.

[0004]

The moving object route display device of the present invention includes a database reproducing device for reading a database storing the moving object route, and calculates the reproduced data and further converts the data into image data. A display device for displaying a screen, and a calculation device for calculating the relationship between the route intersection and the starting point of the moving object on the screen, a target point; a storage device for storing the calculation result and the image data; An input device for inputting a target point, a line connecting the starting point of the moving object and the route intersection or between two route intersections based on the starting point and the target point of the moving object input from the input device, the target point, and the moving object. Of the route information obtained from the database relating to the line connecting the starting point or the route intersection and the evaluation function in accordance with the possibility of toll road selection set in advance by the user. Sequentially evaluating while selecting the Umate route intersection, which is constituted to display on the display device stores in the storage device to determine the path connecting these selected path intersections.

[0005]

According to the moving object route display device of the present invention, since the route to the destination is displayed on the screen, it is not necessary to judge the route selection during the operation and the vehicle can be operated with peace of mind.

[0006]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS A route display device for a moving object according to an embodiment of the present invention will be described with reference to the drawings. FIG. 1 is a block diagram showing a moving object route display device which is a reference example of the present invention.
In the figure, reference numeral 1 denotes an input device including a keyboard and a light pen, and outputs a signal generated by key input to the CPU 6. Reference numeral 5 denotes a CD-ROM reproducing device,
-Output a signal reproduced from the ROM to the display arithmetic processor 7. The arithmetic unit 2 is constituted by the CPU 6 and the display arithmetic processor 7, and performs arithmetic processing on the key input signal.
Further, a signal from the CD-ROM reproducing device is converted into image data, stored in the RAM 8, and displayed on the display device. RA
The storage device 3 is configured by the M8 and the ROM 9. R
The OM 9 stores a program for moving the CPU 6 and fixed data, and the RAM 8 stores variable data and image data. The display device 4 is a CRT or LCD and a RAM 8
The image data developed on the screen is displayed on the screen.

Next, the operation of this embodiment will be described with reference to the flowchart of FIG. To use the apparatus, first, in step S1, a map including a starting point and a target point is read from a CD-ROM, and the map is calculated by an arithmetic unit.
Display on the display device. Next, in step S2, the starting point and the target point are input from the screen with the light pen and stored in the storage device. Next, in step S3, the input starting point and target point are displayed on the map screen. Next, in step S4, the vicinity of the intersection of the route to be selected is input on the screen with a light pen as shown at point C in FIG. Next, in step S5, an intersection node (B in FIG. 3) near the point input in step S4 is determined. Next, in step S5, simple nodes (b, b,... In FIG. 3) between the starting point or the already selected intersection node (A in FIG. 3) and the currently selected intersection node (B in FIG. 3) are obtained. . The road data is stored in the CD-ROM as vector data, that is, simple nodes b, b..., Which are break points when the road is represented by a number of broken lines, and intersection nodes a, a as shown in FIG. I have. Next, at step S6, the intersection node A and the intersection node B
Are determined to be connected at the simple nodes b, b... If not, the process returns to step S4 to obtain another intersection node near the input point, and repeats the steps from step S5.

If it is determined in step S6 that the intersection node A and the intersection node B are connected, the process proceeds to step S7, and the intersection node B selected this time is stored in the storage device. Next, in step S8, the intersection node A and the intersection node B are connected by simple nodes b, b,... And displayed on the display device. Next, in step S9, it is determined whether or not the vehicle has arrived at the target point. If the vehicle has not arrived at the target point, steps S4 and subsequent steps are repeated. When the vehicle arrives at the target point, the operation ends, and the selected route is displayed on the display screen as shown in FIG.

Next, a moving object route display device according to an embodiment of the present invention will be described with reference to the drawings. Since the hardware of the embodiment is the same as that of the reference example shown in FIG. 1, detailed description will be omitted. FIG. 8 shows a memory space used in this embodiment. The branch point memory shown in the figure is a memory for storing the movement trajectory and stores the coordinates of the branch point, that is, the intersection.
The road attribute memory stores the type of road of each branch at address N corresponding to the number N of branches. The rank memory also stores the value of the evaluation function of each branch at address N corresponding to the number of branches N. The NG branch memory stores the current branch when all the branches from the current intersection have stopped, and then does not select the same intersection. For example, the branch register sets the m-th bit to 1 when the M-th branch from the current intersection is not at a stop, and indicates the selectability of the branch.

Next, the operation of this embodiment will be described with reference to the flowcharts of FIGS. First, in step S1, a map including a starting point and a target point is read from the CD-ROM, operated by an arithmetic unit, and displayed on a display unit. Next, in step S2, the starting point and the target point are input from the screen with the light pen and stored in the storage device. The position of the starting point is also stored at the current branch point in the branch point memory. Next, in step S3, the number N of branches connected to the current intersection and the road type of each branch are read from the map data, and the road type of each branch is stored in an address corresponding to each branch in the road attribute memory; The address corresponding to each branch of the rank memory is cleared. Further, the branch number N is stored in the branch number storage memory. Next, in step S4, the branch register is cleared.

Next, the process proceeds to step S5, where the N-th branch is set. Next, in step S6, the set branch node is read from the map data. Next, in step S7, it is determined whether or not the read node has stopped. If the node has stopped, the process proceeds to step S13. If not, the process proceeds to step S8. In step S8, it is determined whether or not the read node is an intersection node. If the node is not an intersection node, a node connected to the node is read in step S6. Step S
If the node read at 8 is an intersection node,
The process proceeds to step S9, and it is determined from the NG branch point memory whether or not the intersection has stopped. If it has stopped, the process proceeds to step S13. If it has not stopped, step S13 is executed.
The process proceeds to 10, and the Nth bit of the branch register is set to 1.
Next, in step S11, as shown in FIG. 5, the intersection node B currently read from the current intersection A
Is calculated. Next, in step S12, the deviation between the azimuths β and α with respect to the target point is obtained and stored in the memory, and the process proceeds to step S13.

In step S13, the value of N is reduced by one and the next branch is set. Next, the process proceeds to step S14,
It is determined whether or not N = 0, and if not, step S5
If the value is 0, the process proceeds to step S15. In this way, the next intersection node is checked for all N branches. In step S15, it is determined whether or not the branch register is 0. If the branch register is 0, all the branches from the current intersection stop, so the flow proceeds to step S16 to store the current intersection in the NG branch point memory, and then to step S17. The current intersection is returned to the previous intersection, and step S3
repeat.

If the branch register is not 0 in step S15, there is a next intersection that does not stop at the current intersection, and the process shifts to step S18 so as to select the next intersection from these. In step S18, the value of the evaluation function of each of the next intersections that do not stop at a stop is calculated from the azimuth deviation. Next, in step S19, the value of the evaluation function of the next intersection following the branch is stored in the address corresponding to each branch in the rank memory. Next, in step S20, an evaluation function value based on the road type is obtained from the road type of each branch stored in the road attribute memory and added to the evaluation function value stored at the address corresponding to each branch in the rank memory. That is, each branch is weighted so that the probability of selecting the type of each road is increased in the order of, for example, an expressway, a national road, and a prefectural road. Next, the process proceeds to step S21 to determine whether to use a toll road. Whether or not a toll road can be used is input in advance. Step S2 when not using a toll road
In step 2, the evaluation function stored in the rank memory of each branch that is a toll road is set to 0, and the process proceeds to step S23. If a toll road is used, the process proceeds directly to step S23. In step S23, the value of the order memory corresponding to the 0 bit of the branch register is set to 0. Next, in step S24, the values of the evaluation function of each branch stored in the rank memory are compared. Next, in step S25,
The current intersection is taken as the previous intersection, the previous intersection is taken down one by one so as to be the intersection two times before and stored in the branch memory, and the next intersection after the branch with the largest evaluation function is stored as the current intersection. I do. Next, step S26
, The route from the starting point to the current intersection is displayed in a different color. Next, in step S27, it is determined whether or not the target point has been reached. If the target point has not been reached, steps 3 and subsequent steps are repeated, and if the target point has been reached, the operation is terminated. In this way, the optimum route from the starting point to the destination is determined and displayed on the display device as shown in FIG.

Although the embodiment is constructed as described above, the invention is not limited to this. For example, instead of inputting the starting point using the input device, the current position of the moving body is input using the position detection device. You may.

[0015]

According to the route display device of the present invention, since the route to the destination is displayed on the screen, it is not necessary to judge the route selection during the operation, and the vehicle can be operated with peace of mind. it can. When the starting point and the destination are input, the optimum route to the destination is calculated and displayed. Furthermore, if the user sets to use the toll road, the toll road is given priority and the optimum route is calculated. If the user does not use the toll road, the optimum route is calculated within the range not including the toll road. Is calculated.

[Brief description of the drawings]

FIG. 1 is a block diagram showing a moving object route display device according to an embodiment of the present invention and a reference example.

FIG. 2 is a flowchart showing the operation of a reference example of the present invention.

FIG. 3 is a diagram showing a part of a display path in an embodiment of the present invention and a reference example.

FIG. 4 is a diagram showing a display screen in an embodiment of the present invention and a reference example.

FIG. 5 is a diagram showing a part of a display path in the embodiment of the present invention.

FIG. 6 is a flowchart showing the operation of the embodiment.

FIG. 7 is a flowchart showing the operation of the embodiment.

FIG. 8 is a diagram showing a portion of a memory space in the embodiment.

FIG. 9 is a diagram showing a display screen of a conventional moving object route display device.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 1 Input device 2 Computing device 3 Storage device 4 Display device 5 CD-ROM reproducing device 6 CPU 7 Display computing processor 8 RAM 9 ROM 10 Position detection device

Continuation of the front page (56) References JP-A-60-209900 (JP, A) JP-A-2-150708 (JP, A) JP-A-2-277200 (JP, A) JP-A 64-16917 (JP) JP-A-3-142318 (JP, A) JP-A-4-313019 (JP, A) JP-A-62-243029 (JP, A) JP-A-61-134900 (JP, A) 61-216098 (JP, A)

Claims (1)

(57) [Scope of request for utility model registration] 1. A database reproducing apparatus for reading a database storing a route of a moving object, calculating the reproduced data, converting the reproduced data into image data, and displaying the image data on a screen, and displaying a route intersection on the screen. A starting point of the moving body, a calculating device for calculating the relationship between the target points, a storage device for storing the calculation result and the image data, and an input device for inputting the starting point and the target point of the moving body, A route obtained from a database on a line connecting the starting point of the moving object and the route intersection or between the two route intersections and a line connecting the target point and the starting point of the moving object or the route intersection based on the input starting point and the target point of the moving object. An evaluation function is determined in accordance with the information data and whether or not toll road selection set in advance by the user is selected, and route intersections are selected while being sequentially evaluated. A moving object route display device configured to determine a route connecting the selected route intersections, store the route in a storage device, and display the route on a display device.