JP5964158B2 - Information processing system, information processing device, server, terminal device, information processing method, and program - Google Patents

Description

  FIELD Embodiments described herein relate generally to an information processing system, an information processing device, a server, a terminal device, an information processing method, and a program, and in particular, an information processing system, an information processing device, and The present invention relates to a server, a terminal device, an information processing method, and a program.

  In Patent Document 1, in order to identify the telepathic road based on the psychological burden of the driver when driving on the narrow street, the load on the narrow street is identified based on the probe data, and the telepathic road is based on the identified load. Techniques for identifying are disclosed.

JP 2011-22033 A

  However, Patent Document 1 does not mention anything about unguaranteed roads. An unguaranteed road is not included in the map network database, but the link parameters for calculating the link cost are insufficient, so the exact link cost cannot be calculated in the route search. It is a road.

  Therefore, the invention of Patent Document 1 has a problem that a guide route including an unguaranteed road cannot be obtained. In particular, in the invention of Patent Document 1, as the proportion of unguaranteed roads included in the map network database increases, roads suitable for guidance are also included, but are not adopted in route search, and appropriate guidance routes (for example, the shortest It is difficult to obtain a route indicating a route.

  The present invention has been made in view of the above problems. An object of the present invention is to provide a guidance route including an unguaranteed road.

  The information processing system according to the present invention includes information acquisition means for acquiring road network information including link information and probe information corresponding to the link information, and link cost calculation for calculating the link cost based on the link information. Means, route search means for searching for a guide route based on the calculated link cost, and link information of an unguaranteed link for which information necessary for link cost calculation is missing in the road network information. Link parameter adding means for adding to the link information based on

  According to the present invention, it is possible to provide a guide route including an unguaranteed road.

The block diagram which shows the structure of the information processing system 1 of 1st Embodiment. The figure which shows an example of the data structure of the link information of 1st Embodiment. The conceptual diagram of the road network of 1st Embodiment. The figure which shows the data structure of the total probe data of 1st Embodiment. The sequence diagram of the information processing of a 1st embodiment. The flowchart of the link data process of 1st Embodiment. Explanatory drawing of S1-106 of FIG. 6 of 1st Embodiment. The comparison figure of the guide route obtained by a prior art, and the guide route obtained by 1st Embodiment. The flowchart of the link data process of 2nd Embodiment. The comparison figure of the guide route obtained by 1st Embodiment and 2nd Embodiment.

  The present embodiment will be described with reference to the drawings.

(First embodiment)
A first embodiment will be described.

  A configuration of the information processing system 1 according to the first embodiment will be described. FIG. 1 is a block diagram illustrating a configuration of an information processing system 1 according to the first embodiment.

  As illustrated in FIG. 1, the information processing system 1 includes a server 10, a terminal device 30, and a network 50. The server 10 and the terminal device 30 can communicate with each other via the network 50. The number of servers 10 may be one or plural. The number of terminal devices 30 may be one or a plurality. The network 50 may be a wired network or a wireless network. Communication between the server 10 and the terminal device 30 is performed via a medium other than the network 50 (for example, a data bus cable such as USB (Universal Serial Bus) or a removable medium such as SD (Secure Digital) card). May be.

  The server 10 includes a server control unit 12, a server storage unit 14, and a server communication unit 16.

  The server control unit 12 includes a server communication control unit 120, a server information acquisition unit 121, a server output control unit 122, a route search unit 124, a road determination unit 126, a link parameter addition unit 128, and a link cost calculation unit. 130. Each unit of the server control unit 12 will be described later.

  The server storage unit 14 stores data handled by the server control unit 12. For example, the server storage unit 14 stores road network information including link information, probe information, and an application executable by the server control unit 12.

  The link information is information related to the link.

  FIG. 2 is a diagram illustrating an example of a data structure of link information according to the first embodiment.

  As shown in FIG. 2, the link information includes a link ID (IDentification), a road flag, a link parameter, and node information.

  The link ID is information for specifying a link in the road network information.

  The road flag includes a type code and a road type. The road flag is a flag indicating whether the road corresponding to the link ID is a guaranteed road (for example, a national road or a prefectural road) or an unguaranteed road.

  The link parameter is information used for calculating the link cost. The link parameters include speed [km / h], distance [m], and width [m]. The speed [km / h] is information indicating the speed when traveling on the link. The distance [m] is information indicating the total length of the link. The width [m] is information indicating the road width.

  For example, the link ID “L1” can travel at 60 [km / h], has a total length of 30 [m], corresponds to a guaranteed road (national road) with a width of 13 [m], and the link ID “L2”. ”Can travel at 60 [km / h], has a total length of 30 [m], corresponds to a guaranteed road (national road) with a width of 12 [m], and the link ID“ L3 ”has a speed of 40 [ It can travel at km / h], has a total length of 15 [m], and corresponds to a guaranteed road (prefectural road) with a width of 11 [m]. On the other hand, the link IDs “L4” to “L6” correspond to unguaranteed roads whose link parameters are unknown or insufficient.

  The node information is information for specifying nodes at two points (start point and end point) that define a link. The node information includes the node ID of the start point node and the node ID of the end point node. For example, the link ID “L1” is a link from the node N1 to the node N2.

  In other words, the guaranteed road is a road that has sufficient information necessary for calculating the link cost (that is, an accurate link cost can be calculated). On the other hand, an unguaranteed road is a road that lacks information necessary for calculating a link cost (that is, an accurate link cost cannot be calculated). For example, the information necessary for calculating the link cost is not input, or is not guaranteed (it is unknown whether an appropriate value is input).

  The road network information is information indicating a road network for traffic vehicles. The road network information is associated with the link information by, for example, a link ID.

  FIG. 3 is a conceptual diagram of the road network according to the first embodiment.

  As shown in FIG. 3, the road network includes a plurality of nodes N1 to N5 and links L1 to L6 connecting the nodes. The links L1 to L6 correspond to the link IDs “L1” to “L4” of the link information in FIG. The links L1 to L3 are guaranteed links corresponding to guaranteed roads. The links L4 to L6 are unguaranteed links corresponding to unguaranteed roads.

  The probe information is information indicating probe data (one probe data or aggregated probe data (hereinafter referred to as “aggregated probe data”) obtained from a probe vehicle actually traveling on a road, and corresponds to link information. Information.

  The probe data includes latitude, longitude, probe vehicle ID, and time. The probe vehicle ID is information for specifying the vehicle from which the probe information has been acquired. One probe data indicates information obtained at one point specified by latitude and longitude.

  The probe data may further include data (for example, heading and vehicle speed pulse) obtained from a link ID of a link subjected to matching processing at the time of position measurement, a road type, and a vehicle equipped with various sensors.

  FIG. 4 is a diagram illustrating a data structure of the aggregate probe data according to the first embodiment. Aggregated probe data is data obtained by performing aggregation processing on a plurality of accumulated probe data for each link ID. For example, the tabulation process is a process including a process for removing noise from a plurality of probe data obtained from a plurality of vehicles and a statistical process (for example, averaging).

  As shown in FIG. 4, the total probe data includes a link ID and a probe parameter. The link ID is the same as in FIG. The probe information is associated with the link information by the link ID.

  The probe parameter is travel information obtained by collecting the probe information obtained from each probe vehicle. The probe parameters include travel speed [km / h], travel time [sec], width [m], and travel count [times].

  For example, the link ID “L4” has an average speed of 60 [km / h], an average travel time of 10 [sec], and a width of “11” [m] in two runs. The link ID “L5” has an average speed of 40 [km / h], an average travel time of 8 [sec], and a width of “12” [5]. m], and the link ID “L6” has an average speed of 40 [km / h], an average travel time of 15 [sec], and a width of 10 times. “13” [m].

  The server communication unit 16 is a communication interface between the server 10 and the network 50.

  The terminal device 30 includes a terminal control unit 32, a terminal storage unit 34, a terminal communication unit 36, an operation unit 38, a positioning unit 40, and a display unit 42. For example, the terminal device 30 is a desktop computer, a notebook computer, a mobile phone, a smartphone, a tablet terminal, or a car navigation device.

  The terminal control unit 32 includes a terminal communication control unit 320, a terminal information acquisition unit 321, a terminal output control unit 322, a request issue unit 324, and a route guidance unit 326. Each unit of the terminal control unit 32 will be described later.

  The terminal storage unit 34 stores data handled by the terminal control unit 32. For example, the terminal storage unit 34 stores user information and an application that can be executed by the terminal control unit 32.

  The terminal communication unit 36 is a communication interface between the terminal device 30 and the network 50.

  The operation unit 38 receives a user instruction from the user. For example, the operation unit 38 is a touch panel. In this case, the user gives a user instruction to the terminal device 30 by performing a predetermined operation (for example, touch or swipe) using the touch panel. The operation unit 38 receives a user instruction in accordance with an operation performed by the user.

  The positioning unit 40 acquires positioning information. The positioning information includes positioning position information indicating the positioning position of the terminal device 30 and positioning direction information indicating the positioning direction of the terminal device 30. For example, the positioning unit 40 is a GPS (Global Positioning System) receiver.

  The display unit 42 displays various information. For example, the display unit 42 is a liquid crystal display or an organic EL (Electroluminescence) display. The operation unit 38 and the display unit 42 may be an integrated module (for example, a touch panel display).

  The server storage unit 14 and the terminal storage unit 34 may be provided outside the server 10 and the terminal device 30, and may be connected to the server 10 and the terminal device 30 via the network 50.

  Information processing according to the first embodiment will be described. FIG. 5 is a sequence diagram of information processing according to the first embodiment. The information processing in FIG. 5 is started when the terminal control unit 32 starts an information processing application. An information processing application is a computer program for causing a computer to execute information processing.

  <S1-30> The terminal device 30 issues a search request.

  For example, the terminal information acquisition unit 321 acquires search conditions from the user via the operation unit 38. The search condition includes at least a departure place and a destination.

  In addition, the terminal information acquisition part 321 may acquire the position corresponding to the positioning information acquired by the positioning part 40 as a departure place instead of acquiring from a user. Further, the terminal information acquisition unit 321 may further acquire at least one of a transit point, a departure designated time, and an arrival designated time.

  Next, the request issuing unit 324 issues a search request including a search condition.

  When S1-30 ends, the terminal communication control unit 320 transmits a search request to the server 10 via the terminal communication unit 36 and the network 50 as illustrated in FIG.

  <S1-10> When a search request is transmitted from the terminal device 30, the server 10 executes link data processing.

  The link data processing according to the first embodiment will be described. FIG. 6 is a flowchart of link data processing according to the first embodiment.

  <S1-100> The server information acquisition unit 121 acquires road network information from the server storage unit 14 based on the search conditions.

  <S1-102> Based on at least one of the road flag and the link parameter given to the link in the road network information acquired by the road determination unit 126 in S1-100, the link is not yet determined for each link ID. Judge whether to correspond to the guaranteed road. For link information corresponding to the guaranteed road (for example, link information corresponding to the link IDs “L1” to “L3” in FIG. 2) (S1-102: N), S1-104 to S1-106 are omitted. . On the other hand, for link information corresponding to an unguaranteed road (for example, link information corresponding to link IDs “L4” to “L6” in FIG. 2) (S1-102: Y), S1-104 is executed.

  <S1-104> The server information acquisition unit 121 acquires the probe information of the unguaranteed road (for example, records corresponding to the link IDs “L3” to “L5” in FIG. 3) from the server storage unit 14.

  <S1-106> The link parameter adding unit 128 adds the link parameter of the unguaranteed road to the link information based on the probe information acquired in S1-104.

  FIG. 7 is an explanatory diagram of S1-106 in FIG. 6 of the first embodiment.

  For example, the link parameter adding unit 128 adds the traveling speed value “60” of the link ID “L4” of FIG. 3 to the speed [km / h] of the link ID “L4” of FIG. The product 166 of the travel speed value “60 [km / h]” and the travel time value “10 [sec]” of the link ID “L4” in FIG. ≈ 60 ÷ 3600 × 10), and the width value “11” [m] of the link ID “L4” in FIG. 3 is added to the width of the link ID “L4” in FIG.

  Further, the link parameter adding unit 128 adds the traveling speed value “60” of the link ID “L5” of FIG. 3 to the speed [km / h] of the link ID “L5” of FIG. 3 is the product 133 of the travel speed value “60 [km / h]” and the travel time value “8 [sec]” of the link ID “L5” in FIG. ≈ 60 ÷ 3600 × 8), and the width value “12” [m] of the link ID “L5” in FIG. 3 is added to the width of the link ID “L5” in FIG.

  Further, the link parameter adding unit 128 adds the traveling speed value “40” of the link ID “L6” of FIG. 3 to the speed [km / h] of the link ID “L6” of FIG. 3, the product 166 of the travel speed value “40 [km / h]” and the travel time value “15 [sec]” of the link ID “L6” in FIG. ≈40 ÷ 3600 × 15), and the width value “13” [m] of the link ID “L6” in FIG. 3 is added to the width of the link ID “L6” in FIG.

  Thereby, the link information of FIG. 6 (that is, information to which the link parameter of the unguaranteed road is added) is obtained.

  <S1-110> The link cost calculation unit 130 calculates the link cost.

  For example, the link cost calculation unit 130 calculates the link cost for the guaranteed road based on the link information obtained in S1-100, and for the unguaranteed road, the link information obtained in S1-106 (that is, The link cost is calculated based on the link information to which the link parameter is added.

  <S1-12> When S1-110 is completed, as shown in FIG. 5, the route search unit 124 performs route search.

  For example, the route search unit 124 selects a link that should constitute a guide route based on the link cost obtained in S1-110 (that is, the link cost of the guaranteed road and the link cost of the unguaranteed road). As a result, at least one guide route corresponding to the search condition is obtained.

  Next, the server communication control unit 120 transmits guide route information indicating the guide route to the terminal device 30 via the server communication unit 16 and the network 50.

  <S1-32> When the guide route information is transmitted from the server 10, the terminal device 30 outputs the guide route.

  For example, the terminal output control unit 322 generates a guide route image corresponding to the guide route information.

  Next, the display unit 42 displays a guide route image. The route guidance unit 326 performs route guidance (image guidance and voice guidance) based on the guidance route image displayed on the display unit 42 and the positioning information acquired by the positioning unit 40.

  When S1-32 ends, as shown in FIG. 5, the information processing of the first embodiment ends.

  FIG. 8 is a comparison diagram of the guide route obtained in the prior art and the guide route obtained in the first embodiment. FIG. 8A shows a guide route obtained by the prior art. FIG. 8B shows the guide route obtained in the first embodiment.

  As shown in FIG. 8A, in the prior art, a guide route is formed using only the guarantee links L1 to L3 among the links included in the road network information.

  On the other hand, as shown in FIG. 8B, in the first embodiment, among the links included in the road network information, not only the guaranteed links L1 to L3 but also the unguaranteed links L4 to L6 are used to provide a guide route. It is formed. As a result, since there are more links available than the guidance route obtained by the conventional technology, a route (that is, a more optimal route) that matches the search condition can be obtained.

(Second Embodiment)
A second embodiment will be described. The second embodiment is an example of extracting unguaranteed links to be used for the guide route from unguaranteed links. In addition, the description similar to 1st Embodiment is abbreviate | omitted.

  A link data process according to the second embodiment will be described. FIG. 9 is a flowchart of link data processing according to the second embodiment.

  <S2-100 to S2-104> The same as in the first embodiment (S1-100 to S1-104 in FIG. 6).

  <S2-105> The road determination unit 126 determines whether or not the target unguaranteed link is based on the probe information acquired in S2-104. For the target unguaranteed link (S2-104: Y), S2-106 is executed. On the other hand, for the non-target unguaranteed link (S2-104: N), S2-126 is executed.

  In the first example of S2-105, the road determination unit 126 determines that the link ID in which the number of travels in the probe information is equal to or greater than the predetermined number is a target unguaranteed link. For example, when the predetermined number of times is “3”, the road determination unit 126, among the unguaranteed links L4 to L6 in FIG. The unguaranteed links L5 and L6 corresponding to “L5” and “L6” are determined to be the target unguaranteed links, and the unguaranteed link L4 whose travel count is less than 3 is determined to be the non-target unguaranteed link.

  In the second example of S2-105, when the search condition includes a user vehicle ID that specifies a vehicle used by the user (hereinafter referred to as “user vehicle”) in S1-30 of FIG. Based on the user vehicle ID, the probe data obtained from the user vehicle is extracted from the probe information. Based on the extracted probe data (ie, the probe data obtained from the user vehicle), the target unguaranteed link Determine whether or not.

  <S2-126> Based on the probe information, the link cost calculation unit 130 includes, in the link information, a link parameter that increases the link cost (hereinafter referred to as “non-target link parameter”) (for example, the link parameter of the guaranteed link). In contrast, a sufficiently large value) is added.

  <S2-106> The same as in the first embodiment (S1-106 in FIG. 6).

  <S2-110> The link cost calculation unit 130 calculates the link cost.

  For example, the link cost calculation unit 130 calculates the link cost based on the link information obtained in S2-100 for the guaranteed road, and obtained in S2-106 and S2-126 for the unguaranteed road. A link cost is calculated based on the link information.

  FIG. 10 is a comparison diagram of guide routes obtained in the first embodiment and the second embodiment. FIG. 10A shows a guide route obtained in the first embodiment. FIG. 10B shows a guide route obtained in the second embodiment (first example of S2-105). FIG. 10C shows a guide route obtained in the second embodiment (second example of S2-105).

  FIG. 10A is similar to FIG.

  On the other hand, as shown in FIG. 10B, in the second embodiment (first example of S2-105), among the links included in the road network information, the guaranteed links L1 to L3, the target unguaranteed link L5, and A guide route is formed using L6.

  On the other hand, as shown in FIG. 10C, in the second embodiment (second example of S2-105), among the links included in the road network information, the guaranteed links L1 to L3, the target unguaranteed link L5, Is used to form a guide route.

  In the second embodiment, among the unguaranteed links, an unguaranteed link that does not match the search condition relatively (for example, obtained from a vehicle having a low number of times of travel or different from the user vehicle) is set as a non-target unguaranteed link. Handled. This non-target unguaranteed link is excluded from the links forming the guide route. Thereby, compared with the guide route obtained in the first embodiment, a guide route that matches the search condition (that is, a highly reliable guide route) is obtained. For example, in the first example of S2-105, a guide route including a frequently used link is obtained. Further, in the second example of S2-105, a guide route including a link with a running record of the user vehicle is obtained.

  In the first and second embodiments, the example in which the link data processing (S1-10 in FIG. 5) is performed before the route search (S1-12 in FIG. 5) has been described. The range of is not limited to this. For example, link data processing may be performed on road network information as route search preprocessing independently of route search, or for a target link whose link cost should be calculated during route search. It may be done each time.

  Further, the link cost calculation unit 130 may consider the probe information in the step of calculating the link cost (S1-110 in FIG. 6 and S2-110 in FIG. 9).

  For example, the link cost calculation unit 130 calculates the link cost for the guaranteed road based on the link information obtained in S1-100, and among the unguaranteed roads, the number of travels in the probe information is less than a predetermined number. For the guaranteed road, the link cost is calculated based on the link information obtained in S1-106 (that is, the link information to which the link parameter is added), and the number of travels in the probe information is not guaranteed. For a road, the link cost may be calculated by multiplying the link parameter in the link information obtained in S1-106 by a coefficient corresponding to the number of times of travel (that is, using probe information).

  At least a part of the information processing system 1 according to the present embodiment may be configured by hardware or software. When configured by software, a program for realizing at least a part of the functions of the information processing system 1 may be stored in a recording medium such as a flexible disk or a CD-ROM, and read and executed by a computer. The recording medium is not limited to a removable medium such as a magnetic disk or an optical disk, but may be a fixed recording medium such as a hard disk device or a memory.

  Further, a program that realizes at least a part of the functions of the information processing system 1 according to the present embodiment may be distributed via a communication line (including wireless communication) such as the Internet. Further, the program may be distributed in a state where the program is encrypted, modulated or compressed, and stored in a recording medium via a wired line such as the Internet or a wireless line.

  In addition, this invention is not limited to embodiment mentioned above, It deform | transforms and implements a component in the range which does not deviate from the summary. Various inventions can be formed by appropriately combining a plurality of constituent elements disclosed in the above-described embodiments. For example, you may delete a some component from all the components shown by embodiment mentioned above. Furthermore, constituent elements over different embodiments may be appropriately combined.

DESCRIPTION OF SYMBOLS 1 Information processing system 10 Server 12 Server control part 120 Server communication control part 121 Server information acquisition part 122 Server output control part 124 Route search part 126 Road determination part 128 Link parameter addition part 130 Link cost calculation part 14 Server storage part 16 Server communication Unit 30 terminal device 32 terminal control unit 320 terminal communication control unit 321 terminal information acquisition unit 322 terminal output control unit 324 request issue unit 326 route guide unit 34 terminal storage unit 36 terminal communication unit 38 operation unit 40 positioning unit 42 display unit

Claims (12)

Information acquisition means for acquiring road network information including link information, probe information corresponding to the link information, link cost calculation means for calculating the link cost based on the link information, and the calculated link A route search means for searching for a guide route based on cost, and a link parameter of an unguaranteed link for which information necessary for calculating a link cost is insufficient in the road network information is added to the link information based on the probe information link parameter addition means for, provided with a,
The probe information includes a probe parameter indicating at least one of travel speed, travel time, width, and travel count,
The link parameter adding means adds the link parameter based on probe information obtained from a user vehicle used by a user.
An information processing system characterized by this. Based on the probe information, it further comprises road determination means for determining whether or not the unguaranteed link is a target unguaranteed link to which the link parameter should be added,
The link parameter adding means adds a link parameter corresponding to the probe information to the link information of the target unguaranteed link, and adds the link cost to the link information of the non-target unguaranteed link to which the link parameter should not be added. The information processing system according to claim 1, wherein a non-target link parameter is added so as to increase. The link information includes a road flag indicating whether the link is an unguaranteed link,
The information processing system according to claim 1, further comprising a road determination unit that determines whether a link included in the road network information is the unguaranteed link based on the road flag.   The road determination means further comprising: a road determination unit that determines whether a link included in the road network information is the unguaranteed link based on whether the link parameter is unknown or insufficient. The information processing system according to any one of 1 to 3.   The information processing system according to claim 1, wherein the link cost calculation unit calculates the link cost using the probe information. Computer
Information acquisition means for acquiring road network information including link information, probe information corresponding to the link information, link cost calculation means for calculating the link cost based on the link information, and the calculated link A route search means for searching for a guide route based on cost, and a link parameter of an unguaranteed link for which information necessary for calculating a link cost is insufficient in the road network information is added to the link information based on the probe information Link parameter adding means, and the link parameter adding means adds the link parameter based on the probe information obtained from the user vehicle used by the user to the server.
Probe information transmitting means for transmitting the probe information including probe parameters indicating at least one of travel speed, travel time, width, and travel count;
Information processing program to function as. Computer
Information acquisition means for acquiring road network information including link information and probe information corresponding to the link information, link cost calculation means for calculating the link cost based on the link information, and the calculated link cost A route search means for searching for a guide route based on the link parameter for adding a link parameter of an unguaranteed link lacking information necessary for calculating a link cost in the road network information to the link information based on the probe information Additional means,
An information processing program that functions as
The probe information includes a probe parameter indicating at least one of travel speed, travel time, width, and travel count,
The link parameter adding means adds the link parameter based on probe information obtained from a user vehicle used by a user.
An information processing program characterized by that. An information processing system including a plurality of computers connected to be communicable,
Information acquisition means for acquiring road network information including link information, probe information corresponding to the link information, link cost calculation means for calculating the link cost based on the link information, and the calculated link A route search means for searching for a guide route based on cost, and a link parameter of an unguaranteed link for which information necessary for calculating a link cost is insufficient in the road network information is added to the link information based on the probe information Link parameter adding means for performing
The probe information includes a probe parameter indicating at least one of travel speed, travel time, width, and travel count,
The link parameter adding means adds the link parameter based on probe information obtained from a user vehicle used by a user.
To make the information processing system work,
An information processing program for causing at least one of the computers to function as at least one of the means. In order to cause the information processing system according to any one of claims 1 to 5 to function by a plurality of computers connected in a communicable manner,
An information processing program for causing one of the computers to function as at least one of the means in the information processing system according to any one of claims 1 to 5. An information processing program for causing a computer to function as at least one of each means in the information processing system according to any one of claims 1 to 5. By a plurality of information processing devices connected to be able to communicate,
Information acquisition means for acquiring road network information including link information, probe information corresponding to the link information, link cost calculation means for calculating the link cost based on the link information, and the calculated link A route search means for searching for a guide route based on cost, and a link parameter of an unguaranteed link for which information necessary for calculating a link cost is insufficient in the road network information is added to the link information based on the probe information Link parameter adding means for performing
The probe information includes a probe parameter indicating at least one of travel speed, travel time, width, and travel count,
The link parameter adding means adds the link parameter based on probe information obtained from a user vehicle used by a user.
To configure the information processing system,
The information processing apparatus comprising at least one of the above means. An information acquisition means for acquiring road network information including link information and probe information corresponding to the link information; and a link cost calculation means for calculating the link cost based on the link information; A route search means for searching for a guide route based on the calculated link cost; and a link parameter addition means for the unguaranteed link in which information necessary for calculating the link cost is insufficient in the road network information. Adding link parameters to the link information based on the probe information, and
The probe information includes a probe parameter indicating at least one of travel speed, travel time, width, and travel count,
The link parameter adding means adds the link parameter based on probe information obtained from a user vehicle used by a user.
An information processing method characterized by the above.

Images