Information processing device, information processing method, and information processing program
The system addresses the challenge of presenting acceptable eco-routes by analyzing user driving habits and identifying energy-efficient routes that maintain route identity, enhancing user acceptance and energy savings.
Patent Information
- Authority / Receiving Office
- JP · JP
- Patent Type
- Patents
- Current Assignee / Owner
- Filing Date
- 2023-02-13
- Publication Date
- 2026-03-30
AI Technical Summary
Existing route calculation methods fail to present eco-routes that are easily acceptable to users, as they often suggest routes significantly different from the user's usual driving habits, making it difficult for users to accept the proposed switch to energy-efficient vehicles.
An information processing system that includes a server device and an in-vehicle device to analyze the user's driving history and identify eco-routes that maintain a high degree of identity with the user's usual driving habits while minimizing energy consumption, presenting these routes as acceptable alternatives.
The system effectively suggests eco-routes that are more likely to be accepted by users by maintaining route identity and reducing energy consumption, thereby facilitating a smoother transition to energy-efficient vehicles.
Smart Images

Figure 0007837464000001 
Figure 0007837464000002 
Figure 0007837464000003
Abstract
Description
Technical Field
[0001] The present disclosure relates to an information processing apparatus, an information processing method, and an information processing program.
Background Art
[0002] Conventionally, a method of searching for an optimal route using a route cost based on a link cost has been proposed.
Prior Art Documents
Patent Documents
[0003]
Patent Document 1
Summary of the Invention
Problems to be Solved by the Invention
[0004] However, in the above prior art, there is room for improvement in presenting an eco-route that is easy for the user to accept.
[0005] For example, in the above prior art, at the time when the user's self-driving ends, a route cost based on the link cost between the self-driving points is calculated, and an optimal route is searched based on the calculation result. However, with such a method, there is a possibility that a route completely different from the route taken by the user may be presented as the optimal route. In such a case, it may be difficult for the user to accept this optimal route as a future self-driving route.
[0006] The present disclosure has been made in view of the above, and proposes an information processing apparatus, an information processing method, and an information processing program that can present an eco-route that is easy for the user to accept.
Means for Solving the Problems
[0007] The information processing device according to claim 1 includes an acquisition unit that acquires a history of the travel route taken by a first mobile body from a departure point to a destination, and an output control unit that outputs a route found among candidate routes from the departure point to the destination as a proposed route for travel by a second mobile body different from the first mobile body, wherein the output control unit outputs a route found among the candidate routes as the proposed route, provided that it has a higher degree of identity with the travel route and consumes less energy than when the second mobile body travels the travel route.
[0008] The information processing method described in claim 11 is an information processing method performed by an information processing device, comprising: an acquisition step of acquiring a history of the travel route taken by a first mobile body from a departure point to a destination; and an output control step of outputting a route found among candidate routes from the departure point to the destination as a proposed route for travel by a second mobile body different from the first mobile body, wherein the output control step outputs a route found among candidate routes as the proposed route, provided that it has a higher degree of identity with the travel route and consumes less energy than when the second mobile body travels the travel route.
[0009] The information processing program described in claim 12 is an information processing program executed by an information processing device, wherein the information processing device is caused to execute an acquisition procedure to acquire a history of the travel route taken by a first mobile body from a departure point to a destination, and an output control procedure to output a route found among candidate routes from the departure point to the destination as a proposed route for travel by a second mobile body different from the first mobile body, wherein the output control procedure outputs a route found among candidate routes as the proposed route, provided that it has a higher degree of identity with the travel route and consumes less energy than when the second mobile body travels the travel route. [Brief explanation of the drawing]
[0010] [Figure 1] Figure 1 shows an example of a system according to an embodiment. [Figure 2] Figure 2 shows an example of the configuration of a server device and an in-vehicle device according to the embodiment. [Figure 3] Figure 3 is a flowchart showing the information processing according to the embodiment. [Figure 4] Figure 4 shows an example of the evaluation value calculation process according to the embodiment. [Figure 5] Figure 5 shows a list of calculation results corresponding to the identity evaluation value. [Figure 6] Figure 6 shows an example of a comparison screen that compares the travel route with the proposed route. [Figure 7] Figure 7 shows a modified example of the information processing according to the embodiment. [Figure 8] Figure 8 is a hardware configuration diagram showing an example of a computer that implements the functions of a server device. [Modes for carrying out the invention]
[0011] [Embodiment] Embodiments of the present disclosure will be described in detail below with reference to the drawings. Note that these embodiments do not limit the information processing apparatus, information processing method, and information processing program related to the present disclosure. Furthermore, the same parts will be denoted by the same reference numerals in the following embodiments, and redundant descriptions will be omitted.
[0012] Furthermore, in the following embodiments, the "moving object" will be described as a "vehicle" (automobile) traveling on a road. Accordingly, "movement" will be expressed as "travel." For example, the expression "the path traveled by the moving object" can be replaced with "the path traveled by the vehicle."
[0013] [1. Introduction] When proposing to a user to switch from a vehicle in which the energy source for driving the power source is gasoline stored in a storage tank, that is, a gasoline vehicle (GV), to a vehicle in which the energy source for driving the power source is electric power stored in a battery, that is, an electric vehicle (EV), a specific eco-route may be presented as an optimal route suitable for the EV.
[0014] In such a case, if the eco-route presented as the optimal route is too different in terms of distance, shape, characteristics, etc. compared to, for example, the route the user usually drives, there is a problem that the user cannot accept this eco-route.
[0015] As an example, when switching from a GV to an EV, it is assumed that a user who wants to drive the commuting route even with an EV is proposed to switch to an EV on the basis that there is no problem commuting even when switching to an EV using an eco-route in a completely different mode from the commuting route. In this way, if the presented eco-route is completely different from the usual driving route, it is difficult to determine whether the effect of suppressing fuel consumption (energy consumption) is due to switching to an EV or due to using the eco-route, and the user's acceptance of the eco-route will decrease.
[0016] In the present disclosure, a new technology for solving the above problems is proposed. Specifically, in the present disclosure, a route with less energy consumption is searched while maintaining the identity with the user's driving route (for example, the driving route the user usually uses). As a result, an eco-route that is easy for the user to accept can be proposed.
[0017] 〔2. System Configuration〕 First, the configuration of the system according to the embodiment will be described using FIG. 1. FIG. 1 is a diagram showing an example of the system according to the embodiment. In FIG. 1, as an example of the system according to the embodiment, system 1 is shown. The information processing according to the embodiment of the present disclosure (hereinafter abbreviated as "information processing according to the embodiment") may be realized in system 1.
[0018] As shown in FIG. 1, the system 1 may include a server device 100 and an in-vehicle device 200. Also, the server device 100 and the in-vehicle device 200 may be communicably connected by wire or wirelessly via a network N. Further, the system 1 may include any number of server devices 100 and any number of in-vehicle devices 200.
[0019] [3. Outline of each device included in the system] (Regarding the server device 100) The server device 100 is an example of an information processing device according to an embodiment and is a central device responsible for the information processing according to the embodiment. Specifically, the server device 100 acquires the history of the travel route that the GV (an example of the first moving body) has traveled from the departure place to the destination, and outputs, as a proposed route when traveling by the EV (an example of the second moving body), the route searched from the candidate routes from the departure place to the destination indicated by the travel history. More specifically, the server device 100 performs route search on the candidate routes under the search condition that the route has a higher identity with the travel route by the GV and consumes less energy than when traveling this travel route by the EV. Then, the server device 100 outputs the searched route as a proposed route when traveling by the EV.
[0020] (Regarding the in-vehicle device 200) The in-vehicle device 200 may be a dedicated navigation device built in or mounted on the vehicle VEx. For example, the in-vehicle device 200 may be composed of a navigation device and a recording device (drive recorder). As an example of this, the in-vehicle device 200 may be a composite device in which a navigation device and a recording device independent of each other are communicably connected. As another example, the in-vehicle device 200 may be one device having a navigation function and a recording function.
[0021] Furthermore, the in-vehicle device 200 may be equipped with various sensors. For example, the in-vehicle device 200 may be equipped with various sensors such as a camera, an accelerometer, a gyroscope, a GPS (Global Positioning System) sensor, and a barometric pressure sensor. In this way, the in-vehicle device 200 may also have a function to provide dialogue and information to support driving based on sensor information acquired by the various sensors.
[0022] Furthermore, the in-vehicle device 200 can use not only sensors provided within its own device, but also sensor information detected by sensors provided in the vehicle VE itself as part of the safe driving system.
[0023] Furthermore, users can operate their everyday portable devices (e.g., smartphones, tablet devices, notebook PCs, PDAs, etc.) in the same way as the in-vehicle device 200 by installing specified application software on these devices.
[0024] Furthermore, the vehicle VEx equipped with the on-board device 200 is assumed to be a GV currently in use by a user (for example, a user considering switching to an EV). The driving type and brand name of the vehicle VEx are not limited.
[0025] [4. Functional Configuration] From here, we will describe an example configuration of the server device 100 and the in-vehicle device 200 using Figure 2. Figure 2 is a diagram showing an example configuration of the server device 100 and the in-vehicle device 200 according to the embodiment.
[0026] (Server device 100) First, let's describe an example of the configuration of the server device 100. As shown in Figure 2, the server device 100 has a communication unit 110, a storage unit 120, and a control unit 130.
[0027] (Communications Department 110) The communication unit 110 is implemented, for example, by a NIC (Network Interface Card). The communication unit 110 is connected to the network N by wire or wireless connection and performs, for example, sending and receiving information with the in-vehicle device 200.
[0028] (Storage unit 120) The storage unit 120 is implemented by, for example, a semiconductor memory element such as RAM (Random Access Memory) or flash memory, or a storage device such as a hard disk or optical disc. The storage unit 120 may store, for example, data or programs related to information processing according to the embodiment. Also, according to the example in Figure 4, the storage unit 120 may have a map information storage unit 121 and a history information storage unit 122.
[0029] (Map information storage unit 121) The map information storage unit 121 stores, for example, map data for the entire country. This map data includes road data, which represents the road network using a combination of links and nodes.
[0030] A link refers to a section of road between feature points. A node is a feature point on a road, such as an intersection, a corner, or a dead end. In other words, a link refers to a section of road defined according to a predetermined rule. To put it another way, a link refers to a unit that divides the recorded section of travel history according to a predetermined rule. In map data, links may be identified by a link ID.
[0031] Furthermore, the map data may also include facility data and object information around roads. Object information includes road signs and other signs, road markings such as stop lines, road lane markings such as center lines, roadside structures, and other geographical features, as well as information on temporarily existing obstacles. Obstacles refer to things that hinder the passage of pedestrians and cyclists, such as puddles, potholes in the road, fallen objects, and drainage ditches (including parts blocked by nets). Object information may also include high-precision point cloud information of objects used for self-position estimation, etc.
[0032] (History information storage unit 122) The history information storage unit 122 stores information about the travel history of the user's GV (an example of a first mobile vehicle). The history information storage unit 122 stores travel history information separately for each user's GV.
[0033] (Regarding the control unit 130) The control unit 130 is implemented by a CPU (Central Processing Unit) or MPU (Micro Processing Unit), etc., which executes various programs (for example, information processing programs according to the embodiment) stored in the storage device inside the server device 100 using RAM as the working area. Alternatively, the control unit 130 can be implemented by an integrated circuit such as an ASIC (Application Specific Integrated Circuit) or FPGA (Field Programmable Gate Array).
[0034] As shown in Figure 2, the control unit 130 includes an acquisition unit 131, a calculation unit 132, a search unit 133, and an output control unit 134, and realizes or executes the information processing functions and operations described below. Note that the internal configuration of the control unit 130 is not limited to the configuration shown in Figure 2, and other configurations are also possible as long as they perform the information processing described later. Also, the connection relationships of the various processing units in the control unit 130 are not limited to the connection relationships shown in Figure 2, and other connection relationships are also possible.
[0035] (Acquisition part 131) The acquisition unit 131 acquires information about the driving history of a vehicle VEx, which is an example of a GV (Ground Vehicle). For example, the acquisition unit 131 may acquire driving history information from an on-board device 200 of the vehicle VEx and store the acquired driving history information in the history information storage unit 122.
[0036] Furthermore, when the information processing according to the embodiment is performed, the acquisition unit 131 may acquire driving route information obtained by statistically analyzing the driving history information stored in the history information storage unit 122. The driving route information referred to here is, for example, information indicating the driving routes that the user uses on a daily basis, and may include commuting routes, driving routes within the living area, etc.
[0037] Furthermore, the driving history may be self-reported by the user at a setting where a switch to an EV is suggested (for example, at an EV dealership).
[0038] (Calculation unit 132) The calculation unit 132 calculates the estimated energy consumption (amount of electricity stored in the battery) that would occur if the user traveled the same route in the vehicle VEx (the route shown in the travel history acquired by the acquisition unit 131) using an EV (an example of a second mobile device). For example, the calculation unit 132 may calculate the estimated energy consumption that would occur if the user traveled the route in an EV based on the results of a statistical analysis of actual energy consumption values obtained for each link included in the travel route (for example, the average value of energy consumption).
[0039] Furthermore, when energy consumption is estimated using this method, for example, actual energy consumption values may be pre-associated for each link in the map data stored in the map information storage unit 121.
[0040] (Search part 133) The search unit 133 searches for candidate routes from the starting point to the destination based on the starting point and destination included in the route traveled by the user in the vehicle VEx. For example, the search unit 133 refers to the map data stored in the map information storage unit 121 and searches for the optimal route among the routes connecting the starting point and destination indicated by the travel route, according to the pre-set route search conditions, as a candidate route. For example, the search unit 133 may search for multiple routes that match the route search conditions as candidate routes. For example, the search unit 133 can use a route calculation method such as Dijkstra's algorithm for the search.
[0041] (Output control unit 134) The output control unit 134 searches for a proposed route for driving an EV from among the candidate routes obtained by the search unit 133, and controls the system so that this proposed route is output to the user. For example, the output control unit 134 searches for a proposed route from among the candidate routes based on the conditions that it has a higher degree of identity with the actual driving route and consumes less energy than driving the actual driving route in an EV.
[0042] For example, the output control unit 134 calculates the travel cost when traveling by EV from the starting point to the destination included in the candidate route, using at least the estimated energy consumption incurred during the journey, and searches for a proposed route from among the candidate routes based on the calculated travel cost. Specifically, the output control unit 134 calculates the travel cost for each link that makes up the candidate route, and searches for a proposed route from among the candidate routes based on the total cost obtained by adding up the travel costs for each link.
[0043] More specifically, the output control unit 134 calculates an "identity evaluation value SMx" to evaluate the identity of the candidate route to the travel route, based on a link identity index value (an example of a first index value) that indicates the identity between the links constituting the travel route and the links constituting the candidate route, and a route identity index value (an example of a second index value) that indicates the identity between the characteristics of the travel route and the characteristics of the candidate route. Then, the output control unit 134 searches for a proposed route from among the candidate routes based on the calculated evaluation value and the total cost corresponding to the candidate route.
[0044] For example, the output control unit 134 calculates a "link identity index value v1" based on the proportion of overlapping links among the links that make up the travel route that overlap with the links that make up the candidate route.
[0045] Furthermore, for example, the output control unit 134 calculates a route identity index value based on the degree of difference between the travel route feature information, which indicates the characteristics of the travel route, and the candidate route feature information, which indicates the characteristics of the candidate route. Here, the travel route feature information may be the number of right and left turns included in the travel route, and the candidate route feature information may be the number of right and left turns included in the candidate route. As another example, the travel route feature information may be the distance of the travel route, and the candidate route feature information may be the distance of the candidate route. In the following embodiment, the route identity index value calculated using the number of right and left turns will be denoted as "route identity index value v2". On the other hand, the route identity index value calculated using distance will be denoted as "route identity index value v3".
[0046] The output control unit 134 then searches among the candidate routes for a route in which the evaluation value calculated based on the link identity index value and the route identity index value is equal to or greater than a predetermined threshold, and the total cost corresponding to the candidate route satisfies predetermined conditions, and outputs the searched route as the proposed route. The predetermined conditions here refer to the total cost corresponding to the candidate route being lower than the cost calculated using at least the estimated energy consumption spent on the journey when the route is traveled by an EV.
[0047] Furthermore, the output control unit 134 may control the output so that the proposed route is displayed on a predetermined terminal device. For example, when a user is driving the VEx vehicle, the output control unit 134 may control the in-vehicle device 200 so that the proposed route is displayed as an eco-route. As another example, when a suggestion to switch to an EV is made, the output control unit 134 may control the terminal device used by the salesperson so that the proposed route is displayed as an eco-route.
[0048] Furthermore, the output control unit 134 may generate a comparison screen that compares the route traveled by the user in the vehicle VEx (for example, the route the user normally uses) with the proposed route as an eco-route, and may control the output so that the generated comparison screen is displayed on the predetermined terminal device.
[0049] (In-vehicle device 200) Next, we will explain an example of the configuration of the in-vehicle device 200 using Figure 2. As shown in Figure 2, the in-vehicle device 200 includes a microphone MC, a speaker SP, a sensor SC, a communication unit 210, a storage unit 220, and a control unit 230.
[0050] (Mike MC) The microphone (MC) is a sound collection device that collects sounds generated inside the vehicle VEx. For example, the microphone (MC) collects speech sounds made by the driver D.
[0051] The speaker SP corresponds to an output device that outputs various information via sound. For example, the speaker SP can output various information in accordance with the output control by the control unit 230. For example, the speaker SP can output guidance content related to navigation and warnings, recommendation content that suggests spots (e.g., tourist destinations, shops, etc.) and various events that are considered beneficial to the user, or other content such as various news and everyday conversations.
[0052] (Storage unit 220) The storage unit 220 is implemented by, for example, a semiconductor memory element such as RAM or flash memory, or a storage device such as a hard disk or optical disc. The storage unit 220 may store, for example, data or programs related to information processing according to the embodiment. Also, according to the example in Figure 2, the storage unit 220 may have a user information storage unit 221 and a content storage unit 222.
[0053] (User information storage unit 221) The user information storage unit 221 stores various information about the user related to the vehicle VEx. The user information storage unit 221 may also store attribute information of the user related to the vehicle VEx, and may further store the driving history of the vehicle VEx.
[0054] (Content storage unit 222) The content storage unit 222 stores the content to be output. The content to be output may be provided by an application (not shown) installed in the in-vehicle device 200.
[0055] (Regarding the control unit 230) The control unit 230 is implemented by a CPU, MPU, etc., which executes various programs (for example, information processing programs according to this embodiment) stored in the memory device inside the in-vehicle device 200 using RAM as a working area. Alternatively, the control unit 230 can be implemented by an integrated circuit such as an ASIC or FPGA.
[0056] As shown in Figure 2, the control unit 230 has a receiving unit 231 and an output unit 232, and realizes or executes the information processing functions and operations described below. Note that the internal configuration of the control unit 230 is not limited to the configuration shown in Figure 2, and other configurations are also possible as long as they perform the information processing described later. Also, the connection relationships of the various processing units in the control unit 230 are not limited to the connection relationships shown in Figure 2, and other connection relationships are also possible.
[0057] (Reception Desk 231) The reception unit 231 receives control information from the output control unit 134 of the server device 100. For example, the reception unit 231 may receive control information instructing it to output information about the proposed route.
[0058] (Output section 232) The output unit 232 controls the speaker SP and display screen (not shown) of the in-vehicle device 200 so that predetermined information is output. For example, the output unit 232 controls the speaker SP so that content provided by an application installed in the in-vehicle device 200 is output as audio. The output unit 232 also controls the display screen so that information on the proposed route is displayed.
[0059] [5. Processing Procedure] Next, the information processing procedure according to the embodiment will be described. Figure 3 is a flowchart of the information processing according to the embodiment. Figure 3 illustrates the information processing procedure in a scenario where user U1, who owns vehicle VE1 (an example of vehicle VEx), receives a proposal to switch to a predetermined EV.
[0060] First, the acquisition unit 131 acquires the driving history of user U1 driving vehicle VE1 (GV) (step S301). Here, it is assumed that the acquisition unit 131 has acquired information indicating the driving route R1 connecting the departure point S and the destination G as driving history information resulting from user U1 driving from the departure point S to the destination G. The driving route R1 may be, for example, user U1's commute route, and the acquisition unit 131 may determine that the driving route R1 is a commute route by analyzing the driving history. Alternatively, if user U1 has self-reported the driving route R1 as a commute route, the acquisition unit 131 may acquire information indicating the driving route R1.
[0061] Next, the search unit 133 extracts candidate routes from the departure point S to the destination G based on the departure point S and destination G (step S302). For example, the search unit 133 may refer to the map data stored in the map information storage unit 121 and extract multiple routes that connect the departure point S and destination G that match the route search conditions as candidate routes.
[0062] The search unit 133 may also extract the travel route R1 itself as one of the candidate routes, or, for example, if there are no candidate routes that match the route search conditions, it may extract the travel route R1 as a candidate route. Here, the search unit 133 extracts routes R11, R12, and R13 as candidate routes. In the following, the travel route R1 will be referred to as "original route R1," and routes R11, R12, and R13 will be referred to as "candidate route R11," "candidate route R12," and "candidate route R13," respectively.
[0063] Next, the calculation unit 132 calculates the travel cost, which is the cost of travel, for each of the original route R1, candidate route R11, candidate route R12, and candidate route R13 (step S303).
[0064] Specifically, the calculation unit 132 calculates the travel cost for each link that makes up the original route R1. The calculation unit 132 also calculates the travel cost for each link that makes up the candidate route R11. Similarly, the calculation unit 132 calculates the travel cost for each link for candidate routes R12 and R13. For example, the calculation unit 132 may calculate the travel cost as the estimated energy consumption (amount of electricity consumed that is stored in the battery) when user U1 travels the links in an EV.
[0065] As another example, the calculation unit 132 may calculate the cost of moving the link using not only energy consumption but also at least one of the time required to travel the link or the distance of the link. For example, if the calculation unit 132 uses both the time required and the distance of the link, it can calculate the cost of movement as the product of energy consumption, time required, and distance of the link. Also, based on the fact that energy consumption generally increases with longer time required and longer distance of the link, the calculation unit 132 may calculate weighting coefficients according to the time required and distance of the link, and calculate the cost of movement as a value corrected for energy consumption using these weighting coefficients.
[0066] Next, the calculation unit 132 calculates the total travel cost Cx by adding up the travel costs for each of the original route R1, candidate route R11, candidate route R12, and candidate route R13 (step S304). Specifically, the calculation unit 132 calculates the total travel cost C1 by adding up the travel costs calculated for each link constituting the original route R1. The calculation unit 132 also calculates the total travel cost C11 by adding up the travel costs calculated for each link constituting the candidate route R11. The calculation unit 132 also calculates the total travel cost C12 by adding up the travel costs calculated for each link constituting the candidate route R12. The calculation unit 132 also calculates the total travel cost C13 by adding up the travel costs calculated for each link constituting the candidate route R13.
[0067] Next, the calculation unit 132 calculates the route distance for each of the original route R1, candidate route R11, candidate route R12, and candidate route R13 (step S305). Specifically, the calculation unit 132 calculates the route distance D1 by adding up the link distances of each link that make up the original route R1. The calculation unit 132 also calculates the route distance D11 by adding up the link distances of each link that make up the candidate route R11. The calculation unit 132 also calculates the route distance D12 by adding up the link distances of each link that make up the candidate route R12. The calculation unit 132 also calculates the route distance D13 by adding up the link distances of each link that make up the candidate route R13.
[0068] The output control unit 134 performs an evaluation value calculation process to calculate an identity evaluation value SMx, which evaluates the identity of candidate routes with respect to the travel route (step S306). In the example in Figure 3, the output control unit 134 calculates an identity evaluation value SM11, which evaluates the identity of candidate route R11 with respect to the original route R1, through the evaluation value calculation process. The output control unit 134 also calculates an identity evaluation value SM12, which evaluates the identity of candidate route R12 with respect to the original route R1, through the evaluation value calculation process. The output control unit 134 also calculates an identity evaluation value SM13, which evaluates the identity of candidate route R13 with respect to the original route R1, through the evaluation value calculation process.
[0069] Here, we will show a specific example of the evaluation value calculation process using Figure 4. Figure 4 is a diagram showing an example of the evaluation value calculation process according to the embodiment.
[0070] In the example shown in Figure 4(a), the original route R1 consists of links connecting node "S" (origin S), node "1" (intermediate), node "2" (intermediate), node "3" (intermediate), node "4" (intermediate), and node "G" (destination G).
[0071] In the example shown in Figure 4(a), the calculation unit 132 calculates the travel cost of link L_S1 between node "S" and node "1" as "5", the travel cost of link L_12 between node "1" and node "2" as "3", the travel cost of link L_23 between node "2" and node "3" as "3", the travel cost of link L_34 between node "3" and node "4" as "4", and the travel cost of link L_4G between node "4" and node "G" as "4". As a result, the calculation unit 132 calculates the total travel cost C1 as "19". The calculation unit 132 also calculates the path distance D1 of the original path R1 as "19".
[0072] Let's explain Figure 4(b). Figure 4(b) shows candidate route R11. In the example in Figure 4(b), the calculation unit 132 calculates the travel cost of link L_S1 between node "S" and node "1" as "5", the travel cost of link L_12 between node "1" and node "2" as "3", the travel cost of link L_23 between node "2" and node "3" as "3", the travel cost of link L_38 between node "3" and node "8" as "4", and the travel cost of link L_8G between node "8" and node "G" as "5". As a result, the calculation unit 132 calculates the total travel cost C11 as "20". The calculation unit 132 also calculates the route distance D11 of candidate route R11 as "20".
[0073] Let's explain Figure 4(c). Figure 4(c) shows the candidate route R12. In the example in Figure 4(c), the calculation unit 132 calculates the travel cost of link L_S5 between node "S" and node "5" as "2", the travel cost of link L_51 between node "5" and node "1" as "1", the travel cost of link L_12 between node "1" and node "2" as "3", the travel cost of link L_23 between node "2" and node "3" as "3", the travel cost of link L_34 between node "3" and node "4" as "4", and the travel cost of link L_4G between node "4" and node "G" as "4". As a result, the calculation unit 132 calculates the total travel cost C12 as "17". The calculation unit 132 also calculates the route distance D12 of the candidate route R12 as "17".
[0074] Let's explain Figure 4(d). Figure 4(d) shows candidate path R13. In the example in Figure 4(d), the calculation unit 132 calculates the travel cost of link L_S1 between node "S" and node "1" as "5", the travel cost of link L_12 between node "1" and node "2" as "3", the travel cost of link L_23 between node "2" and node "3" as "3", the travel cost of link L_36 between node "3" and node "6" as "1", the travel cost of link L_67 between node "6" and node "7" as "1", the travel cost of link L_78 between node "7" and node "8" as "1", the travel cost of link L_89 between node "8" and node "9" as "1", and the travel cost of link L_9G between node "9" and node "G" as "1". As a result, the calculation unit 132 calculates "16" as the total travel cost C13. The calculation unit 132 also calculates "16" as the route distance D13 of the candidate route R13.
[0075] In this state, the output control unit 134 calculates the link identity index value and the route identity index value according to the evaluation value calculation method shown in Figure 4, and calculates the identity evaluation value SMx from the calculation results. The evaluation value calculation method will be explained below using the examples in Figures 4(b), 4(c), and 4(d).
[0076] First, let's explain Figure 4(b). The output control unit 134 calculates the identity evaluation value SM11, which evaluates the identity of candidate route R11 with respect to the original route R1, by calculating the link identity index value v1, route identity index value v2, and route identity index value v3.
[0077] Specifically, the output control unit 134 calculates the number of overlapping links among the links constituting the original route R1 that overlap with the links constituting the candidate route R11, and calculates the ratio of the number of overlapping links to the number of links included in the candidate route R11 as the link identity index value v1. In the example shown in Figure 4(b), the output control unit 134 obtains a link identity index value v1 of "0.60" by dividing the number of overlapping links "3" by the number of links included in the candidate route R11 "5".
[0078] Furthermore, the output control unit 134 calculates a route identity index value v2 based on the degree of difference between the number of right and left turns of the original route R1 and the number of right and left turns of the candidate route R11. Specifically, the output control unit 134 calculates the route identity index value v2 from the formula "1-(abs(number of right and left turns of the original route - number of right and left turns of the candidate route) / number of right and left turns of the candidate route)". In the example in Figure 4(b), the number of right and left turns of the original route R1 is "2", and the number of right and left turns of the candidate route R11 is "1". Therefore, the output control unit 134 obtains "0" as the route identity index value v2 by calculating "1-(abs(2-1) / 1)".
[0079] Furthermore, the output control unit 134 calculates a route identity index value v3 based on the degree of difference between the route distance D1 of the original route R1 and the route distance D11 of the candidate route R11. Specifically, the output control unit 134 calculates the route identity index value v3 from the formula "1-(abs(route distance of original route - route distance of candidate route) / route distance of candidate route)". In the example in Figure 4(b), the route distance D1 of the original route R1 is "19", and the route distance D11 of the candidate route R11 is "20". Therefore, the output control unit 134 obtains a route identity index value v3 of "0.95" by calculating "1-(abs(19-20) / 20)".
[0080] The output control unit 134 then calculates the identity evaluation value SM11 using the formula "(link identity index value v1 + route identity index value v2 + route identity index value v3) / 3", which is the average of the link identity index value v1, the route identity index value v2, and the route identity index value v3. In the example shown in Figure 4(b), the output control unit 134 obtains the identity evaluation value SM11 "0.52" by calculating "(0.6 + 0 + 0.95) / 3".
[0081] Next, Figure 4(c) will be explained. The output control unit 134 calculates the identity evaluation value SM12, which evaluates the identity of the candidate route R12 with respect to the original route R1, by calculating the link identity index value v1, the route identity index value v2, and the route identity index value v3.
[0082] Specifically, the output control unit 134 calculates the number of overlapping links among the links constituting the original route R1 that overlap with the links constituting the candidate route R12, and calculates the ratio of the number of overlapping links to the number of links included in the candidate route R12 as the link identity index value v1. In the example shown in Figure 4(c), the output control unit 134 obtains a link identity index value v1 of "0.67" by dividing the number of overlapping links "4" by the number of links included in the candidate route R12 "6".
[0083] Furthermore, the output control unit 134 calculates a route identity index value v2 based on the degree of difference between the number of right and left turns of the original route R1 and the number of right and left turns of the candidate route R12. Specifically, the output control unit 134 calculates the route identity index value v2 from the formula "1-(abs(number of right and left turns of the original route - number of right and left turns of the candidate route) / number of right and left turns of the candidate route)". In the example in Figure 4(c), the number of right and left turns of the original route R1 is "2", and the number of right and left turns of the candidate route R12 is "4". Therefore, the output control unit 134 obtains a route identity index value v2 of "0.50" by calculating "1-(abs(2-4) / 4)".
[0084] Furthermore, the output control unit 134 calculates a route identity index value v3 based on the degree of difference between the route distance D1 of the original route R1 and the route distance D12 of the candidate route R12. Specifically, the output control unit 134 calculates the route identity index value v3 from the formula "1-(abs(route distance of original route - route distance of candidate route) / route distance of candidate route)". In the example in Figure 4(c), the route distance D1 of the original route R1 is "19", and the route distance D12 of the candidate route R12 is "17". Therefore, the output control unit 134 obtains a route identity index value v3 of "0.88" by calculating "1-(abs(19-17) / 17)".
[0085] The output control unit 134 then calculates the identity evaluation value SM12 using the formula "(link identity index value v1 + route identity index value v2 + route identity index value v3) / 3", which is the average of the link identity index value v1, the route identity index value v2, and the route identity index value v3. In the example shown in Figure 4(c), the output control unit 134 obtains the identity evaluation value SM11 "0.68" by "(0.67 + 0.50 + 0.88) / 3".
[0086] Next, Figure 4(d) will be explained. The output control unit 134 calculates the identity evaluation value SM13, which evaluates the identity of the candidate route R13 with respect to the original route R1, by calculating the link identity index value v1, the route identity index value v2, and the route identity index value v3.
[0087] Specifically, the output control unit 134 calculates the number of duplicate links among the links that make up the original route R1 that overlap with the links that make up the candidate route R13, and calculates the ratio of the number of duplicate links to the number of links included in the candidate route R13 as the link identity index value v1. In the example in Figure 4(d), the output control unit 134 obtains a link identity index value v1 of "0.38" by dividing the number of duplicate links "3" by the number of links included in the candidate route R13 "8".
[0088] Furthermore, the output control unit 134 calculates a route identity index value v2 based on the degree of difference between the number of right and left turns of the original route R1 and the number of right and left turns of the candidate route R13. Specifically, the output control unit 134 calculates the route identity index value v2 from the formula "1-(abs(number of right and left turns of the original route - number of right and left turns of the candidate route) / number of right and left turns of the candidate route)". In the example in Figure 4(d), the number of right and left turns of the original route R1 is "2", and the number of right and left turns of the candidate route R13 is "5". Therefore, the output control unit 134 obtains a route identity index value v2 of "0.40" by calculating "1-(abs(2-5) / 5)".
[0089] Furthermore, the output control unit 134 calculates a route identity index value v3 based on the degree of difference between the route distance D1 of the original route R1 and the route distance D13 of the candidate route R13. Specifically, the output control unit 134 calculates the route identity index value v3 from the formula "1-(abs(route distance of original route - route distance of candidate route) / route distance of candidate route)". In the example in Figure 4(d), the route distance D1 of the original route R1 is "19", and the route distance D13 of the candidate route R13 is "16". Therefore, the output control unit 134 obtains a route identity index value v3 of "0.81" by calculating "1-(abs(19-16) / 16)".
[0090] The output control unit 134 then calculates the identity evaluation value SM13 using the formula "(link identity index value v1 + route identity index value v2 + route identity index value v3) / 3", which is the average of the link identity index value v1, the route identity index value v2, and the route identity index value v3. In the example shown in Figure 4(d), the output control unit 134 obtains the identity evaluation value SM11 "0.53" by "(0.38 + 0.40 + 0.81) / 3".
[0091] Returning to the explanation of Figure 3, the output control unit 134 selects as the proposed route from among the candidate routes R11, R12, and R13 that can be traveled with less energy consumption than when the original route R1 was traveled by EV, and that has a higher identity evaluation value SMx (step S306).
[0092] Here, Figure 5 summarizes the total travel cost Cx and identity evaluation value SMx calculated for each of the candidate routes R11, R12, and R13. Figure 5 is a diagram showing a list of calculation results corresponding to the identity evaluation value, and corresponds to the example in Figure 4. According to this example, the output control unit 134 selects from among candidate routes R11, R12, and R13 that satisfies the conditions that "it is possible to travel with less energy consumption than when the original route R1 is traveled by EV, and the identity evaluation value SMx is higher." More specifically, the output control unit 134 selects the route that satisfies the conditions that "a total travel cost Cx is calculated that is less than the total travel cost C1 when the original route R1 is traveled by EV (19 in the example in Figure 4), and the identity evaluation value SMx is greater than or equal to a threshold (e.g., 0.65)." In this case, as shown in Figure 5, the output control unit 134 can select candidate route R12 as a candidate route that satisfies these conditions.
[0093] Finally, the output control unit 134 controls the output so that the candidate route R12 selected as the proposed route is presented to the user U1 (step S307). For example, the output control unit 134 may control the output so that the candidate route R12 is displayed as an eco-route in a setting where an EV switch proposal is made (for example, a terminal device used by a salesperson).
[0094] For example, the output control unit 134 may generate a comparison screen CM comparing the original route R1 and the candidate route R12 proposed as an eco-route, and then control the output so that the generated comparison screen CM is displayed on the terminal device.
[0095] Figure 6 shows an example of a comparison screen CM that compares the travel route with the proposed route. The comparison screen CM may include areas AR11, AR12, and AR13, as shown in Figure 6. Area AR11 may also display information from before switching to EV. Information from before switching to EV refers to information from when the original route R1 was traveled with vehicle VE1, and may include CO2 emissions when traveling the original route R1 with vehicle VE1, the distance of the original route R1, the time required to travel the original route R1, and the cost of traveling the original route R1.
[0096] On the other hand, area AR12 may display information after switching to an EV. This information includes information about driving the candidate route R12 in an EV, and may include CO2 emissions when driving the candidate route R12 in an EV, the distance of the candidate route R12, the time required to drive the candidate route R12, and the tolls incurred when driving the candidate route R12.
[0097] Furthermore, in region AR13, the original route R1 and the proposed candidate route R12 may be displayed overlaid on each other so that the differences between the original route R1 and the candidate route R12 proposed as an ecoroute can be compared.
[0098] As a result, user U1 will be able to understand that they can reach their destination without any problems even if they drive on their usual route, or a route that is almost identical to their usual route, using an EV. Therefore, according to the information processing of this embodiment, it is possible to propose an eco-route that is easily acceptable to user U1.
[0099] [6. Variant Example] The following describes variations of the information processing according to the embodiments of this disclosure. For example, the server device 100 may be implemented in various forms other than those described above.
[0100] [6-1. Variation (1)] In the above embodiment, the output control unit 134 calculates an identity evaluation value for each candidate route based on the link identity index value and the route identity index value, and outputs candidate routes that satisfy the conditions based on the combination of the calculated identity evaluation value and the cost of travel as proposed routes. However, in searching for candidate routes with higher identity to the user's travel route, the output control unit 134 may narrow down the optimal candidate route by pruning candidate routes that do not reach the threshold, with a threshold value for the link identity index value v1 set in advance for each depth of the search. This point will be explained with reference to Figure 7. Figure 7 is a diagram showing a modified example of the information processing according to the embodiment.
[0101] Figure 7(a) shows the original route R2 (dotted line), which consists of links connecting node "S" (origin S), node "1" (intermediate), node "2" (intermediate), node "3" (intermediate), and node "G" (destination G). Also in Figure 7(a), the network graph NG (solid line) is shown, which consists of links obtained using node "S", node "1", node "2", node "3", node "4", node "5", node "6", and node "G".
[0102] Furthermore, the depth referred to here is the number of links traversed on the network graph NG, starting from node "S". For example, "Depth 1" shown in Figure 7(b) is an example where the number of links traversed is "2" and the threshold condition for the link identity index value v1 is set to "0 or greater". "Depth 2" shown in Figure 7(b) is an example where the number of links traversed is "3" and the threshold condition for the link identity index value v1 is set to "0.25 or greater". "Depth 3" shown in Figure 7(b) is an example where the number of links traversed is "4" and the threshold condition for the link identity index value v1 is set to "0.50 or greater".
[0103] Furthermore, in Figure 7(a), the numerical values associated with each link represent the travel cost. For example, the calculation unit 132 calculates "10" as the travel cost of link L_S1 between node "S" and node "1", "3" as the travel cost of link L_12 between node "1" and node "2", "3" as the travel cost of link L_23 between node "2" and node "3", and "3" as the travel cost of link L_3G between node "3" and node "G". The other links are as shown in the figure, so their explanation is omitted.
[0104] In this state, the output control unit 134 performs a process to expand the candidate paths to a depth of 1. Expanding to a depth of 1 means traversing 2 links from node "S". As a result of expanding to a depth of 1, the output control unit 134 can extract candidate paths "S-1-2", "S-1-5", and "S-1-5", as shown in Figure 7(b).
[0105] Furthermore, as shown in Figure 7(a), the output control unit 134 can calculate a total travel cost Cx of "13" and a link identity index value v1 of "1" for candidate route "S-1-2". In this example, since the link identity index value v1 is greater than or equal to the threshold "0", the output control unit 134 can determine that the threshold condition is met. The candidate routes "S-1-5" and "S-4-5" are shown in Figure 7(b), so their explanation is omitted.
[0106] Here, the output control unit 134 performs a process to expand candidate paths that satisfy the threshold condition, namely candidate path "S-1-2", candidate path "S-1-5", and candidate path "S-1-5" to a depth of "2". Expanding to a depth of "2" means traversing three links from node "S". As a result of expanding to a depth of "2", the output control unit 134 can extract candidate paths "S-1-2-3", candidate path "S-1-2-5", candidate path "S-1-5-2", candidate path "S-1-5-4", candidate path "S-1-5-6", candidate path "S-4-5-1", candidate path "S-4-5-2", and candidate path "S-4-5-6", as shown in Figure 7(b).
[0107] Furthermore, as shown in Figure 7(a), the output control unit 134 can calculate a total travel cost Cx of "16" and a link identity index value v1 of "1" for candidate route "S-1-2-3". In this example, the output control unit 134 can determine that the threshold condition is met because the link identity index value v1 is greater than or equal to the threshold of "0.25". The candidate routes "S-1-2-5", "S-1-5-2", "S-1-5-4", "S-1-5-6", "S-4-5-1", "S-4-5-2", and "S-4-5-6" are shown in Figure 7(b), so their explanation is omitted.
[0108] Next, the output control unit 134 performs a process to expand the candidate paths up to "depth 3" for candidate paths that satisfy the threshold condition, namely candidate paths "S-1-2-3", "S-1-2-5", "S-1-5-2", "S-1-5-4", and "S-1-5-6". Other candidate paths that do not satisfy the threshold condition are removed at this point and no further processing is performed.
[0109] Expanding to "depth 2" means traversing 3 links from node "S". Therefore, by expanding to "depth 3", the output control unit 134 can extract candidate paths "S-1-2-3-G", "S-1-2-3-6", "S-1-2-5-6", "S-1-2-5-4", "S-1-5-2-1", "S-1-5-2-3", "S-1-5-6-3", and "S-1-5-6-G", as shown in Figure 7(b).
[0110] Furthermore, as shown in Figure 7(a), the output control unit 134 can calculate a total travel cost Cx of "19" and a link identity index value v1 of "1" for candidate route "S-1-2-3-G". In this example, the output control unit 134 can determine that the threshold condition is met because the link identity index value v1 is greater than or equal to the threshold of "0.50". The candidate routes "S-1-2-3-6", "S-1-2-5-6", "S-1-2-5-4", "S-1-5-2-1", "S-1-5-2-3", "S-1-5-6-3", and "S-1-5-6-G" are shown in Figure 7(b), so their explanation is omitted.
[0111] The output control unit 134 may extract only candidate paths "S-1-2-3-G" and candidate path "S-1-5-6-G" that have nodes "S" and "G", and then perform threshold condition determination.
[0112] In the example in Figure 7(b), candidate routes "S-1-2-3-G", "S-1-2-5-6", "S-1-2-5-4", and "S-1-5-2-1" all satisfy the threshold condition. However, candidate routes "S-1-2-5-6", "S-1-2-5-4", and "S-1-5-2-1" do not have the destination node "G". Therefore, the output control unit 134 selects candidate route "S-1-2-3-G", which has both node "S" and node "G", as the proposed route.
[0113] Finally, the output control unit 134 controls the output so that the candidate route "S-1-2-3-G" selected as the proposed route is presented to the user U1.
[0114] [6-2. Variation (2)] In the above embodiment, the search unit 133 extracts multiple routes that match the route search conditions from among the routes connecting the departure point S and the destination G, and performs a route search on the candidate routes. However, the server device 100 may accept the setting of stopover points from the user U1. If the user U1 sets stopover points, the search unit 133 may extract candidate routes that pass through the stopover points and perform a route search on the candidate routes that include the stopover points.
[0115] Furthermore, suppose user U1, who is considering switching from a GV to an EV, sets a specific gas station as a stopover point. In this case, the search unit 133 may search for charging spots in the vicinity of the specific location (for example, an area with a radius of 500m). If the search unit 133 finds a charging spot near the specific location, it may extract candidate routes that pass through the location of this charging spot.
[0116] [6-3. Variant Example (3)] In the above embodiment, the proposed switching from a GV to an EV was presented as an application scenario of this disclosure. However, this disclosure is also applicable to proposals for switching to HEVs (hybrid electric vehicles), PHEVs (plug-in hybrid electric vehicles), FCEVs (fuel cell electric vehicles), etc.
[0117] [6-4. Variation (4)] In the above embodiment, the processing described as being performed by the server device 100 may be performed by the in-vehicle device 200. Specifically, the series of processing described as information processing according to the embodiment of this disclosure may be performed by the in-vehicle device 200.
[0118] [7. Hardware Configuration] The server device 100 (an example of an information processing device) described above may be implemented by a computer 1000 having a configuration as shown in Figure 8. Figure 8 is a hardware configuration diagram showing an example of a computer that implements the functions of the server device 100. The computer 1000 has a CPU 1100, RAM 1200, ROM 1300, HDD 1400, communication interface (I / F) 1500, input / output interface (I / F) 1600, and media interface (I / F) 1700.
[0119] The CPU 1100 operates based on programs stored in the ROM 1300 or HDD 1400, controlling various components. The ROM 1300 stores boot programs executed by the CPU 1100 when the computer 1000 starts up, as well as programs that depend on the computer 1000's hardware.
[0120] The HDD1400 stores programs executed by the CPU1100, as well as data used by such programs. The communication interface1500 receives data from other devices via a predetermined communication network and sends it to the CPU1100, and transmits data generated by the CPU1100 to other devices via the predetermined communication network.
[0121] The CPU 1100 controls output devices such as displays and input devices such as keyboards via the input / output interface 1600. The CPU 1100 acquires data from input devices via the input / output interface 1600. The CPU 1100 also outputs the generated data to output devices via the input / output interface 1600.
[0122] The media interface 1700 reads a program or data stored in the recording medium 1800 and provides it to the CPU 1100 via the RAM 1200. The CPU 1100 loads the program from the recording medium 1800 onto the RAM 1200 via the media interface 1700 and executes the loaded program. The recording medium 1800 is, for example, an optical recording medium such as a DVD (Digital Versatile Disc) or PD (Phase Change Rewritable Disk), a magneto-optical recording medium such as an MO (Magneto-Optical disk), a tape medium, a magnetic recording medium, or a semiconductor memory.
[0123] For example, when the computer 1000 functions as a server device 100 according to the embodiment, the CPU 1100 of the computer 1000 realizes the functions of the control unit 130 by executing programs loaded on the RAM 1200. The CPU 1100 of the computer 1000 reads and executes these programs from the recording medium 1800, but as another example, these programs may be obtained from other devices via a predetermined communication network.
[0124] [8. Other] Furthermore, among the processes described in each of the above embodiments, all or part of the processes described as being performed automatically can be performed manually, or all or part of the processes described as being performed manually can be performed automatically by known methods. In addition, the processing procedures, specific names, and information including various data and parameters shown in the above document and drawings can be changed at will unless otherwise specified. For example, the various information shown in each figure is not limited to the information shown.
[0125] Furthermore, the components of each illustrated device are functionally conceptual and do not necessarily need to be physically configured as shown. In other words, the specific forms of distribution and integration of each device are not limited to those shown, and all or part of them can be functionally or physically distributed and integrated in any unit according to various loads and usage conditions. For example, some or all of the processing described as being performed by the server device 100 may be configured to be performed on the in-vehicle device 200 side.
[0126] Furthermore, the above embodiments can be combined as appropriate, provided that the processing content is not contradictory.
[0127] Although some embodiments of the present invention have been described in detail above with reference to the drawings, these are illustrative examples, and the present invention can be implemented in various other forms with modifications and improvements based on the knowledge of those skilled in the art, including the embodiments described in the section on the present invention. [Explanation of symbols]
[0128] 1 System 100 Server Devices 120 Storage section 121 Map Information Storage Unit 122 History Information Storage Unit 130 Control Unit 131 Acquisition Department 132 Calculation Section 133 Search Department 134 Output Control Unit 200 On-vehicle equipment 230 Control Unit 231 Reception Department 232 Output section
Claims
1. An acquisition unit that acquires the history of the travel route taken by a user in a first mobile vehicle from a starting point to a destination, An output control unit that outputs a route found from among candidate routes from the departure point to the destination as a proposed route for when the user travels on a second mobile body different from the first mobile body. Equipped with, The output control unit outputs a route found among the candidate routes as the proposed route, provided that it has a higher degree of identity with the travel route and consumes less energy than if the user were to travel along the travel route using the second mobile body. An information processing device characterized by the following:
2. The output control unit calculates the cost of traveling from the starting point to the destination included in the candidate route using the second mobile unit, using at least the estimated energy consumption for such travel, and searches for the proposed route from among the candidate routes based on the calculated cost. The information processing apparatus according to feature 1.
3. The output control unit calculates the cost for each link constituting the candidate path, and based on the total cost obtained by adding up the calculated costs for each link, it searches for a path from the candidate path to be output to the second mobile unit. The information processing apparatus according to feature 2.
4. The output control unit calculates an evaluation value for evaluating the identity of the candidate path to the travel path based on a first index value indicating the identity between the links constituting the travel path and the links constituting the candidate path, and a second index value indicating the identity between the characteristics of the travel path and the characteristics of the candidate path. Based on the calculated evaluation value and the total cost corresponding to the candidate path, the unit searches for the proposed path from among the candidate paths. The information processing apparatus according to claim 3.
5. The output control unit calculates the first index value based on the proportion of overlapping links among the links constituting the travel path that overlap with the links constituting the candidate path. The information processing apparatus according to feature 4.
6. The output control unit calculates the second index value based on the degree of difference between the travel path feature information, which indicates the characteristics of the travel path, and the candidate path feature information, which indicates the characteristics of the candidate path. The information processing apparatus according to feature 4.
7. The aforementioned travel path characteristic information is the number of right and left turns included in the travel path. The candidate route feature information is the number of right and left turns included in the candidate route. The information processing apparatus according to feature 6.
8. The aforementioned travel path characteristic information is the distance of the aforementioned travel path, The candidate path feature information is the distance of the candidate path. The information processing apparatus according to feature 6.
9. The output control unit searches among the candidate paths for a path in which the evaluation value is equal to or greater than a predetermined threshold and the total cost corresponding to the candidate path satisfies predetermined conditions, and outputs the searched path as the proposed path. The information processing apparatus according to feature 4.
10. The predetermined condition is that the total cost is lower than the cost calculated using at least the estimated energy consumption incurred when traveling along the travel path with the second mobile body. The information processing apparatus according to feature 9.
11. An information processing method performed by an information processing device, A process to acquire the travel history of the route taken by the user from the starting point to the destination using the first mobile device, An output control process that outputs a route searched from among candidate routes from the departure point to the destination as a proposed route for when the user travels using a second mobile body different from the first mobile body. Includes, The output control step outputs a route found among the candidate routes as the proposed route, provided that it has a higher degree of identity with the travel route and consumes less energy than when the user travels along the travel route using the second mobile body. An information processing method characterized by the following:
12. An information processing program executed by an information processing device, A procedure for obtaining the travel history of a user's journey from a starting point to a destination using a first mobile device, An output control procedure that outputs a route searched from among candidate routes from the departure point to the destination as a proposed route for when the user travels using a second mobile body different from the first mobile body. The information processing device is made to execute the above, The output control procedure outputs a route found among the candidate routes as the proposed route, provided that it has a higher degree of identity with the travel route and consumes less energy than if the user were to travel along the travel route using the second mobile body. Information processing program.
Citation Information
Patent Citations
System and equipment for route search
JP2009174855A
Server apparatus, navigation apparatus, route information presentation system and route information presentation method
JP2010197211A
In-vehicle system
JP2010237182A
Navigation device
JP2013044546A
Vehicular information providing device
JP2015148550A