Route search device, route search method, and program

Patent metadata

Field	Value
Publication number	US-11920939-B2
Application number	US-201917292692-A
Country	US
Kind code	B2
Filing date	Oct 29, 2019
Priority date	Nov 12, 2018
Publication date	Mar 5, 2024
Grant date	Mar 5, 2024

Abstract

It is intended to allow an appropriate route search to be performed even with a geographical NW in which accessibility information includes an uninvestigated link. A route appropriateness value calculation unit 160 calculates, for each of a plurality of routes each connecting a departure point and a destination extracted by a route extraction unit 120 and including links connecting individual spots including the departure point and the destination, a route appropriateness value of the route. The route appropriateness value of the route is calculated on the basis of a cost of the route calculated by a cost calculation unit 140 on the basis of a cost representing a degree of passage difficulty which is determined for each of the links with respect to a transportation means on the basis of accessibility information of the investigated link as well as a degree of passage uncertainty representing a possibility that the route cannot be passed through by the transportation mean which is calculated by a passage uncertainty degree calculation unit 150 on the basis of a length of the uninvestigated link included in the route. A route selection unit 180 selects, from among the plurality of routes, the route on the basis of the route appropriateness value of the route.

First claim

The invention claimed is:

1. A route search device comprising a processor configured to execute operations comprising:
receiving a transportation means from a first database, a departure point, and a destination each input thereto;
extracting, from a first database storing route information indexed based at least on the departure point, a plurality of routes each connecting the departure point and the destination and including links connecting individual spots including the departure point and the destination;
determining, for each of the plurality of routes, a cost of a route of the plurality of routes on the basis of a cost representing a degree of passage difficulty which is determined for each of the links with respect to the transportation means on the basis of accessibility information of an investigated link retrieved from a second database, the second database storing the accessibility information indexed based at least on the investigated link of the route, and the route includes an investigated link and an uninvestigated link;
determining, a passage uncertainty degree determiner configured to determine, for each of the plurality of routes, a degree of passage uncertainty representing a possibility that the route cannot be passed through by the transportation means on the basis of a length of an uninvestigated link included in the route retrieved from the second database, the second database further storing the uninvestigated link of the route indexed based at least on the route information, and the uninvestigated link of the route excludes accessibility information;
determining, for each of the plurality of routes, a route appropriateness value of the route on the basis of the cost of the route and the degree of passage uncertainty of the route;
selecting, from among the plurality of routes, a preferred route on the basis of the route appropriateness value of the route; and
transmitting data describing the preferred route over a network to an application configured to display the data.

2. The route search device according to claim 1 , wherein the cost representing the degree of passage difficulty is determined using a value based on an assumption that the uninvestigated link is passable.

3. The route search device according to claim 2 , wherein the determining the degree of passage uncertainty further comprises determining, for each of the plurality of routes, the degree of passage uncertainty on the basis of the length of the uninvestigated link included in the route and a past record of passage by the transportation means through the uninvestigated link.

4. The route search device according to claim 2 , wherein the selecting further comprises selecting the route on the basis of the route appropriateness value of the route, an estimated transit time of the route, a total length of the route, or a proportion of a length of the investigated link in the route.

5. The route search device according to claim 1 , wherein the determining the degree of passage uncertainty further comprises determining, for each of the plurality of routes, the degree of passage uncertainty on the basis of the length of the uninvestigated link included in the route and a past record of passage by the transportation means through the uninvestigated link.

6. The route search device according to claim 5 , wherein the selecting further comprises selecting the route on the basis of the route appropriateness value of the route and, an estimated transit time of the route, a total length of the route, or a proportion of a length of the investigated link in the route.

7. The route search device according to claim 1 , wherein the selecting further comprises selecting the route on the basis of the route appropriateness value of the route, an estimated transit time of the route, a total length of the route, or a proportion of a length of the investigated link in the route.

8. A route search method, the method comprising:
receiving a transportation means, a departure point, and a destination each input thereto;
extracting, from a first database storing route information indexed based at least on the departure point, a plurality of routes each connecting the departure point and the destination and including links connecting individual spots including the departure point and the destination;
determining for each of the plurality of routes extracted by the route extractor, a cost of a route of the plurality of routes on the basis of a cost representing a degree of passage difficulty which is determined for each of the links with respect to the transportation means on the basis of accessibility information of an investigated link retrieved from a second database, the second database storing the accessibility information indexed based at least on the investigated link of the route, and the route includes an investigated link and an uninvestigated link;
determining for each of the plurality of routes, a degree of passage uncertainty representing a possibility that the route cannot be passed through by the transportation means on the basis of a length of an uninvestigated link included in the route retrieved from the second database, the second database further storing the uninvestigated link of the route indexed based at least on the route information, and the uninvestigated link of the route excludes accessibility information;
determining for each of the plurality of routes, a route appropriateness value of the route on the basis of the cost of the route and the degree of passage uncertainty of the route; and
selecting from among the plurality of routes, a preferred route on the basis of the route appropriateness value of the route; and
transmitting data describing the preferred route over a network to an application configured to display the data.

9. The route search method according to claim 8 , wherein the cost representing the degree of passage difficulty is determined using a value based on an assumption that the uninvestigated link is passable.

10. The route search method according to claim 9 , wherein the determining the degree of passage uncertainty further comprises determining, for each of the plurality of routes, the degree of passage uncertainty on the basis of the length of the uninvestigated link included in the route and a past record of passage by the transportation means through the uninvestigated link.

11. The route search method according to claim 9 , wherein the selector further comprises selecting route selector selects the route on the basis of the route appropriateness value of the route, an estimated transit time of the route, a total length of the route, or a proportion of a length of the investigated link in the route.

12. The route search method according to claim 8 , wherein the determining the degree of passage uncertainty further comprises determining, for each of the plurality of routes, the degree of passage uncertainty on the basis of the length of the uninvestigated link included in the route and a past record of passage by the transportation means through the uninvestigated link.

13. The route search method according to claim 12 , wherein the cost representing the degree of passage difficulty is determined using a value based on an assumption that the uninvestigated link is passable.

14. The route search method according to claim 12 , wherein the selecting further comprises selecting the route on the basis of the route appropriateness value of the route, an estimated transit time of the route, a total length of the route, or a proportion of a length of the investigated link in the route.

15. The route search method acc

Assignees

• Nippon Telegraph & Telephone

Inventors

• Yamamoto Chihiro
• Konishi Hiroshi
• Seshimo Hitoshi

Classifications

• G01C21/3461 Primary

  Preferred or disfavoured areas, e.g. dangerous zones, toll or emission zones, intersections, manoeuvre types or segments such as motorways, toll roads or ferries · CPC title

• G09B29/10

  Map spot or coordinate position indicators; Map reading aids (optical projection apparatus per se G03B) · CPC title