Computing transitions between captured driving runs
First Claim
Patent Images
1. A computer-implemented method comprising:
- receiving, with a computing device, an input path comprising a computed path for navigating along one or more streets;
utilizing a transition algorithm to compute an output path associated with the input path, wherein the transition algorithm;
receives, as input, at least two different captured driving runs, the at least two different captured driving runs being stored in memory, each captured run including a plurality of nodes that represent capture events that were acquired at the plurality of nodes along and during the at least two different captured driving runs, and at least some adjacent nodes on each captured run are connected by weighted edges, and a description of an intersection associated with the input path and the driving runs;
computes the output path as a function of cost associated with a transition within the intersection between said at least two captured driving runs;
obtaining images associated with a selected output path; and
causing obtained images to be displayed for a user.
2 Assignments
0 Petitions
Accused Products
Abstract
Various embodiments provide a global approach for computing transitions between captured runs through an intersection. In accordance with one or more embodiments, a transition algorithm receives as input various runs that have been captured through an intersection and an input path through the intersection. The transition algorithm processes its inputs and provides, as an output, a set of points and data such as a direction associated with each of the points. The set of points includes points from different captured runs. The output set of points and associated data indicate which images to obtain from a database and which field of view to create a simulated turn for the user.
15 Citations
18 Claims
-
1. A computer-implemented method comprising:
-
receiving, with a computing device, an input path comprising a computed path for navigating along one or more streets; utilizing a transition algorithm to compute an output path associated with the input path, wherein the transition algorithm; receives, as input, at least two different captured driving runs, the at least two different captured driving runs being stored in memory, each captured run including a plurality of nodes that represent capture events that were acquired at the plurality of nodes along and during the at least two different captured driving runs, and at least some adjacent nodes on each captured run are connected by weighted edges, and a description of an intersection associated with the input path and the driving runs; computes the output path as a function of cost associated with a transition within the intersection between said at least two captured driving runs; obtaining images associated with a selected output path; and causing obtained images to be displayed for a user. - View Dependent Claims (2, 3, 4, 5)
-
-
6. A computer-implemented method comprising:
-
receiving, with a computing device, a user-specified path comprising a computed path for navigating along one or more streets; computing costs associated with making a transition between different captured driving runs, the different captured driving runs being stored in memory, each captured run including a plurality of nodes that represent capture events that were acquired at the plurality of nodes along and during the different captured driving runs, and at least some adjacent nodes on each captured run are connected by weighted edges, associated with the user-specified path; selecting an output path having a lowest cost; obtaining images associated with a selected output path; and causing obtained images to be displayed for a user. - View Dependent Claims (7, 8, 9, 10)
-
-
11. One or more computer-readable hardware storage media embodying computer-executable instructions which, when executed, implement a method comprising:
-
receiving an input path comprising a computed path for navigating along one or more streets; building a weighted, edge-directed graph associated with the input path, the weighted, edge-directed graph comprising multiple captured driving runs, the multiple captured driving runs being stored in memory each of which includes multiple nodes that represent capture events that were acquired at the multiple nodes along and during the multiple captured driving runs; computing transition costs associated with the weighted, edge-directed graph; selecting an output path having a lowest computed transition cost; obtaining 360°
panoramic view images associated with the output path; andcausing the 360°
panoramic view images to be displayed. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18)
-
Specification