# US 2018/0023969 A1 · Point of interest search along a route with return > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2018/0023969 A1 - Document ID: US20180023969A1 - Status: Published application - Kind: A1 - Application number: 15/704,913 - Filed: 2017-09-14 - Published: 2018-01-25 - Earliest claimed: 2009-04-01 - Assignees: Uber Technologies, Inc. - Applicants: Uber Technologies, Inc. - Inventors: Richard F. Poppen; Weidong Tang - Web page: https://patentgrep.com/patent/US20180023969A1 ## CPC - G01C 21/3476: {using point of interest [POI] information, e.g. a route passing visible POIs} - G01C 21/20: Instruments for performing navigational calculations (G01C21/24, G01C21/26 take precedence) - G01C 21/3415: {Dynamic re-routing, e.g. recalculating the route when the user deviates from calculated route or after detecting real-time traffic data or accidents} - G01C 21/3453: {Special cost functions, i.e. other than distance or default speed limit of road segments} - G01C 21/3605: {Destination input or retrieval} - G01C 21/3617: {using user history, behaviour, conditions or preferences, e.g. predicted or inferred from previous use or current movement} - G01C 21/3679: {Retrieval, searching and output of POI information, e.g. hotels, restaurants, shops, filling stations, parking facilities (G01C21/3611 takes precedence)} - G01S 19/42: Determining position - G01C: MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY (measuring liquid level G01F; radio navigation, determining distance or velocity by use of propagation effects, e.g. Doppler effects, propagation time, of radio waves, analogous arrangements using other waves G01S) - G01S: RADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES ## Abstract A routing module identifies POIs that can be reached from a route with a cost less than distance m. A routing engine performs a reverse exploration on nodes in the planned route to locate POIs from which the route can be reached with a cost of less than a second cost n. POIs identified as being reachable from the route with a cost of less than m, and from which the route is reachable with a cost less than n are then further filtered to identify a subset of the POIs for which the sum of the time or distance from the route to the POI and the time or distance from the POI back to the route is less than a threshold time or distance, t. ## Claims ### Claim 1 A computer-implemented method for providing routing to a point of interest, the method comprising: determining, by one or more processors, a first cost to reach a destination along a first navigation route from a current location of a computing device, the first cost less than a second cost to reach the destination along a second navigation route from the current location; determining, by the one or more processors, a third cost to detour to a point of interest from the first navigation route and to reach the destination from the point of interest along the first navigation route; determining, by the one or more processors, a fourth cost to detour to the point of interest from the second navigation route and to reach the destination from the point of interest along the second navigation route; and in response to determining that the fourth cost is less than the third cost, providing the second navigation route for presentation on the computing device. ### Claim 2 (depends on 1) The computer-implemented method of claim 1, wherein the first cost and the second cost are determined based on a first distance of the first navigation route and a second distance of the second navigation route, respectively, the first distance shorter than the second distance. ### Claim 3 (depends on 2) The computer-implemented method of claim 2, further comprising: determining, by the one or more processors, that the point of interest is a first detour distance from the first navigation route and a second detour distance from the second navigation route, the first detour distance greater than the second detour distance. ### Claim 4 (depends on 2) The computer-implemented method of claim 2, further comprising: determining, by the one or more processors, that the point of interest is less than a threshold distance from the second navigation route, the threshold distance greater than a difference between the first distance and the second distance. ### Claim 5 (depends on 1) The computer-implemented method of claim 1, wherein the first cost and the second cost are determined based on a first time of the first navigation route and a second time of the second navigation route, respectively, the first time shorter than the second time. ### Claim 6 (depends on 1) The computer-implemented method of claim 1, further comprising: determining, by the one or more processors, that a detour time from the second navigation route to the point of interest is different than a return time from the point of interest to the second navigation route. ### Claim 7 (depends on 6) The computer-implemented method of claim 6, wherein the detour time is from a freeway exit of the second navigation route and the return time is to a freeway on-ramp of the second navigation route, the freeway on-ramp and the freeway exit located at different portions of the second navigation route. ### Claim 8 (depends on 6) The computer-implemented method of claim 6, wherein an average of the detour time and the return time is less than a threshold time. ### Claim 9 (depends on 8) The computer-implemented method of claim 8, wherein at least one of the detour time and the return time is greater than the threshold time. ### Claim 10 A non-transitory computer-readable storage medium storing instructions for providing routing to a point of interest, the instructions when executed by one or more processors cause the one or more processors to perform steps including: determining, by one or more processors, a first cost to reach a destination along a first navigation route from a current location of a computing device, the first cost less than a second cost to reach the destination along a second navigation route from the current location; determining, by the one or more processors, a third cost to detour to a point of interest from the first navigation route and to reach the destination from the point of interest along the first navigation route; determining, by the one or more processors, a fourth cost to detour to the point of interest from the second navigation route and to reach the destination from the point of interest along the second navigation route; and in response to determining that the fourth cost is less than the third cost, providing the second navigation route for presentation on the computing device. ### Claim 11 (depends on 10) The non-transitory computer-readable storage medium of claim 10, wherein the first cost and the second cost are determined based on a first distance of the first navigation route and a second distance of the second navigation route, respectively, the first distance shorter than the second distance. ### Claim 12 (depends on 11) The non-transitory computer-readable storage medium of claim 11, having further instructions that when executed by the one or more processors cause the one or more processors to perform further steps including: determining, by the one or more processors, that the point of interest is a first detour distance from the first navigation route and a second detour distance from the second navigation route, the first detour distance greater than the second detour distance. ### Claim 13 (depends on 11) The non-transitory computer-readable storage medium of claim 11, having further instructions that when executed by the one or more processors cause the one or more processors to perform further steps including: determining, by the one or more processors, that the point of interest is less than a threshold distance from the second navigation route, the threshold distance greater than a difference between the first distance and the second distance. ### Claim 14 (depends on 10) The non-transitory computer-readable storage medium of claim 10, wherein the first cost and the second cost are determined based on a first time of the first navigation route and a second time of the second navigation route, respectively, the first time shorter than the second time. ### Claim 15 (depends on 10) The non-transitory computer-readable storage medium of claim 10, having further instructions that when executed by the one or more processors cause the one or more processors to perform further steps including: determining, by the one or more processors, that a detour time from the second navigation route to the point of interest is different than a return time from the point of interest to the second navigation route. ### Claim 16 (depends on 15) The non-transitory computer-readable storage medium of claim 15, wherein the detour time is from a freeway exit of the second navigation route and the return time is to a freeway on-ramp of the second navigation route, the freeway on-ramp and the freeway exit located at different portions of the second navigation route. ### Claim 17 (depends on 15) The non-transitory computer-readable storage medium of claim 15, wherein an average of the detour time and the return time is less than a threshold time. ### Claim 18 (depends on 17) The non-transitory computer-readable storage medium of claim 17, wherein at least one of the detour time and the return time is greater than the threshold time. ### Claim 19 A system for providing routing to a point of interest, comprising: a global navigation satellite system radio configured to determine a current location of the system; a routing engine coupled to the global navigation satellite system radio and configured to: determine, by one or more processors, a first cost to reach a destination along a first navigation route from the current location, the first cost less than a second cost to reach the destination along a second navigation route from the current location; determine, by the one or more processors, a third cost to detour to a point of interest from the first navigation route and to reach the destination from the point of interest along the first navigation route; determine, by the one or more processors, a fourth cost to detour to the point of interest from the second navigation route and to reach the destination from the point of interest along the second navigation route; and a user interface coupled to the routing engine and configured to provide the second navigation route for presentation on the system in response to determining that the fourth cost is less than the third cost. ### Claim 20 (depends on 19) The system of claim 19, wherein the first cost and the second cost are determined based on a first distance of the first navigation route and a second distance of the second navigation route, respectively, the first distance shorter than the second distance, and wherein the routing engine is further configured to: determine, by the one or more processors, that the point of interest is less than a threshold distance from the second navigation route, the threshold distance less than a difference between the first distance and the second distance.