JP6571482B2 - Method for generating section information and information processing apparatus - Google Patents

Description

  The present invention relates to a technique for generating section information.

  A technique for collecting and accumulating probe information transmitted from a vehicle that actually travels on a road and obtaining statistical data of the probe information is known. In the statistical data, for each link (predetermined section) included in the road network, the travel time when passing through the road section corresponding to the link is stored in association with each other. Such statistical data is also referred to as traffic information data, and is used, for example, to predict the travel time of the entire route in the route search process.

  FIG. 1 is a diagram for explaining the problems of the prior art. As shown in FIG. 1A, for example, a plurality of continuous links such as links L1 to L4, and a plurality of links having signals at nodes (element points on the road network) between the links, Consider the case where the vehicle actually travels. In this case, the time required for the vehicle to travel on the link L1 greatly depends on the display content of the traffic light TL1 installed at the node N2 in the traveling direction. When the display content of the traffic light TL1 is blue, acceleration / deceleration is difficult to occur, so the time required for traveling is short (for example, 20 seconds). On the other hand, when the display content of the traffic light TL1 is red, acceleration / deceleration is likely to occur, so that the time required for traveling becomes long (for example, 80 seconds). In this way, probe information collected from a vehicle that actually traveled on the road varies greatly depending on the display content of the traffic light at that time. Therefore, the travel time of the link L1 in the traffic information data, that is, the plurality of travel times related to the link L1 based on the plurality of probe information collected from many vehicles is a graph illustrated in a balloon indicated by a broken line in FIG. In this way, multiple travel times with large variations are included. Hereinafter, the fact that the travel time of the same link in the traffic information data includes a plurality of travel times having variations is simply referred to as “intra-link travel time variations”.

  Also, for each section of the links L2 to L4, the travel time within the link varies for the same reason as the link L1. Furthermore, in the example of FIG. 1, an example in which the travel time in the link varies due to the display content of the traffic lights is shown, but due to other factors (for example, changes in the road environment such as presence or absence of regulations) Variations in intra-link travel times can occur. In the route search processing, it is common to predict the travel time of the entire route by obtaining the travel time at each link constituting the route using the traffic information data and integrating the obtained travel time. For this reason, there has been a problem that the travel time variation of the entire route cannot be accurately predicted due to the variation of the travel time in the link in the traffic information data as described above.

  In order to solve the above-mentioned problem, a technique is known in which a composite section combining a plurality of links is defined in advance, and travel time is managed in units of the composite section. For example, the example of FIG. 1B shows an example in which travel times are prepared in units of composite sections of links L1 and L2 in the traffic information data with links L1 and L2 as composite sections. In this case, the travel time for the link L1 + L2 is stored in the traffic information data based on the collected probe information. Patent Document 1 describes a technique for defining a composite section using a standard deviation based on a total value of travel times (link costs) of each link in traffic information data.

Japanese Patent No. 4978720

  In the above prior art, since the composite section is defined using the standard deviation, when the travel information data of the same link included in the traffic information data is small, the obtained standard deviation value is May become extremely small. In such a case, there is a problem that the composite section defined based on the obtained standard deviation is not necessarily reliable. In other words, in the above prior art, in order to increase the reliability of the travel time managed by the composite section, the number of travel time data of the same link included in the traffic information data is required to be more than a certain value. There was a problem of becoming.

  For this reason, in the technology for defining a composite section that combines multiple links, it is possible to define a composite section that does not depend on the number of data in the traffic information data, and the reliability of the travel time managed by the defined composite section It has been desired to improve the performance.

SUMMARY An advantage of some aspects of the invention is to solve at least a part of the problems described above, and the invention can be implemented as the following forms.
A first aspect of the present invention is a method for generating section information defining a composite section,
An information processing apparatus is a traffic section composed of a plurality of continuous links using link information in which information about links constituting a traffic network is stored in advance, and the traffic section having a predetermined characteristic Extracting, and
An information processing apparatus comprising: associating the plurality of links constituting the extracted traffic section as a single composite section and storing them in a storage unit;
The predetermined feature is:
The traffic section has a first link that is the link of a predetermined length or less leading to a traffic signal that controls traffic, and a second link that is the link that enters the first link, and A first feature that is a section that does not have the traffic signal in a direction of entering the first link from a second link;
The traffic section is connected to at least two of the links on one side of the link in the link information, but progress is restricted except for one of the at least two links. The second link is a first link that is the link, and a second link that is the link that is restricted from entering from the other link and is accessible from the first link. Features of
The traffic section is composed of a first link that is the link dedicated to turning right and left, and a second link that is the link that enters the first link, or the traffic section is the link In the information, although it is connected to the link dedicated to the right and left turn, the link dedicated to the right and left turn is the third link which is the link whose progress is restricted, and the third link that enters the third link A fourth link being a link, and a third feature comprising:
In the same section, the link section in the link information and other link information different from the link information, and information relating to the links constituting the traffic network is stored in advance. The link information in the link information is at least one of the fourth feature that is composed of different links, and
The extracting step and the storing step are executed for each of the first feature, the second feature, the third feature, and the fourth feature.
The second aspect of the present invention is:
A method for generating section information defining a composite section,
An information processing apparatus is a traffic section composed of a plurality of continuous links using link information in which information about links constituting a traffic network is stored in advance, and the traffic section having a predetermined characteristic Extracting, and
An information processing apparatus comprising: associating the plurality of links constituting the extracted traffic section as a single composite section and storing them in a storage unit;
The predetermined feature is:
In the same section, the link section in the link information and other link information different from the link information, and information relating to the links constituting the traffic network is stored in advance. The link information in the link information is characterized in that it consists of different links.
The step of extracting the traffic section having the predetermined characteristics includes:
By generating a plurality of polygons from each of the links in the link information and the links in the other link information, and comparing the shapes of the generated polygons, the link information and the other links Extracting the same section from the information.
The third aspect of the present invention is:
A method for generating section information defining a composite section,
An information processing apparatus is a traffic section composed of a plurality of continuous links using link information in which information about links constituting a traffic network is stored in advance, and the traffic section having a predetermined characteristic Extracting, and
An information processing apparatus comprising: associating the plurality of links constituting the extracted traffic section as a single composite section and storing them in a storage unit;
The traffic section includes a first link and a second link that can travel to the first link;
In the traffic section, when the stop does not occur at the first link, when the stop occurs at the second link, and when the stop occurs at the first link, This includes the feature that the stop of the two links does not occur.
In addition, the present invention can be realized in the following forms.
According to this method, a traffic section having a negative correlation can be defined as one composite section.

(1) According to one aspect of the present invention, a method for generating section information defining a composite section is provided. In this method, the information processing apparatus is a traffic section composed of a plurality of continuous links using link information in which information about links constituting the traffic network is stored in advance, and has a predetermined characteristic. A step of extracting the traffic section; and a step of causing the information processing apparatus to associate and store the plurality of links constituting the extracted traffic section as one composite section in a storage unit.
According to the method of this aspect, the information processing apparatus uses the link information to extract a traffic section including a plurality of continuous links and having a predetermined characteristic, and a plurality of information constituting the traffic section. The link is defined as one composite section and stored in the storage unit. That is, according to this method, by using link information, a composite section can be defined without using traffic information data, which is statistical data of probe information, and therefore depends on the number of data in the traffic information data. It is possible to define composite sections that do not. In addition, according to this method, since the composite section is defined based on information about the link (for example, link length, link restriction information, etc.), the reliability of the travel time managed by the defined composite section Can be improved.

(2) In the method of the above aspect; the predetermined characteristic may be that there is a correlation regarding a traffic situation among the plurality of links constituting the traffic section.
According to the method of this embodiment, the predetermined characteristic is that there is a correlation regarding the traffic situation among the plurality of links constituting the traffic section. For this reason, if the traffic situation in one link changes, a plurality of links having the property that the traffic situation in the other link also changes can be defined as one composite section.

(3) In the method of the above aspect; the predetermined feature is: a first link, the traffic section being the link of a predetermined length or less that continues to a traffic signal that controls traffic, and the first link A second link that is the link that enters the first link, and a first feature that is a section that does not have the traffic signal in the direction of entering the first link from the second link; The link in which the section is connected to at least two of the links on one side of the link in the link information, but the progress is restricted except for one of the at least two links And a second link which is a link that is restricted from entering from the other link and is accessible from the first link. And; said transportation zone Consists of a first link that is the link dedicated to turning left and right and a second link that is the link that enters the first link, or the traffic section is included in the link information. The third link is the link that is connected to the link dedicated to the right / left turn, but the progress is restricted to the link dedicated to the right / left turn, and the link that enters the third link. A fourth feature comprising: a fourth link; wherein the traffic section is the same section, the link delimitation method in the link information, and other link information different from the link information. The fourth feature is that the link is different from the link delimitation method in the other link information in which information relating to the links constituting the traffic network is stored in advance. ; It may be at least any one of the.
According to the method of this embodiment, when the first feature is adopted as the predetermined feature, the first link that is a link of a predetermined length or less leading to the traffic light, and the link that enters the first link. A section having a second link and not having a traffic signal in the direction of traveling from the second link to the first link can be defined as one composite section. When the second feature is adopted as the predetermined feature, the link information is connected to at least two links on one side of the link, but one of the at least two links. In addition to the book, the first link is a link whose progression is restricted, the second link which is a link that is restricted from entering from the other link and is accessible from the first link, Can be defined as one composite interval. In addition, when the third feature is adopted as a predetermined feature, a first link that is a link dedicated to turning right and left and a second link that is a link entering the first link are combined into one composite. It can be defined as an interval. Further, when the third feature is adopted as a predetermined feature, the link information is connected to a link dedicated to right / left turns, but the link dedicated to right / left turns is a link whose progress is restricted. It is also possible to define three links and a fourth link that is a link entering the third link as one composite section. In addition, when the fourth feature is adopted as a predetermined feature, in the same section, a link delimitation method in the link information, and other link information different from the link information and related to a link constituting the traffic network A plurality of links that differ from the way of separating links in other link information in which information is stored in advance can be defined as one composite section.

(4) In the method of the above aspect, each of the extracting step and the storing step includes each of the first feature, the second feature, the third feature, and the fourth feature. May be performed.
According to the method of this aspect, the links having the first to fourth characteristics are extracted based on information about the links (for example, link length, link restriction information, etc.), and each is combined into one composite section. And can be stored in the storage unit. That is, according to this method, the composite sections extracted by the first to fourth different features can be respectively defined.

(5) In the method of the above aspect, in the extracting step, the step of extracting the traffic section having the fourth feature is: the link in the link information and the link in the other link information A step of generating a plurality of polygons from each of them and extracting the same section from the link information and the other link information by comparing the shapes of the generated polygons may be included.
According to the method of this aspect, the link information and the other link information have the same property (that is, the property that information regarding the link constituting the traffic network is stored in advance), but the link information is obtained from different information sources. By comparing the shapes of polygons generated from the same, the same section can be easily extracted.

  The present invention can be implemented in various modes. For example, a method for generating section information, a method for generating traffic information data using a method for generating section information, and a method for generating section information. Route search method used, information processing device for executing these methods, system for executing these methods, computer program for realizing the functions of the device or system, server device for distributing the computer program, The present invention can be realized in the form of a non-temporary storage medium storing a computer program.

It is a figure explaining the subject of a prior art. It is a figure which shows schematic structure of the information processing system as one Embodiment of this invention. It is a figure which shows an example of a structure with map DB, probe map DB, and area DB. It is a figure explaining the correlation about a traffic condition. It is a flowchart which shows the procedure of an area information generation process. It is a figure explaining the 1st feature. It is a flowchart which shows the procedure of the production | generation process by a 1st production | generation part. FIG. 7 is a diagram illustrating an example of a section DB after the generation process by the first generation unit is completed for the specific example of FIG. 6. It is a figure explaining the 2nd characteristic. It is a flowchart which shows the procedure of the production | generation process by a 2nd production | generation part. It is a flowchart which shows the procedure of the production | generation process by a 2nd production | generation part. FIG. 10 is a diagram illustrating an example of a section DB after the generation process by the second generation unit is completed for the specific example of FIG. 9. It is a figure explaining the 3rd feature. It is a flowchart which shows the procedure of the production | generation process by a 3rd production | generation part. FIG. 13 is a diagram illustrating an example of a section DB after the generation process by the third generation unit is finished for the specific example of FIG. 12. It is a figure explaining the 4th characteristic. It is a flowchart which shows the procedure of the production | generation process by a 4th production | generation part. It is a figure explaining the method to extract the same area. FIG. 16 is a diagram illustrating an example of a section DB after the generation process by the fourth generation unit is finished for the specific example of FIG. 15.

A. Embodiment:
A-1. System outline:
FIG. 2 is a diagram showing a schematic configuration of an information processing system as an embodiment of the present invention. The information processing system 1 according to the present embodiment extracts and extracts a traffic section including a plurality of continuous links and having a predetermined characteristic by executing a section information generation process described later. A plurality of links constituting a traffic section are associated and defined as one composite section.

  The “link information” is information related to the links constituting the traffic network, and is information including, for example, the link length and link regulation information. In this embodiment, map DB172 mentioned later is used as link information. In the following description, the database is also simply referred to as “DB”. “Traffic section” means a section composed of a plurality of continuous links. “Composite section” means a traffic section (a plurality of continuous links) determined to be preferable to manage travel time in units of the traffic section as a result of the section information generation process among the traffic sections. .

  In addition, the information processing system 1 according to the present embodiment performs route guidance processing using the defined composite section. The route guidance process is a process for guiding a highly accurate route from a departure point specified by a user to a destination and a travel time predicted to be required to pass the route.

  The information processing system 1 according to the present embodiment includes a server 10 and a navigation device 20. The server 10 is connected to the Internet INT by, for example, wired communication. The navigation device 20 is connected to the Internet INT by wireless communication via the communication carrier BS. The communication carrier BS includes a transmission / reception antenna, a radio base station, and an exchange. That is, the server 10 and the navigation apparatus 20 are connected via the Internet INT and can communicate with each other.

A-1-1. Server configuration:
The server 10 includes a CPU 110, a communication unit 140, a ROM 150, a RAM 160, and a storage unit 170, and each unit is connected to each other via a bus (not shown). The server 10 functions as an “information processing apparatus”.

  The storage unit 170 includes a hard disk, a flash memory, a memory card, and the like. The storage unit 170 includes an image DB 171, a map DB 172, a probe map DB 173, a traffic information DB 174, and a section DB 175. The image DB 171 stores data representing a map image. The data representing the map image includes information necessary for displaying the map, such as terrain, buildings, and road shapes. The image DB 171 is prepared in advance and stored in the storage unit 170.

  FIG. 3 is a diagram illustrating an example of the configuration of the map DB 172, the probe map DB 173, and the section DB 175. “X” in FIG. 3 means an arbitrary character string. FIG. 3A shows an example of the configuration of the map DB 172 and the probe map DB 173. The map DB 172 stores information regarding nodes and information regarding links as data for specifying the configuration of the road network. A node means an element point in a traffic network. For example, intersections, branch points, end points, start points, and the like correspond to nodes. A link means a link (that is, a predetermined section) constituting a traffic network. A link is a line segment connecting nodes. For example, a road such as a roadway or a pedestrian road, or a traffic route such as a railroad track corresponds to the link.

  In the example of this embodiment shown in FIG. 3 (A), the map DB 172 includes link ID, position information, type, link length, width information, number of lanes, and restriction information as information relating to links. , Fields are included. In the link ID, an identifier uniquely assigned to each link is stored in order to mutually identify information regarding a plurality of links stored in the map DB 172. The position information stores information for specifying the position of the link, for example, latitude and longitude, coordinates on the map, and the like. In the type, information for specifying the type of link is stored. The type of link indicates, for example, an expressway, a national road, a prefectural road, a pedestrian road, and the like. The link length stores information indicating the link length. In the width information, information indicating the width of the link is stored. The number of lanes stores information indicating the number of link lanes. In the restriction information, information indicating the restriction attached to the link is stored. Restriction refers to, for example, one-way traffic, right-turn exclusive use, left-turn exclusive use, straight-run exclusive use, and whether or not traffic is permitted depending on time of day. Note that information indicating a “designated direction entry prohibited section” may be stored in the restriction information in the right / left turn exclusive lane described in the third feature (details will be described later).

  In the example of the present embodiment illustrated in FIG. 3A, the map DB 172 includes fields of node ID, position information, type, and signal presence / absence as information relating to the node. In the node ID, an identifier uniquely assigned to each node is stored in order to mutually identify information regarding a plurality of nodes stored in the map DB 172. The position information stores information for specifying the position of the node, for example, latitude and longitude, coordinates on a map, and the like. In the type, information for specifying the type of the node is stored. The node type indicates, for example, an intersection, a branch point, an end point, a start point, or the like. In the presence / absence of a signal, information indicating whether or not a traffic signal exists at the node is stored. In the presence / absence of a signal, in addition to the presence / absence of a traffic signal, the type of the traffic signal may be stored.

  The map DB 172 functions as “link information”. The map DB 172 is prepared in advance and stored in the storage unit 170.

  Similar to the map DB 172, the probe map DB 173 stores information about nodes and information about links as data for specifying the configuration of the road network. The table structure of the probe map DB 173 is the same as the table structure of the map DB 172 described with reference to FIG. The probe map DB 173 functions as “other link information”. The probe map DB 173 is prepared in advance and stored in the storage unit 170.

  The difference between the map DB 172 and the probe map DB 173 is the data stored in the table (portion shown as “XXX” in the figure). The difference in the data in the table arises for the following reasons. The map DB 172 is a DB used for route search in route search processing. For this reason, the configuration of links and nodes in the map DB 172 (that is, how to divide links and nodes with respect to the actual road network) is the same as the configuration of links and nodes in the traffic information DB 174. On the other hand, the probe map DB 173 is a DB used when the server 10 uses probe information collected from many vehicles that actually travel on the road. For this reason, the configuration of the links and nodes in the probe map DB 173 is the same as the configuration of the links and nodes in the map DB adopted by each vehicle manufacturer. For this reason, in FIG. 2, the server 10 includes one probe map DB 173, but the server 10 may include a plurality of probe map DBs 173. For example, the server 10 may include a probe map DB 173 for the vehicle manufacturer A, a probe map DB 173 for the vehicle manufacturer B, and a probe map DB 173 for the vehicle manufacturer C.

  In the traffic information DB 174 (FIG. 2), many vehicles that actually travel on the road with respect to each of a plurality of links stored in the map DB 172 and a plurality of composite sections defined in the section DB 175 The travel time of the link (or compound section) based on the probe information collected from is stored. The travel time of a link is also called “link cost”. In addition to the travel time of the link (or composite section), the traffic information DB 174 includes classification conditions for classifying the travel time of the link (or composite section) (for example, date and time when probe information was collected, weather, etc.) Other information such as) may be stored. The traffic information DB 174 functions as “traffic information data”. The traffic information DB 174 is updated as needed in response to acquisition of probe information, update of the map DB 172, update of the section DB 175, and the like.

  FIG. 3B shows an example of the configuration of the section DB 175. The section DB 175 is a DB for defining the composite sections extracted by the section information generation process described later in association with each other. One entry (one row) in the section DB 175 represents one composite section. The section DB 175 includes fields for UID, start point link, end point link, constituent link group, and extraction direction. The UID stores an identifier uniquely assigned to each composite section in order to identify each composite section from each other. In the start point link, a link ID having a larger link ID (FIG. 3A) among the links located at both ends of the composite section is stored. In the end point link, the link ID having the smaller link ID among the links located at both ends of the composite section is stored. In the constituent link group, link IDs of all other links that do not correspond to the start point link and the end point link among the plurality of links to be the composite section are stored. A plurality of link IDs may be stored in the constituent link group.

In the extraction direction, the relationship between the traveling direction of the links constituting the composite section and the start point link and end point link is stored. As described above, in the section DB 175 of this embodiment, a link with a small link ID is stored as a start point link, and a link with a large link ID is stored as an end point link. However, the link has two types of travel directions, “up” and “down”. Therefore, the entry direction is
(A1) Whether a composite section that progresses from a link with a small link ID (for example, link L1) to a link with a large link ID (for example, link L2) is defined,
(A2) Whether a composite section that progresses from a link with a large link ID (for example, link L2) to a link with a small link ID (for example, link L1) is defined,
Stored for the purpose of distinguishing. In the case of the former a1, “order” is stored in the extraction direction, and in the case of the latter a2, “reverse” is stored in the extraction direction. When both the former a1 and the latter a2 are defined, “forward / reverse” is stored in the extraction direction.

  Specifically, in the example of the entry E1 in FIG. 3B, a composite section that progresses from the link L1 to the link L2 and a composite section that progresses from the link L2 to the link L1 are defined. In the entry E1, there is no configuration link group (NULL). In the example of entry E2, a composite section is defined that travels from link L3 through link L4 to link L5. In the example of the entry E3, a composite section is defined that travels from the link L9 through the links L8 and L7 to the link L6. The section DB 175 is updated as needed by section information generation processing described later.

  The CPU 110 (FIG. 2) controls each unit of the server 10 by developing a computer program stored in the ROM 150 on the RAM 160 and executing it. In addition, the CPU 110 also functions as the section information generation unit 120 and the route search unit 130. The section information generation unit 120 executes section information generation processing. In the section information generation process, a traffic section having a plurality of continuous links and having a predetermined characteristic is extracted from the map DB 172, and a plurality of links constituting the extracted traffic section are defined as one composite section. It is processing to do. In the present embodiment, as a predetermined feature, it is adopted that there is a correlation regarding a traffic situation between a plurality of links constituting a traffic section. Moreover, in this embodiment, the below-mentioned 1st-4th characteristic is illustrated as a specific example of the traffic area which produces the correlation regarding a traffic condition.

  FIG. 4 is a diagram for explaining the correlation regarding the traffic situation. In the present embodiment, “correlation with respect to traffic conditions” means that if the traffic condition on one link constituting the traffic section changes, the traffic condition on the other link also changes. There are positive correlations and negative correlations in the traffic situation.

4A and 4B are diagrams for explaining a positive correlation. “Positive correlation” means that the following relationship is established when a scene passing through the continuous link L1 and link L2 is assumed.
As shown in FIG. 4A, if the link L1 is congested between the links L1 and L2, the link L2 is congested.
As shown in FIG. 4B, if the link L1 is free, the link L2 is also free.
That is, a positive correlation means that the traffic situation on each successive link is linked in the same direction. The second feature and the fourth feature employed in the present embodiment are specific examples of traffic sections that generate a positive correlation.

4C and 4D are diagrams for explaining the negative correlation. “Negative correlation” means that the following relationship is established between the links L1 and L2 when a scene passing through the continuous link L1 and the link L2 is assumed.
As shown in FIG. 4C, when the stop does not occur at the link L1, the stop occurs at the link L2 (or the stop is likely to occur).
As shown in FIG. 4D, when the stop occurs at the link L1, the stop does not occur at the link L2 (or the stop is difficult to occur).
That is, a negative correlation means that traffic information on each successive link is linked in different directions. The first feature and the third feature employed in the present embodiment are specific examples of traffic sections that generate a negative correlation.

  The section information generation unit 120 includes a first generation unit 121, a second generation unit 122, a third generation unit 123, and a fourth generation unit 124. The 1st production | generation part 121 extracts the traffic area which has a 1st characteristic, and memorize | stores the some link which comprises the extracted traffic area in area DB175 as one compound area. The 2nd production | generation part 122 extracts the traffic area which has a 2nd characteristic, and memorize | stores the some link which comprises the extracted traffic area in area DB175 as one compound area. The 3rd production | generation part 123 extracts the traffic area which has the 3rd characteristic, and memorize | stores the some link which comprises the extracted traffic area in area DB175 as one compound area. The 4th production | generation part 124 extracts the traffic area which has a 4th characteristic, and memorize | stores the some link which comprises the extracted traffic area in area DB175 as one compound area.

  The route search unit 130 executes route search processing in response to a request from the user, and searches for a route from the designated departure point to the destination. In the route search process, the route search unit 130 uses the map DB 172 and the traffic information DB 174. At this time, in the traffic information DB 174, for example, when both the travel time of the link L1 and the travel time of the link L2 and the travel time of the composite section of the link L1 + L2 are stored in the traffic information DB 174, the route search unit 130 Prior to the travel time, the travel time of the composite section (link L1 + L2) is used. As described in FIG. 1, the travel time of the composite section is more accurate than the travel time of the individual links. For this reason, the route search unit 130 can obtain a highly accurate route from the departure point to the destination by using the travel time of the highly accurate composite section, and is necessary for passing through the entire route. Predicted travel time can be calculated and guided.

  The communication unit 140 controls communication with other devices via a communication interface (not shown). The other devices are, for example, the navigation device 20, a vehicle that transmits probe information, a VICS center, and other servers.

A-1-2. Configuration of navigation device:
The navigation device 20 includes a CPU 210, a communication unit 220, a ROM 230, a RAM 240, a storage unit 250, an input / output unit 260, and a current position acquisition unit 270. It is connected. The navigation device 20 functions as a “client device of an information processing device”.

  CPU210 controls each part of the navigation apparatus 20 by expand | deploying and executing the computer program stored in ROM230 on RAM240. In addition, the CPU 210 also functions as the route guide unit 212. The route guidance unit 212 is predicted to be required for the user of the information processing system 1 (that is, the user of the navigation device 20) to pass the route from the departure point to the destination and the entire route. And travel time. For example, the route guidance unit 212 can implement the above-described guidance by executing the following procedures b1 to b4.

(B1) The route guide unit 212 acquires the designation of the departure place and the designation of the destination from the user via the input / output unit 260. The route guidance unit 212 may omit the acquisition of the designation of the departure place using the current position acquired by the current position acquisition unit 270.
(B2) The route guidance unit 212 transmits a route search request to the server 10. The route search request includes designation of a departure place and designation of a destination.
(B3) The route search unit 130 of the server 10 executes the route search process described above. The route search unit 130 responds to the navigation device 20 with the obtained route and travel time.
(B4) The route guidance unit 212 guides the route and travel time acquired from the server 10 to the user. Specifically, the route guidance unit 212 uses the input / output unit 260 to display the route and travel time, and notifies the guidance voice.

  The communication unit 220 controls communication with other devices via a communication interface. The other device is, for example, the server 10 or another server. The storage unit 250 includes a hard disk, a flash memory, a memory card, and the like. The input / output unit 260 is various interfaces used for input / output of information between the navigation device 20 and the user. As the input / output unit 260, for example, a touch panel as an input unit, operation buttons, a keyboard, a microphone, a touch panel as an output unit, a liquid crystal panel, an LED (Light Emitting Diode) indicator, or the like can be employed. The current position acquisition unit 270 receives radio waves transmitted from artificial satellites constituting a GPS (Global Positioning System) and acquires current position information (for example, latitude and longitude) indicating the current position of the navigation device 20. To do.

A-2. Section information generation processing:
FIG. 5 is a flowchart showing the procedure of the section information generation process. The section information generation process is executed by the section information generation unit 120 of the server 10. The start trigger of the section information generation process can be arbitrarily determined. For example, the server 10 may be executed at a time when the load is low, may be executed periodically, or may be executed when the server 10 is activated.

  In step S100, the section information generation unit 120 opens the map DB 172 stored in the storage unit 170. In step S200, the section information generation unit 120 causes the first generation unit 121 to execute generation processing. In step S300, the section information generation unit 120 causes the second generation unit 122 to execute generation processing. In step S400, the section information generation unit 120 causes the third generation unit 123 to execute generation processing. In addition, the production | generation process by the 1st-3rd production | generation parts 121-123 is performed using map DB172.

  In step S500, the section information generation unit 120 opens the probe map DB 173 stored in the storage unit 170. In step S600, the section information generation unit 120 causes the fourth generation unit 124 to execute generation processing. The generation process by the fourth generation unit 124 is executed using the map DB 172 and the probe map DB 173. In step S700, the section information generation unit 120 makes the information in the section DB 175 unique. Specifically, the section information generation unit 120 assigns a UID to each entry in the section DB 175 updated by the first to fourth generation units 121 to 124. Thereafter, the section information generation unit 120 closes the opened DB and ends the process.

A-2-1. Generation process (first generation unit 121):
FIG. 6 is a diagram illustrating the first feature. The “first feature” is based on the condition that in the map DB 172, a section (traffic section) composed of a plurality of continuous links is composed of the following links.
A first link that is a link of a predetermined length or less leading to a traffic signal that controls traffic.
A second link that is a link entering the first link.
-There is no traffic light in the direction of entering the first link from the second link.

  For example, as shown in FIG. 6, a short link L0 having a traffic signal TL0 at the destination is assumed. In the present embodiment, “short link” means a link that falls within a predetermined range (for example, 5%) from the shorter link length among the link lengths stored in the map DB 172. When the display content of the traffic light TL0 is red, a phenomenon that a vehicle that cannot stop in the short link L0 with a short distance continues to the link L1 is likely to occur. In such a situation, when the display content of the traffic light TL0 changes to blue, there is a high possibility that the vehicle stopped at the link L1 can pass through the short link L0 without stopping within the short link L0. As described above, the short link L0 and the link L1 are easily linked in the same traffic condition and have a negative correlation.

  FIG. 7 is a flowchart showing a procedure of generation processing by the first generation unit 121. The process of FIG. 7 aims to extract a traffic section having the first feature. In step S <b> 202, the first generation unit 121 refers to “signal presence / absence” in the map DB 172 and extracts all nodes having traffic signals. In step S204, the first generation unit 121 repeatedly executes the processing of steps S206 to S222 while moving the processing target node until the processing is completed for all the extracted nodes (loop 1).

  In step S206, the first generation unit 121 repeatedly executes the processing of steps S208 to S222 while moving the processing target link until processing is completed for all the links connected to the processing target node (loop 2). . In step S208, the first generation unit 121 checks whether or not the processing target link is equal to or less than a predetermined distance. The predetermined distance can be arbitrarily determined, for example, 10 m as described above. When the processing target link is longer than the predetermined distance (step S208: NO), the first generation unit 121 shifts the processing to step S206.

  When the processing target link is equal to or shorter than the predetermined distance (step S208: YES), in step S210, the first generation unit 121 sets the processing target link to “link A”. In step S <b> 212, the first generation unit 121 confirms whether or not there is a traffic light at the node opposite to the processing target node for the link A. When there is a traffic light (step S212: YES), the first generation unit 121 shifts the processing to step S206. When there is no traffic signal (step S212: NO), in step S214, the first generation unit 121 acquires a link other than the link A connected to the opposite node.

  In step S216, the first generation unit 121 repeatedly executes the processing of steps S218 to S222 while changing the processing target link until the processing is completed for all the acquired links (loop 3). In step S218, the first generation unit 121 sets the processing target link of loop 3 to “link B”. In step S <b> 220, the first generation unit 121 refers to the “regulation information” in the map DB 172 and confirms whether it is possible to proceed from the link B to the link A. When it cannot progress (step S220: NO), the 1st generation part 121 makes processing shift to step S216.

  When it is possible to proceed (step S220: YES), in step S222, the first generation unit 121 stores the link A and the link B in the section DB 175 together with the extraction direction as a composite section. At the time of step S222, only the start point link, end point link, component link group, and extraction direction are registered in the section DB 175 (FIG. 3B), and the UID is “no data” (NULL).

  A specific example of processing will be described with reference to FIG. In FIG. 6, it is assumed that the link L3 cannot proceed from the link L0 due to restrictions. In the following specific examples, the first generation unit 121 executes the loop process of FIG. 7 from the node ID and the link ID that are small. In steps S202 and S204, the first generation unit 121 extracts the node N0 as a node with a traffic light and sets it as a processing target node. In step S206, the first generation unit 121 extracts the links L0, L4, L5, and L6 connected to the node N0, and sets the link L0 having a small node ID as a processing target link. In step S208, the first generation unit 121 determines that the link L0 is equal to or less than the predetermined distance. In step S210, the first generation unit 121 sets the link L0 as the link A. In step S212, the first generation unit 121 determines that there is no traffic signal at the node N1 on the opposite side of the processing target node N0 for the link L0 (link A). In step S214, the first generation unit 121 acquires links other than the link L0 (link A) connected to the opposite node N1, that is, links L1, L2, and L3. In step S216, the first generation unit 121 sets the link L1 having the smaller link ID among the acquired links L1, L2, and L3 as a processing target link. In step S218, the first generation unit 121 sets the link L1 as the link B. In step S220, the first generation unit 121 determines that the link L1 (link B) can proceed to the link L0 (link A). In step S222, the first generation unit 121 stores the link L1 and the link L0 as a composite section in the section DB 175. In addition, this composite section is a section that progresses from the link L1 having the larger link ID among the two parties to the link L0 having the smaller link ID among the two parties. For this reason, the 1st production | generation part 121 memorize | stores "reverse" in the extraction direction in area DB175. Thereafter, the first generation unit 121 shifts the processing to step S216, and repeats the same processing for the remaining links L2 and L3.

  FIG. 8 is a diagram illustrating an example of the section DB 175 after the generation processing by the first generation unit 121 is completed for the specific example of FIG. As a result of the above processing, the section DB 175 defines that the entry E1 defines that the traffic section from the link L1 to the link L0 is a composite section and that the traffic section from the link L2 to the link L0 is a composite section. The entry E2 to be stored is stored.

  As described above, in the generation process by the first generation unit 121, the first link (link L0) that is a link of a predetermined length or less following the signal and the second link that enters the first link. The links (links L1, L2) can be defined as one composite section. As a result, a traffic section having a negative correlation as described in FIG. 6 can be defined as one composite section.

A-2-2. Generation processing (second generation unit 122):
FIG. 9 is a diagram illustrating the second feature. The “second feature” is based on the condition that a section (traffic section) composed of a plurality of continuous links is composed of the following links in the map DB 172.
A first link that is connected to two or more links in the map DB 172 but can only proceed to one of the two or more links.
A second link that can only enter from the first link.

  For example, as shown in FIG. 9A, there are three links L0 to L2 forming a T-shape, the direction from the link L0 to the link L2, and the direction from the link L2 to the link L1. Suppose links L0 to L2 that cannot proceed due to restrictions. Hereinafter, such three links are also referred to as “substantially two-way paths”. Specifically, as shown in FIGS. 9B and 9C, since the median strip MS is installed at the center of the road composed of the links L0 and L1, the moving direction of the vehicle VH is changed. The case where it is restricted in the direction of the arrow shown by a solid line corresponds to a substantially two-way road. In such a case, although the traffic section from the link L0 to the link L1 is a separate link on the map DB 172, there is substantially no single stop factor (for example, a merge of a traffic signal or a vehicle). It can be regarded as a link, and traffic conditions are easily linked in the same direction, and there is a positive correlation.

  FIG. 10A and FIG. 10B are flowcharts showing the procedure of the generation process by the second generation unit 122. In FIG. 10A and FIG. 10B, one process is divided for the sake of space. This process aims to extract a traffic section having the second feature. In step S302, the second generation unit 122 refers to the map DB 172 and extracts a central node that is a substantial two-way difference candidate. Specifically, the second generation unit 122 stores, in the map DB 172, a node (or “designated direction entry prohibited section”) stored in “regulation information” of all links to which the node (or intersection group) is connected (or (Intersection group) is extracted as a central node that is a substantial two-way candidate.

  In step S304, the second generation unit 122 repeatedly executes the processing of steps S306 to S336 while moving the processing target node until the processing is completed for all the extracted nodes (loop 1).

  In step S306, the second generation unit 122 repeatedly executes the processing of steps S308 to S336 while moving the processing target link until processing is completed for all the links connected to the processing target node (loop 2). . In step S308, the second generation unit 122 sets the processing target link as “link A”.

  In step S310, the second generation unit 122 moves the processing target link until the processing is completed for all links other than the link A among all the links connected to the processing target node. This process is repeatedly executed (loop 3). In step S312, the second generation unit 122 sets the processing target link of loop 3 to “link B”. In step S <b> 314, the second generation unit 122 refers to “signal presence / absence” in the map DB 172 and confirms whether there is a traffic signal at a node connecting the link A and the link B. When there is a traffic light (step S314: YES), the second generation unit 122 causes the process to transition to step S310.

  When there is no traffic signal (step S314: NO), in step S316, the second generation unit 122 refers to the “regulation information” in the map DB 172 and confirms whether or not it is possible to proceed from the link A to the link B. . When it cannot progress (step S314: NO), the 2nd generating part 122 makes processing shift to step S310. If it is possible to proceed (step S314: YES), in step S318, the second generation unit 122 counts the number of links that can proceed from the link A. In step S320, the second generation unit 122 stores link B as “link C”, and causes the process to transition to step S310.

  In step S322, the second generation unit 122 confirms whether or not the number of links determined to be able to proceed from the link A in step S318 is one as a result of completing the processing of the loop 3. If there is not one (that is, two or more) (step S322: NO), the second generation unit 122 causes the process to transition to step S306.

  When there is one (step S322: YES), in step S324, the second generation unit 122 moves the processing target link until the processing is completed for all the links connected to the link C. The process of S332 is repeatedly executed (loop 4). In step S326, the second generation unit 122 sets the processing target link of the loop 4 to “link D”. In step S328, the second generation unit 122 refers to “signal presence / absence” in the map DB 172 and checks whether there is a traffic signal at a node connecting the link C and the link D. When there is a traffic signal (step S328: YES), the second generation unit 122 causes the process to transition to step S324.

  When there is no traffic signal (step S328: NO), in step S330, the second generation unit 122 refers to the “regulation information” in the map DB 172 and confirms whether or not it is possible to proceed from the link D to the link C. . When it cannot proceed (step S330: NO), the second generation unit 122 causes the process to transition to step S324. If it is possible to proceed (step S330: YES), in step S332, the second generation unit 122 counts the number of links that can proceed to the link C, and causes the process to transition to step S324.

  In step S334, the second generation unit 122 confirms whether or not the number of links determined to be able to proceed to the link C in step S332 is one as a result of completing the processing of the loop 4. If there is not one (that is, two or more) (step S334: NO), the second generation unit 122 causes the process to transition to step S306. When there is one (step S334: YES), in step S336, the second generation unit 122 stores the link A and the link C as a composite section in the section DB 175 together with the extraction direction. At the time of step S336, only the start point link, end point link, component link group, and extraction direction are registered in the section DB 175 (FIG. 3B), and the UID is “no data” (NULL).

  A specific example of processing will be described with reference to FIG. In the following specific examples, the second generation unit 122 executes the loop processing of FIGS. 10A and 10B from the node ID and the link ID that are small. In steps S302 and S304, the second generation unit 122 extracts the node N0 as the center node of the substantial two-way difference candidate and sets it as the processing target node. In step S306, the second generation unit 122 extracts the links L0, L1, and L2 connected to the node N0, and sets the link L0 having a small link ID as a processing target link. In step S308, the second generation unit 122 sets the link L0 as the link A. In step S310, the second generation unit 122 extracts all the links L1 and L2 other than the link L0 from all the links L0, L1, and L2 connected to the node N0, and sets the link L1 having a small link ID to the loop 3. The link to be processed. In step S312, the second generation unit 122 sets the link L1 as the link B. In step S314, the second generation unit 122 determines that there is no signal at the node N0 that connects the link L0 (link A) and the link L1 (link B). In step S316, the second generation unit 122 determines that the link L0 (link A) can proceed to the link L1 (link B). In step S318, the second generation unit 122 sets the number of links that can proceed from the link L0 (link A) to 1. In step S320, the second generation unit 122 stores the link L1 (link B) as the link C, and causes the process to transition to step S310. In step S <b> 310, the second generation unit 122 sets the link L <b> 2 next to the link L <b> 1 as the processing target link of the loop 3. In step S312, the second generation unit 122 sets the link L2 as the link B. In step S314, the second generation unit 122 determines that there is no traffic signal at the node N0 connecting the link L0 (link A) and the link L2 (link B). In step S316, the second generation unit 122 determines that it cannot proceed from the link L0 (link A) to the link L2 (link B). Thereby, the loop 3 ends. In step S322, the second generation unit 122 determines that the number of links that can proceed from the link A in step S318 is one. In step S324, the second generation unit 122 extracts the links L0 and L2 connected to the link L1 (link C), and sets the link L0 having a small link ID as the processing target link of the loop 4. In step S326, the second generation unit 122 sets the link L0 as the link D. In step S328, the second generation unit 122 determines that there is no traffic signal at the node N0 that connects the link L1 (link C) and the link L0 (link D). In step S330, the second generation unit 122 determines that the link L0 (link D) can proceed to the link L1 (link C). In step S332, the second generation unit 122 sets the number of links that can proceed to the link L1 (link C) to 1, and shifts the processing to step S324. In step S324, the second generation unit 122 sets the link L2 that is the second smallest after the link L0 as the processing target link of the loop 4. In step S326, the second generation unit 122 sets the link L2 as the link D. In step S328, the second generation unit 122 determines that there is no traffic signal at the node N0 that connects the link L1 (link C) and the link L2 (link D). In step S330, the second generation unit 122 determines that it cannot proceed from the link L2 (link D) to the link L1 (link C). Thereby, the loop 4 ends. In step S334, the second generation unit 122 determines that the number of links that can proceed to the link C in step S332 is one. In step S336, the second generation unit 122 stores the link L0 (link A) and the link L1 (link C) as a composite section in the section DB 175. In addition, this composite section is a section that progresses from a link L0 having a small link ID among the two parties to a link L1 having a large link ID among the two parties. For this reason, the 1st production | generation part 121 memorize | stores "order" in the extraction direction in area DB175. Thereafter, the second generation unit 122 shifts the process to step S306, and repeats the same process for the remaining links L1 and L2.

  FIG. 11 is a diagram illustrating an example of the section DB 175 after the generation processing by the second generation unit 122 is completed for the specific example of FIG. As a result of the above process, the section DB 175 stores an entry E1 that defines that the traffic section from the link L0 to the link L1 is a composite section.

  As described above, in the generation process performed by the second generation unit 122, the link information (map DB 172) is connected to at least two links on one side of the link, but at least the two links. The first link (link L0), which is a link whose progression is restricted except for one of the links, and the link that is restricted from entering from the other link and can enter from the first link The second link (link L1) can be defined as one composite section. As a result, a traffic section having a positive correlation as described in FIG. 9 can be defined as one composite section.

A-2-3. Generation processing (third generation unit 123):
FIG. 12 is a diagram illustrating the third feature. The “third feature” is based on the condition that, in the map DB 172, a section (traffic section) composed of a plurality of continuous links is composed of one of the following links c1 and c2.
(C1) A first link that is a link dedicated to right and left turns and an entrance link / link dedicated to right and left turns.
A second link that is a link entering the first link.
(C2) The inaccessible link connected to the right / left turn dedicated link and the approach link / map DB 172 are connected to the right / left turn dedicated link, but the progress is restricted to the right / left turn dedicated link. A third link that is a link.
A fourth link that is a link that enters the third link.

  For example, as shown in FIG. 12, a crossroad with a left-turn exclusive link L3 is assumed. In FIG. 12, when the left turn dedicated link L3 stops, the link L2 does not stop, and when the left turn dedicated link L3 does not stop, the link L2 is likely to stop. Similarly, when the stop occurs on the link L1, the phenomenon that the stop does not occur on the link L2 and the stop occurs on the link L2 when the stop does not occur on the link L1 is likely to occur. Therefore, in such a case, the link L2 and the link L3, and the link L2 and the link L2 are likely to be linked in different directions of traffic conditions and have a negative correlation.

  FIG. 13 is a flowchart showing a procedure of generation processing by the third generation unit 123. The process of FIG. 13 aims to extract a traffic section having the third feature. In step S <b> 402, the third generation unit 123 refers to “regulation information” in the map DB 172 and extracts all the links in which “designated direction entry prohibited section” is stored in the restriction information. In step S404, the third generation unit 123 repeatedly executes the processing of steps S406 to S426 while moving the processing target link until the processing is completed for all the extracted links (loop 1).

  In step S406, the third generation unit 123 sets the processing target link as “link A”. In step S <b> 408, the third generation unit 123 determines a link other than the link A connected to the link A entry side node (that is, the node entering link A) and the link A exit side node (that is, the node exiting link A). Get all the links.

  In step S410, the third generation unit 123 repeats the processing of steps S412 to S420 while moving the processing target link until the processing is completed for all links other than A connected to the ingress side node of link A. Execute (loop 2). In step S <b> 412, the third generation unit 123 confirms whether it is possible to proceed from the processing target link of the loop 2 to the link A. When it cannot progress (step S412: NO), the 3rd production | generation part 123 makes a process transfer to step S410.

  When it is possible to proceed (step S412: YES), in step S414, the third generation unit 123 causes the processing target link until processing is completed for all the links other than A connected to the exit side node of link A. The processing of steps S416 to S420 is repeatedly executed while moving (loop 3). In step S416, the third generation unit 123 processes the link to be processed (the process of loop 3) connected to the exit side of the link A from the link to be processed (link to be processed of loop 2) connected to the entry side node of link A. Confirm whether or not it is possible to proceed to the target link. When it cannot progress (step S416: NO), the 3rd generation part 123 makes processing shift to Step S414.

  When it is possible to proceed (step S416: YES), in step S418, the third generation unit 123 refers to the “regulation information” in the map DB 172, and among all the link groups determined to be able to proceed in step S416, the link A It is confirmed whether or not the “designated direction entry prohibited section” is stored in the restriction information for links other than the processing target link connected to the entry side and exit side nodes. If not stored (step S418: NO), the third generation unit 123 causes the process to transition to step S414. If stored (step S418: YES), in step S420, the third generation unit 123 sets the processing target link (processing target link of loop 2) connected to the ingress side node of link A as link B, and performs processing. The process proceeds to step S414.

  In step S422, the third generation unit 123 repeatedly executes the processing of steps S424 to S426 while moving the processing target link until the processing is completed for all links connected to the link A side node of link B. (Loop 4). In step S424, the third generation unit 123 sets the processing target link of the loop 4 to “link C”. In step S426, the third generation unit 123 stores the link B and the link C as a composite section in the section DB 175 together with the extraction direction. At the time of step S426, only the start point link, end point link, component link group, and extraction direction are registered in the section DB 175 (FIG. 3B), and the UID is “no data” (NULL).

  A specific example of processing will be described with reference to FIG. In the following specific example, the third generation unit 123 executes the loop process of FIG. 13 from the node ID and the link ID that are small. In steps S <b> 402 and S <b> 404, the third generation unit 123 extracts the link L <b> 3 in which the designated direction entry prohibition section is stored and sets it as a processing target link. In step S406, the third generation unit 123 sets the link L3 as the link A. In step S408, the third generation unit 123 includes links L1 and L2 connected to the entry side node N0 of the link L3 (link A), and links L4 and L5 connected to the exit side node N1 of the link L3 (link A). , Get. In step S410, the third generation unit 123 sets the link L1 having the smaller link ID among the links L1 and L2 connected to the entry side node N0 of the link L3 (link A) as the processing target link of the loop 2. In step S412, the third generation unit 123 determines that it is not possible to proceed from the link L1 (link to be processed in loop 2) to the link L3 (link A), and causes the process to transition to step S410. In step S410, the third generation unit 123 sets the link L2 having the next smallest link ID among the links L1 and L2 connected to the entry side node N0 of the link L3 (link A) as the processing target link of the loop 2. In step S412, the third generation unit 123 determines that the link L2 (the processing target link of the loop 2) can proceed to the link L3 (link A). In step S414, the third generation unit 123 sets the link L4 having a small link ID among the links L4 and L5 connected to the leaving node N1 of the link L3 (link A) as the processing target link of the loop 3. In step S416, the third generation unit 123 determines that it is possible to proceed from the link L2 (the processing target link of the loop 2) to the link L4 (the processing target link of the loop 3). In step S418, the third generation unit 123 selects the processing target link L2 connected to the entry side node and the processing target link L4 connected to the departure side node among the links L2, L3, and L4 determined to be able to proceed in step S416. It is determined that the designated direction entry prohibition section is stored for the link L3 excluding. In step S420, the third generation unit 123 sets the processing target link L2 connected to the entry side node as the link B, and shifts the processing to step S414. In step S414, the third generation unit 123 sets the link L5 having the next smallest link ID among the links L4 and L5 connected to the leaving node N1 of the link L3 (link A) as the processing target link of the loop 3. In step S416, the third generation unit 123 determines that it is not possible to proceed from the link L2 (the processing target link of the loop 2) to the link L5 (the processing target link of the loop 3). Thereby, the loop 3 and the loop 2 are completed. In step S422, the third generation unit 123 performs the process of loop 4 on the link L1 having a small link ID among the links L1 and L3 connected to the link L2 (link B) in the node N0 on the link L3 (link A) side. Target link. In step S424, the third generation unit 123 sets the link L1 as the link C. In step S426, the third generation unit 123 stores the link L2 (link B) and the link L1 (link C) in the section DB 175 as a composite section. In addition, this composite section is a section that progresses from the link L2 having a large link ID among the two parties to the link L1 having a small link ID among the two parties. For this reason, the 1st production | generation part 121 memorize | stores "reverse" in the extraction direction in area DB175. Thereafter, the third generation unit 123 causes the process to transition to step S422. In step S422, the third generation unit 123 loops the link L3 having the next smallest link ID among the links L1 and L3 connected to the link L2 (link B) in the node N0 on the link L3 (link A) side. The link to be processed. In step S424, the third generation unit 123 sets the link L3 as the link C. In step S426, the third generation unit 123 stores the link L2 (link B) and the link L3 (link C) in the section DB 175 as a composite section. In addition, this composite section is a section that progresses from the link L2 having a small link ID among the two parties to the link L3 having a large link ID among the two parties. For this reason, the 1st production | generation part 121 memorize | stores "order" in the extraction direction in area DB175. Thereby, the loop 4 ends.

  FIG. 14 is a diagram illustrating an example of the section DB 175 after the generation processing by the third generation unit 123 is completed for the specific example of FIG. As a result of the processing described above, the section DB 175 defines that the entry E1 defines that the traffic section from the link L2 to the link L3 is a composite section, and the traffic section from the link L2 to the link L1 is the composite section. The entry E2 to be stored is stored.

  As described above, in the generation process by the third generation unit 123, the first link (link L3) that is a link dedicated to right and left turns and the second link (link) that enters the first link are linked. L2) and the third link (link L1), which is a link that is connected to a link dedicated to right and left turns in the link information (map DB 172), but whose travel is restricted to the link dedicated to right and left turns Each of the fourth links (link L2), which is a link entering the third link, can be defined as one composite section. As a result, a traffic section having a negative correlation as described in FIG. 12 can be defined as one composite section.

A-2-4. Generation process (fourth generation unit 124):
FIG. 15 is a diagram for explaining the fourth feature. The “fourth feature” is a section (traffic section) composed of a plurality of continuous links. In the same section, the method of delimiting links in the map DB 172 and the method of delimiting links in the probe map DB 173 are different. On condition that

  For example, a case is assumed in which, in the same section between the node N0 and the node N1, the link delimitation method in the map DB 172 and the link delimitation method in the probe map DB 173 are different. Specifically, as shown in FIG. 15A, in the probe map DB 173, the section between the node N0 and the node N1 is divided into one link L1-A. On the other hand, as shown in FIG. 15B, in the map DB 172, the section between the node N0 and the node N1 is divided into two links L1-B and L2-B. In such a case, since the link L1-A and the links L1-B and L2-B are the same road, the traffic situation always works in the same direction and has a strong positive correlation.

  FIG. 16 is a flowchart illustrating a procedure of generation processing by the fourth generation unit 124. The process of FIG. 16 aims to extract a traffic section having the fourth feature.

  In step S602, the fourth generation unit 124 repeatedly executes the processing of steps S604 to S606 until the processing is completed for all the links stored in the unit A (here, the probe map DB 173). (Loop 1).

  In step S604, the fourth generation unit 124 determines that the link relationship in the same section between the unit A (probe map DB 173) and the unit B (here, the map DB 172) is 1: N (N is 2 or more). Whether or not there is a link of the corresponding unit B (map DB 172). Specifically, the fourth generation unit 124, when “association information” that stores the correspondence relationship between the link separation methods in the map DB 172 and the probe map DB 173 is stored in the storage unit 170, What is necessary is just to search whether the data regarding the process object link are contained in matching information.

When the association information is not stored in the storage unit 170, the fourth generation unit 124 extracts the same section from the map DB 172 and the probe map DB 173 by the following procedures d1 to d4, and sets the extracted section as the extracted section. What is necessary is just to confirm the relationship of the included link.
(D1) The fourth generation unit 124 refers to the map DB 172 and the probe map DB 173, and extracts a node of the map DB 172 having the same absolute position (for example, latitude / longitude and coordinates) as the node of the probe map DB 173. To do.
(D2) The fourth generation unit 124 extracts all the links sandwiched between the nodes extracted in step d1 for each of the map DB 172 and the probe map DB 173.
(D3) The fourth generation unit 124 generates a plurality of polygons from the link group extracted in step d2 for the map DB 172 and the link group extracted in step d2 for the probe map DB 173. Specifically, the fourth generation unit 124 equally divides the link into a predetermined number, and generates a rectangular polygon in which the start point and the end point are placed diagonally for each equally divided link. The number of equally dividing links can be arbitrarily determined. For example, the number of links may be four as shown in the figure, or may be an arbitrary number of two or more.

FIG. 17 is a diagram illustrating a method for extracting the same section.
(D4) The fourth generation unit 124 compares the shapes of the polygons divided in step d3 with respect to the map DB 172 and the probe map DB 173. If all polygons have the same shape, the fourth generation unit 124 determines that the section (traffic section) including the links extracted in step d2 is the same section, and the shape of at least one polygon is If they are different, it is determined that the section (traffic section) composed of the links extracted in step d2 is a different section. For example, in the example of FIG. 17A, the polygon Pa divided from the link L1-A in the probe map DB 173 and the polygon Pb divided from the links L1-B and L2-B in the map DB 172 are included. The shape of each polygon is the same. For this reason, the fourth generation unit 124 determines that the link L1-A and the links L1-B and L2-B are in the same section. On the other hand, in the example of FIG. 17B, the polygon Pa divided from the link L1-A in the probe map DB 173 and the polygon Pb divided from the links L1-B and L2-B in the map DB 172 are included. The shape of each polygon is different. For this reason, the fourth generation unit 124 determines that the link L1-A and the links L1-B and L2-B are not in the same section. Note that when comparing the shapes of polygons in step d4, a predetermined threshold value may be provided, and the deviation of the shape within the threshold value may be allowed.

  In step S604 of FIG. 16, when there is no corresponding link with 1: N (step S604: NO), the fourth generation unit 124 causes the process to transition to step S602. When there is a link corresponding to 1: N (step S604: YES), in step S606, the fourth generation unit 124 sets the link group of the unit B (map DB 172) extracted in step b2 as a composite section, and the extraction direction. At the same time, it is stored in the section DB 175. Note that at the time of step S606, only the start point link, end point link, component link group, and extraction direction are registered in the section DB 175 (FIG. 3B), and the UID is no data (NULL).

  FIG. 18 is a diagram illustrating an example of the section DB 175 after the generation processing by the fourth generation unit 124 is completed for the specific example of FIG. As a result of the above processing, the section DB 175 defines that the traffic section from the link L1-B to the link L2-B and the traffic section from the link L2-B to the link L1-B are combined sections. The entry E1 to be stored is stored.

  As described above, in the generation process by the fourth generation unit 124, in the same section, the link information in the link information (map DB 172) and other link information different from the link information and the traffic network A plurality of links (links L1-B and L2-B) that differ from the link delimitation method in other link information (probe map DB 173) in which information relating to the constituent links is stored in advance as one composite section Can be defined. As a result, a traffic section having a positive correlation as described in FIG. 15 can be defined as one composite section.

  Further, in the procedure b4 of the generation process by the fourth generation unit 124, information on the link property (map DB 172) and other link information (probe map DB 173) of the same property (that is, information on the links constituting the traffic network) is previously stored. It is possible to easily extract the same section by comparing the shapes of polygons divided from links from different information sources while having the property of being stored.

  As described above, the information processing apparatus (server 10) of the above embodiment uses the link information (map DB 172) to extract a traffic section that includes a plurality of continuous links and has a predetermined characteristic. A plurality of links constituting this traffic section are associated and defined as one composite section and stored in the section DB 175 of the storage unit 170. That is, according to the above embodiment, by using the link information (map DB 172), the composite section can be defined without using the traffic information data (traffic information DB 174) which is statistical data of the probe information. It is possible to define a composite section that does not depend on the number of data in the traffic information data (traffic information DB 174). Further, according to the above embodiment, since the composite section is defined based on the information related to the link (the link length stored in the map DB 172, the link restriction information, etc.), the composite section is managed by the defined composite section. The reliability of travel time can be improved.

  In the above-described embodiment, the “predetermined feature” means that there is a correlation (positive correlation, negative correlation) regarding the traffic situation between a plurality of links constituting the traffic section. . For this reason, according to the said embodiment, if the traffic condition in one link changes, the several link with the property that the traffic condition in the other link also changes can be defined as one compound area.

  Furthermore, according to the above-described embodiment, in the section information generation process, the first generation unit 121 to the fourth generation are performed on the basis of information about the link (the link length stored in the map DB 172, the link restriction information, and the like). The generation unit 124 extracts the links having the first to fourth characteristics, associates and defines them as one composite section, and stores them in the section DB 175 of the storage unit 170. That is, according to the above embodiment, the composite sections extracted by the first to fourth different features can be defined in the section DB 175, respectively.

B. Variations:
In the above embodiment, a part of the configuration realized by hardware may be replaced by software, and conversely, a part of the configuration realized by software may be replaced by hardware. Good. In addition, the following modifications are possible.

・ Modification 1:
In the above embodiment, an example of the configuration of the information processing system has been shown. However, the configuration of the information processing system is merely an example, and any aspect can be adopted. For example, the server may have a function that the navigation device has, and the navigation device may have the function that the server has.

Modification 2
In the above embodiment, the navigation device is exemplified as the client device. However, the client device and its configuration in the above embodiment are merely examples, and any aspect can be employed. For example, the deformation | transformation which abbreviate | omits a part of the component, adds a further component, or changes a part of a component is possible. For example, as the client device, various information processing devices such as a smartphone, a personal computer, a PDA (Personal Digital Assistants), and a game machine may be employed.

・ Modification 3:
In the above embodiment, the configuration of the server is exemplified. However, the configuration of the server in the above embodiment is merely an example, and any aspect can be adopted. For example, the deformation | transformation which abbreviate | omits a part of the component, adds a further component, or changes a part of a component is possible. For example, the above-described function may be realized by cooperation of a plurality of servers. For example, the server does not need to perform the route search process, and at least a part of each DB included in the server may be stored in another server or another storage device.

  For example, the configuration of the image DB, the map DB, the probe map DB, the traffic information DB, and the section DB described above is merely an example, and any aspect can be adopted. For example, it is possible to modify such that some of the fields in the DB are omitted, other fields are added, or changed. For example, one DB may be divided into a plurality of DBs, and a plurality of DBs may be integrated into one DB. For example, in the section DB, for the start point link and the end point link, the link ID along the traveling direction is registered instead of the size of the link ID, and the extraction direction field may be omitted.

  For example, the server may include a VICS map DB that is a DB used when using the VICS information received from the VICS (registered trademark) center instead of the probe map DB or together with the probe map DB. In this case, the part described as “probe information” in the above embodiment is replaced with “VICS information”, and the part described as “probe map DB” is replaced with “VICS map DB”.

-Modification 4:
In the above-described embodiment, the section information generation process and the generation processes by the first to fourth generation units have been described using an example of the processing procedure. However, the above procedure is merely an example, and various changes can be made. Some steps may be omitted, and other steps may be added. Further, the order of the steps to be executed may be changed.

  For example, in the section information generation process, the generation processes by the first to fourth generation units may be executed only on a part of the map DB (and the probe map DB). The part may be arbitrarily determined such as a part satisfying a predetermined condition, a predetermined coordinate range, a predetermined latitude / longitude range, a predetermined link ID, a predetermined node ID, and the like. For example, if the predetermined condition is “when the number of travel time data of the same link in the traffic information DB is small”, a method of defining a composite section using the standard deviation of the prior art, the method of the present invention, It is possible to define a composite section by combining the above efficiently.

For example, in the section information generation process, at least a part of the generation processes by the first to fourth generation units may be omitted. For example, in the section information generation process, the execution order of the generation processes by the first to fourth generation units may be switched. For example, in the section information generation process, other processes not described above may be additionally executed. Examples of the other processes include the following processes e1 and e2.
(E1) Generation processing by another generation unit: For example, for an intersection where a vehicle can stop in an intersection, whether the vehicle in the intersection is located on a link on the side entering the intersection, or on the side leaving the intersection It is difficult to determine whether it is located on the link, and erroneous matching is likely to occur. Therefore, the generation process for defining such a link on the side entering the intersection and a link on the exit side as one composite section may be executed.
(E2) Integration processing in the section DB: In the section DB, for example, an entry having the traffic section from the link L1 to L2 as a composite section and an entry having the traffic section from the link L2 to the link L3 as a composite section are When defined separately, the section information generation unit may execute a process of integrating these separate entries into one entry. The entries after integration are, for example, a start point link L1, an end point link L3, and a configuration link group L2. Note that the integration process in the section D may be executed independently of the section information generation process.

Modification 5:
The present invention is not limited to the above-described embodiments, examples, and modifications, and can be realized with various configurations without departing from the spirit thereof. For example, the technical features in the embodiments, examples, and modifications corresponding to the technical features in each embodiment described in the summary section of the invention are to solve some or all of the above-described problems, or In order to achieve part or all of the above-described effects, replacement or combination can be performed as appropriate. Further, if the technical feature is not described as essential in the present specification, it can be deleted as appropriate.

DESCRIPTION OF SYMBOLS 1 ... Information processing system 10 ... Server 20 ... Navigation apparatus 110 ... CPU
DESCRIPTION OF SYMBOLS 120 ... Section information generation part 121 ... 1st generation part 122 ... 2nd generation part 123 ... 3rd generation part 124 ... 4th generation part 130 ... Path | route search part 140 ... Communication part 150 ... ROM
160 ... RAM
170 ... storage unit 171 ... image DB
172 ... Map DB
173 ... Probe map DB
174 ... Traffic information DB
175 ... Section DB
210 ... CPU
212 ... Route guidance unit 220 ... Communication unit 230 ... ROM
240 ... RAM
250 ... storage unit 260 ... input / output unit 270 ... current position acquisition unit

Claims (6)

A method for generating section information defining a composite section,
An information processing apparatus is a traffic section composed of a plurality of continuous links using link information in which information about links constituting a traffic network is stored in advance, and the traffic section having a predetermined characteristic Extracting, and
An information processing apparatus comprising: associating the plurality of links constituting the extracted traffic section as a single composite section and storing them in a storage unit ;
The predetermined feature is:
The traffic section has a first link that is the link of a predetermined length or less leading to a traffic signal that controls traffic, and a second link that is the link that enters the first link, and A first feature that is a section that does not have the traffic signal in a direction of entering the first link from a second link;
The traffic section is connected to at least two of the links on one side of the link in the link information, but progress is restricted except for one of the at least two links. The second link is a first link that is the link, and a second link that is the link that is restricted from entering from the other link and is accessible from the first link. Features of
The traffic section is composed of a first link that is the link dedicated to turning right and left, and a second link that is the link that enters the first link, or the traffic section is the link In the information, although it is connected to the link dedicated to the right and left turn, the link dedicated to the right and left turn is the third link which is the link whose progress is restricted, and the third link that enters the third link A fourth link being a link, and a third feature comprising:
In the same section, the link section in the link information and other link information different from the link information, and information relating to the links constituting the traffic network is stored in advance. The link information in the link information is at least one of the fourth feature that is composed of different links, and
The method of extracting and storing are performed for each of the first feature, the second feature, the third feature, and the fourth feature. A method for generating section information defining a composite section,
An information processing apparatus is a traffic section composed of a plurality of continuous links using link information in which information about links constituting a traffic network is stored in advance, and the traffic section having a predetermined characteristic Extracting, and
An information processing apparatus comprising: associating the plurality of links constituting the extracted traffic section as a single composite section and storing them in a storage unit ;
The predetermined feature is:
In the same section, the link section in the link information and other link information different from the link information, and information relating to the links constituting the traffic network is stored in advance. The link information in the link information is characterized in that it consists of different links.
The step of extracting the traffic section having the predetermined characteristics includes:
By generating a plurality of polygons from each of the links in the link information and the links in the other link information, and comparing the shapes of the generated polygons, the link information and the other links Extracting the same section from the information. A method for generating section information defining a composite section,
An information processing apparatus is a traffic section composed of a plurality of continuous links using link information in which information about links constituting a traffic network is stored in advance, and the traffic section having a predetermined characteristic Extracting, and
An information processing apparatus comprising: associating the plurality of links constituting the extracted traffic section as a single composite section and storing them in a storage unit ;
The traffic section includes a first link and a second link that can travel to the first link;
In the traffic section, when the stop does not occur at the first link, when the stop occurs at the second link, and when the stop occurs at the first link, A method comprising the feature that no stop occurs on the two links. An information processing apparatus,
A storage unit in which link information, which is information related to links constituting the traffic network, is stored in advance;
Using the link information, a traffic section composed of a plurality of consecutive links, the traffic section having a predetermined characteristic is extracted, and the plurality of links constituting the extracted traffic section are defined as 1 A section information generation unit to be associated with two composite sections and stored in the storage unit;
Equipped with a,
The predetermined feature is:
The traffic section has a first link that is the link of a predetermined length or less leading to a traffic signal that controls traffic, and a second link that is the link that enters the first link, and A first feature that is a section that does not have the traffic signal in a direction of entering the first link from a second link;
The traffic section is connected to at least two of the links on one side of the link in the link information, but progress is restricted except for one of the at least two links. The second link is a first link that is the link, and a second link that is the link that is restricted from entering from the other link and is accessible from the first link. Features of
The traffic section is composed of a first link that is the link dedicated to turning right and left, and a second link that is the link that enters the first link, or the traffic section is the link In the information, although it is connected to the link dedicated to the right and left turn, the link dedicated to the right and left turn is the third link which is the link whose progress is restricted, and the third link that enters the third link A fourth link being a link, and a third feature comprising:
In the same section, the link section in the link information and other link information different from the link information, and information relating to the links constituting the traffic network is stored in advance. The link information in the link information is at least one of the fourth feature that is composed of different links, and
The section information generation unit extracts the traffic section for each of the first feature, the second feature, the third feature, and the fourth feature, and extracts the traffic An information processing apparatus that stores the plurality of links constituting a section. An information processing apparatus,
A storage unit in which link information, which is information related to links constituting the traffic network, is stored in advance;
Using the link information, a traffic section composed of a plurality of consecutive links, the traffic section having a predetermined characteristic is extracted, and the plurality of links constituting the extracted traffic section are defined as 1 A section information generation unit to be associated with two composite sections and stored in the storage unit;
Equipped with a,
The predetermined feature is:
In the same section, the link section in the link information and other link information different from the link information, and information relating to the links constituting the traffic network is stored in advance. The link information in the link information is characterized in that it consists of different links.
The section information generation unit generates a plurality of polygons from each of the link in the link information and the link in the other link information when extracting the traffic section having the predetermined characteristics. Then, the information processing apparatus extracts the same section from the link information and the other link information by comparing the generated shapes of the polygons. An information processing apparatus,
A storage unit in which link information, which is information related to links constituting the traffic network, is stored in advance;
Using the link information, a traffic section composed of a plurality of consecutive links, the traffic section having a predetermined characteristic is extracted, and the plurality of links constituting the extracted traffic section are defined as 1 A section information generation unit to be associated with two composite sections and stored in the storage unit;
Equipped with a,
The traffic section includes a first link and a second link that can travel to the first link;
In the traffic section, when the stop does not occur at the first link, when the stop occurs at the second link, and when the stop occurs at the first link, An information processing apparatus including a feature that a stop does not occur at two links.

Images