公开(公告)号：US09273970B2

公开(公告)日：2016-03-01

申请号：US13894025

申请日：2013-05-14

Applicant: Google Inc.

Inventor： Albert Graells ,  Lucien Pech

IPC: G01C21/00 ,  G01C21/26 ,  G01C22/02 ,  G08G1/0968 ,  G01C21/34 ,  G01C22/00

CPC classification number: G01C21/26 ,  G01C21/00 ,  G01C21/34 ,  G01C21/3423 ,  G01C22/002 ,  G01C22/02 ,  G08G1/096844

Abstract: Systems and methods for generating a plurality of trip patterns are provided. One exemplary method includes receiving transit graph data describing a plurality of nodes respectively corresponding to a plurality of transit stations and a plurality of arcs respectively connecting the plurality of nodes. The method also includes performing a plurality of identification iterations. Each identification iteration includes determining an optimal transit trip connecting an origin node to a destination node based on a cost model. Each identification iteration also includes revising the cost model based on the determined optimal transit trip, such that the arc costs associated with one or more arcs associated with the optimal transit trip are increased. Each optimal transit trip can have an associated trip pattern describing a sequence of nodes traversed by such optimal transit trip. One exemplary system can include a transit planning platform that includes a trip pattern identification module.

Abstract translation: 提供了用于产生多个行程模式的系统和方法。 一种示例性方法包括：接收描述分别对应于多个中转站的多个节点的转接图数据和分别连接多个节点的多个弧。 该方法还包括执行多个识别迭代。 每个识别迭代包括基于成本模型来确定将原始节点连接到目的地节点的最佳传输跳闸。 每个识别迭代还包括基于确定的最佳传输跳闸修改成本模型，使得与与最佳传输跳闸相关联的一个或多个弧相关联的电弧成本增加。 每个最佳传输跳闸可以具有描述通过这种最佳传输跳闸所遍历的节点序列的相关行程模式。 一个示例性系统可以包括包括跳闸模式识别模块的运输计划平台。

公开(公告)号：US20150170063A1

公开(公告)日：2015-06-18

申请号：US13893961

申请日：2013-05-14

Applicant: Google Inc.

Inventor： Albert Graells ,  Lucien Pech

IPC: G06Q10/02

CPC classification number: G06Q10/025

Abstract: Systems and methods for pattern based transit routing are provided. One exemplary method includes determining a plurality of trip patterns between an origin and a destination responsive to a user request. Trips for each of the plurality of trip patterns are generated, each trip corresponding to an instance of transportation. The trips are filtered. Each trip in the filtered trips is annotated with transit data. Responsive to a user request, one or more trips are selected from the annotated trips based upon the transit data associated with each respective trip, the user request, or combinations thereof.

Abstract translation: 提供了基于模式的传输路由的系统和方法。 一种示例性方法包括响应于用户请求确定原点和目的地之间的多个行程模式。 产生用于多个行程模式中的每一个的行程，每个行程对应于运输的一个实例。 旅行过滤。 过滤旅程中的每个行程都用传输数据进行注释。 基于用户请求，基于与每个相应行程，用户请求或其组合相关联的传输数据，从注释的行程中选择一个或多个行程。

公开(公告)号：US08972185B1

公开(公告)日：2015-03-03

申请号：US13632472

申请日：2012-10-01

Applicant: Google Inc.

Inventor： Fabien Viger ,  Lucien Pech

IPC: G01C21/34

CPC classification number: G01C21/3446 ,  G01C21/3423 ,  G06F17/30958 ,  G06Q10/047

Abstract: A computer-implemented method of constructing a transit transfer network from transit data comprises processing transit data to define a plurality of transfer endpoints; determining a set of acceptable transfer durations for each of a plurality of transfers associated with the transfer endpoints; determining one or more groups of endpoints to be merged, each group comprising two or more endpoints, wherein transfers associated with the endpoints in each said group have one or more common acceptable transfer durations; and merging the endpoints in each group to form one or more merged endpoints.

Abstract translation: 从运输数据构建过境转运网络的计算机实现的方法包括处理过境数据以定义多个转移端点; 确定与所述传送端点相关联的多个传输中的每一个的可接受转移持续时间的集合; 确定要合并的一个或多个端点组，每个组包括两个或更多个端点，其中与每个所述组中的端点相关联的传输具有一个或多个公共可接受传输持续时间; 并合并每个组中的端点以形成一个或多个合并的端点。

公开(公告)号：US20140343852A1

公开(公告)日：2014-11-20

申请号：US13893947

申请日：2013-05-14

Applicant: Google Inc.

Inventor： Lucien Pech ,  Albert Graells

IPC: G01C21/00

CPC classification number: G01C21/3423

Abstract: Systems and methods for recommending time independent or “guidebook” transit routes between an origin and a destination are provided. A score is generated for each transit route. The score can be used to evaluate and prioritize the transit routes so that one or more transit routes can be recommended to a user. The score can be computed based on characteristics of a trip duration function generated for the transit route. The trip duration function specifies a trip cost (e.g. a trip duration) for the transit route as a function of time (such as departure time or arrival time) over the time interval. The trip duration function can be a piecewise linear function with one or more linear trip segments. Each linear trip segment models the trip cost, including waiting time, of a transit trip associated with the transit route over at least a portion of the time interval.

Abstract translation: 提供了在原点和目的地之间建议时间无关或“指南”过境路线的系统和方法。 每个过境路线都会产生分数。 该分数可用于评估和优先处理运输路线，以便向用户推荐一条或多条运输路线。 可以基于为过境路线生成的行程持续时间函数的特征来计算得分。 跳闸持续时间功能指定在时间间隔内作为时间的函数（例如出发时间或到达时间）的中转路线的行程费用（例如，行程持续时间）。 跳闸持续时间功能可以是具有一个或多个线性跳闸段的分段线性函数。 每个线性跳闸段在时间间隔的至少一部分上模拟与传输路由相关联的传输跳闸的行程成本，包括等待时间。

公开(公告)号：US09217647B2

公开(公告)日：2015-12-22

申请号：US13893947

申请日：2013-05-14

Applicant: Google Inc.

Inventor： Lucien Pech ,  Albert Graells

IPC: G01C21/00 ,  G01C21/34

CPC classification number: G01C21/3423

Abstract: Systems and methods for recommending time independent or “guidebook” transit routes between an origin and a destination are provided. A score is generated for each transit route. The score can be used to evaluate and prioritize the transit routes so that one or more transit routes can be recommended to a user. The score can be computed based on characteristics of a trip duration function generated for the transit route. The trip duration function specifies a trip cost (e.g. a trip duration) for the transit route as a function of time (such as departure time or arrival time) over the time interval. The trip duration function can be a piecewise linear function with one or more linear trip segments. Each linear trip segment models the trip cost, including waiting time, of a transit trip associated with the transit route over at least a portion of the time interval.

Abstract translation: 提供了在原点和目的地之间建议时间无关或“指南”过境路线的系统和方法。 每个过境路线都会产生分数。 该分数可用于评估和优先处理运输路线，以便向用户推荐一条或多条运输路线。 可以基于为过境路线生成的行程持续时间函数的特征来计算得分。 跳闸持续时间功能指定在时间间隔内作为时间的函数（例如出发时间或到达时间）的中转路线的行程费用（例如，行程持续时间）。 跳闸持续时间功能可以是具有一个或多个线性跳闸段的分段线性函数。 每个线性跳闸段在时间间隔的至少一部分上模拟与传输路由相关联的传输跳闸的行程成本，包括等待时间。

公开(公告)号：US20150168148A1

公开(公告)日：2015-06-18

申请号：US13894002

申请日：2013-05-14

Applicant: Google Inc.

Inventor： Lucien Pech ,  Albert Graells

IPC: G01C21/00

CPC classification number: G01C21/343 ,  G01C21/3423

Abstract: Systems and methods for recommending time independent or “guidebook” transit routes between an origin and a destination are provided. Inputs of a trip pattern, an interval of times, and the timetables of the trips of the trip pattern, can result in output of a list of all considered trips (including departure time and duration thereof) and a list of lines for each transit step.

Abstract translation: 提供了在原点和目的地之间建议时间无关或“指南”过境路线的系统和方法。 旅行模式的输入，时间间隔和旅行模式的行程的时间表可以导致所有考虑的行程（包括出发时间和持续时间）的列表的输出以及每个过境步骤的行列表 。

公开(公告)号：US20140343974A1

公开(公告)日：2014-11-20

申请号：US13893910

申请日：2013-05-14

Applicant: Google Inc.

Inventor： Albert Graells ,  Lucien Pech

IPC: G06Q10/02

CPC classification number: G06Q10/02

Abstract: Systems and methods for filtering an initial set of transit trips between an origin and a destination to identify a subset of reasonable transit trips between the origin and the destination are provided. Once identified, the subset of reasonable transit trips can be further analyzed based on various criteria (e.g. earliest arrival, lowest price, least amount of waking, least number of transfers, etc.) to recommend one or more transit trips to a user. The subset of reasonable transit trips can be identified by obtaining transit trip data suitable for identifying a trip duration (e.g. departure time and arrival time) for each trip in the initial set of transit trips. This transit trip data can be used to filter out trips from the set that do not provide an optimal trip duration at some specific time over a time interval.

Abstract translation: 提供了用于过滤原始和目的地之间的初始传输跳闸集合的系统和方法，以识别原点和目的地之间的合理过境跳闸的子集。 一旦确定，可以基于各种标准（例如最早到达，最低价格，最少的唤醒，最少的转移等）来进一步分析合理的中转行程的子集，以向用户推荐一个或多个过境旅行。 可以通过获得适合于识别在初始的一组中转行程中的每个行程的行程持续时间（例如，出发时间和到达时间）的转接行程数据来识别合理的过境行程的子集。 该传输跳闸数据可以用于过滤掉在一段时间内在特定时间内不提供最佳跳闸持续时间的组中的跳闸。

公开(公告)号：US20150168149A1

公开(公告)日：2015-06-18

申请号：US13894025

申请日：2013-05-14

Applicant: Google Inc.

Inventor： Albert Graells ,  Lucien Pech

IPC: G01C21/00

CPC classification number: G01C21/26 ,  G01C21/00 ,  G01C21/34 ,  G01C21/3423 ,  G01C22/002 ,  G01C22/02 ,  G08G1/096844

Abstract: Systems and methods for generating a plurality of trip patterns are provided. One exemplary method includes receiving transit graph data describing a plurality of nodes respectively corresponding to a plurality of transit stations and a plurality of arcs respectively connecting the plurality of nodes. The method also includes performing a plurality of identification iterations. Each identification iteration includes determining an optimal transit trip connecting an origin node to a destination node based on a cost model. Each identification iteration also includes revising the cost model based on the determined optimal transit trip, such that the arc costs associated with one or more arcs associated with the optimal transit trip are increased. Each optimal transit trip can have an associated trip pattern describing a sequence of nodes traversed by such optimal transit trip. One exemplary system can include a transit planning platform that includes a trip pattern identification module.

Abstract translation: 提供了用于产生多个行程模式的系统和方法。 一种示例性方法包括接收描述分别对应于多个中转站的多个节点的转接图数据和分别连接多个节点的多个弧。 该方法还包括执行多个识别迭代。 每个识别迭代包括基于成本模型来确定将原始节点连接到目的地节点的最佳传输跳闸。 每个识别迭代还包括基于确定的最佳传输跳闸修改成本模型，使得与与最佳传输跳闸相关联的一个或多个弧相关联的电弧成本增加。 每个最佳传输跳闸可以具有描述通过这种最佳传输跳闸所遍历的节点序列的相关行程模式。 一个示例性系统可以包括包括跳闸模式识别模块的运输计划平台。

公开(公告)号：US08972190B1

公开(公告)日：2015-03-03

申请号：US13893983

申请日：2013-05-14

Applicant: Google Inc.

Inventor： Lucien Pech ,  Albert Graells

IPC: G01C21/00

CPC classification number: G06Q10/047

Abstract: Systems and methods for generating transit trips between an origin and a destination are provided. Searches can be undertaken to identify optimal departure times from a source station and/or one or more intermediate stations while maintaining a lowest cost arrival time at a destination station. In this manner, public transportation journey schedules for routes can be determined and recommendations can be provided even if different journey schedules show identical costs.

Abstract translation: 提供了在原点和目的地之间生成中转的系统和方法。 可以进行搜索来确定来自源站和/或一个或多个中间站的最佳出发时间，同时在目的地站处保持最低成本到达时间。 以这种方式，可以确定路线的公共交通行程时间表，即使不同的行程时间表显示相同的成本，也可以提供建议。