Route search device

JP7634118B2Active Publication Date: 2025-02-20NTT DOCOMO INC
View PDF 7 Cites 0 Cited by

Patent Information

Application Number
JP2023576667
Authority / Receiving Office
JP · JP
Patent Type
Patents
Current Assignee / Owner
Priority Date
2022-01-28
Filing Date
2022-11-30
Publication Date
2025-02-20
Estimated Expiration
2042-11-30

Smart Images

  • Figure 0007634118000001
    Figure 0007634118000001
  • Figure 0007634118000002
    Figure 0007634118000002
  • Figure 0007634118000003
    Figure 0007634118000003
Patent Text Reader

Abstract

The objective of the present invention is to provide a route searching device capable of providing a user with information for route selection. A route searching device 100 comprises a route searching unit 101, a cost calculating unit 102, an evaluation calculating unit 103, and a presenting unit 104. The route searching unit 101 searches for a proposed route for the user, being a driver, to travel along, on the basis of at least a current position and a destination. Furthermore, the cost calculating unit 102 calculates a travel cost for the proposed route. The presenting unit 104 presents the driver with an evaluation based on the travel cost. The travel cost includes a monetary value that would be expended if the driver were to attempt to travel along the proposed route, and includes a travel time, a travel efficiency, and an arrival time at the destination, for example.
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] The present invention relates to a route search device that proposes a travel route. [Background technology]

[0002] Patent Document 1 describes presenting a plurality of route candidates to the user as searched routes. [Prior art documents] [Patent documents]

[0003] [Patent Document 1] JP 2004-170376 A Summary of the Invention [Problem to be solved by the invention]

[0004] In the invention described in Patent Document 1, route candidates are simply presented to the user, and the user cannot know what criteria to use when selecting which route.

[0005] Therefore, in order to solve the above-mentioned problems, an object of the present invention is to provide a route search device that can provide a user with information for route selection when a route has been searched for. [Means for solving the problem]

[0006] The route search device of the present invention includes a route search unit that searches for a proposed route for a user to travel based on a current location and a destination, a cost calculation unit that calculates the travel cost of the proposed route, and an evaluation unit that evaluates the proposed route based on the travel cost. Effect of the Invention

[0007] According to the present invention, by presenting to the user an evaluation based on the travel cost when the user attempts to travel along a proposed route, the user can determine the suitability of the proposed route. [Brief description of the drawings]

[0008] [Figure 1] FIG. 1 illustrates the processing concept of the present disclosure. [Diagram 2] 1 is a block diagram showing a functional configuration of a route search device 100 according to the present disclosure. [Diagram 3] FIG. 13 is a diagram illustrating a process for calculating a loss function and an overall evaluation. [Figure 4] 1 is a table in which various costs and efficiency coefficients calculated by the cost calculation unit 102 are associated with each other, as well as loss values, relative coefficients, and the like. [Diagram 5] 4 is a flowchart showing the operation of the route search device 100. [Figure 6] 1 is a diagram illustrating an example of a hardware configuration of a route search device 100 according to an embodiment of the present disclosure. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0009] The embodiments of the present disclosure will be described with reference to the accompanying drawings. Whenever possible, the same parts are designated by the same reference numerals and redundant description will be omitted.

[0010] FIG. 1 is a diagram showing the processing concept of the present disclosure. The vehicle 200 communicates with the route search device 100 and is provided with route information of the route T1 or the routes T2 and T3 and their overall evaluation. The current location A indicates the location of the vehicle. The driver of the vehicle 200 can choose to go from the current location A to the destination B via the route T1, or to go from the current location A to the detour C via the route T2, and then to the destination B via the route T3. In the present disclosure, it is assumed that the route T1 takes longer than usual due to traffic congestion, etc. In that case, the driver of the vehicle chooses to go to the detour C via the route T2 instead of the route T1. The driver can choose to stay at the detour C for the facility stay time Tc, and then go to the destination B via the route T3.

[0011] The routes T1 to T3, the stay time Tc at the detour C, and the overall evaluation of each route are calculated by the route search device 100 and provided to the driver.

[0012] 2 is a block diagram showing a functional configuration of the route search device 100 according to the present disclosure. As shown in the figure, the route search device 100 includes a route search unit 101, a cost calculation unit 102, an evaluation calculation unit 103, a presentation unit 104, a map DB 105, a traffic DB 106, and a cost DB 107.

[0013] The route search unit 101 is a part that receives a request from the vehicle 200 and calculates one or more routes from the current location of the vehicle 200 to a destination in response to the request. The request from the vehicle 200 includes information on the current location of the vehicle 200 and the destination.

[0014] More specifically, the route search unit 101 refers to the map DB 105 and the traffic DB 106 to calculate one or more routes based on the current location and the destination. When calculating the route, the route search unit 101 searches for a detour based on the current location and the destination of the vehicle 200, and calculates a route that passes through the detour. The search for a detour may be determined based on the driver's hobbies, preferences, personality, and other attributes such as gender and age. The driver may also set the detour. In the description of FIG. 1, the number of detours is one, but there may be multiple detours.

[0015] The cost calculation unit 102 is a part that calculates the cost of each route calculated by the route search unit 101. The cost calculation unit 102 has a function of converting wasted time into a monetary value and creating a quantitative evaluation that also takes into account a relative evaluation with respect to an ideal time.

[0016] The cost calculation unit 102 creates or acquires in advance a loss function that indicates that X minutes of traffic congestion time is worth Y yen to the user. FIG. 3(a) is a diagram showing a specific example of a loss function. As shown in the figure, the horizontal axis is time and the vertical axis is amount of money, and this function outputs an amount of money according to time. This loss function is defined for each user, and is defined by conducting a questionnaire with the users in advance.

[0017] Moreover, the cost calculation unit 102 calculates the loss value and the efficiency coefficient. The route search unit 101 determines the traffic congestion time on various routes, and calculates the loss value from the loss value function based on the traffic congestion time. It is preferable that this loss value is set to increase according to the length of the traffic congestion time. In addition, when the traffic congestion lasts for a certain period of time or longer, the loss value may be further increased. For example, the loss value may be corrected by adding a predetermined value. In this disclosure, a large loss value means that the loss is large for the user.

[0018] In addition, the cost calculation unit 102 calculates the efficiency coefficient by the following formula. The efficiency coefficient is a coefficient that indicates how efficiently the proposed route for today's travel can be traveled compared to travel on a route at a reference time (here, a route without traffic jams). The larger this coefficient is, the worse the travel efficiency for that day is.

[0019] Travel time of the searched route ÷ Travel time of the route without past traffic jams (1) For example, as shown in Figure 3(b), Travel time from current location A to destination B When moving: T1=110 No traffic jam: T1_min=60 Travel time from current location A to detour location C When moving: T2=30 No traffic jam: T2_min=20 Travel time from detour C to destination B When moving: T3=50 No traffic jam: T3_min=50 Let Tx and Tx_min denote the travel time (in minutes) of route x.

[0020] In this case, the cost calculation unit 102 calculates the efficiency coefficient from the current location A to the destination B as T1 during travel / T1_min without traffic jam, for example, to obtain 110 / 60 ≈ 1.83. The efficiency coefficients are calculated similarly for other routes. FIG. 3(c) shows the traffic jam time, loss value, and efficiency coefficient when travelling from the current location A to the destination B via a direct route, and the traffic jam time, loss value, and efficiency coefficient when travelling via the detour C. As will be described later, a comprehensive evaluation is calculated based on these loss values ​​and efficiency coefficients. Note that the efficiency coefficient here is a value based on the absence of traffic jams, but is not limited to this, and may be the average travel time in a given period of time in the past.

[0021] The cost calculation unit 102 may further calculate a cost for a comprehensive evaluation that takes into account the cost of the entire route other than the travel efficiency described above.

[0022] For example, the cost calculation unit 102 calculates the vehicle movement additional cost and the vehicle movement cost efficiency coefficient. First, the cost calculation unit 102 calculates the difference in fuel cost between a route when there is no traffic jam (reference time) and the searched proposed route for today as the "vehicle movement additional cost" (fuel efficiency is poor during traffic jams, and gasoline costs increase). In addition, the cost calculation unit 102 calculates "fuel cost Y yen of the searched proposed route ÷ fuel cost X yen of the direct route when there is no traffic jam (reference time)" as the vehicle movement cost efficiency coefficient. The fuel consumption per km is calculated based on the total travel distance, traffic jam distance, and travel time, and the fuel cost is calculated based on this. For example, it is assumed that fuel consumption is 1.5 times higher during traffic jams.

[0023] The cost calculation unit 102 also calculates the detour loss value and the efficiency coefficient of the detour. The cost calculation unit 102 estimates the waiting time at the detour facility (detour location C) from external information, and calculates the loss value for the waiting time from the detour loss value function. The detour loss value is, for example, a value obtained by converting the waiting time at the detour location C into a monetary value. The cost calculation unit 102 acquires the average stay time at the detour facility from external information, etc., and calculates "1 + waiting time at facility ÷ average stay time" as the efficiency coefficient of the detour. The waiting time and average stay time are information provided from external information, and are the waiting time to enter the facility, the usage time, etc. These pieces of information are, for example, information provided from a management server managed by the facility. The "waiting time at facility" is the predicted waiting time at the facility at the scheduled arrival time.

[0024] Furthermore, the cost calculation unit 102 may use the stay cost in addition to or instead of the stay time such as the waiting time. That is, when the stay cost exceeds a certain cost, a loss function for that purpose may be used to use the loss value. This loss function is determined in advance according to the price range and stay time of the facility (e.g., a store) in the detour area C. For example, the average stay time in a general coffee shop is 30 minutes and the average amount is 600 yen, and the average amount is 60 minutes and 900 yen in a family restaurant. Based on such information, a loss function with the horizontal axis being "yen / minute" and the vertical axis being "loss value (yen)" may be prepared in advance. Note that a table that uniquely defines the loss value according to the type of facility (restaurant, souvenir shop, leisure facility) in the detour area C may be used.

[0025] Additionally, the cost calculation unit 102 calculates the loss value of an arrival delay at destination B and the relative coefficient of the delay. The cost calculation unit 102 has a "basic arrival time" that each user does not want to be later than.

[0026] In the present disclosure, the cost calculation unit 102 acquires user information including a basic arrival time. For example, the cost calculation unit 102 acquires a basic arrival time of the user information from a route search request from the vehicle 200 acquired by the route search unit 101. The cost calculation unit 102 calculates a loss value from a loss function of arrival delay according to the time later than the basic arrival time. That is, in this case, a loss function for when an arrival delay occurs other than the basic loss function is prepared, and the cost calculation unit 102 calculates the loss value using it. Then, the cost calculation unit 102 multiplies the loss value by a relative coefficient.

[0027] The relative coefficient for the direct route plan is set to 1, and the other detour route plans are defined according to the following cases: Case 1: If the direct route plan arrives before the basic arrival time → 1 Case 2: If the direct route plan is after the base arrival time → "Excess time of the detour route plan ÷ excess time of the direct route plan" (excess time indicates the time exceeded from the base arrival time)

[0028] 4 is a table in which various costs and efficiency coefficients calculated by the cost calculation unit 102 are associated with other loss values, relative coefficients, etc. As shown in the figure, they are further associated with and managed in relation to the overall evaluation calculated based on the loss value and efficiency coefficient of travel.

[0029] In FIG. 4, the overall evaluation is calculated as the sum of the overall evaluation in evaluation v1, the product of the vehicle movement additional cost and the vehicle movement cost efficiency coefficient, the product of the loss value of the detour and the efficiency coefficient of the detour, and the product of the loss value of the delay home and the relative coefficient of the delay home.

[0030] For convenience of explanation, the evaluation v1 indicates an overall evaluation based on the loss for travel and its efficiency, and the evaluation v2 indicates an evaluation based on the entire proposal including the additional cost when making a detour, but there is no need to distinguish between them. The evaluation calculation unit 103 can calculate the overall evaluation with only one of them. In FIG. 4, since the proposal 1 is a direct route proposal, the cost of the detour is omitted.

[0031] The evaluation calculation unit 103 functions as an evaluation unit and calculates an overall evaluation based on the loss value and efficiency coefficient calculated by the cost calculation unit 102. Specifically, the evaluation calculation unit 103 calculates the product of the loss value and the efficiency coefficient (or relative coefficient) calculated for each item as the evaluation for each item, and calculates the sum of these as the overall evaluation.

[0032] Furthermore, the evaluation calculation unit 103 may correct the overall evaluation by adding conditions other than those mentioned above, such as the traffic jam time being equal to or longer than a predetermined time, the stay cost exceeding a certain cost, the arrival time being later than a predetermined time, etc. As a function of the cost calculation unit 102, the loss value may be calculated according to these conditions, or the evaluation calculation unit 103 may correct the overall evaluation by taking these conditions into consideration.

[0033] The map DB 105 is a database that stores map information for route searches. This map information includes roads and facilities. The facilities are locations for detours, and indicate the names or types of the facilities.

[0034] The traffic DB 106 is a database that stores information about traffic congestion on roads.

[0035] The cost DB 107 is a database that stores the loss function and the cost of the detour place (stay cost of the facility). As described above, the cost of the detour place is information given from the outside as external information, so the route search device 100 may be configured not to have the cost DB 107 and to acquire it from an external server.

[0036] Next, the operation of the route search device 100 of the present disclosure will be described. Fig. 5 is a flowchart showing the operation of the route search device 100. The route search unit 101 acquires a current location from the vehicle 200 (S101). Note that in the present disclosure, a direct route to a destination is calculated, and for example, the destination is assumed to be a home. Note that, naturally, the destination is not limited to a home.

[0037] The route search unit 101 acquires a direct route to home based on the current location (S102).The route search unit 101 acquires a detour route based on the current location (S103).

[0038] The cost calculation unit 102 calculates the cost of the direct route, the cost of the detour route, and the cost of the detour points (places of stay) on the detour route (S104).

[0039] The evaluation calculation unit 103 calculates the evaluation of the direct route and the detour route based on the cost (S105). The evaluation calculation unit 103 further narrows down the detour routes to x routes with high overall evaluations based on the overall evaluation (S106).

[0040] The presentation unit 104 presents the direct route and the x number of detour routes to the driver (S107).

[0041] As described above, the route search device 100 can derive a plurality of routes and provide the driver with an overall evaluation of each route.

[0042] In the table shown in FIG. 4, when there are multiple proposed routes, whether direct or detour, depending on whether or not an expressway is used, the expressway route is used as the standard for the direct route. Then, the routes can be divided into cases where a general road is used as the direct route, where an expressway is used as a detour route, and where a general road is used as a detour route. In this case, the presence or absence of an expressway may be taken into consideration as the travel cost. In other words, the toll for the expressway may be added to the travel cost.

[0043] Also, the loss value may be calculated by treating the additional time as traffic jam time based on the shortest route using the expressway, or a value number for using the expressway may be created in advance in addition to the loss value for traffic jam time. In general, the value of a 30-minute traffic jam on an expressway is different from that of a 30-minute traffic jam on an ordinary road. In general, the loss value of a traffic jam on an expressway is considered to be large, and the loss value on an ordinary road may be multiplied by 1.5.

[0044] The overall evaluation may be presented to the user not as a number but as a rank (e.g., 3000 or more is Bad, 500 or less is Good). In addition, evaluation correction may be added to the multiplication result of the loss value and the efficiency coefficient in the following cases:

[0045] Detour locations may be grouped by fixed area (such as within a five-minute drive) rather than by facility such as a store.

[0046] Loss value functions are created from surveys, etc. For example, a loss value function can be created from a survey asking questions such as how much would you be willing to pay if there was a fast lane that would allow you to avoid 10 minutes of traffic on the highway, or would you use the highway if it cost 100 yen and saved you 10 minutes? In other words, by conducting such a survey of each user, the creator of the loss value can grasp the monetary value corresponding to the user's time and create a loss value function.

[0047] Also, there may be loss functions corresponding to travel, stay at a detour, and delay in returning home. Also, the loss function may not be common to all users, but may be calculated by a machine learning model with attribute data as feature values. That is, an estimation model learned by machine learning may be used with attribute data (age, sex, hobbies, preferences, personality, etc.) and time as explanatory variables and monetary value as a target variable. Time and monetary value are determined based on the survey results taken for each user, as described above.

[0048] The time spent at the facility Tc may be calculated by aggregating the average time spent at the facility for each time period from the past logs of all drivers, or by using a prediction function for the time spent at the facility, as shown below. The prediction function determines the minimum time spent at the facility from the facility category, and calculates the time spent at the facility by finding the earliest time when the traffic jam time of the detour plan is equal to or shorter than a certain time.

[0049] In addition, the favorability of the detour (facility) may be taken into account in the overall evaluation. For example, the driver's preferences may be surveyed in advance, and if the driver likes a particular facility category, the evaluation value may be adjusted by subtracting a uniform X from the evaluation value and adding an additional coefficient (1 or less).

[0050] In addition, if there are incentives that can be obtained for each proposal, they may be taken into account in the overall evaluation. In some cases, local government agencies may want to set recommended routes or detour locations in order to alleviate traffic congestion in the area where drivers are planning to pass and to promote regional revitalization. Incentive settings are used for this purpose.

[0051] For example, by giving an incentive to the driver for a proposed route recommended by the route search device 100 (or the government or company that manages this device), the driver is motivated to select the proposed route. The route search device 100 (rating calculation unit 103) converts the incentive into an rating (for example, multiplies the efficiency coefficient by a monetary value) and subtracts the rating from the overall rating to obtain the overall rating. In other words, when the driver selects the proposed route with the incentive, the route search device 100 gives the driver a cashback or points that can be exchanged for cash.

[0052] After route search, the route search device 100 has the driver input which route to select, or performs GPS positioning or the like constantly or at an appropriate timing, and determines whether the driver has traveled a route for which an incentive is to be granted. Then, the route search device 100 determines the granting conditions when the driver arrives at the destination. If it is determined that the incentive should be granted, the incentive is granted. Note that, although the route search device 100 grants the incentive here, another incentive management device may perform the above operation.

[0053] Next, the effects of the route search device 100 of the present disclosure will be described. The route search device 100 of the present disclosure includes a route search unit 101, a cost calculation unit 102, an evaluation calculation unit 103, and a presentation unit 104. The route search unit 101 searches for a proposed route along which a user, who is a driver, travels, based on at least a current position and a destination. Then, the cost calculation unit 102 calculates the travel cost of the proposed route. The presentation unit 104 presents an overall evaluation based on the travel cost to the driver. This travel cost includes a monetary value consumed when the driver travels along the proposed route, and includes travel time, travel efficiency, arrival time at the destination, and the like.

[0054] According to this configuration, by presenting the user with an overall evaluation based on the travel cost when the user tries to travel along the proposed route, the user can determine whether the proposed route is good or bad. The travel cost indicates a monetary value consumed when the user tries to travel along the proposed route, and is calculated based on at least one of travel time, stay time, travel efficiency, and final arrival time, for example. For example, if the travel time is long, it is converted into a monetary value according to the length for the user, and this is regarded as the monetary value consumed.

[0055] Although there are multiple perspectives in the proposed travel route, a unified quantification such as travel cost makes it easier for users to make a decision. Note that travel cost is not only converted into a monetary value (= economic viewpoint), but also includes perception and subjectivity (= quantified by relative evaluation), and such a comprehensive evaluation enables a comprehensive evaluation that is more in line with a person's judgment criteria.

[0056] In the above embodiment, the proposed routes in the present disclosure are direct routes and detour routes, but it is also possible to search for only one of them and calculate and present the overall evaluation thereof.

[0057] Moreover, in the route search device 100 of the present disclosure, the cost calculation unit 102 has the functions of a loss calculation unit and an efficiency calculation unit. The loss calculation unit calculates the loss value (e.g., travel time loss, expenses associated with travel, etc.) of travel on the proposed route (direct return route or detour route) at the time of proposal (search) as a travel cost. Then, the efficiency calculation unit calculates an efficiency coefficient using the travel time on the proposed route at a reference time (e.g., when there is no traffic jam, or other predetermined period in the past). The evaluation calculation unit 103 calculates an overall evaluation based on the loss value and the efficiency coefficient.

[0058] The loss value is determined based on at least one of the time of a moving state such as a traffic jam or the arrival time at a destination, for example. If the traffic jam time is long, the user feels that a loss has been incurred. If the user arrives late, the user feels that a loss has been incurred.

[0059] In addition, the cost calculation unit 102 may calculate the energy consumption (fuel consumption) of the driver's moving body (e.g., vehicle 200) at a reference time, such as a specified time or period in the past, and at the time when the proposed route is proposed, and the difference between them may be treated as the loss value (fuel cost).

[0060] In the route search device 100 of the present disclosure, the route search unit 101 searches for a direct route from the current location to the destination. On the other hand, the route search unit 101 determines a detour point as a stopover based on the current location, and searches for a detour route including a first route from the current location to the detour point and a second route from the detour point to the destination. It is only necessary to search for both or either of a direct route and a detour route.

[0061] Then, the cost calculation unit 102 calculates the travel cost of each of the direct route and / or the detour route.

[0062] With this configuration, it is possible to find a direct route from the current location to the destination and a detour route, and to find the travel cost and evaluation of each route. The user can decide which route to use based on the evaluation of each route. In other words, this decision can be made easily.

[0063] In addition, in the route search device 100 of the present disclosure, when the route search unit 101 searches for a detour route (a detour location), the cost calculation unit 102 calculates the stay cost at the detour location and calculates the travel cost taking the stay cost into consideration.

[0064] This configuration allows the calculation of travel costs that take into account the cost of staying at detours, and enables evaluation accordingly. For example, the cost of staying is not only the time spent there, but also the estimated money consumed during the stay. This allows the user to make a more realistic decision.

[0065] Furthermore, in the route search device 100 of the present disclosure, the cost calculation unit 102 calculates a loss value according to the stay time at a detour point on a detour route as a stay cost.

[0066] For example, the stay time includes the stay time for normal activities at the detour area, and if there is a waiting time due to congestion, the loss value is calculated according to the waiting time.

[0067] This makes it possible to present a more appropriate judgment index to the driver.

[0068] The evaluation calculation unit 103 corrects the overall evaluation when the cost of staying at the detour exceeds a certain cost. That is, the evaluation calculation unit 103 adds a predetermined value to the overall evaluation to correct the overall evaluation in a worsening direction. Some detours may require costs, which may impose a financial burden on the user. This may need to be taken into consideration when making the evaluation.

[0069] This enables a comprehensive evaluation that takes into account stay costs above a certain level, providing users with more appropriate information for making decisions.

[0070] Furthermore, when the arrival time at the destination exceeds a certain time, or when a certain travel condition (such as traffic jam) on the proposed route exceeds a certain time, the evaluation calculation unit 103 may correct and evaluate the loss value.

[0071] Furthermore, the evaluation calculation unit 103 may correct the overall evaluation when the detour location matches the user's preferences. If the detour matches the user's preferences, the user's satisfaction should be high even if the travel cost is high. Therefore, in this case, a predetermined value is subtracted from the overall evaluation to correct the overall evaluation in a better direction.

[0072] The block diagrams used in the description of the above embodiments show functional blocks. These functional blocks (components) are realized by any combination of at least one of hardware and software. The method of realizing each functional block is not particularly limited. That is, each functional block may be realized by using one device that is physically or logically combined, or may be realized by using two or more devices that are physically or logically separated and directly or indirectly connected (for example, by wire, wireless, etc.). The functional block may be realized by combining the one device or the multiple devices with software.

[0073] Functions include, but are not limited to, judgment, determination, judgment, calculation, computation, processing, derivation, investigation, search, confirmation, reception, transmission, output, access, resolution, selection, selection, establishment, comparison, assumption, expectation, consideration, broadcasting, notifying, communicating, forwarding, configuring, reconfiguring, allocation, mapping, assignment, etc. For example, a functional block (component) that performs the function of transmission is called a transmitting unit or a transmitter. In either case, as described above, there is no particular limitation on the method of realization.

[0074] For example, the route search device 100 according to an embodiment of the present disclosure may function as a computer that performs processing of the route search method of the present disclosure. Fig. 6 is a diagram illustrating an example of a hardware configuration of the route search device 100 according to an embodiment of the present disclosure. The above-mentioned route search device 100 may be physically configured as a computer device including a processor 1001, a memory 1002, a storage 1003, a communication device 1004, an input device 1005, an output device 1006, a bus 1007, and the like.

[0075] In the following description, the term "apparatus" may be replaced with a circuit, a device, a unit, etc. The hardware configuration of the route search apparatus 100 may be configured to include one or more of the apparatuses shown in the drawings, or may be configured to exclude some of the apparatuses.

[0076] Each function in the route search device 100 is realized by loading a specific software (program) onto hardware such as the processor 1001 and memory 1002, causing the processor 1001 to perform calculations, control communications by the communication device 1004, and control at least one of the reading and writing of data in the memory 1002 and storage 1003.

[0077] The processor 1001 controls the entire computer by running an operating system, for example. The processor 1001 may be configured with a central processing unit (CPU) including an interface with peripheral devices, a control device, an arithmetic unit, a register, etc. For example, the above-mentioned route search unit 101, cost calculation unit 102, evaluation calculation unit 103, etc. may be realized by the processor 1001.

[0078] Moreover, the processor 1001 reads out a program (program code), a software module, data, etc. from at least one of the storage 1003 and the communication device 1004 into the memory 1002, and executes various processes according to the read out programs. As the program, a program that causes a computer to execute at least a part of the operations described in the above-mentioned embodiment is used. For example, the route search unit 101, the cost calculation unit 102, and the evaluation calculation unit 103 may be realized by a control program stored in the memory 1002 and operated in the processor 1001, and other functional blocks may be realized in a similar manner. Although the above-mentioned various processes have been described as being executed by one processor 1001, they may be executed by two or more processors 1001 simultaneously or sequentially. The processor 1001 may be implemented by one or more chips. The program may be transmitted from a network via a telecommunication line.

[0079] The memory 1002 is a computer-readable recording medium, and may be configured by at least one of, for example, a read only memory (ROM), an erasable programmable ROM (EPROM), an electrically erasable programmable ROM (EEPROM), a random access memory (RAM), etc. The memory 1002 may be called a register, a cache, a main memory (primary storage device), etc. The memory 1002 can store a program (program code), a software module, etc. that can be executed to implement a path search method according to an embodiment of the present disclosure.

[0080] Storage 1003 is a computer-readable recording medium, and may be composed of at least one of, for example, an optical disk such as a CD-ROM (Compact Disc ROM), a hard disk drive, a flexible disk, a magneto-optical disk (e.g., a compact disk, a digital versatile disk, a Blu-ray (registered trademark) disk), a smart card, a flash memory (e.g., a card, a stick, a key drive), a floppy (registered trademark) disk, a magnetic strip, and the like. Storage 1003 may be referred to as an auxiliary storage device. The above-mentioned storage medium may be, for example, a database, a server, or other suitable medium including at least one of memory 1002 and storage 1003.

[0081] The communication device 1004 is hardware (transmission / reception device) for performing communication between computers via at least one of a wired network and a wireless network, and is also called, for example, a network device, a network controller, a network card, a communication module, etc. The communication device 1004 may be configured to include a high-frequency switch, a duplexer, a filter, a frequency synthesizer, etc., in order to realize at least one of Frequency Division Duplex (FDD) and Time Division Duplex (TDD). For example, a part of the receiving function of the route search unit 101 and the transmitting function of the presentation unit 104 may be realized by the communication device 1004.

[0082] The input device 1005 is an input device (e.g., a keyboard, a mouse, a microphone, a switch, a button, a sensor, etc.) that accepts input from the outside. The output device 1006 is an output device (e.g., a display, a speaker, an LED lamp, etc.) that performs output to the outside. The input device 1005 and the output device 1006 may be integrated into one device (e.g., a touch panel).

[0083] In addition, each device such as the processor 1001 and the memory 1002 is connected by a bus 1007 for communicating information. The bus 1007 may be configured using a single bus, or may be configured using different buses between each device.

[0084] Furthermore, the route search device 100 may be configured to include hardware such as a microprocessor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a programmable logic device (PLD), a field programmable gate array (FPGA), etc., and some or all of the functional blocks may be realized by the hardware. For example, the processor 1001 may be implemented using at least one of these pieces of hardware.

[0085] The notification of information is not limited to the aspects / embodiments described in the present disclosure, and may be performed using other methods. For example, the notification of information may be performed by physical layer signaling (e.g., Downlink Control Information (DCI), Uplink Control Information (UCI)), higher layer signaling (e.g., Radio Resource Control (RRC) signaling, Medium Access Control (MAC) signaling, broadcast information (Master Information Block (MIB), System Information Block (SIB))), other signals, or a combination thereof. In addition, the RRC signaling may be called an RRC message, and may be, for example, an RRC Connection Setup message, an RRC Connection Reconfiguration message, or the like.

[0086] The order of the steps, sequences, flow charts, etc. of each aspect / embodiment described in this disclosure may be changed unless inconsistent. For example, the methods described in this disclosure present elements of various steps using an example order, and are not limited to the particular order presented.

[0087] The input and output information may be stored in a specific location (e.g., memory) or may be managed using a management table. The input and output information may be overwritten, updated, or added to. The output information may be deleted. The input information may be transmitted to another device.

[0088] The determination may be based on a value represented by a single bit (0 or 1), a Boolean (true or false) value, or a numerical comparison (e.g., comparison with a predetermined value).

[0089] Each aspect / embodiment described in this disclosure may be used alone, in combination, or switched according to execution. In addition, notification of specific information (e.g., notification that "X is the case") is not limited to being done explicitly, but may be done implicitly (e.g., not notifying the specific information).

[0090] Although the present disclosure has been described in detail above, it is clear to those skilled in the art that the present disclosure is not limited to the embodiments described in the present disclosure. The present disclosure can be implemented as modified and altered forms without departing from the spirit and scope of the present disclosure as defined by the claims. Therefore, the description of the present disclosure is intended to be illustrative and does not have any limiting meaning on the present disclosure.

[0091] Software shall be construed broadly to mean instructions, instruction sets, code, code segments, program code, programs, subprograms, software modules, applications, software applications, software packages, routines, subroutines, objects, executable files, threads of execution, procedures, functions, etc., whether referred to as software, firmware, middleware, microcode, hardware description language, or otherwise.

[0092] Software, instructions, information, etc. may also be transmitted or received over a transmission medium. For example, if the software is transmitted from a website, server, or other remote source using wired technologies (such as coaxial cable, fiber optic cable, twisted pair, Digital Subscriber Line (DSL)), and / or wireless technologies (such as infrared, microwave, etc.), then these wired and / or wireless technologies are included within the definition of transmission media.

[0093] The information, signals, etc. described in this disclosure may be represented using any of a variety of different technologies. For example, the data, instructions, commands, information, signals, bits, symbols, chips, etc. that may be referred to throughout the above description may be represented by voltages, currents, electromagnetic waves, magnetic fields or magnetic particles, optical fields or photons, or any combination thereof.

[0094] In addition, the terms described in this disclosure and the terms necessary for understanding this disclosure may be replaced with terms having the same or similar meanings. For example, at least one of the channel and the symbol may be a signal (signaling). Also, the signal may be a message. Also, the component carrier (CC) may be called a carrier frequency, a cell, a frequency carrier, etc.

[0095] In addition, the information, parameters, etc. described in the present disclosure may be represented using absolute values, may be represented using relative values ​​from a predetermined value, or may be represented using other corresponding information. For example, a radio resource may be indicated by an index.

[0096] The names used for the above-mentioned parameters are not limiting in any way. Moreover, the formulas etc. using these parameters may differ from those explicitly disclosed in this disclosure. The various channels (e.g., PUCCH, PDCCH, etc.) and information elements may be identified by any suitable names, and therefore the various names assigned to these various channels and information elements are not limiting in any way.

[0097] In this disclosure, the terms "Mobile Station (MS)", "user terminal", "User Equipment (UE)", "terminal", etc. may be used interchangeably.

[0098] A mobile station may also be referred to by those skilled in the art as a subscriber station, mobile unit, subscriber unit, wireless unit, remote unit, mobile device, wireless device, wireless communication device, remote device, mobile subscriber station, access terminal, mobile terminal, wireless terminal, remote terminal, handset, user agent, mobile client, client, or some other suitable terminology.

[0099] As used in this disclosure, the terms "determining" and "determining" may encompass a wide variety of actions. "Determining" and "determining" may include, for example, judging, calculating, computing, processing, deriving, investigating, looking up, search, inquiry (e.g., searching in a table, database, or other data structure), ascertaining, and the like. "Determining" and "determining" may also include receiving (e.g., receiving information), transmitting (e.g., sending information), input, output, accessing (e.g., accessing data in a memory), and the like. In addition, "judgment" and "decision" can include considering resolving, selecting, choosing, establishing, comparing, etc., to be a "judgment" or "decision." In other words, "judgment" and "decision" can include considering some action to be a "judgment" or "decision." In addition, "judgment" can be interpreted as "assuming," "expecting," "considering," etc.

[0100] The terms "connected," "coupled," or any variation thereof, refer to any direct or indirect connection or coupling between two or more elements, and may include the presence of one or more intermediate elements between two elements that are "connected" or "coupled" to each other. The coupling or connection between elements may be physical, logical, or a combination thereof. For example, "connected" may be read as "access." As used in this disclosure, two elements may be considered to be "connected" or "coupled" to each other using at least one of one or more wires, cables, and printed electrical connections, as well as electromagnetic energy having wavelengths in the radio frequency range, microwave range, and optical (both visible and invisible) range, as some non-limiting and non-exhaustive examples.

[0101] As used in this disclosure, the phrase "based on" does not mean "based only on," unless expressly stated otherwise. In other words, the phrase "based on" means both "based only on" and "based at least on."

[0102] Any reference to an element using a designation such as "first", "second" etc. used in this disclosure does not generally limit the quantity or order of those elements. These designations may be used in this disclosure as a convenient way to distinguish between two or more elements. Thus, a reference to a first and a second element does not imply that only two elements may be employed or that the first element must precede the second element in some way.

[0103] When "include," "including," and variations thereof are used in this disclosure, these terms are intended to be inclusive, similar to the term "comprising." Further, when used in this disclosure, the term "or" is not intended to be an exclusive or.

[0104] In this disclosure, where articles have been added due to translation, such as, for example, a, an, and the in English, the disclosure may include that the nouns following these articles are in the plural form.

[0105] In the present disclosure, the term "A and B are different" may mean "A and B are different from each other." The term may also mean "A and B are each different from C." Terms such as "separate" and "coupled" may also be interpreted in the same way as "different." [Explanation of symbols]

[0106] 100: route search device, 101: route search unit, 102: cost calculation unit, 103: evaluation calculation unit, 104: presentation unit, 105: map DB, 106: traffic DB, 107: cost DB.

Claims

1. A route search unit that searches for a proposed route for a user to travel based on a current location and a destination; a cost calculation unit for calculating a travel cost of the proposed route; an evaluation unit that evaluates the proposed route based on the travel cost; a presentation unit that presents the proposed route and its evaluation to the user; Equipped with The cost calculation unit: a loss calculation unit that calculates a loss value of travel along the proposed route at the time of proposal as a travel cost; an efficiency calculation unit that calculates an efficiency coefficient by using a movement path at a reference time in the proposed path; Including, The evaluation unit is Calculating a comprehensive evaluation based on the loss value and the efficiency coefficient; The cost calculation unit: Calculating the energy consumption of the user's mobile body at a predetermined reference time and at the proposed time, and setting the difference therebetween as a loss value. Route search device.

2. The movement cost is indicating a monetary value that would be consumed if the user were to travel along the proposed route; The route search device according to claim 1.

3. The route search unit is Searching for a direct route from the current location to the destination as a proposed route, or / and determining a waypoint based on the current location, and searching for a detour route including a first route from the current location to the waypoint and a second route from the waypoint to the destination as a proposed route; The cost calculation unit: calculating a travel cost of the direct route and / or the detour route; The route search device according to claim 1.

4. When the route search unit searches for the detour route, The cost calculation unit: Calculating a stay cost at the intermediate point, and calculating the travel cost taking the stay cost into consideration; The route search device according to claim 3.

5. The cost calculation unit: A loss value according to a stay time at the intermediate point is calculated as the stay cost.

5. The route search device according to claim 4.

6. The evaluation unit is When the cost of staying at the transit point exceeds a certain cost, the evaluation is corrected.

5. The route search device according to claim 4.

7. The evaluation unit further When the arrival time at the destination exceeds a certain time, and when a certain moving state on the proposed route exceeds a certain time, a loss value is calculated taking each of the above into consideration. The route search device according to claim 1.

Citation Information

Patent Citations

  • JP170376A

  • Route searching device and route searching method

    JP2007010399A

  • Route search device, route search method, route search program, and recording medium

    JP2007263581A

  • Navigation device, navigation method and program

    JP2009210508A

  • Electronic device

    JP2019144028A