Patent US 20110208419A1

First Claim

Please sign in to see patent images.

Patent Images

1. . A method for optimizing routes, comprising:

receiving a request for a route from a requester;

determining an optimized route and a potential position of the requester within the optimized route based on the request;

providing a proposal in response to the request, the proposal comprising the optimized route and the potential position; and

receiving a response to the proposal.

View all claims

1 Assignment

Timeline View

Assignment View

0 Petitions

Accused Products

Abstract

In general, the present invention relates to route optimization/prediction. In one embodiment, the present invention provides visibility to future predicted traffic situations, based on all reserved routes in a system at a given point in time. This allows city planners, for example, to know where traffic will be to adjust traffic flow accordingly. Additional value comes into play by being able to calculate and publish aggregated savings from using this system, such as driver time, mileage, and gas. This information may be added to a database and made available to individuals via their GPS. In a typical implementation, a request for a route is received from a requester. Based on the request, an optimized route and a potential position of the requester within the optimized route are determined and then proposed to the requester. The requester can then select an option from the proposal.

51 Citations
View as Search Results

21 Forward Citations

30 References Cited

RECOMMENDING POINTS OF INTERESTS IN A REGION
Patent # US 20110093458A1 Filed 09/25/2009	Current Assignee Microsoft Technology Licensing LLC	Sponsoring Entity Microsoft Technology Licensing LLC

Mining Correlation Between Locations Using Location History
Patent # US 20110208425A1 Filed 02/23/2010	Current Assignee Microsoft Technology Licensing LLC	Sponsoring Entity Microsoft Technology Licensing LLC

Detecting Spatial Outliers in a Location Entity Dataset
Patent # US 20100179759A1 Filed 01/14/2009	Current Assignee Microsoft Technology Licensing LLC	Sponsoring Entity Microsoft Technology Licensing LLC

SYSTEM FOR LOGGING LIFE EXPERIENCES USING GEOGRAPHIC CUES
Patent # US 20090216435A1 Filed 02/26/2008	Current Assignee Microsoft Technology Licensing LLC	Sponsoring Entity Microsoft Technology Licensing LLC

MITIGATION OF CONGESTION IN USE OF A CAPACITY CONSTRAINED RESOURCE BY PROVIDING INCENTIVES
Patent # US 20120226532A1 Filed 03/01/2012	Current Assignee Board of Trustees of the Leland Stanford Junior University	Sponsoring Entity Board of Trustees of the Leland Stanford Junior University

Collaborative location and activity recommendations
Patent # US 8,719,198 B2 Filed 05/04/2010	Current Assignee Microsoft Technology Licensing LLC	Sponsoring Entity Microsoft Technology Licensing LLC

SYSTEM FOR EXCHANGING JOBS AND TRIP INFORMATION TO REDUCE DRIVING AND PROMOTE SAVING GASOLINE
Patent # US 20140297549A1 Filed 12/24/2013	Current Assignee Mavi Yvonne Macfarlane, Elizabeth Lauren Ashe	Sponsoring Entity Mavi Yvonne Macfarlane, Elizabeth Lauren Ashe

Client-side management of domain name information
Patent # US 8,966,121 B2 Filed 03/03/2008	Current Assignee Microsoft Technology Licensing LLC	Sponsoring Entity Microsoft Technology Licensing LLC

System for logging life experiences using geographic cues
Patent # US 8,972,177 B2 Filed 02/26/2008	Current Assignee Microsoft Technology Licensing LLC	Sponsoring Entity Microsoft Technology Licensing LLC

Recommending points of interests in a region
Patent # US 9,009,177 B2 Filed 09/25/2009	Current Assignee Microsoft Technology Licensing LLC	Sponsoring Entity Microsoft Technology Licensing LLC

Detecting spatial outliers in a location entity dataset
Patent # US 9,063,226 B2 Filed 01/14/2009	Current Assignee Microsoft Technology Licensing LLC	Sponsoring Entity Microsoft Technology Licensing LLC

Route computation based on route-oriented vehicle trajectories
Patent # US 9,261,376 B2 Filed 02/24/2010	Current Assignee Uber Technologies Inc.	Sponsoring Entity Microsoft Technology Licensing LLC

Recommending points of interests in a region
Patent # US 9,501,577 B2 Filed 03/16/2015	Current Assignee Microsoft Technology Licensing LLC	Sponsoring Entity Microsoft Technology Licensing LLC

Determine spatiotemporal causal interactions in data
Patent # US 9,536,146 B2 Filed 12/31/2014	Current Assignee Microsoft Technology Licensing LLC	Sponsoring Entity Microsoft Technology Licensing LLC

Searching similar trajectories by locations
Patent # US 9,593,957 B2 Filed 06/04/2010	Current Assignee Microsoft Technology Licensing LLC	Sponsoring Entity Microsoft Technology Licensing LLC

Learning transportation modes from raw GPS data
Patent # US 9,683,858 B2 Filed 11/12/2012	Current Assignee Microsoft Technology Licensing LLC	Sponsoring Entity Microsoft Technology Licensing LLC

Urban computing of route-oriented vehicles
Patent # US 9,754,226 B2 Filed 12/13/2011	Current Assignee Microsoft Technology Licensing LLC	Sponsoring Entity Microsoft Technology Licensing LLC

Intelligent routing method for routing items through a network
Patent # US 10,237,167 B2 Filed 01/26/2016	Current Assignee Bobsweep Inc.	Sponsoring Entity Bobsweep Inc.

Management of moving objects
Patent # US 10,262,529 B2 Filed 04/10/2017	Current Assignee HCL Technologies Limited	Sponsoring Entity HCL Technologies Limited

Map-matching for low-sampling-rate GPS trajectories
Patent # US 10,288,433 B2 Filed 02/25/2010	Current Assignee Microsoft Technology Licensing LLC	Sponsoring Entity Microsoft Technology Licensing LLC

Management of mobile objects
Patent # US 10,339,810 B2 Filed 02/23/2018	Current Assignee International Business Machines Corporation	Sponsoring Entity International Business Machines Corporation

View All

Assigning and managing patron reservations for distributed services using wireless personal communication devices
Patent # US 7,895,066 B2 Filed 02/24/2009	Current Assignee Lo-Q PLC	Sponsoring Entity Lo-Q PLC

Combination reservation and navigation system and method
Patent # US 7,966,215 B1 Filed 09/08/1999	Current Assignee Uber Technologies Inc.	Sponsoring Entity ATT Intellectual Property I LP

System and Method for Coordinating Movement of Mobile Drive Units
Patent # US 20110130954A1 Filed 02/07/2011	Current Assignee Amazon Technologies	Sponsoring Entity Amazon Technologies

Methods, systems and computer program products for ride matching based on selection criteria and driver characteristic information
Patent # US 7,941,267 B2 Filed 10/20/2009	Current Assignee Uber Technologies Inc.	Sponsoring Entity ATT Intellectual Property I LP

Method and system for selective route search on satellite navigators
Patent # US 7,483,786 B1 Filed 05/15/2008	Current Assignee International Business Machines Corporation	Sponsoring Entity International Business Machines Corporation

Navigation system, server, method, and program
Patent # US 20090043488A1 Filed 07/25/2008	Current Assignee Aisin AW Corporation Limited	Sponsoring Entity -

System and method for predicting travel time for a travel route
Patent # US 7,508,321 B2 Filed 08/15/2006	Current Assignee Uber Technologies Inc.	Sponsoring Entity Triangle Software LLC

Assigning and managing patron reservations for distributed services using wireless personal communication devices
Patent # US 7,516,148 B2 Filed 06/03/2004	Current Assignee Lo-Q PLC	Sponsoring Entity PalmTop Productions Inc.

SHARED MULTI-TENANT COMMUTING MANAGEMENT
Patent # US 20080021723A1 Filed 07/24/2007	Current Assignee DEVARAKONDA MURALI KRISHNA	Sponsoring Entity DEVARAKONDA MURALI KRISHNA

Personalized Parking and Reservation System
Patent # US 20080033769A1 Filed 08/01/2007	Current Assignee Slosar Jeff, Chhittoor Venketaraman, Koorapati Sailendra	Sponsoring Entity Slosar Jeff, Chhittoor Venketaraman, Koorapati Sailendra

Traffic routing based on segment travel time
Patent # US 7,375,649 B2 Filed 08/24/2006	Current Assignee Uber Technologies Inc.	Sponsoring Entity Triangle Software LLC

TRAVEL FORECASTING AND ALLOCATING SYSTEM AND METHOD
Patent # US 20080133284A1 Filed 12/03/2007	Current Assignee BIRCH GRANT DAVON, SCHUBOTZ SHAWN IVOR	Sponsoring Entity SCHUBOTZ SHAWN IVOR

Freeway optimization program
Patent # US 20070083322A1 Filed 10/11/2005	Current Assignee Van Ee Jonathan	Sponsoring Entity Van Ee Jonathan

Route Guidance System
Patent # US 20070276596A1 Filed 10/25/2004	Current Assignee Trafficmaster Limited	Sponsoring Entity Trafficmaster Limited

Use of vehicle permissions to control individual operator parameters in a hierarchical traffic control system
Patent # US 6,885,935 B2 Filed 01/23/2003	Current Assignee Daedalus Group LLC	Sponsoring Entity International Business Machines Corporation

Motor vehicle navigation system that receives route information from a central unit
Patent # US 6,853,915 B2 Filed 09/12/2001	Current Assignee Harman Becker Automotive Systems GmbH	Sponsoring Entity Harman Becker Automotive Systems GmbH

System and method for coordinating personal transportation
Patent # US 5,604,676 A Filed 07/25/1994	Current Assignee Lucent Technologies Inc.	Sponsoring Entity Lucent Technologies Inc.

Method and system for allowing vehicles to negotiate roles and permission sets in a hierarchical traffic control system
Patent # US 6,609,061 B2 Filed 09/27/2001	Current Assignee Daedalus Group LLC	Sponsoring Entity International Business Machines Corporation

Hierarchical traffic control system which includes vehicle roles and permissions
Patent # US 6,681,175 B2 Filed 01/10/2003	Current Assignee Google LLC	Sponsoring Entity International Business Machines Corporation

METHOD OF USING A NETWORK OF COMPUTERS TO CONTROL THE RESERVATION OR SALE OF AVAILABLE LIMITED FIXED OR TIME SENSITIVE INVENTORY BETWEEN A SELLER INTERFACE AND A BUYER INTERFACE USING TWO WAY COMMUNICATIONS
Patent # US 6,873,969 B2 Filed 06/07/2002	Current Assignee Michael A. Dean, Lucinda Stone	Sponsoring Entity Michael A. Dean, Lucinda Stone

Route entry guiding device and method in a navigation system using a portable terminal
Patent # US 6,708,111 B2 Filed 05/03/2002	Current Assignee Samsung Electronics Co. Ltd.	Sponsoring Entity Samsung Electronics Co. Ltd.

Method of using a network of computers to facilitate and control access or admission to facility, site, business, or venue
Patent # US 6,738,750 B2 Filed 06/07/2002	Current Assignee Michael A. Dean, Lucinda Stone	Sponsoring Entity Michael A. Dean, Lucinda Stone

Assigning and managing patron reservations for distributed services using wireless personal communication devices
Patent # US 6,748,364 B1 Filed 11/01/1999	Current Assignee Lo-Q PLC	Sponsoring Entity PALM TOP PRODUCTION INC.

On-demand transportation system
Patent # US 20030040944A1 Filed 08/22/2001	Current Assignee Ryan M. Hileman	Sponsoring Entity Ryan M. Hileman

Using predictive traffic modeling
Patent # US 6,256,577 B1 Filed 09/17/1999	Current Assignee Intel Corporation	Sponsoring Entity Intel Corporation

Assigning and managing patron reservations for distributed services using wireless personal communication devices
Patent # US 5,978,770 A Filed 04/24/1997	Current Assignee Lo-Q PLC	Sponsoring Entity VISIBLE INTERACTIVE CORPORATION

Optimal and stable route planning system
Patent # US 5,610,821 A Filed 11/18/1994	Current Assignee International Business Machines Corporation	Sponsoring Entity International Business Machines Corporation

Method for identifying highway access ramps for route calculation in a vehicle navigation system
Patent # US 5,515,283 A Filed 06/20/1994	Current Assignee TomTom Incorporated	Sponsoring Entity Zexel Corporation

Computerized navigation system
Patent # US 5,543,789 A Filed 06/24/1994	Current Assignee HERE Global B.V.	Sponsoring Entity SHIELDS ENTERPRISES INC.

Land vehicle multiple navigation route apparatus
Patent # US 5,220,507 A Filed 10/08/1992	Current Assignee Motorola Inc.	Sponsoring Entity Motorola Inc.

View All

22 Claims

1. . A method for optimizing routes, comprising:
- receiving a request for a route from a requester;
  
  determining an optimized route and a potential position of the requester within the optimized route based on the request;
  
  providing a proposal in response to the request, the proposal comprising the optimized route and the potential position; and
  
  receiving a response to the proposal.
- View Dependent Claims (2, 3, 4, 5, 6, 7)
- - 2. . The method of claim 1, further comprising reserving the optimized route pending the response.
  - 3. . The method of claim 1, the proposal further comprising a set of alternative optimized routes and corresponding potential positions
  - 4. . The method of claim 1, further comprising trading the optimized route and the potential position of the requester with another optimized route and another potential position of another requester.
  - 5. . The method of claim 1, further comprising collecting feedback based on an execution of the proposal.
  - 6. . The method of claim 1, further comprising assigning the requester to the optimized route and the potential position when the response comprises an acceptance of the proposal.
  - 7. . The method of claim 1, the route being a traffic route, and the determining being based on Global Positioning Satellite (GPS) technology.

8. . A system for optimizing traffic routes, comprising:
- a memory medium comprising instructions;
  
  a bus coupled to the memory medium; and
  
  a processor coupled to the bus that when executing the instructions causes the system to;
  
  receive a request for a traffic route from a requester;
  
  determine an optimized traffic route and a potential position of the requester within the optimized traffic route based on the request;
  
  provide a proposal in response to the request, the proposal comprising the optimized traffic route and the potential position; and
  
  receive a response to the proposal.
- View Dependent Claims (9, 10, 11, 12, 13, 14)
- - 9. . The system of claim 8, the system further being caused to reserve the optimized traffic route pending the response.
  - 10. . The system of claim 8, the proposal further comprising a set of alternative optimized traffic routes and corresponding potential positions
  - 11. . The system of claim 8, the system further being caused to trade the optimized traffic route and the potential position of the requester with another optimized traffic route and another potential position of another requester.
  - 12. . The system of claim 8, the system further being caused to collect feedback based on an execution of the proposal.
  - 13. . The system of claim 8, the system further being caused to assign the requester to the optimized traffic route and the potential position when the response comprises an acceptance of the proposal.
  - 14. . The system of claim 8, the optimized traffic route being determined based on Global Positioning Satellite (GPS) technology.

15. . A computer readable medium containing a program product for optimizing traffic routes, the computer readable medium comprising program code for causing a computer to:
- receive a request for a traffic route from a requester;
  
  determine an optimized traffic route and a potential position of the requester within the optimized traffic route based on the request;
  
  provide a proposal in response to the request, the proposal comprising the optimized traffic route and the potential position; and
  
  receive a response to the proposal.
- View Dependent Claims (16, 17, 18, 19, 20, 21)
- - 16. . The computer readable medium containing the program product of claim 15, the computer readable medium further comprising program code for further causing the computer to reserve the optimized traffic route pending the response.
  - 17. . The computer readable medium containing the program product of claim 15, the proposal further comprising a set of alternative optimized traffic routes and corresponding potential positions.
  - 18. . The computer readable medium containing the program product of claim 15, the computer readable medium further comprising program code for further causing the computer to trade the optimized traffic route and the potential position of the requester with another optimized traffic route and another potential position of another requester.
  - 19. . The computer readable medium containing the program product of claim 15, the computer readable medium further comprising program code for further causing the computer to collect feedback based on an execution of the proposal.
  - 20. . The computer readable medium containing the program product of claim 15, the computer readable medium further comprising program code for further causing the computer to assign the requester to the optimized traffic route and the potential position when the response comprises an acceptance of the proposal.
  - 21. . The computer readable medium containing the program product of claim 15, the optimized traffic route being determined based on Global Positioning Satellite (GPS) technology.

22. . A method for deploying a system for optimizing traffic routes, comprising:
- providing a computer infrastructure being operable to;
  
  receive a request for a traffic route from a requester;
  
  determine an optimized traffic route and a potential position of the requester within the optimized traffic route based on the request;
  
  provide a proposal in response to the request, the proposal comprising the optimized traffic route and the potential position; and
  
  receive a response to the proposal.

1 Specification

TECHNICAL FIELD

The present invention generally relates to route optimization. In one embodiment, the present invention relates to traffic route optimization.

BACKGROUND

The use of GPS navigation systems in automobiles is becoming commonplace. Users are increasingly dependent on GPS devices to plan and direct their routes, real-time. Currently, traffic is stochastic, as people drive to and from locations in a completely unpredictable manner.

Currently, when a large number of drivers are traveling to the same destination, or in the same area, traffic jams occur with little coordinated planning to prevent them. Also, given the chaotic and currently unpredictable nature of society and driving, the quantity of cars driving from random destinations, taking random routes, and arriving at random locations makes optimizing the system very difficult. For example, when a popular event is planned (e.g., sporting event or concert), local authorities may dispatch officers to help direct traffic, or they may post signs warning of the traffic congestion. While these responses are proactive in nature, they often do not have a significant impact on traffic congestion, nor do they enable incentives for improved driving.

SUMMARY

In general, the present invention relates to route optimization/prediction. In one embodiment, the present invention provides visibility to future predicted traffic situations, based on all reserved routes in a system at a given point in time. This allows city planners, for example, to know where traffic will be to adjust traffic flow accordingly. Additional value comes into play by being able to calculate and publish aggregated savings from using this system, such as driver time, mileage, and gas. This information may be added to a database and made available to individuals via their GPS. In a typical implementation, a request for a route is received from a requester. Based on the request, an optimized route and a potential position of the requester within the optimized route are determined and then proposed to the requester. The requester can then select an option from the proposal.

A first aspect of the present invention provides a method for optimizing routes, comprising: receiving a request for a route from a requester; determining an optimized route and a potential position of the requester within the optimized route based on the request; providing a proposal in response to the request, the proposal comprising the optimized route and the potential position; and receiving a response to the proposal.

A second aspect of the present invention provides a system for optimizing traffic routes, comprising: a memory medium comprising instructions; a bus coupled to the memory medium; and a processor coupled to the bus that when executing the instructions causes the system to: receive a request for a traffic route from a requester; determine an optimized traffic route and a potential position of the requester within the optimized traffic route based on the request; provide a proposal in response to the request, the proposal comprising the optimized traffic route and the potential position; and receive a response to the proposal.

A third aspect of the present invention provides a computer readable medium containing a program product for optimizing traffic routes, the computer readable medium comprising program code for causing a computer to: receive a request for a traffic route from a requester; determine an optimized traffic route and a potential position of the requester within the optimized traffic route based on the request; provide a proposal in response to the request, the proposal comprising the optimized traffic route and the potential position; and receive a response to the proposal.

A fourth aspect of the present invention provides a method for deploying a system for optimizing traffic routes, comprising: providing a computer infrastructure being operable to: receive a request for a traffic route from a requester; determine an optimized traffic route and a potential position of the requester within the optimized traffic route based on the request; provide a proposal in response to the request, the proposal comprising the optimized traffic route and the potential position; and receive a response to the proposal.

BRIEF DESCRIPTION OF THE DRAWINGS

These and other features of this invention will be more readily understood from the following detailed description of the various aspects of the invention taken in conjunction with the accompanying drawings in which:

FIG. 1 shows a first method flow diagram according to an embodiment of the present invention.

FIG. 2 shows a second method flow diagram according to an embodiment of the present invention.

FIG. 3 shows a third method flow diagram according to an embodiment of the present invention.

FIG. 4 shows a more specific computerized implementation according to an embodiment of the present invention.

FIG. 5 shows a method flow diagram according to an embodiment of the present invention.

The drawings are not necessarily to scale. The drawings are merely schematic representations, not intended to portray specific parameters of the invention. The drawings are intended to depict only typical embodiments of the invention, and therefore should not be considered as limiting the scope of the invention. In the drawings, like numbering represents like elements.

DETAILED DESCRIPTION

For convenience, the Detailed Description of the Invention has the following sections:

I. General Description

II. Computerized Implementation

I. General Description

As indicated above, the present invention relates to route optimization/prediction. In one embodiment, the present invention provides visibility to future predicted traffic situations, based on all reserved routes in a system at a given point in time. This allows city planners, for example, to know where traffic will be to adjust traffic flow accordingly. Additional value comes into play by being able to calculate and publish aggregated savings from using this system, such as driver time, mileage, and gas. This information may be added to a database and made available to individuals via their GPS. In a typical implementation, a request for a route is received from a requester. Based on the request, an optimized route and a potential position of the requester within the optimized route are determined and then proposed to the requester. The requester can then select an option from the proposal.

One added and useful benefit that this system provides is visibility to future predicted traffic situations, based on all reserved routes in the system at a given point in time. This allows city planners, for example, to know where traffic will be and adjust traffic flow accordingly. Additional value comes into play by being able to calculate and publish aggregated savings from using this system, such as driver time, mileage, and gas. This information may be added to a database and made available to individuals via their GPS.

In a typical embodiment, this invention allows drivers to designate their intended driving route to/from an event or location in advance, and “reserve” a driving route. By doing this, GPS or other navigational systems can then be used to calculate user travel routes in ways that will:

- 1. improve traffic congestion;
- 2. enable drivers to select routes that coincide with latest designated “preferred” routes to/from a given event or location;
- 3. enable event coordinators, sellers or local public works departments to reward achieving of desired traffic patterns; and
- 4. create markets for trading assigned traffic routings.
  It is assumed that a finite number of reservations are available at any given time for a specific route due to size of roads, road conditions, traffic expectations etc., making the route reservation a desirable asset.

A summary of the steps for this system are as follows:

1. Request Route.

2. Optimize Route.

3. Reserve Route.

4. Queue Route.

5. Deliver Route and Offers.

6. Trade Route (optionally).

7. Collect feedback & learn for future routing.

This invention provides a benefit for the society as a whole by optimizing the overall patterns of traffic to minimize congestion. Although each participant may not get the most direct route for his/herself, traffic jams will be avoided and the greater good will be served. The currently random system of traffic is optimized.

Referring now to FIG. 1, a first process flow diagram according to an embodiment of the present invention is shown. As depicted, drivers 1-3 can request routes (e.g., automated) using various techniques such an event attraction/incentive system 10A, a GPS/navigation system 10B and/or a local alert system 10C (e.g., safety, weather, etc.). With this invention, if a driver requests and registers his/her route early, (s) he is more likely to be given his preferred path than someone that requests the route last-minute. Users are incented to participate since this helps in planning for high volume traffic, especially in situations that do not follow predictable patterns. Cities may then change the timing of lights, etc. to accommodate this predicted traffic.

The requests can be routed via request databases 12A-C to route registration engine 14, which manages all routes between various registrations. Based on the request, the route registration engine will determine a set (at least one) of optimized routes for each driver 1-3, and route queue engine 16 will determine a potential position of each driver within each corresponding route. For example, assume that two optimized routes (e.g., A and B) have been determined for driver 1. It could be the case that driver 1 would be assigned a potential position of 20^thwithin route A, and position of 15^thwithin route B. In a typical embodiment, optimal routings for each driver can be determined based upon the following inputs:

- Driver route requests and preferences. For example: allow me to leave at the last possible minute or ensure I am not late, etc.
- Automated route requests.
- Promotions (e.g., free parking to first 100 registrants; t-shirt; ticket discounts; toll reductions). Market incentives are introduced to allow the consumers to opt in. Network externality (i.e., network effect) applies to this invention because the more people that participate, the better it works for all.
- Public works data (e.g., water main break on Main Street, or bad weather slowdowns).

Routing optimization may be based on, but not limited to:

- The number of days in advance that a request is made;
- Type of car being driven (e.g., reward fuel efficient models);
- Designated “preferred paths” (e.g., avoiding school zones during certain hours, HOV lanes, or partial/full routes reserved only for participants)

A route may be dynamically changed based on the real-time situation.

For example:

- “Route correction” requests can be automatically generated in the event you are running late for your assigned route. The GPS system knows what time you start your car and the assigned start time of your reserved route. If these are different, a new route may be automatically generated & reserved.
- The original route you registered for weeks ago has been “upgraded” based on new real-time factors (e.g., cancellations which bump you up in the queue). In the case of upgrades, incentives may also accompany the new upgraded route.

Business intelligence (BI) & analytics:

- Use of BI and known analytical tools to determine what routes are working and which are not, and provide feedback to the system to enable future updates of routing algorithms. This feedback may be based on an individual'"'"'s route success ratios (e.g., number of routes completed within specified window of assigned timings for the route vs. the number of times the exact route was used), OR on the user population as a whole (i.e., analyze ALL of the success ratios of a given pool of route reserving users).
- Identification of instances where drivers (e.g., a pool of drivers) take more or less time to traverse a piece of road than is predicted based upon known variables. These instances are noted and the system automatically accounts for different timings in the future. This takes into account factors which may not be known to the GPS or computer system, such as severe pot holes, dirt road washouts etc.
- The system logs and recognizes instances where you leave later than assigned but arrive earlier than expected at your destination and adjusts future routes accordingly (e.g., for forecasting purposes).

In addition, the position of a driver within a route represents the driver'"'"'s order in the broader routing plan. Along these lines, the following features are provided under the invention:

- If a driver cancels or does not take the preregistered route, the queue can be dynamically updated to offer new routes to those next in line.
- The route queue engine 16 has the ability to compare exact locations vs. preregistered routes to check for compliance. This may be accomplished by applying customizable rules to define local compliance guidelines (e.g., rewarding frequent driver points under certain conditions).

Regardless, referring to FIG. 2, once optimized routes and potential positions are determined, they will be sent back to the corresponding drivers 1-3 as proposals via route queue engine 16. Each driver 1-3 can then make a determination as to which route to select. If none are desirable, the process will repeat and a new proposal will be determined (if possible). If a selection of a particular route/position is made, that route and position will be reserved (e.g., by route queue engine 16).

In delivering the routes and offers/proposals, the following functions are provided hereunder:

- The requesters'"'"' optimized route is sent back to the requester, along with any applicable offers/promotions.
- The requester may accept or reject the assigned route. If rejected, the requester may place a new route request.
- The requester may also cancel a previously registered route.
- For requesters that do NOT take their assigned routes, offers/incentives may be revoked or diminished.
- Likewise, rewards and/or incentives may be adjusted dynamically based on real-time changes to the routes.

An additional feature of the invention is the ability of drivers to trade routes and/or positions. For example, referring to FIG. 3, route trade engine 18 can coordinate the offering, accepting, and reassignment of routes and/or positions within routes between drivers. Assume that driver 1 has been assigned route A and position X. Further assume that driver 2 has been assigned route B and position Y. The two have the capability to trade either routes or positions. This tracking and management of this exchange is coordinated by the route trading engine. It should be understood that the trades can be conducted in accordance with any trading approach now known or later developed. For example, routes/positions could be traded in an auction format, they could be exchanged concurrently for another route/position or some other compensation (e.g., financial), or they could be traded for a compensation to be determined later.

Example Scenario

- 1. High traffic-volume event is planned for a location (e.g., important sporting event or concert).
- 2. When a user purchases a ticket to the event, it is automatically registered to the routing system.
- 3. His home address is used as a default starting point or if he requests anonymity, his general neighborhood is given as a starting point.
- 4. User'"'"'s route is recorded, including expected time of departure, rate of travel over route, and expected time of arrival.
- 5. Routing system may predict how many people will be on the road at that time and what routes they will take, so it can preemptively reroute certain people to prevent a traffic jam.
- 6. People who purchased their ticket early and had their route registered early are assigned the most direct route. They are incented for their participation in helping with traffic management for all.
- 7. Others who purchased their tickets late are assigned a slightly longer route, but one that will prevent jams for all. They are incented for following their prescribed route.

II. Computerized Implementation

Referring now to FIG. 4, a computerized implementation 100 of the present invention is shown. As depicted, implementation 100 includes a computer system 104 deployed within a computer infrastructure 102. This is intended to demonstrate, among other things, that the present invention could be implemented within a network environment (e.g., the Internet, a wide area network (WAN), a local area network (LAN), a virtual private network (VPN), etc.), or on a stand-alone computer system. In the case of the former, communication throughout the network can occur via any combination of various types of communication links. For example, the communication links can comprise addressable connections that may utilize any combination of wired and/or wireless transmission methods. Where communications occur via the Internet, connectivity could be provided by conventional TCP/IP sockets-based protocol, and an Internet service provider could be used to establish connectivity to the Internet. Still yet, computer infrastructure 102 is intended to demonstrate that some or all of the components of implementation 100 could be deployed, managed, serviced, etc., by a service provider who offers to implement, deploy, and/or perform the functions of the present invention for others.

As shown, computer system 104 includes a processing unit 106, a memory 108, a bus 110, and a device interfaces 112. Further, computer system 104 is shown having external devices 114 and storage system 116 that communicate with bus 110 via device interfaces 112. In general, processing unit 106 executes computer program code, such as route optimization software/program 118, which is stored in memory 108 and/or storage system 116. While executing computer program code, processing unit 106 can read and/or write data to/from memory 108, storage system 116, and/or device interfaces 112. Bus 110 provides a communication link between each of the components in computer system 104. Although not shown, computer system 104 could also include I/O interfaces that communicate with: one or more external devices such as a keyboard, a pointing device, a display, etc.; one or more devices that enable a user to interact with computer system 104; and/or any devices (e.g., network card, modem, etc.) that enable computer system 104 to communicate with one or more other computing devices.

Computer infrastructure 102 is only illustrative of various types of computer infrastructures for implementing the invention. For example, in one embodiment, computer infrastructure 102 comprises two or more computing devices (e.g., a server cluster) that communicate over a network to perform the various processes of the invention. Moreover, computer system 104 is only representative of various possible computer systems that can include numerous combinations of hardware. To this extent, in other embodiments, computer system 104 can comprise any specific purpose-computing article of manufacture comprising hardware and/or computer program code for performing specific functions, any computing article of manufacture that comprises a combination of specific purpose and general purpose hardware/software, or the like. In each case, the program code and hardware can be created using standard programming and engineering techniques, respectively. Moreover, processing unit 106 may comprise a single processing unit, or be distributed across one or more processing units in one or more locations (e.g., on a client and server). Similarly, memory 108 and/or storage system 116 can comprise any combination of various types of data storage and/or transmission media that reside at one or more physical locations. Further, device interfaces 112 can comprise any module for exchanging information with one or more external devices. Still further, it is understood that one or more additional components (e.g., system software, math co-processing unit, etc.) not shown in FIG. 4 can be included in computer system 104.

Storage system 116 can be any type of system capable of providing storage for information under the present invention such as item appearances. To this extent, storage system 116 could include one or more storage devices, such as a magnetic disk drive or an optical disk drive. In another embodiment, storage system 116 includes data distributed across, for example, a local area network (LAN), wide area network (WAN) or a storage area network (SAN) (not shown). In addition, although not shown, additional components, such as cache memory, communication systems, system software, etc., may be incorporated into computer system 104.

Shown in memory 108 of computer system 104 is route optimization program 118, with a set of modules 120. The modules 120 generally provide the functions of the present invention as described herein. Specifically (among other things), set of modules 120 is configured to (as shown in conjunction with the method flow diagram of FIG. 5: receive a request for a route from a requester in step S1; determine an optimized route and a potential position of the requester within the optimized route based on the request in step S2; provide a proposal in response to the request, the proposal comprising the optimized route and the potential position in step S3; receive a response to the proposal S4; and reserve the optimized route pending the response in step S5.

While shown and described herein as a route optimization solution, it is understood that the invention further provides various alternative embodiments. For example, in one embodiment, the invention provides a computer-readable/useable medium that includes computer program code to enable a computer infrastructure to provide a route optimization solution. To this extent, the computer-readable/useable medium includes program code that implements each of the various process of the invention. It is understood that the terms computer-readable medium or computer useable medium comprise one or more of any type of physical embodiment of the program code. In particular, the computer-readable/useable medium can comprise program code embodied on one or more portable storage articles of manufacture (e.g., a compact disc, a magnetic disk, a tape, etc.), on one or more data storage portions of a computing device, such as memory 108 (FIG. 4) and/or storage system 116 (FIG. 4) (e.g., a fixed disk, a read-only memory, a random access memory, a cache memory, etc.), and/or as a data signal (e.g., a propagated signal) traveling over a network (e.g., during a wired/wireless electronic distribution of the program code).

In another embodiment, the invention provides a method that performs the process of the invention on a subscription, advertising, and/or fee basis. That is, a service provider, such as a Solution Integrator, could offer to provide a route optimization solution. In this case, the service provider can create, maintain, support, etc., a computer infrastructure, such as computer infrastructure 102 (FIG. 4) that performs the process of the invention for one or more customers. In return, the service provider can receive payment from the customer(s) under a subscription and/or fee agreement and/or the service provider can receive payment from the sale of advertising cont6

In still another embodiment, the invention provides a computer-implemented method for route optimization. In this case, a computer infrastructure, such as computer infrastructure 102 (FIG. 4), can be provided and one or more systems for performing the process of the invention can be obtained (e.g., created, purchased, used, modified, etc.) and deployed to the computer infrastructure. To this extent, the deployment of a system can comprise one or more of: installing program code on a computing device, such as computer system 104 (FIG. 4), from a computer-readable medium; adding one or more computing devices to the computer infrastructure; and incorporating and/or modifying one or more existing systems of the computer infrastructure to enable the computer infrastructure to perform the process of the invention.

As used herein, it is understood that the terms “program code” and “computer program code” are synonymous and mean any expression, in any language, code, or notation, of a set of instructions intended to cause a computing device having an information processing capability to perform a particular function either directly or after either or both of the following: (a) conversion to another language, code, or notation; and/or (b) reproduction in a different material form. To this extent, program code can be embodied as one or more of: an application/software program, component software/a library of functions, an operating system, a basic device system/driver for a particular computing and/or device, and the like.

A data processing system suitable for storing and/or executing program code can be provided hereunder and can include at least one processor communicatively coupled, directly or indirectly, to memory element through a system bus. The memory elements can include, but are not limited to, local memory employed during actual execution of the program code, bulk storage, and cache memories that provide temporary storage of at least some program code in order to reduce the number of times code must be retrieved from bulk storage during execution. Input/output or other external devices (including, but not limited to, keyboards, displays, pointing devices, etc.) can be coupled to the system either directly or through intervening device controllers.

Network adapters also may be coupled to the system to enable the data processing system to become coupled to other data processing systems, remote printers, storage devices, and/or the like, through any combination of intervening private or public networks. Illustrative network adapters include, but are not limited to, modems, cable modems, and Ethernet cards.

The foregoing description of various aspects of the invention has been presented for purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise form disclosed, and obviously, many modifications and variations are possible. Such modifications and variations that may be apparent to a person skilled in the art are intended to be included within the scope of the invention as defined by the accompanying claims.

View All

ROUTE OPTIMIZATION

First Claim

1 Assignment

0 Petitions

Accused Products

Abstract

51 Citations
View as Search Results

22 Claims

1 Specification

2 Family Members

ROUTE OPTIMIZATION

Create Patent Alert

First Claim

1 Assignment

0 Petitions

Accused Products

Abstract

51 Citations View as Search Results

22 Claims

1 Specification

2 Family Members

Thank you for your feedback

51 Citations
View as Search Results