Incentivizing human travel patterns to reduce traffic congestion

• US 10,325,332 B2
• Filed: 12/30/2015
• Issued: 06/18/2019
• Est. Priority Date: 12/30/2015
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Kalyanaraman, Shivkumar, Kokku, Ravindranath, Steer, Kent
• Primary Examiner(s): Stoltenberg, David J
• Application Number:
  US14/984,718
• Publication Number:
  US 20170193614A1
• Time in Patent Office: 1,266 Days
• Field of Search: None
• CPC Class Codes: G06Q 30/0239 Online discounts or incentives
• CPC Class Codes: G06Q 50/14 Travel agencies

Abstract

A system for incentivizing travel patterns to reduce traffic congestion includes a negotiator that receives a travel template from a traveler, transmits a set of journey options to the traveler, receives a journey selected from the journey options, and sends a journey contract to the traveler based on the selected journey, a journey generator that determines the set of journey options based on the travel template, the traveler'"'"'s historical behavior, and current network conditions, a rewards engine that calculates the reward associated with each journey option based on a reduction in cost for the journey, a location arbitrator that receives location information from the traveler as the travelers performs the journey in the journey contract, and a verification engine that verifies, whether the traveler'"'"'s journey complied the terms of the journey contract, and determines the traveler'"'"'s reward as calculated by the rewards engine based on a degree of compliance with the contract.

Claims

1. A method for incentivizing travel patterns, comprising the steps of:

receiving by a server from a mobile computing device of a user a travel template for an expected journey that includes an origin, a destination, and a time window for the journey;

comparing, by the server, the travel template to current and forecasted travel conditions during said time window on a travel network that connects the origin and destination to determine a reward for each of a plurality of paths connecting the origin and destination during said time period, wherein determining a reward for each of the plurality of paths connecting the origin and destination during said time period comprises calculating ψ

(c′

−

c_x), where ψ

(⋅

) is a non-decreasing function, c_x is a cost associated with path x, and c′

=φ

(x′

, M_x) wherein x′

represents the expected journey, and M_x represents a graph of a road network connecting the origin and destination of the expected journey, wherein connections between graph vertices are weighted based on a current or forecasted traffic load, and φ

( ) is a cost function which quantifies an impact of expected journey x′

on the network given a network forecast M_x;

transmitting each path and an associated reward from the server to the mobile computing device of the user;

receiving, by the server from the mobile computing device of the user a decision regarding the plurality of paths and the associated rewards;

transmitting a confirmation of a journey contract from the server to the mobile computing device of the user, if the user has selected one of the plurality of paths and its associated reward as the path for the user'"'"'s journey;

verifying, by the server, performance of the user'"'"'s journey contract by receiving verification that the user has passed through a threshold number of locations associated with mobile phone base stations that correspond to a path of the contracted journey within specified time windows; and

transmitting a reward from the server to the mobile computing device of the user based on the journey contract, upon verifying that the user has passed through a threshold number of locations.

2. The method of claim 1, further comprising receiving by the server from the mobile computing device of the user a request for more path options, if the user rejects all of the plurality of paths.

3. The method of claim 1, further comprising receiving by the server a list of mobile phone base stations that correspond to a path for the contracted journey, wherein the contracted journey is decomposed into a finite list of locations, each associated with a mobile phone base station, and each associated with a specified time window.

4. The method of claim 3, wherein receiving a list of mobile phone base stations further comprises transmitting path information about the contracted journey to a mobile phone service provider, and receiving the list of phone base stations that correspond to the path from the mobile phone service provider.

5. The method of claim 3, wherein receiving a list of mobile phone base stations further comprises receiving a list from a mobile phone service provider of all mobile phone base stations in a geographic vicinity of the contracted journey, and selecting those mobile phone base stations that correspond to the path of the contracted journey.

6. The method of claim 3, wherein verifying that the user has passed through a threshold number of locations comprises receiving a list of time-stamps from each mobile phone base station passed that were recorded using a location service on the user'"'"'s mobile phone.

7. The method of claim 3, wherein verifying that the user has passed through a threshold number of locations comprises receiving a verification signal from the user that indicates whether the user'"'"'s phone was at the contracted base station locations during the contracted time windows within an agreed margin of error.

8. A system for incentivizing travel patterns, comprising:

a negotiator that receives a travel template from a traveler'"'"'s mobile application, transmits a set of journey options to the traveler, receives a journey selected from the journey options, and sends a journey contract to the traveler based on the selected journey, wherein the travel template includes an origin, a destination and an approximate departure/arrival time, wherein each journey option specifies a route from the origin to the destination associated with a start time or time window and a reward, and the journey contract is a selected journey option;

a journey generator that determines the set of journey options based on the travel template, the traveler'"'"'s historical behavior, and current network conditions;

a rewards engine that calculates the reward associated with each journey option based on a reduction in cost for the journey by calculating ψ

(c′

−

c_x), where ψ

(⋅

) is a non-decreasing function, c_x is a cost associated with journey x, and c′

=φ

(x′

, M_x) wherein x′

represents an expected journey, and M_x represents a graph of a road network connecting the origin and destination of the expected journey, wherein connections between graph vertices are weighted based on a current or forecasted traffic load, and φ

( ) is a cost function which quantifies an impact of expected journey x′

on the network given a network forecast M_x;

a location arbitrator that receives location information from the traveler as the travelers performs the journey specified in the journey contract; and

a verification engine that receives location information from the location arbitrator and verifies, based on the location information, whether the traveler'"'"'s journey complied the terms of the journey contract, and determines the traveler'"'"'s reward as calculated by the rewards engine based on a degree of compliance with the contract, and upon verifying that the user has passed through a threshold number of locations, transmits a reward to the user based on the journey contract.

9. The system of claim 8, further comprising a normal behavior model that is used by the journey generator to determine a reward for each journey option, wherein the reduction in cost is determined with respect to a normal behavior pattern for the journey option.

10. The system of claim 8, wherein the location arbitrator receives a list of mobile phone base stations that correspond to the contracted journey, wherein the contracted journey is decomposed into a finite list of locations, each associated with a mobile phone base station, and each associated with a specified time window.

11. The system of claim 10, wherein the verification engine verifies whether the traveler'"'"'s journey complied the terms of the journey contract by determining whether the user has passed through a threshold number of locations associated with those mobile phone base stations that correspond to the path of the contracted journey within the specified time windows.

12. A non-transitory program storage device readable by a computer, tangibly embodying a program of instructions executed by the computer to perform the method steps for incentivizing travel patterns, the method comprising the steps of:

receiving by a server from a mobile computing device of a user a travel template for an expected journey that includes an origin, a destination, and a time window for the journey;

comparing, by the server, the travel template to current and forecasted travel conditions during said time window on a travel network that connects the origin and destination to determine a reward for each of a plurality of paths connecting the origin and destination during said time period, wherein determining a reward for each of the plurality of paths connecting the origin and destination during said time period comprises calculating ψ

(c′

−

c_x), where ψ

(⋅

) is a non-decreasing function, c_x is a cost associated with path x, and c′

=φ

(x′

, M_x) wherein x′

represents the expected journey, and M_x represents a graph of a road network connecting the origin and destination of the expected journey, wherein connections between graph vertices are weighted based on a current or forecasted traffic load, and φ

( ) is a cost function which quantifies an impact of expected journey x′

on the network given a network forecast M_x;

transmitting each path and an associated reward from the server to the mobile computing device of the user;

receiving by the server from the mobile computing device of the user a decision regarding the plurality of paths and the associated rewards;

transmitting a confirmation of a journey contract from the server to the mobile computing device of the user, if the user has selected one of the plurality of paths and its associated reward as the path for the user'"'"'s journey;

verifying, by the server, performance of the user'"'"'s journey contract by receiving verification that the user has passed through a threshold number of locations associated with mobile phone base stations that correspond to a path of the contracted journey within specified time windows; and

transmitting a reward from the server to the mobile computing device of the user based on the journey contract, upon verifying that the user has passed through a threshold number of locations.

13. The computer readable program storage device of claim 12, the method further comprising receiving by the server a list of mobile phone base stations that correspond to a path for the contracted journey, wherein the contracted journey is decomposed into a finite list of locations, each associated with a mobile phone base station, and each associated with a specified time window.