Patents by Inventor Renato F. Werneck
Renato F. Werneck has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20130231862Abstract: Customizable route planning is a technique for computing point-to-point shortest paths in road networks. It includes three phases: preprocessing, customization, and queries. The preprocessing phase partitions a graph into multiple levels of loosely connected components of bounded size and creates an overlay graph for each level by replacing each component with a clique connecting its boundary vertices. Clique edge lengths are computed during the customization phase. The query phase comprises a bidirectional Dijkstra's algorithm operating on the union of the overlay graphs and the components of the original graph containing the origin and the destination. The customization may be made even faster, enabling a wide range of applications including highly dynamic applications and on-line personalized cost functions. In an implementation, to compute overlay arc costs, Dijkstra's algorithm may be supplemented or replaced by other techniques, such as contraction and the Bellman-Ford algorithm.Type: ApplicationFiled: April 23, 2013Publication date: September 5, 2013Applicant: Microsoft CorporationInventors: Daniel Delling, Renato F. Werneck
-
Patent number: 8494771Abstract: Optimum journeys in public transportation networks are determined. The determination of Pareto optimal journeys from one stop to another stop in a public transportation network uses the criteria travel time and minimum transfers. A technique for bi-criteria journey planning using the aforementioned criteria in public transportation networks operates in rounds (K rounds at most), where after round k (k?K), arrival times are computed for the stops that can be reached with up to k trips.Type: GrantFiled: September 7, 2011Date of Patent: July 23, 2013Assignee: Microsoft CorporationInventors: Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck
-
Publication number: 20130132369Abstract: A batched shortest path problem, such as a one-to-many problem, is solved on a graph by using a preprocessing phase, a target selection phase, and then, in a query phase, computing the distances from a given source in the graph with a linear sweep over all the vertices. Contraction hierarchies may be used in the preprocessing phase and in the query phase. Optimizations may include reordering the vertices in advance to exploit locality and using parallelism.Type: ApplicationFiled: November 17, 2011Publication date: May 23, 2013Applicant: Microsoft CorporationInventors: Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
-
Publication number: 20130060468Abstract: Optimum journeys in public transportation networks are determined. The determination of Pareto optimal journeys from one stop to another stop in a public transportation network uses the criteria travel time and minimum transfers. A technique for bi-criteria journey planning using the aforementioned criteria in public transportation networks operates in rounds (K rounds at most), where after round k (k?K), arrival times are computed for the stops that can be reached with up to k trips.Type: ApplicationFiled: September 7, 2011Publication date: March 7, 2013Applicant: Microsoft CorporationInventors: Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck
-
Patent number: 8364717Abstract: The non-negative single-source shortest path (NSSP) problem is solved on a graph by using a preprocessing phase and then, in a query phase, computing the distances from a given source in the graph with a linear sweep over all the vertices. Contraction hierarchies may be used in the preprocessing phase and in the query phase. Optimizations may include reordering the vertices in advance to exploit locality, performing multiple NSSP computations simultaneously, marking vertices during initialization, and using parallelism. Techniques may be performed on a graphics processing unit (GPU). This makes applications based on all-pairs shortest-paths practical for continental-sized road networks. The applications include, for example, computing graph diameter, exact arc flags, and centrality measures such as exact reaches or betweenness.Type: GrantFiled: January 10, 2011Date of Patent: January 29, 2013Assignee: Microsoft CorporationInventors: Daniel Delling, Andrew V. Goldberg, Andreas Nowatzyk, Renato F. Werneck
-
Publication number: 20120254597Abstract: A distributed data-parallel execution (DDPE) system splits a computational problem into a plurality of sub-problems using a branch-and-bound algorithm, designates a synchronous stop time for a “plurality of processors” (for example, a cluster) for each round of execution, processes the search tree by recursively using a branch-and-bound algorithm in multiple rounds (without inter-processor communications), determines if further processing is required based on the processing round state data, and terminates processing on the processors when processing is completed.Type: ApplicationFiled: March 29, 2011Publication date: October 4, 2012Applicant: Microsoft CorporationInventors: Daniel Delling, Mihai Budiu, Renato F. Werneck
-
Publication number: 20120250535Abstract: Hub based labeling is used to determine a shortest path between two locations. Every point has a set of hubs: this is the label (along with the distance from the point to all those hubs). The hubs are determined using the labels. The hubs are determined that intersect the two labels, and this information is used to find the shortest distance. A hub based labeling technique uses a preprocessing stage and a query stage. Finding the hubs is performed in the preprocessing stage, and finding the intersecting hubs (i.e., the common hubs they share) is performed in the query stage. During preprocessing, a forward label and a reverse label are defined for each vertex. The labels are generated using contraction hierarchies that may be guided by shortest path covers, and may be pruned. A query is processed using the labels to determine the shortest path.Type: ApplicationFiled: March 31, 2011Publication date: October 4, 2012Applicant: Microsoft CorporationInventors: Daniel Delling, Ittai Abraham, Renato F. Werneck, Andrew V. Goldberg
-
Publication number: 20120254153Abstract: Hub based labeling is used, in databases, to determine a shortest path between two locations. Every point has a set of hubs: this is the label (along with the distance from the point to all those hubs). The hubs are determined that intersect the two labels. This information is used to find the shortest distance. A hub based labeling technique uses, in a database, a preprocessing stage and a query stage. Finding the hubs is performed in the preprocessing stage, and finding the intersecting hubs is performed in the query stage using relational database operators, such as SQL queries. During preprocessing, a forward label and a reverse label are defined for each vertex. The labels are generated using contraction hierarchies that may be guided by shortest path covers. A query, such as an SQL query, is processed using the labels to determine the shortest path.Type: ApplicationFiled: November 2, 2011Publication date: October 4, 2012Applicant: Microsoft CorporationInventors: Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
-
Publication number: 20120192138Abstract: Graph partitioning techniques are based on the notion of natural cuts. A filtering phase performs a series of minimum cut computations to identify and contract dense regions of the graph. This reduces the graph size significantly, but preserves its general structure. An assembly phase uses a combination of greedy and local search heuristics to assemble the final partition. The techniques may be used on road networks, which have an abundance of natural cuts (such as bridges, mountain passes, and ferries).Type: ApplicationFiled: January 24, 2011Publication date: July 26, 2012Applicant: Microsoft CorporationInventors: Daniel Delling, Andrew V. Goldberg, Ilya Razenshteyn, Renato F. Werneck
-
Publication number: 20120179674Abstract: The non-negative single-source shortest path (NSSP) problem is solved on a graph by using a preprocessing phase and then, in a query phase, computing the distances from a given source in the graph with a linear sweep over all the vertices. Contraction hierarchies may be used in the preprocessing phase and in the query phase. Optimizations may include reordering the vertices in advance to exploit locality, performing multiple NSSP computations simultaneously, marking vertices during initialization, and using parallelism. Techniques may be performed on a graphics processing unit (GPU). This makes applications based on all-pairs shortest-paths practical for continental-sized road networks. The applications include, for example, computing graph diameter, exact arc flags, and centrality measures such as exact reaches or betweenness.Type: ApplicationFiled: January 10, 2011Publication date: July 12, 2012Applicant: Microsoft CorporationInventors: Daniel Delling, Andrew V. Goldberg, Andreas Nowatzyk, Renato F. Werneck
-
Publication number: 20110295497Abstract: Alternative routes to an optimal route may be determined and presented to a user via a computing device. Alternative routes are selected from candidate routes that meet admissibility criteria. In an implementation, admissibility of a candidate route (in order for it to be considered an alternative route) may be determined based on three criteria: “limited sharing”, “local optimality”, and “stretch” such as “uniformly bounded stretch”. Limited sharing refers to the amount of difference between the alternative route and the optimal route, local optimality refers to lack of unnecessary detours, and uniformly bounded stretch refers to a length of the shortest path to travel between two points on the alternative route.Type: ApplicationFiled: May 26, 2010Publication date: December 1, 2011Applicant: Microsoft CorporationInventors: Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
-
Patent number: 7774734Abstract: An algorithm referred to as REAL for the point-to-point shortest path problem combines A* search with landmark-based lower bounds and reach-based pruning. A symbiosis of these techniques is described, which gives a range of time and space tradeoffs, including those that improve both of these complexity measures. Locality is improved and exact reach computation is described.Type: GrantFiled: November 6, 2006Date of Patent: August 10, 2010Assignee: Microsoft CorporationInventors: Andrew V. Goldberg, Renato F. Werneck, Haim Kaplan
-
Publication number: 20090228198Abstract: A set of landmarks may be selected during preprocessing by evaluating a sample of the queries that the landmarks may be used in. A cost function may be used to generate a k-median problem. The k-median problem may then be solved with heuristics. The landmarks may then be used with A* search to find the shortest path from a source to a destination.Type: ApplicationFiled: March 7, 2008Publication date: September 10, 2009Applicant: MICROSOFT CORPORATIONInventors: Andrew V. Goldberg, Renato F. Werneck
-
Publication number: 20080122848Abstract: An algorithm referred to as REAL for the point-to-point shortest path problem combines A* search with landmark-based lower bounds and reach-based pruning. A symbiosis of these techniques is described, which gives a range of time and space tradeoffs, including those that improve both of these complexity measures. Locality is improved and exact reach computation is described.Type: ApplicationFiled: November 6, 2006Publication date: May 29, 2008Applicant: Microsoft CorporationInventors: Andrew V. Goldberg, Renato F. Werneck, Haim Kaplan