Hedging risk in journey planning

US9829334B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-9829334-B2
Application numberUS-201213617065-A
CountryUS
Kind codeB2
Filing dateSep 14, 2012
Priority dateAug 31, 2012
Publication dateNov 28, 2017
Grant dateNov 28, 2017

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

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.

First claim

Opening claim text (preview).

What is claimed is: 1. A method for journey planning through a multi-modal transportation system, the method comprising: receiving a journey planning request, the journey planning request comprising an origin and a destination in the multi-modal transportation network; receiving and storing information from the multi-modal transportation network regarding a state of one or more pieces of transportation equipment in the multi-modal transportation network, wherein the state of one or more pieces of equipment comprises at least one of on-schedule, off-schedule, and out-of-service; calculating, by a processor, an optimized journey plan, wherein calculating the optimized journey plan comprises: identifying a plurality of routes through the multi-modal transportation network from the origin to the destination; determining an uncertainty associated with each of the plurality of routes, wherein the uncertainty comprises a variability of a travel time along each route, wherein the variability is based on an expected travel time, a mode travel time, a median travel time and a standard deviation; 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. 2. The method of claim 1 , wherein the journey planning request further comprises an optimization request and wherein selecting the optimized journey plan is further based on the optimization request. 3. The method of claim 2 , the optimization request comprises a worst case arrival time. 4. The method of claim 2 , the optimization request comprises a most consistent arrival time. 5. The method of claim 1 , wherein determining an uncertainty associated with each of the plurality of routes is based on a historical data associated with the multi-modal transportation network. 6. The method of claim 1 , wherein evaluating a robustness of each of the plurality of routes to the uncertainty associated with each of the plurality of routes includes determining a worst case travel time for each of the plurality of routes and an expected travel time for each of the plurality of routes. 7. The method of claim 1 , wherein at least one of the plurality of routes through the multi-modal transportation network from the origin to the destination includes multiple contingent branches.

Assignees

Inventors

Classifications

  • G01C21/36Primary

    Input/output arrangements for on-board computers · CPC title

  • Calculating itineraries (travelling salesman problem G06Q10/04; optimisation of routes G06Q10/047) · CPC title

  • Multimodal routing · CPC title

  • specially adapted for navigation in a road network · CPC title

  • Traffic control systems for simultaneous control of two or more different kinds of craft · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US9829334B2 cover?
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…
Who is the assignee on this patent?
Berlingerio Michele, Botea Adi I, Bouillet Eric P, and 5 more
What technology area does this patent fall under?
Primary CPC classification G01C21/36. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Nov 28 2017 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).