Information processing apparatus and information processing method

Abstract

To provide a technique capable of suggesting a route candidate that causes less stress perceived by a user driving a vehicle.SOLUTION: The present disclosure provides an information processing device that calculates a cost of each of a plurality of route candidates from a point of departure to a destination and sets a higher recommendation level for a route candidate with a lower cost. Among the plurality of route candidates, for a first route candidate including a first segment with a road width that makes passing an oncoming vehicle difficult, a control unit of the information processing device calculates its cost on the basis of whether or not a user can check presence or absence of an oncoming vehicle before entering the first segment and traffic of oncoming vehicles in the first segment. If the user can check the presence or absence of oncoming vehicles before entering the first segment, the control unit calculates the cost of the first route candidate to be smaller as the traffic of oncoming vehicles in the first segment is smaller.SELECTED DRAWING: Figure 6

Description

Technical Field

[0001] The present disclosure relates to an information processing apparatus and an information processing method.

Background Art

[0002] Patent Document 1 discloses a technique for calculating a cost by considering traffic volume, regulation information, etc. when calculating the cost of a route candidate.

[0003] Patent Document 2 discloses a technique for calculating a cost by considering visibility when a route candidate includes a narrow street.

[0004] Patent Document 3 discloses a technique for reducing the priority of a route with a large number of operations of a driving safety system by a probe vehicle when determining the priority of a route candidate.

Prior Art Documents

Patent Documents

[0005]

Patent Document 1

Patent Document 2

Patent Document 3

Summary of the Invention

Problems to be Solved by the Invention

[0006] An object of the present disclosure is to provide a technique capable of expanding options when a user determines a driving route of a vehicle.

Means for Solving the Problems

[0007] The present disclosure can also be regarded as an information processing apparatus applied to a car navigation system that performs route search based on the cost of each of a plurality of route candidates from a starting point to a destination. In that case, the information processing apparatus is, for example, For a first route candidate including a first section with a road width where it is difficult to pass by an oncoming vehicle among the plurality of route candidates, whether it is possible to confirm the presence or absence of an oncoming vehicle before entering the first section, and based on the traffic volume of oncoming vehicles in the first section, calculate the cost. It may be provided with a control unit.

[0008] The present disclosure can also be regarded as an information processing method applied to a car navigation system that performs route search based on the cost of each of a plurality of route candidates from a starting point to a destination. In that case, the information processing method is, for example, The computer For a first route candidate including a first section with a road width where it is difficult to pass by an oncoming vehicle among the plurality of route candidates, it may be configured to calculate the cost based on whether it is possible to confirm the presence or absence of an oncoming vehicle before entering the first section and the traffic volume of oncoming vehicles in the first section.

[0009] The present disclosure can also be regarded as an information processing program for causing a computer to execute the above-described information processing method, or a computer-readable storage medium that non-temporarily stores the information processing program.

Effects of the Invention

[0010] According to the present disclosure, it is possible to provide a technology that can expand the options when a user determines a driving route of a vehicle.

Brief Description of the Drawings

[0011]

Figure 1

Figure 2

Figure 3

Figure 4

Figure 5

Figure 6

Figure 7

Figure 8

Mode for Carrying Out the Invention

[0012] The information processing apparatus of the present disclosure is applied to a car navigation system that performs route search for a vehicle. The car navigation system receives an input of a departure place and a destination by a user, and searches for a route from the departure place to the destination.

[0013] In the route search, the information processing apparatus, for example, extracts a plurality of route candidates from the departure place to the destination, calculates the cost of each of the extracted plurality of route candidates, determines the recommendation degree of the plurality of route candidates according to the calculated cost, and presents the route candidates with the highest recommendation degree to the user.

[0014] In a conventional car navigation system, the cost of each route candidate is calculated using parameters such as the distance length, travel time, and toll of each route candidate. For example, a route candidate with a shorter distance length is calculated to have a lower cost. Also, a route candidate with a shorter travel time is calculated to have a lower cost. Further, a route candidate with a lower toll is calculated to have a lower cost. The route candidate with a lower cost calculated in this way is set to have a higher recommendation level.

[0015] By the way, in a conventional car navigation system, there is a possibility that the cost of a route candidate (first route candidate) including a section (first section) with a narrow road width where it is difficult to pass by oncoming vehicles is calculated to be high, or the first route candidate is excluded from the route candidates subject to cost calculation. As a result, there was a high possibility that the first route candidate including the first section was not proposed to the user.

[0016] On the other hand, in recent years, with the spread of application programs for car navigation, the needs of users have become diversified. For example, the number of users who desire the proposal of the first route candidate including the first section has been increasing.

[0017] In response to the above needs, for the first route candidate, a method of calculating the cost in consideration of the visibility of the first section can be considered. That is, if the visibility is good enough to confirm in advance the presence or absence of oncoming vehicles entering the first section, the cost of the first route candidate can be calculated to be lower than before, or the first route candidate can be prevented from being excluded from the route candidates. According to such a method, if the visibility of the first section is good, the possibility that the first route candidate including the first section is presented to the user becomes high. In this way, if the visibility of the first section is good, the possibility that the first route candidate including the first section is presented to the user becomes high.

[0018] Here, when the user drives the vehicle according to the first route candidate including the first section with good visibility, the user can check whether there is an oncoming vehicle entering the first section before entering the vehicle into the first section. If the user can confirm that there is no oncoming vehicle entering the first section before entering the vehicle into the first section, the user can enter the vehicle into the first section without worrying about passing by the oncoming vehicle.

[0019] However, even if the visibility of the first section is good, if the number of oncoming vehicles passing through the first section is large, the opportunity to enter the vehicle into the first section will be reduced. As a result, the waiting time of the vehicle before the first section becomes long, and there is a possibility that the user may feel stressed.

[0020] Therefore, in the information processing apparatus according to the present disclosure, the control unit calculates the cost based on whether it is possible to check whether there is an oncoming vehicle before entering the first section and the traffic volume of oncoming vehicles in the first section for the first route candidate among a plurality of route candidates. Thereby, not only whether it is possible to check whether there is an oncoming vehicle before entering the first section (that is, whether the visibility of the first section is good), but also the traffic volume of oncoming vehicles in the first section is taken into account, and the cost of the first route candidate can be calculated.

[0021] Here, when it is possible to check for oncoming vehicles before entering the first section, the control unit of the information processing apparatus according to the present disclosure may calculate the cost of the first route candidate to be smaller as the traffic volume of oncoming vehicles in the first section is smaller. As a result, when it is possible to check for oncoming vehicles before entering the first section and the traffic volume of oncoming vehicles in the first section is large, the cost of the first route candidate is calculated to be large. As a result, even when it is possible to check for oncoming vehicles before entering the first section, if the traffic volume of oncoming vehicles in the first section is large, the recommendation degree of the first route candidate can be lowered. On the other hand, when it is possible to check for oncoming vehicles before entering the first section and the traffic volume of oncoming vehicles in the first section is small, the cost of the first route candidate is calculated to be small. Thereby, when it is possible to check for oncoming vehicles before entering the first section and the traffic volume of oncoming vehicles in the first section is small, the recommendation degree of the first route candidate can be increased.

[0022] Note that when it is not possible to check for oncoming vehicles before entering the first section (that is, when the visibility of the first section is poor), the control unit of the information processing apparatus according to the present disclosure may not calculate the cost based on the traffic volume of oncoming vehicles in the first section for the first route candidate. Even if the traffic volume of oncoming vehicles in the first section is small, if the visibility of the first section is poor, when the vehicle travels in the first section, the user is likely to feel stressed worrying about passing by oncoming vehicles. Therefore, it is not necessary to calculate the cost of such a first route candidate to be small.

[0023] In addition, in the information processing apparatus according to the present disclosure, the control unit may calculate the cost of the first route candidate based on whether it is possible to confirm the presence or absence of oncoming vehicles before entering the first section, the traffic volume of oncoming vehicles in the first section, and the presence or absence of a bypass area in the first section. As a result, not only can it be determined whether it is possible to confirm the presence or absence of oncoming vehicles before entering the first section, but also the cost of the first route candidate can be calculated taking into account the traffic volume of oncoming vehicles in the first section and the presence or absence of a bypass area in the first section.

[0024] Here, when there is a bypass area in the first section, the control unit of the information processing apparatus according to the present disclosure may calculate the cost of the first route candidate to be smaller as the traffic volume of oncoming vehicles in the first section is smaller. Thereby, even when it is not possible to confirm the presence or absence of oncoming vehicles before entering the first section (when the visibility of the first section is poor), if there is a bypass area in the first section and the traffic volume of oncoming vehicles in the first section is small, the recommended degree of the first route candidate can be increased. When there is a bypass area in the first section, even if the visibility of the first section is poor, it is possible to pass by oncoming vehicles using the bypass area, so the stress on the user when driving a vehicle in the first section can be reduced. Furthermore, if the traffic volume of oncoming vehicles in the first section is small, the frequency of passing by oncoming vehicles using the bypass area can also be reduced, so the stress on the user when driving a vehicle in the first section can be more reliably reduced.

[0025] In addition, when there is no bypass area in the first section and it is possible to confirm the presence or absence of oncoming vehicles before entering the first section, the control unit of the information processing apparatus according to the present disclosure may calculate the cost of the first route candidate to be smaller as the traffic volume of oncoming vehicles in the first section is smaller. This is because even when there is no bypass area in the first section, if the visibility of the first section is good and the traffic volume of oncoming vehicles in the first section is small, the stress on the user when driving a vehicle in the first section can be reduced.

[0026] Also, when there is no evacuation area in the first section and it is impossible to confirm the presence or absence of oncoming vehicles before entering the first section, the control unit of the information processing apparatus according to the present disclosure may not calculate the cost based on the traffic volume of oncoming vehicles in the first section for the first route candidate. Even when the traffic volume of oncoming vehicles in the first section is small, if the visibility in the first section is poor and there is no evacuation area in the first section, when the vehicle travels in the first section, the user is likely to feel stressed worrying about passing by oncoming vehicles. Therefore, it may not be necessary to calculate the cost of such a first route candidate to be small.

[0027] Further, in the information processing apparatus according to the present disclosure, the control unit may calculate the cost of the first route candidate based on whether it is possible to confirm the presence or absence of oncoming vehicles before entering the first section, in addition to the traffic volume of oncoming vehicles in the first section, the presence or absence of an evacuation area in the first section, and the distance length of the first section. Thereby, not only whether it is possible to confirm the presence or absence of oncoming vehicles before entering the first section, but also taking into account the traffic volume of oncoming vehicles in the first section, the presence or absence of an evacuation area in the first section, and the distance length of the first section, the cost of the first route candidate can be calculated.

[0028] Here, when there is an avoidance area in the first section, the control unit of the information processing apparatus according to the present disclosure may calculate the cost of the first route candidate to be smaller as the traffic volume of oncoming vehicles in the first section is smaller and the distance length of the first section is shorter. Thereby, even when it is not possible to confirm the presence or absence of oncoming vehicles before entering the first section (when the visibility of the first section is poor), if there is an avoidance area in the first section, the traffic volume of oncoming vehicles in the first section is small, and the distance length of the first section is short, the recommendation degree of the first route candidate can be increased. When there is an avoidance area in the first section, as described above, even if the visibility of the first section is poor, it is possible to pass by oncoming vehicles using the avoidance area. However, when the distance length of the first section is long, there is a possibility that the user's vehicle and oncoming vehicles will encounter at a point away from the avoidance area. In such a case, the moving distance when the user moves the vehicle to the avoidance area may become long, and the user is likely to feel stress. On the contrary, according to the present disclosure, even when there is an avoidance area in the first section and the traffic volume of oncoming vehicles in the first section is small, if the distance length of the first section is long, the recommendation degree of the first route candidate can be decreased.

[0029] In addition, when there is no avoidance area in the first section and it is possible to confirm the presence or absence of oncoming vehicles before entering the first section, the control unit of the information processing apparatus according to the present disclosure may calculate the cost of the first route candidate to be smaller as the traffic volume of oncoming vehicles in the first section is smaller and the distance length of the first section is shorter. This is because even when there is no avoidance area in the first section, if the visibility of the first section is good, the traffic volume of oncoming vehicles in the first section is small, and the distance length of the first section is short, the stress of the user when driving the vehicle through the first section can be reduced.

[0030] However, when the traffic volume of oncoming vehicles in the first section is greater than the first threshold and / or the distance length of the first section is longer than the second threshold, the control unit of the information processing apparatus according to the present disclosure may not calculate the cost based on the traffic volume of oncoming vehicles in the first section and the distance length of the first section for the first route candidate. Even when there is a parking area in the first section and it is possible to check for the presence of oncoming vehicles before entering the first section, if the traffic volume of oncoming vehicles in the first section is excessively large and / or the distance length of the first section is excessively long, the stress on the user when driving the vehicle through the first section is likely to increase. Therefore, it may not be necessary to calculate the cost of such a first route candidate to be small.

[0031] Also, when there is no parking area in the first section and it is not possible to check for the presence of oncoming vehicles before entering the first section, the control unit of the information processing apparatus according to the present disclosure may not calculate the cost based on the traffic volume of oncoming vehicles in the first section and the distance length of the first section for the first route candidate. Even when the traffic volume of oncoming vehicles in the first section is small and the distance length of the first section is short, if the visibility in the first section is poor and there is no parking area in the first section, the user is likely to feel stress when driving the vehicle through the first section. Therefore, it may not be necessary to calculate the cost of such a first route candidate to be small.

[0032] <Embodiment> In this embodiment, an example of applying the information processing apparatus of the present disclosure to a system (car navigation system) that searches for a route from a departure point to a destination when a user (user) who wishes to move by vehicle designates the departure point and the destination will be described.

[0033] (Overview of the Car Navigation System) FIG. 1 is a diagram showing an overview of a car navigation system. In the example shown in FIG. 1, the car navigation system includes a vehicle 100, a user terminal 200, and a server device 300. In the example shown in FIG. 1, only one vehicle 100 and one user terminal 200 are illustrated, but it is assumed that there are a plurality of vehicles 100 and user terminals 200 under the management of the server device 300.

[0034] The user terminal 200 and the server device 300 are connected via a network N1. The network N1 is, for example, a WAN (Wide Area Network) such as a worldwide public communication network like the Internet, or another communication network. Note that the user terminal 200 is connected to the network N1 using wireless communication Wireless communication is, for example, mobile communication such as 5G (5th - Generation) or LTE (Long Term Evolution), narrow - band communication such as DSRC (Dedicated Short Range Communications), or Wi - Fi (registered trademark), etc.

[0035] The vehicle 100 is a vehicle used by a user for moving from a departure place to a destination, such as an automobile or a motorcycle. The user terminal 200 is a terminal device used by the user. An application program for using the car navigation service is installed in the user terminal 200. The user can receive the provision of the car navigation service by causing the user terminal 200 to execute the above - mentioned predetermined application.

[0036] In a car navigation service, a user transmits information indicating a departure point and a destination desired by the user (hereinafter, may also be referred to as "OD (Origin-Destination) information") to the server device 300 through the user terminal 200. Also, the user receives, by the user terminal 200, information indicating a search result of route candidates by the server device 300 (hereinafter, may also be referred to as "recommended route information"). The recommended route information includes information on a candidate with a higher recommendation degree (hereinafter, may also be referred to as "recommended route") among a plurality of route candidates from the departure point to the destination. Information on the recommended route is information representing the recommended route as a set of road links.

[0037] Note that the recommended route may be only the route candidate with the highest recommendation degree, or may be N route candidates from the highest to the Nth (N is a natural number). When information on N recommended routes is included in the recommended route, information on the recommendation order in the N recommended routes may be included in the recommended route information.

[0038] The server device 300 extracts a plurality of route candidates connecting the departure point and the destination desired by the user based on the OD information received from the user terminal 200. The server device 300 calculates the cost of each of the extracted plurality of route candidates. In the present embodiment, the server device 300 calculates the cost of each route candidate using, as parameters, the distance length, required time, toll, road width, visibility, and passing volume of oncoming vehicles of each route candidate. At this time, the server device 300 may calculate the cost for each road link for each route candidate and calculate the total of the costs for each road link as the cost of each route candidate. For example, for a route candidate including a first road link and a second road link, the server device 300 calculates the cost of the first road link and the cost of the second road link, respectively. The server device 300 calculates the total of the cost of the first road link and the cost of the second road link as the cost of the route candidate. The method of calculating the cost for each road link will be described later.

[0039] When the cost of each of the plurality of route candidates is calculated, the server device 300 determines the degree of recommendation (recommendation order (priority order)) among the plurality of route candidates by comparing the costs among the plurality of route candidates. In the present embodiment, the server device 300 determines that the route candidate with a smaller cost has a higher degree of recommendation. The server device 300 selects the route candidate with the highest degree of recommendation as the recommended route. The server device 300 generates recommended route information including information regarding the recommended route, and transmits the generated recommended route information to the user terminal 200.

[0040] Note that, in the present embodiment, the server device 300 corresponds to the "information processing device" according to the present disclosure.

[0041] (Hardware Configuration) FIG. 2 is a diagram showing an example of the hardware configuration of each of the user terminal 200 and the server device 300 included in the car navigation system.

[0042] The server device 300 is a computer managed by a provider of a car navigation service. The server device 300 of the present embodiment includes a processor 301, a main storage unit 302, an auxiliary storage unit 303, a communication unit 304, etc., as shown in FIG. 2. These processor 301, main storage unit 302, auxiliary storage unit 303, and communication unit 304 are connected to each other by a bus. The hardware configuration of the computer is not limited to the example shown in FIG. 2, and components may be appropriately omitted, replaced, or added.

[0043] The server device 300 realizes a function that matches a predetermined purpose by the processor 301 loading a program stored in a recording medium into a work area of the main storage unit 302 and executing it. Note that a series of processes executed by the server device 300 can be executed by hardware, but can also be executed by software.

[0044] The processor 301 is, for example, a CPU (Central Processing Unit) or a DSP (Digital Signal Processor). The processor 301 controls the server device 300 and performs various information processing operations to control the server device 300.

[0045] The main memory unit 302 is a computer-readable recording medium. The main memory unit 302 is used as a recording area for loading the programs stored in the auxiliary storage unit 303, or is used as a buffer for temporarily storing the calculation results of the processor 301 and the like. The main memory unit 302 is configured to include, for example, a RAM (Random Access Memory) and a ROM (Read Only Memory).

[0046] The auxiliary storage unit 303 is a computer-readable recording medium. The auxiliary storage unit 303 stores various programs, various data and various tables used when the processor 301 executes the various programs. The auxiliary storage unit 303 includes, for example, an EPROM (Erasable Programmable ROM) or an HDD (Hard Disk Drive). The auxiliary storage unit 303 can include a removable medium, that is, a portable recording medium. The removable medium may be, for example, a disk recording medium such as a CD (Compact Disc) or a DVD (Digital Versatile Disc), or a USB (Universal Serial Bus) memory. The programs stored in the auxiliary storage unit 303 include, in addition to the OS (Operating System), programs for realizing functions related to the provision of car navigation services. Note that part or all of the information stored in the auxiliary storage unit 303 may be stored in the main memory unit 302.

[0047] The communication unit 304 transmits and receives information between an external device (e.g., the user terminal 200) and the server device 300. The communication unit 304 is, for example, a LAN (Local Area Network) interface board or a wireless communication circuit for wireless communication. The LAN interface board or the wireless communication circuit is connected to the network N1.

[0048] Next, the user terminal 200 is a small computer that can be carried by the user, such as a smartphone, a tablet terminal, or a wearable computer (such as a smartwatch). Note that the user terminal 200 may be an in-vehicle terminal such as a display audio mounted on the vehicle 100. In that case, the in-vehicle terminal is configured to be connectable to the network N1 using wireless communication.

[0049] The user terminal 200 includes a processor 201, a main memory unit 202, an auxiliary storage unit 203, a display unit 204, an input unit 205, a position acquisition unit 206, and a communication unit 207. These processor 201, main memory unit 202, auxiliary storage unit 203, display unit 204, input unit 205, position acquisition unit 206, and communication unit 207 are connected to each other by a bus. Since the processor 201, main memory unit 202, and auxiliary storage unit 203 are the same as the processor 301, main memory unit 302, and auxiliary storage unit 303 of the server device 300, the description thereof is omitted.

[0050] The display unit 204 is, for example, an LCD (Liquid Crystal Display) or an EL (Electroluminescence) panel. The input unit 205 includes, for example, a touch panel capable of inputting symbols such as characters, a microphone capable of inputting voice, or a camera. The position acquisition unit 206 is a device that acquires the current position of the user terminal 200 and typically includes a GPS receiver. The communication unit 207 is a communication circuit for accessing the network N1 using, for example, a mobile communication service (a telephone communication network such as a mobile phone or a wireless communication such as WiFi) and performing data communication with the server device 300 and the like. Note that the hardware of the user terminal 200 ​ The α configuration is not limited to the example shown in FIG. 2, and components may be omitted, replaced, or added as appropriate.

[0051] A series of processes executed by the user terminal 200 configured as described above can be executed by hardware or by software.

[0052] (Functional Configuration of Server Device) Here, the functional configuration of the server device 300 in the present embodiment will be described with reference to FIG. 3. FIG. 3 is a block diagram showing an example of the functional configuration of the server device 300 in the present embodiment. As shown in FIG. 3, the server device 300 in the present embodiment includes, as its functional components, an acquisition unit F310, an extraction unit F320, a calculation unit F330, a determination unit F340, a map information database D310, and a road link database D320.

[0053] The acquisition unit F310, the extraction unit F320, the calculation unit F330, and the determination unit F340 are realized by the processor 301 of the server device 300 loading and executing the program in the auxiliary storage unit 303 onto the main storage unit 302. Note that the acquisition unit F310, the extraction unit F320, the calculation unit F330, and the determination unit F340 may be realized by a hardware circuit such as an ASIC (Application Specific Integrated Circuit) or an FPGA (Field Programmable Gate Array). That is also acceptable.

[0054] In the present embodiment, the processor 301 that realizes the functional components of the acquisition unit F310, the extraction unit F320, the calculation unit F330, and the determination unit F340 corresponds to the "control unit" according to the present disclosure.

[0055] The map information database D310 and the road link database D320 are constructed by a database management system (DBMS) managing the data stored in the auxiliary storage unit 303. The database management system is a program executed by the processor 301 of the server device 300. The map information database D310 and the road link database D320 are, for example, relational databases.

[0056] Note that any one of the functional components of the server device 300, or a part of its processing, may be executed by another computer connected to the network N1. Also, the functional configuration of the server device 300 is not limited to the example shown in FIG. 3, and omission, change, or addition of functional components can be made as appropriate.

[0057] In the map information database D310, map data of roads that the vehicle 100 can pass through is registered. As the map data, data in a well-known form can be used. For example, the map data may include a plurality of map meshes corresponding to a plurality of areas divided by latitude and longitude. Each map mesh may include a road link indicating a road that a motor vehicle can pass through and information for specifying a position on the map (for example, latitude and longitude, or an address, etc.). A link ID for identifying each individual road link may be assigned to each road link.

[0058] In the road link database D320, information regarding the road links registered in the map information database D310 is stored. FIG. 4 is a diagram showing an example of the information stored in the road link database D320.

[0059] As shown in FIG. 4, the road link database D320 of this embodiment has a table for each road link (hereinafter, may also be referred to as a "road link information table"). Each road link information table has fields such as a link ID, distance length, required time, toll, road width, visibility, and traffic volume. Note that the configuration of the road link information table is not limited to the example shown in FIG. 4, and fields can be added, changed, or deleted as appropriate.

[0060] In the link ID field, information (link ID) for identifying each road link is registered. In the distance length field, the distance length of each road link is registered. In the required time field, the time (required time) required for vehicle 100 to travel each road link at a predetermined speed is registered. The predetermined speed is, for example, the legal speed of each road link. Note that the information registered in the required time field may be the required time estimated from traffic jams and traffic regulations of each road link, or may be the time required when a probe vehicle travels each road link. In the toll field, the toll required when an automobile travels each road link is registered. When a road link includes at least a part of a toll road section, the amount indicating the toll required when passing through the section with vehicle 100 is registered in the toll field. When a road link does not include a toll road section, an amount indicating free (for example, "0") is registered in the toll field. In the road width field, a numerical value indicating the road width of each road link is registered.

[0061] In the visibility field, information indicating the visibility of each road link is registered. Specifically, at the position of one end of each road link, information indicating whether it is possible to visually recognize the presence or absence of oncoming vehicles passing through each road link and the presence or absence of oncoming vehicles attempting to enter each road link from the other end of each road link is registered in the visibility field. In the example shown in FIG. 4, when it is possible to visually recognize the presence or absence of oncoming vehicles passing through each road link and the presence or absence of oncoming vehicles attempting to enter each road link from the other end of each road link at the position of one end of each road link, "good" is registered in the visibility field. Also, when it is not possible to visually recognize the presence or absence of oncoming vehicles passing through each road link and / or the presence or absence of oncoming vehicles attempting to enter each road link from the other end of each road link at the position of one end of each road link, "bad" is registered in the visibility field.

[0062] In the traffic volume field, information indicating the traffic volume of oncoming vehicles on each road link is registered. Since the traffic volume of oncoming vehicles on each road link varies depending on the traveling direction of the vehicle 100, the traffic volume of oncoming vehicles for each traveling direction is registered in the traffic volume field. That is, the traffic volume when the traveling direction of the vehicle 100 is from one end to the other end of each road link and the traffic volume when the traveling direction of the vehicle 100 is from the other end to one end of each road link are registered in the traffic volume field.

[0063] Note that the required time for each road link and the traffic volume of oncoming vehicles on each road link may vary depending on the day of the week, time zone, etc. Therefore, it may be possible to register the required time for each time zone of each day of the week and the traffic volume of oncoming vehicles for each time zone of each day of the week in the required time field and the traffic volume field, respectively.

[0064] Also, for the visibility field and the traffic volume field, the corresponding information may be registered only in the road link information table corresponding to a road link whose road width is equal to or less than a predetermined width. The "predetermined width" referred to here is the upper limit value of the road width at which it is difficult to pass by an oncoming vehicle. The road width at which it is difficult to pass by an oncoming vehicle may be a road width at which it is physically impossible to pass by an oncoming vehicle, or may be a road width at which a user driving the vehicle 100 feels that it is impossible to pass by an oncoming vehicle. Note that the information registered in the visibility field and the traffic volume field may be obtained by an on-site survey or the like by an administrator of the system or the like.

[0065] Here, returning to the description of FIG. 3, the acquisition unit F310 acquires OD information from the user terminal 200. Specifically, when the OD information is transmitted from the user terminal 200 to the server device 300, the acquisition unit F310 acquires the OD information through the communication unit 304. As described above, the OD information is information regarding a departure place and a destination designated by the user. The OD information acquired by the communication unit 304 is passed to the extraction unit F320.

[0066] The extraction unit F320 extracts information regarding a route candidate (hereinafter, may also be referred to as "first information") based on the OD information acquired by the acquisition unit F310. The route candidate is a route that is a candidate for the recommended route and is a route connecting the departure place and the destination indicated by the OD information. The first information is data representing a combination of road links constituting the route candidate, and is data in which the link IDs of those road links are arranged in the order of the road links from the departure place to the destination.

[0067] The extraction unit F320 identifies, as route candidates, a plurality of routes connecting the departure point and the destination indicated by the OD information based on the map data registered in the map information database D310. The extraction unit F320 reads out the link IDs of the road links constituting each of the plurality of identified route candidates from the map information database D310. The extraction unit F320 generates first information for each route candidate based on the link IDs read out from the map information database D310. At this time, for a route candidate constituted by combining a plurality of road links, the extraction unit F320 generates the first information by arranging the plurality of link IDs corresponding to those plurality of road links in the order of the road links from the departure point to the destination.

[0068] The first information of the plurality of route candidates is passed from the extraction unit F320 to the calculation unit F330.

[0069] The calculation unit F330 calculates the cost of each of the plurality of route candidates extracted by the extraction unit F320. In the present embodiment, the cost calculation is performed in different ways for a route candidate including a road link with a road width equal to or less than a predetermined width (hereinafter, may also be referred to as a "first route candidate") and a route candidate not including a road link with a road width equal to or less than a predetermined width (hereinafter, may also be referred to as a "second route candidate"). Therefore, the calculation unit F330 first sorts the plurality of route candidates extracted by the extraction unit F320 into a first route candidate and a second route candidate.

[0070] The discrimination between the first route candidate and the second route candidate is performed based on the information stored in the road link database D320. That is, the calculation unit F330 accesses the road link information table of the road links included in each route candidate, and determines whether the road width registered in the road width field is equal to or less than a predetermined width. A route candidate including a road link (the first section) determined to have a road width equal to or less than the predetermined width registered in the road width field is selected as the first route candidate. A route candidate including only road links determined to have a road width greater than the predetermined width registered in the road width field (a route candidate not including the first section) is selected as the second route candidate.

[0071] Regarding the first route candidate, before the cost is calculated, the appropriateness of cost adjustment is determined. The "cost adjustment" mentioned here means subtracting and correcting the cost calculated in the same method as the second route candidate described later according to the passing volume of oncoming vehicles in the first section. The determination of the appropriateness of cost adjustment is performed based on the visibility of the first section. Specifically, the calculation unit F330 accesses the road link information table of the road link corresponding to the first section, and determines whether information indicating "good" is registered in the visibility field. If information indicating "bad" is registered in the visibility field, the first route candidate including the road link is determined to have no appropriateness of cost adjustment. In that case, the first route candidate is excluded from the target of cost adjustment, and the cost is calculated in the same method as the second route candidate. That is, a route candidate determined to have no appropriateness of cost adjustment is reselected as the second route candidate. If information indicating "good" is registered in the visibility field, the first route candidate including the road link is determined to have appropriateness of cost adjustment. In that case, the first route candidate becomes the target of cost adjustment.

[0072] For the first route candidate determined to have appropriate cost adjustment, the calculation unit F330 calculates the cost based on the total distance length, total required time, total toll, minimum road width, and the traffic volume of oncoming vehicles in the first section of the first route candidate. The total distance length is the sum of the distance lengths of the road links included in the first route candidate. The total required time is the sum of the required times included in the first route candidate. The total toll is the sum of the tolls of the road links included in the first route candidate. The minimum road width is the road width of the link with the narrowest road width among the road links included in the first route candidate.

[0073] The cost based on the total distance length (hereinafter, may also be referred to as "the first cost"), the cost based on the total required time (hereinafter, may also be referred to as "the second cost"), the cost based on the total toll (hereinafter, may also be referred to as "the third cost"), the cost based on the minimum road width (hereinafter, may also be referred to as "the fourth cost"), and the cost based on the traffic volume of oncoming vehicles in the road link corresponding to the first section (hereinafter, may also be referred to as "the fifth cost") are calculated by the calculation unit F330. In this embodiment, the calculation unit F330 calculates the first cost to be smaller as the total distance length is shorter. Also, the calculation unit F330 calculates the second cost to be smaller as the total required time is shorter. Also, the calculation unit F330 calculates the third cost to be smaller as the total toll is cheaper. Also, the calculation unit F330 calculates the fourth cost to be smaller as the minimum road width is wider. Also, the calculation unit F330 calculates the fifth cost to be larger as the traffic volume of oncoming vehicles in the first section is smaller.

[0074] The first cost may be calculated using a map or calculation model that derives the first cost with the total distance length as an argument. In that case, the map or calculation model is designed such that the derived first cost becomes smaller as the total distance length is shorter. Such a map or calculation model may be stored in the auxiliary storage unit 303 in advance.

[0075] The second cost may be calculated using a map or an arithmetic model that derives the second cost with the total required time as an argument. In that case, the map or arithmetic model is designed such that the shorter the total required time, the smaller the derived second cost. Such a map or arithmetic model may be stored in the auxiliary storage unit 303 in advance.

[0076] The third cost may be calculated using a map or an arithmetic model that derives the third cost with the total toll as an argument. In that case, the map or arithmetic model is designed such that the lower the total toll, the smaller the derived third cost. Such a map or arithmetic model may be stored in the auxiliary storage unit 303 in advance.

[0077] The fourth cost may be calculated using a map or an arithmetic model that derives the fourth cost with the minimum road width as an argument. In that case, the map or arithmetic model is designed such that the wider the minimum road width, the smaller the derived fourth cost. Such a map or arithmetic model may be stored in the auxiliary storage unit 303 in advance.

[0078] The fifth cost may be calculated using a map or an arithmetic model that derives the fifth cost with the traffic volume of oncoming vehicles as an argument. In that case, the map or arithmetic model is designed such that the lower the traffic volume of oncoming vehicles, the larger the derived fifth cost. Such a map or arithmetic model may be stored in the auxiliary storage unit 303 in advance.

[0079] The calculation unit F330 calculates the cost of the first route candidate according to the following formula (1). (Cost of the first route candidate) = (First cost) + (Second cost) + (Third cost ) + (Fourth cost) - (Fifth cost) ··· (1) That is, the calculation unit F330 calculates the cost of the first route candidate by obtaining the sum of the first to fourth costs and subtracting and correcting the sum by the fifth cost.

[0080] Next, for the second route candidate, the calculation unit F330 calculates the cost without determining the appropriateness of cost adjustment. That is, the calculation unit F330 calculates the cost for each of all the route candidates selected as the second route candidate. The cost of the second route candidate is calculated by summing the first cost, the second cost, the third cost, and the fourth cost. The first cost in this case is the cost based on the total distance length of the second route candidate. The second cost is the cost based on the total required time of the second route candidate. The third cost is the cost based on the total toll of the second route candidate. The fourth cost is the minimum road width of the second route candidate. These first cost, second cost, third cost, and fourth cost are calculated using the same map or calculation model as the first route candidate.

[0081] When the cost calculation is completed for all of the plurality of route candidates extracted by the extraction unit F320, the first information and cost of those plurality of route candidates are passed from the calculation unit F330 to the determination unit F340.

[0082] The determination unit F340 determines a recommended route from among the plurality of route candidates. Specifically, the determination unit F340 first determines the recommendation degree of the plurality of route candidates. In this embodiment, the determination unit F340 determines that the route candidate with a smaller cost has a higher recommendation degree. The determination unit F340 determines the route candidate with the highest recommendation degree among the plurality of route candidates as the recommended route. The determination unit F340 may also determine the N route candidates with the highest recommendation degrees from the plurality of route candidates as the recommended route.

[0083] In addition, when there are multiple route candidates with the same cost calculated by the calculation unit F330, the determination unit F340 may determine the recommendation degrees of these multiple route candidates based on any one of the total distance length, the total required time, or the total toll. For example, the determination unit F340 may determine that the shorter the total distance length of the route candidate, the higher the recommendation degree. Also, the determination unit F340 may determine that the shorter the total required time of the route candidate, the higher the recommendation degree. Further, the determination unit F340 may determine that the lower the total toll of the route candidate, the higher the recommendation degree. Regarding which one of the total distance length, the total required time, and the total toll is used to determine the recommendation degree when there are multiple route candidates with the same cost, it may be possible for the user of the vehicle 100 to specify it. In that case, information indicating which one of the total distance length, the total required time, and the total toll the user values may be included in the OD information.

[0084] The determination unit F340 generates recommended route information based on the first information of the route candidate determined as the recommended route. The recommended route information includes, for example, information representing the recommended route as a set of road links, the total distance length of the recommended route, the total required time of the recommended route, and the total toll of the recommended route. When the N route candidates with the highest recommendation degrees from the top are determined as the recommended routes, information indicating the recommendation order of the N recommended routes may also be included in the recommended route information in addition to the above-mentioned information.

[0085] The recommended route information generated by the determination unit F340 is transmitted to the user terminal 200 through the communication unit 304 of the server device 300.

[0086] (Flow of processing) Here, the flow of processing executed by the server device 300 will be described based on FIGS. 5 and 6. FIG. 5 shows the trigger for receiving the OD information transmitted from the user terminal 200. FIG. 6 is a flowchart showing a processing routine performed by the server device 300. FIG. 6 is a flowchart showing a subroutine executed in the process of step S105 in FIG. 5. Note that the execution subject of the processing routine shown in FIGS. 5 and 6 is the processor 301 of the server device 300, but here, the functional components of the server device 300 will be mainly described.

[0087] In FIG. 5, when OD information transmitted from the user terminal 200 is received by the communication unit 304 of the server device 300, the acquisition unit F310 of the server device 300 acquires the OD information from the communication unit 304 (step S101). The acquisition unit F310 passes the OD information acquired through the communication unit 304 to the extraction unit F320. The extraction unit F320 executes the process of step S102 triggered by the reception of the OD information.

[0088] In step S102, the extraction unit F320 specifies route candidates based on the above OD information. That is, the extraction unit F320 accesses the map information database D310 and specifies a plurality of routes connecting the departure point and the destination indicated by the OD information as route candidates. After the extraction unit F320 finishes executing the process of step S102, it executes the process of step S103.

[0089] In step S103, the extraction unit F320 generates first information for each of the plurality of route candidates specified in step S102. As described above, the first information is information in which the link IDs of the road links constituting each route candidate are arranged in the order of the road links from the departure point to the destination. The link IDs of the road links constituting each route candidate are extracted from the map information data stored in the map information database D310. The extraction unit F320 passes the first information of the plurality of route candidates to the calculation unit F330. The calculation unit F330 executes the process of step S104 triggered by the reception of the first information.

[0090] In step S104, the arithmetic unit F330 selects route candidates based on the above first information and the information stored in the road link database D320. That is, the arithmetic unit F330 accesses the road link information table of the road links included in each route candidate, and determines whether the road width registered in the road width field is equal to or less than a predetermined width. For a route candidate including a road link (first section) for which it is determined that the road width registered in the road width field is equal to or less than the predetermined width, the arithmetic unit F330 selects it as a first route candidate. For a route candidate including only road links for which it is determined that the road width registered in the road width field is greater than the predetermined width (a route candidate not including the first section), the arithmetic unit F330 selects it as a second route candidate. When the arithmetic unit F330 finishes executing the process of step S104, it executes the process of step S105.

[0091] In step S105, the arithmetic unit F330 calculates the costs of a plurality of route candidates according to the selection result in step S104. Specifically, the arithmetic unit F330 calculates the costs of the route candidates based on the subroutine in FIG. 6. The subroutine in FIG. 6 is executed for each of the plurality of route candidates extracted by the extraction unit F320.

[0092] In FIG. 6, the arithmetic unit F330 determines whether the target route candidate is selected as a first route candidate (step S1051). When the target route candidate is selected as a first route candidate (positive determination in step S1051), the arithmetic unit F330 executes the process of step S1052.

[0093] In step S1052, the arithmetic unit F330 determines whether the target route candidate is suitable for cost adjustment. In the present embodiment, based on the quality of the visibility of the road link corresponding to the first section among the road links constituting the target route candidate, the route candidate The suitability is determined. That is, the arithmetic unit F330 accesses the road link information table corresponding to the road link among the road link information tables stored in the road link database D320, and determines whether information indicating "good" is registered in the visibility field.

[0094] If information indicating "poor" is registered in the visibility field, it is determined that the target route candidate is not suitable for cost adjustment (negative determination in step S1052). In this case, the target route candidate is re-selected as the second route candidate, and cost calculation is performed in steps 1055 and S1056 described later. On the other hand, if information indicating "good" is registered in the visibility field, it is determined that the target route candidate is suitable for cost adjustment (positive determination in step S1052). In this case, the arithmetic unit F330 executes the process of step S1053.

[0095] In step S1053, the arithmetic unit F330 calculates the first to fifth costs of the target first route candidate. Specifically, the arithmetic unit F330 first calculates the total distance length, total required time, and total toll of the target first route candidate based on the information registered in the road link database D320. Also, the arithmetic unit F330 extracts the minimum road width of the target first route candidate based on the information registered in the road link database D320. Next, the arithmetic unit F330 calculates the first cost, second cost, third cost, and fourth cost, respectively, using the total distance length, total required time, total toll, and minimum road width as arguments. At that time, as described above, the first cost is calculated to be smaller as the total distance length is shorter. The second cost is calculated to be smaller as the total required time is shorter. The third cost is calculated to be smaller as the total toll is lower. The fourth cost is calculated to be smaller as the minimum road width is wider. Also, the arithmetic unit F330 calculates the fifth cost based on the passing volume of oncoming vehicles in the road link corresponding to the first section. At that time, the fifth cost is calculated to be larger as the passing volume of oncoming vehicles in the road link is smaller. When the arithmetic unit F330 finishes executing the process of step S1053, it executes the process of step S1054.

[0096] In step S1054, the arithmetic unit F330 calculates the cost of the target first route candidate based on the first to fifth costs calculated in step S1053. Specifically, the arithmetic unit F330 calculates the cost of the target first route candidate by substituting the first to fifth costs calculated in step S1053 into the above-described formula (1). After the process of step S1054 is executed, the execution of this subroutine ends. In that case, the process of step S106 in FIG. 5 is executed.

[0097] In step S1051 in FIG. 6, when the target route candidate is selected as the second route candidate (negative determination in step S1051), and when the target route candidate is reselected from the first route candidate to the second route candidate (negative determination in step S1052), the calculation unit F330 executes the process of step S1055.

[0098] In step S1055, the calculation unit F330 calculates the first to fourth costs of the target second route candidate. After the calculation unit F330 finishes executing the process of step S1055, it executes the process of step S1056.

[0099] In step S1056, the calculation unit F330 calculates the cost of the target second route candidate by summing the first to fourth costs calculated in step S1055. After the process of step S1056 is executed, the execution of this subroutine ends. In that case, the process of step S106 in FIG. 5 is executed.

[0100] Here, returning to the processing routine of FIG. 5, after the process of step S105 is executed, the cost The first information and cost of the route candidate for which cost calculation was performed are passed from the calculation unit F330 to the determination unit F340. The determination unit F340 executes the process of step S106 triggered by receiving the first information and cost.

[0101] In step S106, the determination unit F340 determines the recommendation degree of each of the route candidates that were the target of cost calculation in step S105. That is, the determination unit F340 determines a higher recommendation degree for a route candidate with a lower cost calculated in step S105. After the determination unit F340 finishes executing the process of step S106, it executes the process of step S107. Note that if there are multiple route candidates with the same cost calculated in step S105, the route candidate with a shorter total distance length may be determined to have a higher recommendation degree. Also, the route candidate with a shorter total required time may be determined to have a higher recommendation degree. Also, the route candidate with a lower total toll may be determined to have a higher recommendation degree.

[0102] In step S107, the determination unit F340 determines a recommended route based on the recommendation degree determined in step S106. For example, the determination unit F340 determines, as the recommended route, the route candidate with the highest recommendation degree among the route candidates subject to cost calculation. Note that the determination unit F340 may determine, as the recommended route, the N route candidates with the top N recommendation degrees among the route candidates subject to cost calculation. After executing the process of step S107, the determination unit F340 executes the process of step S108.

[0103] In step S108, the determination unit F340 generates recommended route information based on the first information of the route candidate determined as the recommended route. The recommended route information includes information representing the recommended route as a set of road links, the total distance length of the recommended route, the total required time of the recommended route, and the total toll of the recommended route. When N route candidates with the top N recommendation degrees are determined as the recommended route, information indicating the recommendation order of the N recommended routes is included in the recommended route information in addition to the above-described information. After executing the process of step S108, the determination unit F340 executes the process of step S109.

[0104] In step S109, the determination unit F340 transmits the recommended route information generated in step S108 to the user terminal 200 through the communication unit 304 of the server device 300. After the process of step S109 is executed, the process of this processing routine is terminated.

[0105] When the recommended route information transmitted from the server device 300 is received by the user terminal 200, the display unit 204 of the user terminal 200 outputs the recommended route information. Thereby, the user can determine the driving route of the vehicle 100 based on the recommended route information output to the display unit 204. The user terminal 200 can perform route guidance according to the determined driving route through a navigation application program.

[0106] (Operational Effects of the Embodiment) According to this embodiment, even for a route candidate including a road link (first section) with a road width where it is difficult to pass by an oncoming vehicle, if the visibility of the first section is good, it becomes a target for cost adjustment. For a route candidate including a first section with good visibility (a route candidate that has become a target for cost adjustment), the less the traffic volume of oncoming vehicles in the first section, the lower the cost is calculated. Conversely, even for a route candidate including a first section with good visibility, if the traffic volume of oncoming vehicles in the first section is large, the cost is calculated to be large. Therefore, it is possible to suppress a route candidate that includes a first section with good visibility and has a large traffic volume of oncoming vehicles in the first section from being proposed to the user as a recommended route. That is, it is possible to suppress a route candidate for which the user is likely to feel stress in passing by an oncoming vehicle from being proposed as a recommended route. On the other hand, for a route candidate that includes a first section with good visibility and has a small traffic volume of oncoming vehicles in the first section, the cost is calculated to be low. Therefore, a route candidate that includes a first section with good visibility and has a small traffic volume of oncoming vehicles in the first section can be proposed to the user as a recommended route. Thereby, the options when the user determines the traveling route of the vehicle 100 can be expanded.

[0107] <Modification 1> In the above-described embodiment, an example of determining the suitability of a route candidate selected as the first route candidate based on the visibility of the road link corresponding to the first section has been described. In contrast, in this modification, an example of determining the suitability of a route candidate selected as the first route candidate based on the presence or absence of a detour area in the road link in addition to the visibility of the road link corresponding to the first section will be described.

[0108] Here, even if the visibility of the road link corresponding to the first section is poor, if there is a bypass area in the middle of the road link, it is possible to pass by oncoming vehicles using the bypass area. Further, if the traffic volume of oncoming vehicles on the road link is small, the frequency of passing by oncoming vehicles using the bypass area will be reduced. Therefore, the stress on the user when driving the vehicle 100 on the road link can be significantly reduced.

[0109] Also, even if there is no bypass area on the road link corresponding to the first section, if the visibility of the road link is good, before the user's vehicle 100 enters the road link, it is possible to check for the presence of oncoming vehicles passing through the road link and visually confirm oncoming vehicles attempting to enter the road link. Further, if the traffic volume of oncoming vehicles on the road link is small, the opportunity for the user's vehicle 100 to enter the road link increases. Therefore, the stress on the user when driving the vehicle 100 on the road link can be significantly reduced.

[0110] Therefore, in this modified example, when there is a bypass area on the road link corresponding to the first section and / or when the visibility of the road link is good, it is determined that the route candidate including the road link has suitability for cost adjustment. As a result, even if the visibility of the road link corresponding to the first section is poor, if there is a bypass area on the road link, the route candidate including the road link becomes a target for cost adjustment. Also, even if there is no bypass area on the road link corresponding to the first area, if the visibility of the road link is good, the route candidate including the road link becomes a target for cost adjustment.

[0111] FIG. 7 is a diagram showing an example of information stored in the road link database D320 in this modified example. The road link database D320 in this modified example has a road link information table for each road link, similar to the above-described embodiment. However, as shown in FIG. 7, the road link information table in this modified example has a detour area field in addition to the fields of link ID, distance length, required time, toll, road width, visibility, and traffic volume. The information registered in the fields of link ID, distance length, required time, traffic volume, road width, visibility, and traffic volume is the same as the road link information table (see FIG. 4) of the above-described embodiment. In the detour area field, information indicating whether there is a detour area in the middle of each road link is registered. For example, in the road link information table of a road link with a detour area, information indicating "yes" is registered in the detour area field. Also, in the road link information table of a road link without a detour area, information indicating "no" is registered in the detour area field.

[0112] FIG. 8 is a flowchart showing the process executed by the server device 300 when determining the suitability of the route candidates selected as the first route candidates. That is, FIG. 8 shows the flow of the process executed instead of step S1052 in the subroutine of FIG. 6 described above. -chart.

[0113] In FIG. 8, the arithmetic unit F330 of the server device 300 determines the presence or absence of a detour area in the road link corresponding to the first section among the road links constituting the target route candidate (the route candidate selected as the first route candidate) (step S1052A). Specifically, the arithmetic unit F330 accesses the road link information table corresponding to the road link in the road link information table stored in the road link database D320 and determines whether information indicating "no" is registered in the detour area field. If information indicating "no" is registered in the detour area field (positive determination in step S1052A), the arithmetic unit F330 executes the process of step S1052B.

[0114] In step S1052B, the arithmetic unit F330 determines the visibility quality of the road link corresponding to the first section. Specifically, the arithmetic unit F330 determines whether information indicating "poor" is registered in the visibility field of the road link information table corresponding to the road link. If information indicating "poor" is registered in the visibility field (positive determination in S1052B), the arithmetic unit F330 executes the process of step S1052C.

[0115] In step S1052C, the arithmetic unit F330 determines that the target route candidate is not suitable for cost adjustment. After the process of step S1052C is executed, the processing routine of FIG. 8 ends. In that case, the target route candidate is reselected as the second route candidate. As a result, the arithmetic unit F330 calculates the cost of the target route candidate by executing the same processes as steps S1055 and S1056 in the processing routine of FIG. 6 described above.

[0116] Also, in step S1052A described above, if it is determined that information indicating "yes" is registered in the evacuation area field (positive determination in step S1052A), and in step S1052B described above, if it is determined that information indicating "good" is registered in the visibility field (negative determination in step S1052B), the arithmetic unit F330 executes the process of step S1052D.

[0117] In step S1052D, the arithmetic unit F330 determines that the target route candidate is suitable for cost adjustment. After the process of step S1052D is executed, the processing routine of FIG. 8 ends. In that case, the arithmetic unit F330 calculates the cost of the target route candidate by executing the same processes as steps S1053 and S1054 in the processing routine of FIG. 6 described above.

[0118] According to this modification example, even for a route candidate including a road link (first section) with a road width where it is difficult to pass by an oncoming vehicle and having poor visibility in the first section, if there is a parking area in the first section, it becomes a target for cost adjustment. Also, even for a route candidate including the first section and having no parking area in the first section, if the visibility in the first section is good, it becomes a target for cost adjustment. Thereby, the options when the user determines the traveling route of the vehicle 100 can be further expanded.

[0119] Furthermore, according to this modification example, for a route candidate including the first section with a parking area and / or a route candidate including the first section with good visibility, the less the traffic volume of oncoming vehicles in the first section, the smaller the cost is calculated. Conversely, even for a route candidate including the first section with a parking area and / or a route candidate including the first section with good visibility, if the traffic volume of oncoming vehicles in the first section is large, the cost is calculated to be large. Therefore, it is possible to suppress a route candidate that is a route candidate including the first section with good visibility and having a large traffic volume of oncoming vehicles in the first section, and a route candidate that is a route candidate including the first section with a parking area and having a large traffic volume of oncoming vehicles in the first section from being proposed to the user as a recommended route. As a result, it is possible to suppress a route candidate that the user is likely to feel stressed when passing by an oncoming vehicle from being proposed as a recommended route.

[0120] <Modification Example 2> In the above-described embodiment and Modification Example 1, an example was described in which the total distance length, total required time, total toll, minimum road width, and the traffic volume of oncoming vehicles in the first section are used as parameters when calculating the cost of a route candidate including the first section and being a route candidate (first route candidate) subject to cost adjustment. In contrast, in this modification example, an example will be described in which, in addition to the total distance length, total required time, total toll, minimum road width, and the traffic volume of oncoming vehicles in the first section, the distance length of the first section is used.

[0121] Even if the visibility in the first section is good and / or there is a refuge area in the first section, if the distance of the first section is long, even if the traffic volume of oncoming vehicles in the first section is small, the stress on the user when driving vehicle 100 through the first section may increase. For example, when the visibility in the first section is good, the user of vehicle 100 driving through the first section can visually recognize oncoming vehicles waiting to enter the first section. When the user of vehicle 100 visually recognizes an oncoming vehicle waiting to enter the first section, if the distance of the first section is long, the user of vehicle 100 may feel stressed about making the oncoming vehicle wait. Also, even if there is a refuge area in the first section, if the distance of the first section is long, there is a possibility that the user's vehicle 100 will encounter an oncoming vehicle at a point far from the refuge area. In such a case, since the moving distance when the user moves the vehicle to the refuge area becomes long, the user is likely to feel stressed.

[0122] Therefore, in this modification, the arithmetic unit F330 first calculates a first cost based on the total distance length, a second cost based on the total required time, a third cost based on the total toll, a fourth cost based on the minimum road width of the first section, a fifth cost based on the traffic volume of oncoming vehicles in the first section, and a cost based on the distance length of the first section (hereinafter, may also be referred to as the "sixth cost"). The first to fifth costs are calculated in the same manner as in the above-described embodiment. The sixth cost is calculated to be larger as the distance length of the first section is shorter.

[0123] Next, the arithmetic unit F330 calculates the cost of the first route candidate according to the following formula (2). (Cost of the first route candidate) = (First cost) + (Second cost) + (Third cost) + (Fourth cost) - (Fifth cost) - (Sixth cost) ··· (2) That is, the arithmetic unit F330 obtains the sum of the first to fourth costs, and calculates the cost of the first route candidate by subtraction correction of the sum by the fifth cost and the sixth cost.

[0124] According to this modification example, when the visibility of the first section is good and the traffic volume of oncoming vehicles in the first section is small, and / or when there is a parking area in the first section and the traffic volume of oncoming vehicles in the first section is small, even if the distance of the first section is long, the recommendation degree of the candidate including the first section can be lowered. Thereby, the recommendation degree of the route candidate including the first section where the user is likely to feel stress can be more surely lowered. As a result, it is possible to more surely suppress the route candidate including the first section where the user is likely to feel stress from being proposed to the user as the recommended route.

[0125] In addition, when the traffic volume of oncoming vehicles in the first section is excessively large and / or when the distance of the first section is excessively long, the route candidate including the first section may be excluded from the target of cost adjustment. That is, when the traffic volume of oncoming vehicles in the first section is excessively large and / or when the distance of the first section is excessively long, it may be determined that there is no suitability for cost adjustment for the route candidate including the first section. In that case, when the calculation unit F330 of the server device 300 determines the suitability of the route candidate selected as the first route candidate, in addition to determining whether the visibility of the first section is good (and whether there is a parking area in the first section), it may also determine whether the traffic volume of oncoming vehicles in the first section is more than the first threshold value and whether the distance of the first section is longer than the second threshold value. Thereby, it is possible to suppress a route candidate including a first section with an excessively large traffic volume of oncoming vehicles and / or a route candidate including a first section with an excessively long distance from being proposed to the user as the recommended route. On the other hand, for a route candidate including a first section with a small traffic volume of oncoming vehicles and / or a route candidate including a first section with a short distance, it can be proposed to the user as the recommended route.

[0126] <Others> The above-described embodiments are merely examples, and the present disclosure can be appropriately modified and implemented without departing from the gist thereof.

[0127] In addition, the processes and configurations described in the present disclosure can be freely combined and implemented as long as no technical contradiction occurs. For example, in the above embodiment, an example of applying the "information processing apparatus" in the present disclosure to a server apparatus has been described, but it may also be applied to a user terminal. That is, the process described as being performed by the server apparatus may be performed by the user terminal. Further, the process described as being performed by the server apparatus may be performed by sharing between the server apparatus and the user terminal. In a computer system, how each function is realized in a hardware configuration can be flexibly changed.

[0128] In addition, the present disclosure can also be realized by supplying a computer program (information processing program) that implements the functions described in each of the above embodiments to a computer, and causing one or more processors included in the computer to read and execute the program. The computer at that time may be a server apparatus or a user terminal. Such a computer program may be provided to the computer by a non-transitory computer-readable storage medium connectable to the system bus of the computer, or may be provided to the computer via a network. A non-transitory computer-readable storage medium is a recording medium that accumulates information such as data and programs by an electrical, magnetic, optical, mechanical, or chemical action and can be read by a computer or the like. Such a non-transitory computer-readable storage medium may be, for example, a disk such as a magnetic disk (a floppy (registered trademark) disk, a hard disk drive (HDD), etc.) or an optical disk (a CD-ROM, a DVD disk, a Blu-ray disk, etc.). Further, the non-transitory computer-readable storage medium may be a medium such as a read-only memory (ROM), a random access memory (RAM), an EPROM, an EEPROM, a magnetic card, a flash memory, an optical card, or a solid state drive (SSD).

Description of Reference Numerals

[0129] 100 Vehicle 200 User Terminal 300 Server device 301 Processor 302 Main memory unit 303 Auxiliary storage unit 304 Communication unit D310 Map information database D320 Road link database F310 Acquisition unit F320 Extraction unit F330 Arithmetic unit F340 Decision unit

Claims

1. An information processing apparatus applied to a car navigation system that performs route search based on the cost of each of a plurality of route candidates from a departure point to a destination, comprising: For a first route candidate among the plurality of route candidates that includes a first section with a road width where it is difficult to pass by oncoming vehicles, based on whether it is possible to check for the presence of oncoming vehicles before entering the first section and the traffic volume of oncoming vehicles in the first section, calculate the cost. Comprising a control unit. An information processing apparatus.

2. In the case where it is possible to check for the presence of oncoming vehicles before entering the first section, The control unit Calculates the cost of the first route candidate to be smaller as the traffic volume of oncoming vehicles in the first section is smaller. The information processing apparatus according to claim 1.

3. In the case where it is not possible to check for the presence of oncoming vehicles before entering the first section, The control unit Does not calculate the cost based on the traffic volume of oncoming vehicles in the first section for the first route candidate. The information processing apparatus according to claim 1 or 2.

4. The control unit Calculates the cost of the first route candidate based on whether it is possible to check for the presence of oncoming vehicles before entering the first section, the traffic volume of oncoming vehicles in the first section, and in addition, the presence or absence of a bypass area in the first section. The information processing apparatus according to claim 1.

5. In the case where there is a bypass area in the first section, The control unit Calculates the cost of the first route candidate to be smaller as the traffic volume of oncoming vehicles in the first section is smaller. The information processing apparatus according to claim 4.

6. In the case where there is no bypass area in the first section and it is possible to check for the presence of oncoming vehicles before entering the first section, The control unit Calculates the cost of the first route candidate to be smaller as the traffic volume of oncoming vehicles in the first section is smaller. The information processing apparatus according to claim 4 or 5.

7. In the case where there is no bypass area in the first section and it is not possible to check for the presence of oncoming vehicles before entering the first section, The control unit Does not calculate the cost based on the traffic volume of oncoming vehicles in the first section for the first route candidate. The information processing apparatus according to any one of claims 4 to 6.

8. The control unit Before entering the first section, can it be confirmed whether there is an oncoming vehicle, and in addition to the traffic volume of oncoming vehicles in the first section, based on the presence or absence of a passing area in the first section and the length of the first section, calculate the cost of the first route candidate. The information processing apparatus according to claim 1.

9. When there is a passing area in the first section The control unit The less the traffic volume of oncoming vehicles in the first section and the shorter the length of the first section, the smaller the cost of the first route candidate is calculated. The information processing apparatus according to claim 8.

10. When there is no passing area in the first section and it is possible to confirm the presence or absence of an oncoming vehicle before entering the first section The control unit The less the traffic volume of oncoming vehicles in the first section and the shorter the length of the first section, the smaller the cost of the first route candidate is calculated. The information processing apparatus according to claim 8 or 9.

11. When there is no passing area in the first section and it is not possible to confirm the presence or absence of an oncoming vehicle before entering the first section The control unit For the first route candidate, the calculation of the cost based on the traffic volume of oncoming vehicles in the first section and the length of the first section is not performed. The information processing apparatus according to any one of claims 8 to 10.

12. When the traffic volume of oncoming vehicles in the first section is more than a first threshold value and / or when the length of the first section is longer than a second threshold value The control unit For the first route candidate, the calculation of the cost based on the traffic volume of oncoming vehicles in the first section and the length of the first section is not performed. The information processing apparatus according to any one of claims 8 to 11.

13. An information processing method applied to a car navigation system that performs route search based on the cost of each of a plurality of route candidates from a starting point to a destination, A computer Among a plurality of the route candidates, for a first route candidate including a first section with a road width where it is difficult to pass by an oncoming vehicle, based on whether it is possible to confirm the presence or absence of an oncoming vehicle before entering the first section and the traffic volume of oncoming vehicles in the first section, calculate the cost. Information processing method.

14. When it is possible to confirm the presence or absence of an oncoming vehicle before entering the first section the computer calculates the cost of the first route candidate to be smaller as the traffic volume of oncoming vehicles in the first section is smaller The information processing method according to claim 13

15. When it is impossible to confirm the presence or absence of oncoming vehicles before entering the first section the computer does not calculate the cost based on the traffic volume of oncoming vehicles in the first section for the first route candidate The information processing method according to claim 13 or 14

16. the computer calculates the cost of the first route candidate based on whether it is possible to confirm the presence or absence of oncoming vehicles before entering the first section, the traffic volume of oncoming vehicles in the first section, and the presence or absence of a parking area in the first section The information processing method according to claim 13

17. When there is a parking area in the first section the computer calculates the cost of the first route candidate to be smaller as the traffic volume of oncoming vehicles in the first section is smaller The information processing method according to claim 16

18. When there is no parking area in the first section and it is possible to confirm the presence or absence of oncoming vehicles before entering the first section the computer calculates the cost of the first route candidate to be smaller as the traffic volume of oncoming vehicles in the first section is smaller The information processing method according to claim 16 or 17

19. When there is no parking area in the first section and it is impossible to confirm the presence or absence of oncoming vehicles before entering the first section the computer does not calculate the cost based on the traffic volume of oncoming vehicles in the first section for the first route candidate The information processing method according to any one of claims 16 to 18

20. the computer calculates the cost of the first route candidate based on whether it is possible to confirm the presence or absence of oncoming vehicles before entering the first section, the traffic volume of oncoming vehicles in the first section, the presence or absence of a parking area in the first section, and the length of the first section The information processing method according to claim 13 ​

Images