公开(公告)号：US20160341560A1

公开(公告)日：2016-11-24

申请号：US15228460

申请日：2016-08-04

Applicant: Google Inc.

Inventor： Robert Geisberger ,  Amo Eigenwillig

IPC: G01C21/34 ,  G01C21/20

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.

公开(公告)号：US10288437B2

公开(公告)日：2019-05-14

申请号：US15722036

申请日：2017-10-02

Applicant: Google Inc.

Inventor： Robert Geisberger ,  Amo Eigenwillig

IPC: G01C21/34 ,  G01C21/20 ,  G06Q10/04 ,  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.

公开(公告)号：US20180045523A1

公开(公告)日：2018-02-15

申请号：US15722036

申请日：2017-10-02

Applicant: Google Inc.

Inventor： Robert Geisberger ,  Amo Eigenwillig

IPC: G01C21/34 ,  G06Q50/30 ,  G01C21/20 ,  G06Q10/04

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

IPC: G01C21/34 ,  G01C21/20 ,  G06Q10/04 ,  G06Q50/30

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.