-
公开(公告)号：US10288437B2
公开(公告)日：2019-05-14
申请号：US15722036
申请日：2017-10-02
Applicant: Google Inc.
Inventor： Robert Geisberger , Amo Eigenwillig
Abstract: Systems and methods are provided for the determination of routes from, for instance, travel segment network data associated with different data versions. More particularly, a request can be received for a route from an origin to a destination. Graph data modeling a travel segment network for a geographic region associated with the origin and for a geographic region associated the destination can be accessed. The graph data can preserve boundary nodes for visiting during a search (e.g. a contraction hierarchies style search) for a shortest path through the graph data. The reach value of a boundary segment can be considered in identifying boundary segments to be visited during the shortest path search through the graph data. The route can be determined based at least in part on the shortest path.
-
公开(公告)号：US09435658B2
公开(公告)日：2016-09-06
申请号：US14714742
申请日：2015-05-18
Applicant: Google Inc.
Inventor： Robert Geisberger , Arno Eigenwillig
CPC classification number: G01C21/3446 , G01C21/20 , G06Q10/047 , G06Q50/30
Abstract: Systems and methods are provided for the determination of routes from, for instance, travel segment network data associated with different data versions. More particularly, a request can be received for a route from an origin to a destination. Graph data modeling a travel segment network for a geographic region associated with the origin and for a geographic region associated the destination can be accessed. The graph data can preserve boundary nodes for visiting during a search (e.g. a contraction hierarchies style search) for a shortest path through the graph data. The reach value of a boundary segment can be considered in identifying boundary segments to be visited during the shortest path search through the graph data. The route can be determined based at least in part on the shortest path.
Abstract translation: 提供系统和方法用于确定例如与不同数据版本相关联的旅行段网络数据的路线。 更具体地，可以接收从原点到目的地的路线的请求。 可以访问与原点相关联的地理区域以及与目的地相关联的地理区域的旅行分段网络的图形数据建模。 图形数据可以保留用于通过图形数据的最短路径的搜索期间的边界节点（例如收缩层次样式搜索）。 在通过图形数据的最短路径搜索期间，可以考虑边界段的到达值来识别要访问的边界段。 该路由可以至少部分地基于最短路径来确定。
-
公开(公告)号：US08738286B2
公开(公告)日：2014-05-27
申请号：US13797767
申请日：2013-03-12
Applicant: Google Inc.
Inventor： Hannah Bast , Erik Carlsson , Arno Eigenwillig , Robert Geisberger , Chris Harrelson , Veselin Raychev , Fabien Viger
CPC classification number: G01C21/3446 , G01C21/00 , G01C21/34 , G01C21/3423 , G01C21/343 , G06Q10/047
Abstract: A public transit travel planning system and methodology that uses an extensive pre-processing approach of transit information prior to query time on order to determine optimal public transit routes for journeys. At query time, since the transit information has already been processed by the system, very little computation is needed in order to fulfill the query. The system then provides users with public transit directions in response to the queries for public transit journeys.
Abstract translation: 一个公共交通旅行规划系统和方法，在查询时间之前使用广泛的过境信息预处理方法，以确定最佳的公共交通路线。 在查询时，由于传输信息已被系统处理，所以为了满足查询需要很少的计算。 该系统随后向公众提供公共交通路线，以响应公共交通工具的查询。
-
公开(公告)号：US20130184994A1
公开(公告)日：2013-07-18
申请号：US13789174
申请日：2013-03-07
Applicant: Google Inc.
Inventor： Hannah Bast , Erik Carlsson , Arno Eigenwillig , Robert Geisberger , Chris Harrelson , Veselin Raychev , Fabien Viger
IPC: G01C21/00
CPC classification number: G01C21/3446 , G01C21/00 , G01C21/34 , G01C21/3423 , G01C21/343 , G06Q10/047
Abstract: A public transit travel planning system and methodology that uses an extensive pre-processing approach of transit information prior to query time on order to determine optimal public transit routes for journeys. At query time, since the transit information has already been processed by the system, very little computation is needed in order to fulfill the query. The system then provides users with public transit directions in response to the queries for public transit journeys.
-
公开(公告)号：US20160341560A1
公开(公告)日：2016-11-24
申请号：US15228460
申请日：2016-08-04
Applicant: Google Inc.
Inventor： Robert Geisberger , Amo Eigenwillig
CPC classification number: G01C21/3446 , G01C21/20 , G06Q10/047 , G06Q50/30
Abstract: Systems and methods are provided for the determination of routes from, for instance, travel segment network data associated with different data versions. More particularly, a request can be received for a route from an origin to a destination. Graph data modeling a travel segment network for a geographic region associated with the origin and for a geographic region associated the destination can be accessed. The graph data can preserve boundary nodes for visiting during a search (e.g. a contraction hierarchies style search) for a shortest path through the graph data. The reach value of a boundary segment can be considered in identifying boundary segments to be visited during the shortest path search through the graph data. The route can be determined based at least in part on the shortest path.
-
Patent Agency Ranking
公开(公告)号：US09175972B2
公开(公告)日：2015-11-03
申请号：US14157913
申请日：2014-01-17
Applicant: Google Inc.
Inventor： Robert Geisberger
IPC: G01C21/34 , G06N5/00 , G08G1/0968
CPC classification number: G01C21/3492 , G01C21/3415 , G01C21/3446 , G06N5/003 , G08G1/096816 , G08G1/09685
Abstract: A computer-implemented route planning method comprises determining source and destination nodes in a graph data structure based on a route planning query, executing an initial graph search on the graph data structure using graph costs based on real-time traffic data, wherein the initial graph search starts at the source node and settles nodes until it stops, and computing one or more routes to the destination node from one or more of said settled nodes using precomputed data based on traffic prediction data, thereby to determine a route from the source node to the destination node via one of said settled nodes.
Abstract translation: 计算机实现的路线规划方法包括基于路线规划查询确定图形数据结构中的源节点和目的地节点，使用基于实时业务数据的图形成本对图形数据结构执行初始图形搜索，其中初始图 搜索从源节点开始，并且结算节点，直到其停止，并且使用基于业务预测数据的预计算数据，从一个或多个所述确定节点计算到目的地节点的一个或多个路由，从而确定从源节点到 目的地节点经由一个所述确定的节点。
-
公开(公告)号：US20180045523A1
公开(公告)日：2018-02-15
申请号：US15722036
申请日：2017-10-02
Applicant: Google Inc.
Inventor： Robert Geisberger , Amo Eigenwillig
CPC classification number: G01C21/3446 , G01C21/20 , G06Q10/047 , G06Q50/30
Abstract: Systems and methods are provided for the determination of routes from, for instance, travel segment network data associated with different data versions. More particularly, a request can be received for a route from an origin to a destination. Graph data modeling a travel segment network for a geographic region associated with the origin and for a geographic region associated the destination can be accessed. The graph data can preserve boundary nodes for visiting during a search (e.g. a contraction hierarchies style search) for a shortest path through the graph data. The reach value of a boundary segment can be considered in identifying boundary segments to be visited during the shortest path search through the graph data. The route can be determined based at least in part on the shortest path.
-
公开(公告)号：US09778052B2
公开(公告)日：2017-10-03
申请号：US15228460
申请日：2016-08-04
Applicant: Google Inc.
Inventor： Robert Geisberger , Amo Eigenwillig
CPC classification number: G01C21/3446 , G01C21/20 , G06Q10/047 , G06Q50/30
Abstract: Systems and methods are provided for the determination of routes from, for instance, travel segment network data associated with different data versions. More particularly, a request can be received for a route from an origin to a destination. Graph data modeling a travel segment network for a geographic region associated with the origin and for a geographic region associated the destination can be accessed. The graph data can preserve boundary nodes for visiting during a search (e.g. a contraction hierarchies style search) for a shortest path through the graph data. The reach value of a boundary segment can be considered in identifying boundary segments to be visited during the shortest path search through the graph data. The route can be determined based at least in part on the shortest path.
-
公开(公告)号：US20140200807A1
公开(公告)日：2014-07-17
申请号：US14157913
申请日：2014-01-17
Applicant: Google Inc.
Inventor： Robert Geisberger
IPC: G01C21/34
CPC classification number: G01C21/3492 , G01C21/3415 , G01C21/3446 , G06N5/003 , G08G1/096816 , G08G1/09685
Abstract: A computer-implemented route planning method comprises determining source and destination nodes in a graph data structure based on a route planning query, executing an initial graph search on the graph data structure using graph costs based on real-time traffic data, wherein the initial graph search starts at the source node and settles nodes until it stops, and computing one or more routes to the destination node from one or more of said settled nodes using precomputed data based on traffic prediction data, thereby to determine a route from the source node to the destination node via one of said settled nodes.
Abstract translation: 计算机实现的路线规划方法包括基于路线规划查询确定图形数据结构中的源节点和目的地节点，使用基于实时业务数据的图形成本对图形数据结构执行初始图形搜索，其中初始图形 搜索从源节点开始，并且结算节点，直到其停止，并且使用基于业务预测数据的预计算数据，从一个或多个所述确定节点计算到目的地节点的一个或多个路由，从而确定从源节点到 目的地节点经由一个所述确定的节点。
-
公开(公告)号：US08756014B2
公开(公告)日：2014-06-17
申请号：US13789174
申请日：2013-03-07
Applicant: Google Inc.
Inventor： Hannah Bast , Erik Carlsson , Arno Eigenwillig , Robert Geisberger , Chris Harrelson , Veselin Raychev , Fabien Viger
IPC: G01C21/00
CPC classification number: G01C21/3446 , G01C21/00 , G01C21/34 , G01C21/3423 , G01C21/343 , G06Q10/047
Abstract: A public transit travel planning system and methodology that uses an extensive pre-processing approach of transit information prior to query time on order to determine optimal public transit routes for journeys. At query time, since the transit information has already been processed by the system, very little computation is needed in order to fulfill the query. The system then provides users with public transit directions in response to the queries for public transit journeys.
-
-
-
-
-
-
-
-
-
Search Results
13
records
(took 0.018 seconds)
