JP2004251773A - Route search system - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a route search system a user can use without anxiety. <P>SOLUTION: In this route search system 1, a processor 16 executes a plurality of processings for searching a route from a search start point up to a search finish point to draw out a plurality of routes different each other. The processor 16 specifies also causes by which the plurality of routes obtained by the search are different, and thereafter outputs the plurality of routes obtained by the search and the causes of difference from a display 18 and/or a speaker 19. <P>COPYRIGHT: (C)2004,JPO&NCIPI

Description

[0001]
TECHNICAL FIELD OF THE INVENTION
The present invention relates to a route search device, and more specifically, to a route search device that searches a plurality of routes from a search start point to a search end point.
[0002]
[Prior art]
Conventionally, various types of route search devices have been researched and developed. Japanese Patent Laying-Open No. 9-287965 discloses a first route search device as described below. After setting a start point and an end point of the route search, the first route search device reads out map data representing a road network existing in a search range including the set two points. Here, the map data includes links that represent road sections between feature points, and each link is assigned a travel time required for a vehicle to pass through a target road section. Thereafter, the first route search device receives the current traffic information (particularly, congestion information) from the VICS (Vehicle Information Communication System), and uses the received traffic information to read the travel time of each link, Update to match your traffic situation. Then, the first route search device searches for a route between the two set points using the link whose travel time has been updated.
[0003]
Further, Japanese Patent Application Laid-Open No. 6-186049 discloses a second route search device as described below. The second route search device searches for a route from the set start point to the end point using map data prepared in advance, and guides the user to the destination according to the searched route. During this guidance, the second route search device may determine that the vehicle cannot travel smoothly on the route currently being guided by referring to the traffic information received from the VICS. In this case, the second route search device updates the travel time of each read link using the received traffic information, and searches for a route from the current position to the end point using the updated travel time.
[0004]
Further, Japanese Patent Application Laid-Open No. 9-292252 discloses the following third route search device. The third route search device holds map data representing a predetermined wide-area road network, and locus data including information on roads and intersections on which vehicles have actually traveled. Then, similarly to the first route search device, the third route search device searches for a route from the set start point to the end point using the map data within the search range. Further, the third route search device searches for a route between the same two points using the track data held. As described above, the third route search device performs the route search under different conditions, and derives a plurality of routes having the same route between two points but different directions.
[0005]
[Patent Document 1]
JP-A-9-287965
[Patent Document 2]
JP-A-6-186049
[Patent Document 3]
JP-A-9-292252
[0006]
[Problems to be solved by the invention]
In the first and second route search devices described above, when the user goes to a certain destination, the route searched last time may be different from the route searched this time depending on the traffic situation. However, since the user does not know why a route different from the previous route was searched this time, the user may have distrust in the route searched this time. When the user has such distrust, even if the first or second route search device searches for an appropriate route according to the current traffic situation, the user does not need to search for the first or second route. There is a problem that the route searched by the search device may not be used.
[0007]
Further, in the above-described third route search device, a plurality of routes having different directions are provided to the user. However, since the user does not know the reason why the plurality of routes are provided, it is difficult for the user to select one convenient route from the plurality of provided routes. As a result, there is a problem that the user may be anxious whether the selected route is really good.
[0008]
Therefore, an object of the present invention is to provide a route search device that can be used by a user with peace of mind.
[0009]
Means for Solving the Problems and Effects of the Invention
In order to achieve the above object, a first aspect of the present invention is a route search device, which performs a plurality of processes for searching for a route from a search start point to a search end point, and derives a plurality of different routes from each other. Unit, a cause identification unit that identifies the cause of the difference between the plurality of routes searched by the route search unit, and an output unit that outputs the plurality of routes searched by the route search unit and the cause identified by the cause identification unit. Prepare. Thus, it is possible to provide the user with the cause of the difference between the plurality of routes obtained by the route search, so that the user can be given a sense of security.
[0010]
In the first aspect, the route search device further includes a receiving unit that receives traffic information periodically sent from the outside. Further, the cause specifying unit specifies the cause of the difference between the plurality of routes searched by the route searching unit using the traffic information received by the receiving unit. As a result, it is possible to give the user the traffic situation that caused the plurality of routes to be different as the cause of the difference.
[0011]
In the first aspect, the cause specifying unit uses the traffic information received by the receiving unit to generate status change information indicating a change in traffic status on at least the route searched by the route searching unit. A creating unit, a difference data creating unit that creates a plurality of difference data items that specify different parts among the plurality of routes searched by the route searching unit, and any of the difference data created by the difference data creating unit. Using the situation change information created by the situation change information creation unit, the avoidance route information creation unit that creates the avoidance route information in which the traffic situation has deteriorated among the plurality of routes searched by the route search unit; Use of improved traffic conditions among a plurality of routes searched by the route search unit using the other difference data created by the data creation unit and the situation change information created by the situation change information creation unit And a utilization pathway information creating unit that creates the road information. This makes it possible to provide the user with different portions of the plurality of routes as the cause of the difference in the traffic condition.
[0012]
In the first aspect, the route search device uses the map data stored in advance to save the avoidance route information created by the avoidance route information creation unit and / or the use route information created by the use route information creation unit. The image processing apparatus further includes an image data creation unit that creates display image data in which a plurality of routes searched by the route search unit are different on the map, and sends the display image data to the output unit. Thus, the user can see the cause of the difference on the display map, and thus it is possible to provide a more convenient route search device.
[0013]
In the first aspect, the route search device may include a plurality of routes searched by the route search unit using the avoidance route information created by the avoidance route information creation unit and / or the use route information created by the use route information creation unit. And a synthesized voice data generating unit that generates synthesized voice data that expresses the cause of the difference in the path by voice and sends the synthesized voice data to the output unit. As a result, it is possible to provide the cause of the difference to the user by voice, so that a more convenient route search device can be provided.
[0014]
In the first aspect, the route search device further includes a selection unit that selects one of the plurality of routes searched by the route search unit based on a user's designation. Here, the output unit outputs the route selected by the selection unit and the route not selected by the selection unit by different methods, and outputs the causes specified by the cause specifying unit by different methods. As a result, the user can accurately distinguish the route selected by the user, the remaining routes, and the cause of the difference between the routes.
[0015]
A second invention is a route search method, comprising: performing a plurality of processes for searching for a route from a search start point to a search end point to derive a plurality of different routes; The method includes a cause identification step of identifying the cause of the difference between the plurality of routes, and an output step of outputting the plurality of routes searched by the route search step and the cause identified in the cause identification step.
[0016]
In the second invention, the route search method is realized as a computer program executable on a computer device. Further, the computer program is recorded on a recording medium.
[0017]
BEST MODE FOR CARRYING OUT THE INVENTION
FIG. 1 is a block diagram showing a hardware configuration of a route search device 1 according to one embodiment of the present invention. In FIG. 1, the route search device 1 includes a storage device 11, an input device 12, a locator 13, a receiver 14, a program memory 15, a processor 16, a working area 17, a display device 18, and a speaker 19. And
[0018]
The storage device 11 is a device that drives a randomly accessible and large-capacity recording medium such as a hard disk or a DVD (Digital Versatile Disk). _cart Is stored. Map data D _cart Contains various data that can create a wide-area map (hereinafter, referred to as a wide-area map) such as the entire area of Japan.
On the wide area map, the road network is roughly represented by i internal nodes N as shown in FIG. _in (See ●) and j internal links L _in It is expressed using and. However, in FIG. 2, for convenience, three internal nodes N _in , And two internal links L _in Only shows. Each internal node N _in Represents an intersection or a turning point on the road network. Each internal link L _in Is the two internal nodes N _in Represents the road section that connects.
Each of the above internal nodes N _in And each internal link L _in To specify the map data D _cart Is a node list L as shown in FIG. _node And link list L _link Network data D including _net including. The road network data D shown in FIG. _net Is the correspondence list L _conn , Which will be described later.
[0019]
In FIG. 3, the node list L _node Is i internal nodes N _in Node records R assigned one by one _n1 ~ R _ni Consists of Each node record R _n1 ~ R _ni Is the internal node to which it is assigned (hereinafter referred to as the target internal node) N _in (Hereinafter referred to as an internal node number) N _nn , Position (hereinafter referred to as internal node position) P _nn And some internal link numbers N _nl including. For convenience, FIG. 3 shows the node record R _n1 Only the data structure of FIG. Internal node number N _nn Is the target internal node N _in Is a number assigned to the ID to uniquely identify the ID. Internal node position P _nn Is the target internal node N _in Is specified on the road network using, for example, longitude and latitude. Also, node record R _n1 ~ R _ni Some internal link numbers N set to _nl Is the target internal node N _in One or more internal links L leading to _in To identify.
[0020]
Link list L _link Is j internal links L _in Link record R assigned to each _k1 ~ R _kj Consists of Each link record R _k1 ~ R _kj Is an internal link (hereinafter referred to as a target internal link) L to which it is assigned. _in Of the internal link number N _nl , Distance (hereinafter referred to as internal link distance) D _nl , Road type T _rd And two internal node numbers N _nn including. For convenience, FIG. 3 shows the link record R _k1 Only the data structure of FIG. Internal link number N _nl Is the target internal link L _in Is a number assigned to uniquely identify the. Internal link distance D _nl Is the target internal link L _in Is the distance of the road section represented by. Road type T _rd Is typically the target internal link L _in Is a type of the road represented by. In this embodiment, it is assumed that the road type is any one of a "highway", a "national road", a "prefectural road", and a "private road". However, the road type is not limited to these. Also, link record R _k1 ~ R _kj Each internal node number N set to _nn Is the target internal link L _in Internal nodes N located at both ends of _in To identify.
[0021]
In the above description, the link list L _link Contains the internal link distance D _nl However, a travel time may be set instead. The travel time means that the user using the route search apparatus 1 moves at a predetermined speed, and the user uses the target internal link L _in It is the time that is assumed to be required to pass through.
[0022]
Next, the correspondence list L _conn Related external links L _ex Will be described. The receiver 14 shown in FIG. 1 periodically transmits traffic information I from a road-to-vehicle communication system using Dedicated Short Range Communication (DSRC) and / or a VICS (Vehicle Information Communication System). _tr Is sent. In these systems, in general, a road network consisting of only main roads or main roads (see a solid line portion in FIG. 5) is connected to an external node N. _ex And external link L _ex The road network data expressed using is used. That is, the road network of FIG. 5 does not include non-trunk roads (see dotted lines) represented by narrow streets. On the other hand, the road network data D _net Represents a road network composed of many roads (including main roads, main roads, and non-main roads) to which the user can move in addition to the main roads or the main roads, as shown in FIG. From the above, external link L _ex And the internal link L _in And the following differences. That is, the internal link L _in Indicates a road section of a main road, a main road, and a non-main road. In contrast, the external link L _ex Indicates a road section of a main road and a main road. From the above, external link L _ex And internal link L _in Is not completely one-to-one correspondence. That is, the external link L _ex Is an internal link L _in In some cases, a plurality of continuous internal links L _in In some cases. For example, FIG. 5 shows a road network in the same range as the road network of FIG. 2, but the external link L illustrated in FIG. _ex Is the two internal links L shown in FIG. _in Is equivalent to connecting The above external link L _ex Which internal link L _in , The correspondence list L _conn Is road network data D _net include.
[0023]
In FIG. 3, the correspondence list L _conn Is k external links L _ex Record R assigned to each _c1 ~ R _ck Consists of Each correspondence record R _c1 ~ R _ck Is an external link (hereinafter referred to as a target external link) L to which it is assigned. _ex Information (hereinafter referred to as an external link number) N _xl , Distance (hereinafter referred to as external link distance) D _xl , And information set IS _nl including. For the sake of convenience, FIG. _c1 Only the data structure of FIG. External link number N _xl Is the target external link L _ex Is a number assigned to it to uniquely identify it. External link distance D _xl Is the target external link L _ex Is the distance of the road section represented by. Information Set IS _nl Is at least the target external link L _ex Some internal links L _in Internal link number N that identifies _in including.
[0024]
In addition, each external link L _ex And each internal link L _in If the one-to-one relationship is completely established between _conn Is unnecessary.
[0025]
In FIG. 1, the input device 12 includes a remote controller, a touch sensor, some keys, a mouse or a microphone, or a combination of two or more of them. By operating the input device 12 described above, the user designates only the search start point OP and the search end point EP required for the route search described later, or only the search end point EP.
[0026]
The locator 13 includes an external positioning system (typically, a GPS (Global Positioning System)) receiver and / or a group of autonomous navigation sensors. The GPS receiver periodically uses the information received from the positioning system to obtain the user's current position P. _ur Is derived. The group of autonomous navigation sensors typically includes a speed sensor and a direction sensor, and the speed sensor and the direction sensor periodically change the moving speed V of the user. _ur And its moving direction D _ur Is detected.
[0027]
The receiver 14 receives the traffic information I _tr Receive on a regular basis. Traffic Information I _tr Represents k external links L as shown in FIG. _ex Information record R assigned to each _t1 ~ R _tk including. Each traffic information record R _t1 ~ R _tk Is the target external link L _ex About the external link number N _xl And some information sets IS _tr And For convenience, FIG. 4A shows the traffic information record R _t1 Only the data structure of FIG. Each information set IS _tr Is the target external link L _ex Traffic restrictions or congestion occurring on the road section represented by, and the target external link L _ex Indicates one of travel times. Specifically, each information set IS _tr Is the type T _inf And content C _inf including. Type T _inf As shown in FIG. 4B, at least one of event regulation and traffic congestion is described. Also, type T _inf Is event regulation, content C _inf Is set to either a construction or an accident. Also, type T _inf If traffic is congested, content C _inf Describes the degree of congestion according to the current degree of congestion.
[0028]
The program memory 15 is typically composed of a ROM (Read Only Memory) and stores a computer program (hereinafter, simply referred to as a program) 151. The processor 16 generally performs two processes, a route search and a reason selection, according to the program 151. The working area 17 stores various information necessary for the processing of the processor 16.
[0029]
The display device 18 constitutes a part of the output unit, and displays image data D generated by the processor 16. _dsp The image is displayed according to.
The speaker 19 constitutes a part of the output unit, and the synthesized speech data D created by the processor 16. _ad And output a voice.
[0030]
In the above route search device 1, the processor 16 executes the program 151 in the program memory 15. Here, FIGS. 6 and 7 are flowcharts showing the processing procedure of the processor 16 described in the program 151.
First, in step A1 of FIG. 6, the processor 16 sets a search start point OP and a search end point EP. More specifically, the input device 12 outputs the designated position information I that specifies the two points OP and EP designated by the user. _dp Is created and stored in the working area 17. Above designated position information I _dp And the processor 16 sets the search start point OP and the search end point EP in the working area 17.
[0031]
In step A1, the search start point OP and the search end point EP may be set as follows. That is, the input device 12 outputs the designated position information I that specifies the one point EP designated by the user. _dp Is created and stored in the working area 17. This designated position information I _dp And the processor 16 sets the search end point EP in the working area 17. The locator 13 determines the derived current position P _ur , And the detected moving speed V _ur And moving direction D _ur Is stored in the working area 17. The processor 16 determines the stored current position P _ur , Moving speed V _ur And moving direction D _ur , The user's exact current position PP _ur Is derived and set in the working area 17 as a search start point OP in step A1.
[0032]
In the next step A2, the processor 16 outputs the map data D of the search range. _cart From the storage device 11 to the working area 17. Here, the search range is preferably a rectangular area including both the search start point OP and the search end point EP. As a result, all internal nodes N included in the search range _in Node record R _n And all internal links L _in Link record R _k Is read.
[0033]
At the next step A3, the processor 16 sets the internal link L obtained at step A2. _in , The internal link transit time T _nl Is calculated. Specifically, as shown in FIG. 8, the program 151 _rd And initial estimated speed V _fs Estimated speed table T in which a set of _fs Contains. In FIG. 8, the road type T _rd Is the link record R _k Is the same as that described in. In this case, the road type T _rd Are described as "highway", "national road", "prefectural road", and "private road". Initial estimated speed V _fs Is the same set of road types T _rd Is the speed at which the user is estimated to move on the road classified by. The value is a predetermined value. In the case of "highway", the initial estimated speed V _fs For example, “100 km / h” is described. In addition, road type T _rd Is "national road", "prefectural road" and "private road", the initial estimated speed V _fs For example, "60 km / h", "40 km / h", and "20 km / h" are described. The above-described first estimated speed table T _fs , The processor 16 determines in step A3 that each internal link transit time T _nl Is calculated. Here, FIG. 9 is a flowchart showing a detailed processing procedure of step A3 in FIG.
[0034]
In step B1 of FIG. 9, the processor 16 determines that all the link records R read out in step A2. _k One of the unselected ones is selected. In the following description, the one selected in step B1 is referred to as the first link record R to be processed. _k And the first processing target link record code R _k Internal link L specified by _in To the first processing target internal link L _in Called.
In the next step B2, the processor 16 sets the first link record R to be processed. _k From the road type T _rd And internal link distance D _nl Take out.
At next step B3, the processor 16 determines the road type T obtained at step B2. _rd The same set of initial estimated speed V _fs In the first estimated speed table T _fs Take out from.
At next step B4, the processor 16 determines the initial estimated speed V obtained at step B3. _fs Is the internal link distance D obtained in step B2. _nl To the first processing target internal link L _in Internal link transit time T _nl Is calculated.
In the next step B5, the processor 16 sets the first processing target link record R as shown in FIG. _k And the calculated internal link transit time T _nl Add.
[0035]
FIG. 9 is referred to again. At the next step B6, the processor 16 determines that the link record R not selected at the step B1. _k It is determined whether or not exists. If there is an unselected one, the processor 16 performs step B1. Conversely, all link records R _k Has been selected, the processor 16 ends the step A3 in FIG. By the above processing, the processor 16 determines that all the link records R read in step A2 _k The internal link transit time T calculated in step B4. _nl Add.
[0036]
In step A4 in FIG. 6, the processor 16 performs an initial route search according to a known algorithm represented by the Dijkstra method. Specifically, the processor 16 outputs the road network data D on the working area 17. _net , The first optimal route OR from the search start point OP to the search end point EP ₁ To explore. Here, the first optimal route OR ₁ Is a route that the user can reach between the set two points OP and EP in the shortest travel time. More specifically, among the routes connecting between these two points OP and EP, the first optimal route OR ₁ Is the total internal link L existing between the two points OP and EP. _in Internal link transit time T assigned to _nl Is the smallest route.
[0037]
At next step A5, the processor 16 sets the first optimal path OR ₁ Path data RD for specifying ₁ Is created on the working area 17. First route data RD ₁ Is preferably a total value V as shown in FIG. _sum And the total number of links TN _lk And link number set S _ln Consists of Total value V _sum Is the first optimal route OR ₁ All the internal links L _in Internal link transit time T _nl Is the sum of Total number of links TN _lk Is the first optimal route OR ₁ All the internal links L _in Is the total number of Link number set S _ln Is the first optimal route OR ₁ Each internal link L _in All internal link numbers N that specify _nl Consists of Preferably, the link number set S _ln , The internal link number N _nl Are arranged in the order of passage by the user from the closest to the search start point OP to the closest to the search end point EP. For example, as shown in FIG. 11B, a search start point OP and a search end point EP are set, and five internal links L are further set. _in6 ~ L _in10 Optimal route OR consisting of ₁ Is found, for example, as shown in FIG. _sum 25 minutes, total number of links TN _lk And the internal link L _in6 ~ L _in10 Internal link number N that identifies _nl6 ~ N _nl10 Link number set S consisting of _ln Path data RD including ₁ Is created. Such first route data RD ₁ Is stored in the working area 17 by the route search device 1.
[0038]
FIG. 6 is referred to again. At step A6, the processor 16 determines the current position P obtained from the locator 13. _ur , Moving speed V _ur And moving direction D _ur , The user's exact current position PP _ur Is derived.
In the next step A7, the processor 16 outputs the map data D on the working area 17. _cart From the display range. Here, the display range is the accurate current position PP derived in step A6. _ur And the range of the map displayed on the display device 18.
[0039]
In the next step A8, the processor 16 outputs the map image M of the display range as shown in FIG. _dsp Display image data D containing _dsp1 Create More specifically, the processor 16 outputs the map data D selected in step A7. _cart Using the map image M on the working area 17 _dsp To draw. Further, the processor 16 outputs the first path data RD ₁ , The first optimal route OR included in the display target range ₁ Is the map image M drawn _dsp To be synthesized. Further, the processor 16 outputs the drawn map image M _dsp , The correct current position PP derived in step A6 _ur Mark image M indicating the current position of the user _ur Are synthesized. Thereby, the display image data D _dsp1 Is completed. In step A8, if necessary, the processor 16 transmits the synthesized speech data D necessary for the user's guidance. _ad May be created.
[0040]
In the next step A9, the processor 16 generates the display image data D _dsp1 Is transferred from the working area 17 to the display device 18. The display device 18 receives the display image data D _dsp1 , The image shown in FIG. 12 is displayed. In FIG. 12, a two-dimensional map image M _dsp However, the present invention is not limited to this, and the three-dimensional map image M _dsp May be generated and output. In step A8, the synthesized voice data D _ad Is created, the processor 16 outputs it to the speaker 19 in step A9.
[0041]
At next step A10, the processor 16 sets the current position PP derived at step A6. _ur Then, it is determined whether or not the search end point EP set in step A1 matches. If they match, the processor 16 determines that the user has been guided to the search end point EP (that is, the destination of the user), and ends the processing in FIGS. 6 and 7. Conversely, if they do not match, the processor 16 proceeds to step A11.
[0042]
At step A11, the processor 16 determines whether the traffic information I received by the receiver 14 is _tr Is stored in the working area 17. If not stored, the processor 16 determines that there is no need to perform a re-route search and performs step A6. In this case, a series of processes from steps A6 to A11 described above are repeated. Conversely, traffic information I _tr Is stored, the processor 16 performs Step A12.
[0043]
In step A12, the processor 16 sets the necessary internal link L _in For the corrected transit time T _ud Calculate and record. Here, the program 151, as shown in FIG. _tj And estimated speed V during traffic jam _sc Second estimated speed table T in which a set of _sc Contains. In FIG. 13, the congestion degree L _tj Is traffic information I _tr In the same way as the congestion degree described in _ex Indicates the degree of traffic congestion occurring in the road section indicated by. In this embodiment, for convenience of explanation, the congestion degree L _tj Are categorized into three stages of “0”, “1” and “2”. However, the congestion degree L _tj Is not limited to three stages and may be classified into any number of stages. In addition, the estimated speed V during congestion _sc Is the same set of traffic congestion L _tj Is the speed at which the user is estimated to move on the road, and is a predetermined value. In the present embodiment, the congestion degree L _tj Is “0”, “1” and “2”, the estimated traffic speed V _sc "No correction", "15 km / h" and "5 km / h" are described as examples. Here, “without correction” means that the corrected transit time T _ud Does not need to be calculated. The above second estimated speed table T _sc , The processor 16 calculates each corrected transit time T in step A12. _ud Is calculated. Here, FIG. 14 is a flowchart showing a detailed processing procedure of step A12 in FIG.
[0044]
In step C1 of FIG. 14, the processor 16 determines the exact current position PP of the user in the same manner as described above. _ur Is derived.
At next step C2, the processor 16 determines at step A3 that the internal link transit time T _nl Each link record R to which is added _k , Each internal link L belonging to the processing target range _in Select the one assigned to. Here, the processing target range is preferably the exact current position PP obtained in step C1. _ur And a rectangular area including both the search end point EP. In the following description, the link selected in step C2 is referred to as the second link record R to be processed. _k And the second processing target link record R _k Internal link L specified by _in To the second processing target internal link L _in Called.
[0045]
In the next step C3, the processor 16 sets all the second processing target link records R _k One of the unselected ones is selected. In the following description, the one selected in step C3 is referred to as the third processing target link record R _k And the third processing target link record R _k Internal link L specified by _in To the third processing target internal link L _in Called.
[0046]
In the next step C4, the processor 16 sets the third processing target link record R _k From the internal link number N _nl Take out.
At the next step C5, the processor 16 determines the correspondence list L in the storage device 11. _conn From the internal link number N obtained in step C4 _nl Relationship record R containing _c Search for. Searched correspondence record R _c From the external link number N _xl Take out.
At next step C6, the processor 16 sends the traffic information I on the working area 17 _tr From the external link number N obtained in step C5 _xl Traffic information record R including _t Search for. Traffic information record R searched _t Therefore, the processor 16 determines that the type T _inf Information set IS that describes "traffic jam" in the _tr And the traffic information set IS searched _tr Value V _inf Current congestion degree L described as _tj Extract "0", "1" or "2".
[0047]
At the next step C7, the processor 16 determines whether or not "0" has been extracted at step C6. When “0” is extracted, the corrected transit time T _ud Is not necessary, the processor 16 proceeds to step C12. Conversely, if not “0”, the processor 16 determines that the corrected transit time T _ud Step C8 is performed to calculate.
[0048]
At the next step C8, the processor 16 determines the current congestion degree (congestion degree L _tj Estimated speed V during congestion of the same set as _sc In the second estimated speed table T _sc Take out from.
In the next step C9, the processor 16 sets the third processing target link record R _k From the internal link distance D _nl Take out.
In the next step C10, the processor 16 calculates the estimated congestion speed V obtained in step C8. _sc Is the internal link distance D obtained in step C9. _nl To the third internal link L to be processed. _in Corrected transit time T _ud Is calculated.
In the next step C11, the processor 16 preferably operates as shown in FIG. _k Link transit time T currently added to _nl Or corrected transit time T _ud And the corrected transit time T calculated in the immediately preceding step C10 _ud Is added.
[0049]
In the next step C12, the processor 16 sets the second processing target link record R not selected in step C3. _k It is determined whether or not exists. If there is an unselected one, the processor 16 performs Step C3 again. Conversely, all link records R _k Has been selected, the processor 16 ends the step A12 in FIG. By the above processing, the processor 16 sets the required second processing target internal link L _in For the corrected transit time T _ud Calculate and record
[0050]
In step A13 of FIG. 6, the processor 16 determines the correct current position PP. _ur Is derived.
At next step A14, the processor 16 sets the current position PP derived at step A13. _ur Is set as the search start point OP. Since the search end point EP is as set in step A1, there is no need to set it again.
At next step A15, the processor 16 performs a re-route search according to the well-known algorithm described above. Thereby, the processor 16 determines that the current position PP as the new search start point OP _ur Second optimal route OR from the route to the search end point EP ₂ To explore. Here, the second optimal route OR ₂ Is the current position PP _ur Is a route that can be reached by the user with a minimum travel time between the search end point EP and the search end point EP. More specifically, the second optimal route OR ₂ Is the total internal link L existing between the two points OP and EP. _in Link transit time T currently assigned to _nl Or corrected transit time T _ud Is the smallest route.
[0051]
At next step A16, the processor 16 sets the second optimum path OR ₂ Path data RD for specifying ₂ Is created and held on the working area 17. Second route data RD ₂ Is the first route data RD as shown in FIG. ₁ Has the same data structure as. However, the total value V _sum Is the second optimal path OR ₂ All the internal links L _in Internal link transit time T _nl Or corrected transit time T _ud Is the sum of These internal links L _in Is the total number of links TN _lk Indicates. Link number set S _ln Is the internal link L _in Internal link number N that identifies _nl Consists of For example, as shown in FIG. 16B, a search start point OP and a search end point EP are set, and three internal links L _in7 , L _in11 And L _in12 Optimal route OR consisting of ₂ Is found, for example, as shown in FIG. _sum 15 minutes, total number of links TN _lk And three internal links L _in7 , L _in11 And L _in12 Internal link number N that identifies _in7 , N _in11 And N _in12 Link number set S consisting of _ln Path data RD including ₂ Is created. Such second route data RD ₂ Is stored in the working area 17 by the route search device 1. Thus, the working area 17 stores the first route data RD ₁ And the second route data RD ₂ Will be held.
[0052]
In the above example, in the first route search, the internal link L _in6 ~ L _in10 And the first optimal path OR ₁ Is searched. On the other hand, received traffic information I _tr In the re-route search performed using, three internal links L _in7 , L _in11 And L _in12 Optimal route OR consisting of ₂ Is searched. In this case, the processor 16 sets the internal link L ₈ ~ L ₁₀ Rather than passing through a road section consisting of _in11 And L _in12 Is determined to be able to reach the user's destination (search end point EP) in a shorter time by passing through the road section composed of. As described above, the processor 16 can realize a route search in consideration of the latest traffic situation.
[0053]
Next, reference is made to FIG. In step A17, the processor 16 sets the first route data RD ₁ Unnecessary internal link number N _nl Remove. Specifically, the second optimal route OR ₂ Is a route from the search start point OP set in step A14 three steps before this step A17. On the other hand, the first optimal route OR ₁ Is a route from the search start point OP set in step A1 or the previous step A14. Here, as is clear from FIGS. 6 and 7, after step A28 is completed, the processor 16 performs step A12, and thus each of steps A12 to A28 may be performed a plurality of times. Here, assuming that one loop is constituted by steps A12 to A26, the previous step A14 means not the step A14 performed three steps before but the step A14 performed in the previous loop. Even if the re-route search is performed, the user is still heading to the destination (search end point EP) set in step A1. Further, the user may select the first optimal route OR ₁ Follow the directions to your destination. From the above, the current search start point OP (the second optimal route OR ₂ ) Is the first optimal path OR ₁ It can be said that this is the point above. From the above, in step A17, the first route data RD ₁ , The internal link L not included in the rectangular area including the current search start point OP and search end point EP _in Internal link number N indicating _nl Is removed as unnecessary. Therefore, the first route data RD ₁ In the link number set S _ln Is one or more internal link numbers N not deleted in step A17. _nl Will be included. For example, the second route data RD shown in FIG. ₂ Is obtained, in step A17, the first route data RD ₁ Is the internal link number N from the one shown in FIG. _nl7 ~ N _nl10 Link number set S including _ln Will be updated to
[0054]
FIG. 7 is referred to again. In step A18, the processor 16 sets the second route data RD created this time. ₂ Link number set S _ln And the first route data RD updated in step A17 ₁ Link number set S _ln It is determined whether or not all match. That is, the processor 16 determines that the first optimal path OR ₁ And the second optimal route OR ₂ It is determined whether or not matches. Both routes OR ₁ And OR ₂ If they match, the processor 16 determines that there is no need to specify the cause of the difference, and skips step A19 and performs step A20. Conversely, both routes OR ₁ And OR ₂ Do not match, the processor 16 performs step A19.
[0055]
At step A19, the processor 16 determines that the first optimal route OR ₁ And the second optimal route OR ₂ Identify one or more causes of the differences. Here, FIG. 17 is a flowchart showing a detailed processing procedure of step A19.
At step D1 in FIG. 17, the processor 16 _sc Is newly created or updated. Here, FIG. 18 and FIG. 19 are the first half and the second half of the flowchart showing the detailed processing procedure of step D1.
[0056]
First, in step E1 of FIG. 18, the processor 16 stores the status change information I on the working area 17. _sc It is determined whether or not there is. If not, the processor 16 sends the status change information I _sc Proceeds to step E2 in order to newly create
At the next step E2, the processor 16 sets the current traffic information I _tr Traffic information record R not selected from _t Select one. In the following description, the information selected in step E2 is referred to as the first traffic information record R to be processed. _t Called.
At next step E3, the processor 16 sets the first traffic information record R to be processed. _t From the external link number N _xl Take out.
[0057]
At next step E4, the processor 16 sets the first traffic information record R to be processed. _t From the unselected traffic information set IS _tr Select one. In the following description, the traffic information set IS selected in this step will be described. _tr To the traffic information set IS to be processed _tr Called.
[0058]
At the next step E5, the processor 16 sets the traffic information set IS to be processed. _tr Type T that constitutes _inf And content C _inf Take out the combination of In the following description, the content C extracted in this step _inf , This time CC _inf Called.
In a next step E6, the processor 16 further executes the previous contents PC _inf Is the type T extracted in step E5 _inf Initial contents IC according to _inf Set to. Here, as shown in FIG. 20, the program 151 _inf And initial contents IC _inf Contents table T in which a set of _ic Contains. In FIG. 20, the type T _inf Is as described above. Type T _inf Is "event regulation", the initial content IC _inf "No regulation" is described. Also, type T _inf Is "Congestion", the initial content IC _inf "No traffic jam" is described. The above initial contents table T _ic , The processor 16 determines the type T extracted in step E5. _inf Initial contents IC of the same set as _inf Take out and take out the previous contents PC _inf Is determined.
[0059]
At the next step E7, the processor 16 sets the type T extracted at step E5. _inf The previous contents PC determined in step E6 _inf , And the current content CC extracted in step E5 _inf Change information set IS consisting of _sc Create
At next step E8, the processor 16 sets the traffic information record R to be processed. _t In addition, unselected traffic information set IS _tr It is determined whether or not remains. If there is an unselected one, the processor 16 performs step E4 again. Conversely, all traffic information set IS _tr If has been selected, the processor 16 performs step E9.
[0060]
At step E9, the processor 16 sets the processing target traffic information record R selected at step E2. _t For all the situation change information sets IS created in step E7 _sc And the external link number N extracted in step E3 _xl And the situation change information record R including _sc Create By performing the above-described step E9, the processor 16 stores the status change record R in FIG. _sc1 As an example, the target external link L _ex About some situation change information sets IS _sc Status change record R having _sc Create The above situation change record R _sc Is the target external link L _ex Shows changes in traffic conditions at.
[0061]
At the next step E10, the processor 16 sets the current traffic information I _tr , The unselected traffic information record R _t It is determined whether or not remains. If there is an unselected one, the processor 16 performs step E2 again. Conversely, all traffic information records R _t Has been selected, the processor 16 ends the step D1 in FIG. As a result, as shown in FIG. 21, the processor 16 _ex Some status change records R created for _sc Change information I having _sc Has been created.
[0062]
Also, in step E1 of FIG. _sc Is determined to have already been created in the working area 17, the situation change information I _sc Is updated, the processor 16 proceeds to step E11.
At step E11, the processor 16 sends the status change information I on the working area 17 _sc From the unselected status change record R _sc Select In the following description, what is selected in step E12 is _sc Called.
At next step E12, the processor 16 determines the traffic information I stored at step A11. _tr , The processing target status change record R _sc Same external link number N as _xl Traffic information record R having _t Select one. In the following description, the selected traffic information record in the second processing target traffic information record R _t Called.
[0063]
At next step E13, the processor 16 sets the target status record R _sc From the unselected status change information set IS _sc Select In the following description, the situation change information set IS selected in step E13 _sc To process status change information set IS _sc Called.
At next step E14, the processor 16 sets the processing target situation change information set IS _sc This time CC set to _inf Is the previous content PC _inf Change to
[0064]
At next step E15, the processor 16 sets the second traffic information record I to be processed. _tr In the target situation change information set IS _sc Type T in _inf Traffic information set IS with _tr It is determined whether or not there is. Hereinafter, the traffic information set IS searched in step E15 _tr In the first traffic information set to be processed IS _tr Called.
[0065]
In step E15, the first processing target traffic information set IS _tr If it is determined that there is a target external link L _ex Means that a traffic accident, traffic regulation or traffic congestion has occurred. In such a case, in step E16, the processor 16 sets the first traffic information set to be processed IS _tr Content C _inf And process target status change information set IS _sc And this time CC _inf Set as
[0066]
Conversely, in step E15, the first traffic information set to be processed IS _tr When it is determined that there is no target external link L _ex This means that the processing of the traffic accident that has occurred in the above is completed, or that traffic regulation or traffic congestion has been resolved. In such a case, in step E17, the processor 16 executes the above-mentioned initial content table T _ic From the target situation change information set IS _sc Type T in _inf Initial content IC corresponding to _inf And process target status change information set IS _sc And this time CC _inf Set as
[0067]
When step E16 or E17 ends, in step E18, the processor 16 sets the target status record R _sc Unselected situation change information set IS _sc It is determined whether or not remains. If there is an unselected one, the processor 16 performs Step E13 again. Conversely, the target status record R _sc All situation change information set IS _sc Has been selected, the processor 16 performs step E19.
At next step E19, the processor 16 sets the second traffic information record R to be processed. _t Unselected traffic information set IS _tr It is determined whether or not remains. Unselected traffic information set IS _tr If no is left, the processor 16 skips steps E20 to E24 and performs step E25. Conversely, unselected traffic information set IS _tr Is determined to remain, the processor 16 sets the target external link L _ex Above, assuming that a traffic accident, traffic regulation or traffic congestion has newly occurred, step E20 is performed.
[0068]
At step E20, the processor 16 sets the second traffic information record R to be processed. _t From the unselected traffic information set IS _tr Select one. In the following description, the information selected in step E20 is referred to as the second traffic information set IS to be processed. _tr Called.
In the next steps E21 to E24, the processor 16 sets a new status change information set IS in the same manner as in steps E5 to E8. _sc Create
Next, in step E24, the processor 16 sets the traffic information record R to be processed. _t In addition, unselected traffic information set IS _tr It is determined whether or not remains. If there is an unselected one, the processor 16 performs Step E20 again. Conversely, all traffic information set IS _tr If has been selected, the processor 16 performs step E25.
[0069]
At step E25, the processor 16 sets the processing target situation change information record R _sc Each situation change information set IS created in step E23. _sc Add. As a result, the status change record R _sc Is the target external link L _ex Shows the change between the previous traffic situation and the current traffic situation at.
At next step E26, the processor 16 sends the status change information I on the working area 17 _sc Unselected status change record R _sc It is determined whether or not remains. Unselected status change record R _sc If remains, the processor 16 performs Step E11 again. Conversely, all status change records R _sc Has been selected, the processor 16 sets the status change information I _sc The step D1 in FIG.
[0070]
After the end of step D1, in step D2, the processor 16 stores the correspondence list L in the storage device 11. _conn , The first route data RD ₁ And the second route data RD ₂ Internal link number N included in _nl Of the possible links are external link numbers N _xl Replace with Specifically, each correspondence record R _c All internal link numbers N included in _nl To the first route data RD ₁ And the second route data RD ₂ , If they are found in their internal link number N _nl To the external link number N _xl Replace with As a result of the above replacement processing, the processor 16 sets the first replacement path data PRD as shown in FIG. ₁ And second replacement route data PRD ₂ Create
[0071]
In FIG. 22A, the first replacement route data PRD ₁ And second replacement route data PRD ₂ Is the first route data RD ₁ (See FIG. 11A) and the second route data RD ₂ (See FIG. 16A), the required internal link number N _nl Is the external link number N _xl The difference is that For example, in FIG. 11B, one internal link L _in7 One external link L _ex1 And two internal links L _in8 And L _in9 One external link L _ex2 And one internal link L _in10 One external link L _ex3 Is constructed, the first replacement route data PRD ₁ At link number set S _ln Is the external link L as shown in FIG. _ex1 , L _ex2 And L _ex3 External link number N _xl1 , N _xl2 And N _xl3 Consists of Further, for example, in FIG. 16B, two internal links L _in11 And L _in12 One external link L _ex4 Is constructed, the second replacement route data PRD ₂ At link number set S _ln Is the external link L as shown in FIG. _ex1 And L _ex4 External link number N _xl1 And N _x14 Consists of
[0072]
After the end of step D2, in step D3, the processor 16 sets the first replacement path data PRD created in step D2. ₁ And second replacement route data PRD ₂ From unnecessary external link number N _xl And delete the first difference link data DLD ₁ And second difference link data DLD ₂ Create Specifically, the first difference link data DLD ₁ Is the first replacement route data PRD as shown in FIG. ₁ , But the second replacement route data PRD ₂ All external link numbers N not included in _xl And their external link numbers N _xl Total number TN _xl Consists of For example, the first replacement route data PRD ₁ And second replacement route data PRD ₂ Are the ones in FIGS. 22B and 22C, the first difference link data DLD ₁ Represents two external link numbers N as shown in FIG. _xl2 And N _xl3 including. Also, the second difference link data DLD ₂ Is the second replacement route data PRD as shown in FIG. ₂ , The first replacement route data PRD ₁ All external link numbers N not included in _xl And their external link numbers N _xl Total number TN _xl Consists of For example, the first replacement route data PRD ₁ And second replacement route data PRD ₂ Are the ones in FIGS. 22B and 22C, the second difference link data DLD ₂ Is one external link number N as shown in FIG. _x14 including.
[0073]
After the end of step D3, in step D4, the processor 16 sets the status change information I newly created or updated in step D1. _sc From the first difference link data DLD ₁ External link number N included in _xl Status change information set IS including _sc 24, and as shown in FIG. 24A, these status change information sets IS _sc Route information I consisting of _ss Create As described above, the first difference link data DLD ₁ Is the one shown in FIG. 23A, the external link number N created in step D4 is _xl2 And N _xl3 Two situation change information sets IS including _sc Avoidance information I consisting of _ss It is.
[0074]
In step D5, the processor 16 sets the status change information I newly created or updated in step D1. _sc From the second difference link data DLD ₂ External link number N included in _xl Status change information set IS including _sc Are extracted, and as shown in FIG. 24B, these status change information sets IS _sc Route information I consisting of _pr Create As described above, the second difference link data DLD ₂ Is the one shown in FIG. 23B, what is created in step D5 is the external link number N _x14 One situation change information set IS including _sc Route information I consisting of _pr It is.
[0075]
By the completion of the above step D5, the first optimum route OR ₁ And the second optimal route OR ₂ Processor 16 terminates step A19 in FIG.
In the next steps A20 and A21, the processor 16 sets the current position PP in the same manner as in steps A6 and A7. _ur After deriving the map data D _cart Select
In the next step A22, the processor 16 sets the display image data D _dsp Create Here, FIG. 25 is a flowchart showing a detailed processing procedure of step A22.
[0076]
In step F1 of FIG. 25, the processor 16 determines whether or not step A19 has been performed. If it is determined that step A19 has not been performed, the processor 16 determines in step F2 that the first optimal route OR ₁ And the second optimal route OR ₂ Has no difference, the display image data D _dsp1 And the required synthesized voice data D _ad1 And create
In the next step F3, the processor 16 creates the display image data D _dsp1 Is transferred to the display device 18 and the synthesized speech data D _ad1 To the speaker 19. The display device 18 receives the display image data D _dsp1 , The image shown in FIG. 12 is displayed. The speaker 19 receives the synthesized voice data D _ad1 Outputs audio according to.
[0077]
Conversely, if it is determined in step F1 that step A19 has been performed, the processor 16 determines at least the avoidance route information I _ss And usage route information I _pr Each external link L _ex Impact I _nf Step F4 is performed to calculate.
In step F4, the processor 16 firstly avoids the avoidance route information I on the working area 17. _ss And usage route information I _pr From the external link number N _xl , Previous contents PC _inf (Hereinafter referred to as the previous traffic congestion degree) and the current content CC _inf All of the combinations of the congestion degrees set in (hereinafter, referred to as the current congestion degree) are acquired.
At the next step F5, the processor 16 selects one of the combinations obtained at step F4. In the following description, the combination selected in this step, the external link number N _xl , The previous traffic congestion degree and the current traffic congestion degree, the processing target group, the processing target external link number N _xl , The congestion degree of the previous process and the congestion degree of the current process.
[0078]
In the next step F6, the processor 16 stores the correspondence list L in the storage device 11. _conn From the external link number N to be processed _xl All internal link numbers N _nl To get.
In the next step F7, the processor 16 sets the link list L _link , Each internal link number N extracted in step F6 _nl Link record R containing _k And then select each selected link record R _k From the internal link distance D _nl And road type T _rd Get the set of
[0079]
At next step F8, the processor 16 determines the internal link distance D obtained at step F7. _nl Total and road type T _rd And the previous congestion degree and the above-mentioned first estimated speed table T _fs Or the second estimated speed table T _sc External link L to be processed using the information described in _ex The external link transit time (hereinafter, referred to as the last external link transit time) assumed to have been required when the user passed under the previous traffic condition T _px Is calculated. Specifically, when the previous congestion degree is 0, the first estimated speed table T _fs Is the external link transit time T _px Used to calculate In this case, therefore, the external link transit time T _px Is the internal link distance D _nl And the road type T _rd Estimated speed V corresponding to _fs Obtained by multiplication with If the previous congestion degree is not 0, the second estimated speed table T _sc Is the external link transit time T _px Used to calculate In this case, therefore, the external link transit time T _px Is the internal link distance D _nl And the estimated speed V during congestion corresponding to the degree of congestion _sc Obtained by multiplication with
[0080]
After step F8, in step F9, the processor 16 determines the internal link distance D obtained in step F7. _nl Total and road type T _rd , The current congestion degree, and the above-mentioned first estimated speed table T _fs Or the second estimated speed table T _sc External link L to be processed using the information described in _ex Is assumed to be required when the user passes under the current traffic condition (hereinafter, the external link transit time) T _cx Is calculated. This external link passage time T _cx Is calculated in the same manner as in step F8, and a detailed description thereof will be omitted.
[0081]
In the next step F10, the processor 16 determines that the current external link transit time T _cx To the previous external link transit time T _px Is subtracted to obtain the external link L to be processed. _ex Degree of change in traffic conditions (hereinafter referred to as change level) L _tc Is calculated. Generally, the smaller the transit time of the external link, the better the traffic condition, so the change level L _tc Is a positive value, the external link L to be processed _ex This means that the traffic situation has worsened compared to the previous time. Conversely, the change level L _tc If is negative, the traffic situation is improving.
[0082]
At the next step F11, the processor 16 determines whether or not unselected ones remain in the combinations acquired at step F4. If an unselected pair remains, the processor 16 performs Step F5 again. Conversely, if all combinations have been selected, the processor 16 performs Step F12.
[0083]
In step F12, the processor 16 transmits the first replacement route data PRD created in the working area 17 ₁ , The second replacement route data PRD ₂ , Avoidance route information I _ss , And usage route information I _pr , The map image M in the display range as shown in FIG. _dsp Display image data D containing _dsp2 Create More specifically, the processor 16 outputs the map data D selected in step A21. _cart Using the map image M on the working area 17 _dsp To draw. Further, the processor 16 outputs the first replacement path data PRD. ₁ , The first optimal route OR included in the display target range ₁ Is the map image M drawn _dsp To be synthesized. Further, the processor 16 outputs the synthesized first optimal path OR ₁ In the avoidance route information I _ss External link L specified by _ex For other external links L _ex Or internal link L _in Is expressed in a different color, line type or method. Further, the processor 16 controls the avoidance route information I _ss External link L specified by _ex And the change level L calculated in step F10 _tc Are synthesized. Further, the processor 16 outputs the second replacement path data PRD. ₂ , The second optimal route OR included in the display target range ₂ Is the map image M drawn _dsp To be synthesized. Further, the processor 16 outputs the second optimal path OR ₂ In the use route information I _pr External link L specified by _ex For other external links L _ex Or internal link L _in Is expressed in a different color, line type or method. Further, the processor 16 uses the use route information I _pr External link L specified by _ex And the change level L calculated in step F10 _tc Are synthesized. Further, the processor 16 outputs the drawn map image M _dsp , The correct current position PP derived in step A20 _ur Mark image M indicating the current position of the user _ur Are synthesized. Thereby, the display image data D _dsp2 Is completed.
[0084]
In step F13, the processor 16 determines that the one to be used for guiding the user is the first optimal route OR. ₁ To the second optimal route OR ₂ Synthesized voice data D indicating the reason for changing to _ad2 Create Here, FIG. 27 is a flowchart showing a detailed processing procedure of step F13.
At step G1 in FIG. 27, the processor 16 sets the avoidance route information I on the working area 17 _ss From the change level L calculated in step F10 _tc External link L with the largest absolute value of _ex External link number N _xl Select
At the next step G2, the processor 16 sets the external link number N selected at step G1. _xl Change information record R having _sc From the unselected status change information set IS _sc Select one.
[0085]
In the next step G3, the processor 16 adds the situation change information set IS selected in step G2 to the basic pattern prepared in advance in the program 151. _sc Type T set in _inf And the one used for user guidance is the first optimal route OR ₁ To the second optimal route OR ₂ Partially synthesized voice data PD showing part of the reason for changing to _ad2 Create For example, the basic pattern is “The guidance route will be changed because of ○○○.” _inf Is "traffic regulation", a synthesized voice having the content "change the guidance route for traffic regulation."
At next step G4, the processor 16 sets the target situation change information record R _sc , An unselected situation change information set IS _sc It is determined whether or not remains. If it is determined that an unselected one remains, the processor 16 performs Step G2 again. Conversely, all situation change information sets IS _sc Has been selected, the processor 16 proceeds to step G5.
At step G5, the processor 16 outputs the synthesized voice data D including the synthesized voice generated at each step G3. _ad2 Is created, and the step F13 in FIG. 25 ends.
[0086]
In the next step F14, the processor 16 generates the display image data D _dsp2 Is transferred from the working area 17 to the display device 18 and the synthesized speech data D _ad2 To the speaker 19. The display device 18 receives the display image data D _dsp2 , The image shown in FIG. 12 or FIG. 26 is displayed. In FIG. 26, a two-dimensional map image M _dsp However, the present invention is not limited to this, and the three-dimensional map image M _dsp May be generated and output. The speaker 19 receives the synthesized voice data D _ad2 The sound represented by is output. Thus, step A22 in FIG. 7 ends, and the processor 16 performs step A23.
[0087]
At next step A23, the processor 16 sets the current position PP derived at step A20 in the same manner as at step A10. _ur And the search end point EP set in step A1, it is considered that the user has been guided to the search end point EP (that is, the destination of the user), and the processing in FIGS. 6 and 7 is ended. Conversely, if they do not match, the processor 16 proceeds to step A25.
In step A25, the processor 16 transmits the traffic information I as in step A11. _tr Is not stored, Step A20 is performed again. Conversely, traffic information I _tr Is stored, the processor 16 performs Step A26.
[0088]
In step A26, the processor 16 may perform the step A19 again, so that the second path data RD ₂ And second replacement route data PRD ₂ To the first route data RD ₁ And first replacement route data PRD ₁ Set to. When the above processing ends, the processor 16 performs Step A12 again.
[0089]
As described above, according to the present embodiment, two types of optimal routes OR ₁ And OR ₂ After deriving the two routes OR ₁ And OR ₂ Is identified, and display image data D representing the cause is identified. _dsp2 And synthesized voice data D _ad2 Can be created, so that the user can change the second optimal route OR ₂ Accordingly, it is possible to provide the route search device 1 capable of heading for the destination with ease.
[0090]
Note that, in the above embodiment, the route search device 1 uses the first route data RD ₁ Traffic information I _tr In response to the second route data RD ₂ However, the present invention is not limited to this. For example, as disclosed in Japanese Patent Application Laid-Open No. 9-292252, the first route obtained by performing a route search twice continuously under different conditions is used. Route data RD ₁ And the second route data RD ₂ Using the first optimal path OR ₁ And the second optimal route OR ₂ May be specified. Thus, the first optimal route OR ₁ And the second optimal route OR ₂ Are provided, the user can easily select one of the two. Here, a typical example of the condition for the route search is the latest traffic information I. _tr To use, past traffic information I _tr There is a condition that the user needs to consider the fee required to reach the destination.
[0091]
Further, in the above embodiment, the route search device 1 outputs the plurality of routes obtained by the route search and the cause of the difference as they are. However, the present invention is not limited to this. In the case where the route search device 1 performs the route search continuously a plurality of times under different conditions, the route search device 1 selects one of a plurality of routes obtained thereby according to the user's specification. The map image M indicates the route selected by the user and the cause of the difference between the currently selected route and the previously selected route. _dsp May be combined. Further, each time the user selects, the map image M _dsp May be changed.
[0092]
Also, in the above embodiment, the route search device 1 has two routes OR ₁ And OR ₂ However, the present invention is not limited to this, and three or more optimal routes may be derived, and the cause of the difference may be specified.
[0093]
In addition, the route search device 1 determines a plurality of routes obtained by the route search, for example, the route OR ₁ And OR ₂ Is re-evaluated under the same conditions, and any one is selected as the recommended route. Thereafter, the route search device 1 may output the recommended route, the remaining route, and the cause of the difference.
[0094]
Further, in the above embodiment, the route search device 1 uses the traffic information I _tr Each time is stored, a re-route search is performed. That is, the route search device 1 determines that two consecutive traffic information I _tr , Two-way OR ₁ And OR ₂ Identified the cause of the difference. However, as is well known, the route search places a heavy burden on the processor 16, so that the route search device 1 is preferably provided with the next traffic information I. _tr Not traffic information I _tr When is stored, a re-route search may be performed.
[0095]
In the above embodiment, the route search device 1 uses the map image M _dsp The first path OR ₁ And the second path OR ₂ External link L that constitutes both _ex And the current traffic congestion level and change level L _tc But not only these, but also the first path OR ₁ And the second path OR ₂ External link L around _ex The current traffic congestion level and change level L _tc May be combined. In addition, the current congestion degree and the change level L _tc Is the target external link L _ex More preferably, it is synthesized above. Further, the route search device 1 uses the map image M _dsp And the current congestion degree and change level L _tc May be provided individually to the user without combining them.
[0096]
Further, in the above embodiment, the processor 16 performs the step F13 so that the synthesized voice data D _ad2 Had been created. As a result, the external link L that most affected the change of the optimal route _ex Can be known by the user. The synthesized voice data D _ad2 Is the target external link L _ex The name of the road or the name of the nearest intersection may be transmitted to the user using synthesized speech. Further, the processor 16 controls the avoidance route information I _ss Or use route information I _pr External link L included in _ex Is the change level L _tc Are arranged in descending order, and the status change information record R _sc Is selected, and the synthesized speech data D is sequentially used using the selected one. _ad2 May be created.
[0097]
Also, the external link L closest to the current position of the user _ex Change information record R containing _sc , The synthesized voice data D _ad2 It is also preferred to create Further, similarly, the processor 16 also generates the avoidance route information I _ss Or use route information I _pr External link L included in _ex Are arranged in the order close to the current position of the user, and the status change information record R _sc Is selected, and the synthesized speech data D is sequentially used using the selected one. _ad2 May be created.
[0098]
When the user can select any one of the plurality of routes, the route searching device 1 _ss Or use route information I _pr Change information record R included in _sc Is selected, and the synthesized speech data D is sequentially used using the selected one. _ad2 May be created.
[0099]
Further, in the above embodiment, the processor 16 uses the use route information I _pr , The synthesized voice data D _ad2 May be created.
[Brief description of the drawings]
FIG. 1 is a schematic diagram illustrating a hardware configuration of a route search device 1 according to an embodiment of the present invention.
FIG. 2 is a map data D stored in a storage device 11 shown in FIG. _cart It is a schematic diagram which shows the road network represented by.
FIG. 3 is a map data D stored in a storage device 11 shown in FIG. _cart FIG. 3 is a schematic diagram showing a detailed data structure of FIG.
4 is traffic information I received by the receiver 14 shown in FIG. _tr FIG. 3 is a schematic diagram showing a detailed data structure of traffic information I; _tr Type T set in _inf And content C _inf FIG.
FIG. 5 is a schematic diagram showing a road network used in a general road-to-vehicle communication system and / or VICS.
FIG. 6 is a first half of a flowchart showing a processing procedure of a processor 16 described in a program 151 of FIG. 1;
7 is a latter half of a flowchart showing a processing procedure of a processor 16 described in a program 151 of FIG. 1;
FIG. 8 is a first estimated speed table T described in a program 151 of FIG. 1; _fs FIG.
FIG. 9 is a flowchart showing a detailed processing procedure of step A3 shown in FIG. 6;
FIG. 10 is a schematic diagram showing a process performed in step B5 of FIG. 9;
FIG. 11 shows first route data RD created in step A5 of FIG. ₁ FIG.
FIG. 12 shows display image data D created in step A8 of FIG. _dsp1 Map image M represented by _dsp FIG.
FIG. 13 is a second estimated speed table T described in a program 151 of FIG. 1; _sc FIG.
FIG. 14 is a flowchart showing a detailed processing procedure of step A12 in FIG. 6;
FIG. 15 is a schematic diagram illustrating a process performed in step C11 of FIG. 14;
FIG. 16 shows the second route data RD created in step A15 of FIG. ₂ FIG.
FIG. 17 is a flowchart showing a detailed processing procedure of step A19 in FIG. 7;
18 is a first half of a flowchart showing a detailed processing procedure of step D1 in FIG. 17;
FIG. 19 is a latter half of the flowchart showing the detailed processing procedure of step D1 in FIG. 17;
FIG. 20 is an initial content table T described in a program 151 of FIG. 1; _ic FIG.
FIG. 21 is situation change information I created in step D1 of FIG. 17; _sc FIG. 3 is a schematic diagram showing a detailed data structure of FIG.
FIG. 22 shows the first replacement route data PRD created in step D2 of FIG. ₁ And second replacement route data PRD ₂ FIG.
FIG. 23 is a first difference link data DLD created in step D3 of FIG. 17; ₁ And second difference link data DLD ₂ FIG.
FIG. 24 is avoidance route information I created in step D4 of FIG. 17; _ss , And the use route information I created in step D5 _pr FIG.
FIG. 25 is a flowchart showing a detailed processing procedure of step A22.
FIG. 26 is display image data D created in step F12 of FIG. 25; _dsp2 Map image M represented by _dsp FIG.
FIG. 27 is a flowchart showing a detailed processing procedure of step F13 in FIG. 25;
[Explanation of symbols]
1. Route search device
11 ... Storage device
12 Input device
13 ... Locator
14 ... Receiver
15 Program memory
151: Computer program
16 ... Processor
17… Working area
18 Display device
19 ... Speaker

Claims (9)

A route search device,
A route search unit that performs a plurality of processes for searching for a route from the search start point to the search end point, and derives a plurality of different routes;
A cause identification unit that identifies the cause of the difference between the plurality of routes searched by the route search unit,
A route search device, comprising: a plurality of routes searched by the route search unit; and an output unit that outputs a cause identified by the cause identification unit. The route search device further includes a receiving unit that receives traffic information periodically sent from the outside,
The route searching device according to claim 1, wherein the cause specifying unit specifies a cause of a difference between the plurality of routes searched by the route searching unit using the traffic information received by the receiving unit. The cause identification unit is
Using the traffic information received by the receiving unit, a situation change information creating unit that creates situation change information indicating a change in the traffic situation on at least the route searched by the route search unit,
Of the plurality of routes searched by the route searching unit, a difference data creating unit that creates a plurality of difference data specifying different parts from each other,
Using any one of the difference data created by the difference data creation unit and the situation change information created by the situation change information creation unit, a traffic condition of the plurality of routes searched by the route search unit. An avoidance route information creating unit that creates avoidance route information in which
Using the other difference data created by the difference data creation unit and the situation change information created by the situation change information creation unit, the traffic condition of the plurality of routes searched by the route search unit is The route search device according to claim 2, further comprising: a use route information creation unit that creates improved use route information. Using the map data stored in advance, the route search unit searched using the avoidance route information created by the avoidance route information creation unit and / or the use route information created by the use route information creation unit. The route search device according to claim 3, further comprising: an image data creation unit that creates display image data in which a plurality of routes are different on a map and that sends the image data to the output unit. Using the avoidance route information created by the avoidance route information creation unit and / or the use route information created by the use route information creation unit, the cause of the difference between the plurality of routes searched by the route search unit is spoken. The route search device according to claim 3, further comprising a synthesized voice data generating unit that generates synthesized voice data to be represented and sends the synthesized voice data to the output unit. The route search device further includes a selection unit that selects one of the plurality of routes searched by the route search unit,
The output unit outputs a path selected by the selection unit and a path not selected by the selection unit in different methods, and outputs a cause specified by the cause specification unit in different methods. Item 2. The route search device according to item 1. A route search method,
A route search step of performing a plurality of processes for searching for a route from the search start point to the search end point to derive a plurality of different routes;
A cause identification step of identifying a cause of the difference between the plurality of routes searched in the route search step,
A route search method, comprising: a plurality of routes searched by the route search step; and an output step of outputting a cause identified in the cause identification step. The route search method according to claim 7, implemented as a computer program executable on a computer device. The route search method according to claim 8, wherein the computer program is recorded on a recording medium.

Images