ROUTE RECOMMENDATION IN MAP SERVICE

• US 20180216948A1
• Filed: 01/27/2017
• Published: 08/02/2018
• Est. Priority Date: 01/27/2017
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: BA, Yu Tao, REN, Chang Rui, SHI, Xin, ZHANG, Bo
• Granted Patent: US 10,989,549 B2
• Time in Patent Office: Days
• CPC Class Codes: G01C 21/343 Calculating itineraries, i.e. routes leading from a starting point to a series of categorical destinations using a global route restraint, round trips, touristic trips travelling salesman problem G06Q10/04; optimisation of routes G06Q10/047
• CPC Class Codes: G01C 21/3469 Fuel consumption; Energy use; Emission aspects
• CPC Class Codes: G01C 21/3667 Display of a road map G01C21/3614 takes precedence; guidance using 3D or perspective road maps G01C21/3635

Abstract

This disclosure involves improved route recommendation in map service. A computer-implemented method comprises identifying at least one intermediate point for traveling from an origin to a destination based on a user input. The method further comprises determining one or more first recommended routes from the origin to the destination via the at least one intermediate point. The method further comprises determining one or more second recommended routes from the origin to the destination without considering the at least one intermediate point. The method further comprises in response to at least one of the first recommended routes being better than the second recommended routes, storing the at least one intermediate point associated with the origin and the destination.

Claims

1. A computer-implemented method, comprising:

identifying at least one intermediate point for traveling from an origin to a destination based on a user input;

determining one or more first recommended routes from the origin to the destination via the at least one intermediate point;

determining one or more second recommended routes from the origin to the destination without considering the at least one intermediate point; and

in response to at least one of the first recommended routes being better than the second recommended routes, storing the at least one intermediate point associated with the origin and the destination.

2. The method of claim 1, wherein at least one of the first recommended routes being better than the second recommended routes comprises at least one of:

the at least one of the first recommended routes having a shorter traveling duration than the second recommended routes; and

the at least one of the first recommended routes having less energy consumption than the second recommended routes.

3. The method of claim 1, further comprising:

in response to at least one of the first recommended routes being better than the second recommended routes, storing context in determining the one or more first recommended routes as a tag for the stored at least one intermediate point.

4. The method of claim 3, wherein the context comprises at least one of:

time of day, day of week, rush hour or not, holiday or not, and weather condition.

5. The method of claim 1, wherein the at least one intermediate point is stored as an intermediate point set, and the method further comprises:

ranking the intermediate point set among stored intermediate point sets associated with the origin and the destination according to at least one of;

calculated traveling duration of the first recommended route, calculated energy consumption of the first recommended route, and time elapsed since the intermediate point set was stored.

6. The method of claim 1, wherein the at least one intermediate point is stored as an intermediate point set, the method further comprises:

in response to a search request for a route from a first location in a vicinity of the origin to a second location in a vicinity of the destination, recommending one or more routes for the search request using stored intermediate point sets associated with the origin and the destination.

7. The method of claim 6, wherein recommending the one or more routes for the search request comprises:

for at least one of the stored intermediate point sets associated with the origin and the destination, determining one or more third recommended routes from the first location to the second location via the intermediate point set;

determining one or more fourth recommended routes from the first location to the second location without considering the stored intermediate point sets; and

providing the one or more routes for the search request by comparing the third recommended routes and the fourth recommended routes.

8. The method of claim 7, wherein each of the at least one of the stored intermediate point sets associated with the origin and the destination has a tag matching context of the search request, wherein the tag for the stored intermediate point set indicates context in determining corresponding first recommended routes.

9. A computing system, comprising:

a processor;

a computer-readable memory coupled to the processor, the memory comprising instructions that when executed by the processor perform actions of;

identifying at least one intermediate point for traveling from an origin to a destination based on a user input;

determining one or more first recommended routes from the origin to the destination via the at least one intermediate point;

determining one or more second recommended routes from the origin to the destination without considering the at least one intermediate point; and

in response to at least one of the first recommended routes being better than the second recommended routes, storing the at least one intermediate point associated with the origin and the destination.

10. The computing system of claim 9, wherein the memory further comprises instructions that when executed by the processor perform actions of:

in response to at least one of the first recommended routes being better than the second recommended routes, storing context in determining the one or more first recommended routes as a tag for the stored at least one intermediate point.

11. The computing system of claim 9, wherein the at least one intermediate point is stored as an intermediate point set, and the memory further comprises instructions that when executed by the processor perform actions of:

ranking the intermediate point set among stored intermediate point sets associated with the origin and the destination according to at least one of;

calculated traveling duration of the first recommended route, calculated energy consumption of the first recommended route, and time elapsed since the intermediate point set was stored.

12. The computing system of claim 9, wherein the at least one intermediate point is stored as an intermediate point set, and the memory further comprises instructions that when executed by the processor perform actions of:

in response to a search request for a route from a first location in a vicinity of the origin to a second location in a vicinity of the destination, recommending one or more routes for the search request using stored intermediate point sets associated with the origin and the destination.

13. The computing system of claim 12, wherein recommending the one or more routes for the search request comprises:

for at least one of the stored intermediate point sets associated with the origin and the destination, determining one or more third recommended routes from the first location to the second location via the intermediate point set;

determining one or more fourth recommended routes from the first location to the second location without considering the stored intermediate point sets; and

providing the one or more routes for the search request by comparing the third recommended routes and the fourth recommended routes.

14. The computing system of claim 13, wherein each of the at least one of the stored intermediate point sets associated with the origin and the destination has a tag matching context of the search request, wherein the tag for the stored intermediate point set indicates context in determining corresponding first recommended routes.

15. A computer program product, comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to:

identify at least one intermediate point for traveling from an origin to a destination based on a user input;

determine one or more first recommended routes from the origin to the destination via the at least one intermediate point;

determine one or more second recommended routes from the origin to the destination without considering the at least one intermediate point; and

in response to at least one of the first recommended routes being better than the second recommended routes, store the at least one intermediate point associated with the origin and the destination.

16. The computer program product of claim 15, wherein the program instructions executable by the processor further cause the processor to:

in response to at least one of the first recommended routes being better than the second recommended routes, store context in determining the one or more first recommended routes as a tag for the stored at least one intermediate point.

17. The computer program product of claim 15, wherein the at least one intermediate point is stored as an intermediate point set, and the program instructions executable by the processor further cause the processor to:

rank the intermediate point set among stored intermediate point sets associated with the origin and the destination according to at least one of;

calculated traveling duration of the first recommended route, calculated energy consumption of the first recommended route, and time elapsed since the intermediate point set was stored.

18. The computer program product of claim 15, wherein the at least one intermediate point is stored as an intermediate point set, and the program instructions executable by the processor further cause the processor to:

in response to a search request for a route from a first location in a vicinity of the origin to a second location in a vicinity of the destination, recommend one or more routes for the search request using stored intermediate point sets associated with the origin and the destination.

19. The computer program product of claim 18, wherein recommending the one or more routes for the search request comprises:

for at least one of the stored intermediate point sets associated with the origin and the destination, determining one or more third recommended routes from the first location to the second location via the intermediate point set;

determining one or more fourth recommended routes from the first location to the second location without considering the stored intermediate point sets; and

providing the one or more routes for the search request by comparing the third recommended routes and the fourth recommended routes.

20. The computer program product of claim 19, wherein each of the at least one of the stored intermediate point sets associated with the origin and the destination has a tag matching context of the search request, wherein the tag for the stored intermediate point set indicates context in determining corresponding first recommended routes.