利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

6 条记录 (耗时 0.027 秒)

    HEDGING RISK IN JOURNEY PLANNING
    1.
    发明申请
    HEDGING RISK IN JOURNEY PLANNING 有权
    在自己的计划中遇到风险

    公开(公告)号：US20140067254A1

    公开(公告)日：2014-03-06

    申请号：US13600996

    申请日：2012-08-31

    申请人： Michele Berlingerio ,  Adi I. Botea ,  Eric P. Bouillet ,  Francesco Calabrese ,  Lea A. Deleris ,  Donna L. Gresh ,  Olivier Verscheure

    发明人： Michele Berlingerio ,  Adi I. Botea ,  Eric P. Bouillet ,  Francesco Calabrese ,  Lea A. Deleris ,  Donna L. Gresh ,  Olivier Verscheure

    IPC分类号： G01C21/34

    CPC分类号： G01C21/36 ,  G01C21/26 ,  G01C21/3423 ,  G01C21/343 ,  G08G7/00

    摘要： Embodiments of the disclosure include a computer system for journey planning, the computer system includes a journey planning server configured to perform a method. The method includes receiving a journey planning request, the journey planning request having an origin and a destination in a transportation network. The method also includes calculating an optimized journey plan by identifying a plurality of routes through the transportation network from the origin to the destination and determining an uncertainty associated with each of the plurality of routes. Calculating an optimized journey plan also includes evaluating a robustness of each of the plurality of routes to the uncertainty associated with each of the plurality of routes and selecting the optimized journey plan based on the journey planning request and the robustness of each of the plurality of routes.

    摘要翻译： 本公开的实施例包括用于旅程规划的计算机系统，该计算机系统包括被配置为执行方法的行程规划服务器。 该方法包括接收旅程规划请求，旅程规划请求具有运输网络中的起点和目的地。 该方法还包括通过识别通过运输网络从原点到目的地的多条路线来计算优化的行驶计划，并且确定与多条路线中的每条路线相关联的不确定性。 计算优化的旅程计划还包括将多个路线中的每一条路线的鲁棒性评估为与多条路线中的每条路线相关联的不确定性，并且基于行程规划请求和多条路线中的每条路线的鲁棒性来选择优化的行驶计划 。

    HEDGING RISK IN JOURNEY PLANNING
    2.
    发明申请
    HEDGING RISK IN JOURNEY PLANNING 审中-公开
    在自己的计划中遇到风险

    公开(公告)号：US20140067251A1

    公开(公告)日：2014-03-06

    申请号：US13617065

    申请日：2012-09-14

    申请人： Michele Berlingerio ,  Adi I. Botea ,  Eric P. Bouillet ,  Francesco Calabrese ,  Lea A. Deleris ,  Donna L. Gresh ,  Olivier Verscheure

    发明人： Michele Berlingerio ,  Adi I. Botea ,  Eric P. Bouillet ,  Francesco Calabrese ,  Lea A. Deleris ,  Donna L. Gresh ,  Olivier Verscheure

    IPC分类号： G01C21/00

    CPC分类号： G01C21/36 ,  G01C21/26 ,  G01C21/3423 ,  G01C21/343 ,  G08G7/00

    摘要： Embodiments of the disclosure include a method for journey planning including receiving a journey planning request, the journey planning request having an origin and a destination in a transportation network. The method also includes calculating an optimized journey plan by identifying a plurality of routes through the transportation network from the origin to the destination and determining an uncertainty associated with each of the plurality of routes. Calculating an optimized journey plan also includes evaluating a robustness of each of the plurality of routes to the uncertainty associated with each of the plurality of routes and selecting the optimized journey plan based on the journey planning request and the robustness of each of the plurality of routes.

    摘要翻译： 本公开的实施例包括一种用于旅程规划的方法，包括接收旅程规划请求，行驶规划请求具有运输网络中的起点和目的地。 该方法还包括通过识别通过运输网络从原点到目的地的多条路线来计算优化的行驶计划，并且确定与多条路线中的每条路线相关联的不确定性。 计算优化的旅程计划还包括将多个路线中的每一条路线的鲁棒性评估为与多条路线中的每条路线相关联的不确定性，并且基于行程规划请求和多条路线中的每条路线的鲁棒性来选择优化的行驶计划 。

    Hedging risk in journey planning
    4.
    发明授权
    Hedging risk in journey planning 有权
    旅行计划中的对冲风险

    公开(公告)号：US09459108B2

    公开(公告)日：2016-10-04

    申请号：US13600996

    申请日：2012-08-31

    申请人： Michele Berlingerio ,  Adi I. Botea ,  Eric P. Bouillet ,  Francesco Calabrese ,  Lea A. Deleris ,  Donna L. Gresh ,  Olivier Verscheure

    发明人： Michele Berlingerio ,  Adi I. Botea ,  Eric P. Bouillet ,  Francesco Calabrese ,  Lea A. Deleris ,  Donna L. Gresh ,  Olivier Verscheure

    IPC分类号： G01C21/32 ,  G01C21/34 ,  G08G7/00

    CPC分类号： G01C21/36 ,  G01C21/26 ,  G01C21/3423 ,  G01C21/343 ,  G08G7/00

    摘要： Embodiments of the disclosure include a computer system for journey planning, the computer system includes a journey planning server configured to perform a method. The method includes receiving a journey planning request, the journey planning request having an origin and a destination in a transportation network. The method also includes calculating an optimized journey plan by identifying a plurality of routes through the transportation network from the origin to the destination and determining an uncertainty associated with each of the plurality of routes. Calculating an optimized journey plan also includes evaluating a robustness of each of the plurality of routes to the uncertainty associated with each of the plurality of routes and selecting the optimized journey plan based on the journey planning request and the robustness of each of the plurality of routes.

    摘要翻译： 本公开的实施例包括用于旅程规划的计算机系统，该计算机系统包括被配置为执行方法的行程规划服务器。 该方法包括接收旅程规划请求，旅程规划请求具有运输网络中的起点和目的地。 该方法还包括通过识别通过运输网络从原点到目的地的多条路线来计算优化的行驶计划，并且确定与多条路线中的每条路线相关联的不确定性。 计算优化的旅程计划还包括将多个路线中的每一条路线的鲁棒性评估为与多条路线中的每条路线相关联的不确定性，并且基于行程规划请求和多条路线中的每条路线的鲁棒性选择优化的行驶计划 。

    Journey computation with re-planning based on events in a transportation network
    5.
    发明授权
    Journey computation with re-planning based on events in a transportation network 有权
    根据运输网络中的事件进行重新规划的旅程计算

    公开(公告)号：US09304006B2

    公开(公告)日：2016-04-05

    申请号：US13600903

    申请日：2012-08-31

    申请人： Michele Berlingerio ,  Adi I. Botea ,  Eric P. Bouillet ,  Francesco Calabrese ,  Olivier Verscheure

    发明人： Michele Berlingerio ,  Adi I. Botea ,  Eric P. Bouillet ,  Francesco Calabrese ,  Olivier Verscheure

    IPC分类号： G01C21/00 ,  G01C21/34

    CPC分类号： G01C21/3423 ,  G01C21/3415

    摘要： Embodiments of the disclosure include a method for journey planning including receiving a journey planning request. The request includes an origin and a destination in a transportation network. The method also includes calculating an optimized journey plan based on the journey planning request and a route map corresponding to the transportation network and identifying a potential event in the transportation. The method further includes monitoring the transportation network for the potential event and based on detecting an execution of the potential event, calculating an improved journey plan.

    摘要翻译： 本公开的实施例包括用于旅程规划的方法，包括接收旅程规划请求。 该请求包括运输网络中的起点和目的地。 该方法还包括基于旅程规划请求和对应于运输网络的路线图计算优化的旅行计划，并识别交通中的潜在事件。 该方法还包括监测潜在事件的运输网络，并且基于检测到潜在事件的执行，计算改进的行驶计划。

    JOURNEY COMPUTATION WITH RE-PLANNING BASED ON EVENTS IN A TRANSPORTATION NETWORK
    6.
    发明申请
    JOURNEY COMPUTATION WITH RE-PLANNING BASED ON EVENTS IN A TRANSPORTATION NETWORK 有权
    根据运输网络中的事件进行重新规划的计划

    公开(公告)号：US20140067266A1

    公开(公告)日：2014-03-06

    申请号：US13600903

    申请日：2012-08-31

    申请人： Michele Berlingerio ,  Adi I. Botea ,  Eric P. Bouillet ,  Francesco Calabrese ,  Olivier Verscheure

    发明人： Michele Berlingerio ,  Adi I. Botea ,  Eric P. Bouillet ,  Francesco Calabrese ,  Olivier Verscheure

    IPC分类号： G01C21/00

    CPC分类号： G01C21/3423 ,  G01C21/3415

    摘要： Embodiments of the disclosure include a method for journey planning including receiving a journey planning request. The request includes an origin and a destination in a transportation network. The method also includes calculating an optimized journey plan based on the journey planning request and a route map corresponding to the transportation network and identifying a potential event in the transportation. The method further includes monitoring the transportation network for the potential event and based on detecting an execution of the potential event, calculating an improved journey plan.

    摘要翻译： 本公开的实施例包括用于旅程规划的方法，包括接收旅程规划请求。 该请求包括运输网络中的起点和目的地。 该方法还包括基于旅程规划请求和对应于运输网络的路线图计算优化的旅行计划，并识别交通中的潜在事件。 该方法还包括监测潜在事件的运输网络，并且基于检测到潜在事件的执行，计算改进的行驶计划。