Routing system

• US 6,459,986 B1
• Filed: 11/12/1998
• Issued: 10/01/2002
• Est. Priority Date: 09/18/1998
• Status: Expired due to Fees

• Current Assignee: Lenovo Singapore Pte Limited (Lenovo Group Ltd.)
• Original Assignee: International Business Machines Corporation
• Inventors: Boyce, Conor, Smith, James Spencer
• Primary Examiner(s): Louis-Jacques, Jacques H.
• Assistant Examiner(s): Broadhead, Brian J.
• Application Number:
  US09/191,014
• Time in Patent Office: 1,419 Days
• Field of Search: 701/201, 701/202, 701/204, 701/206, 701/208, 701/209, 705/5, 705/6, 705/13, 705/417, 705/418
• US Class Current: 701/202
• CPC Class Codes: G01C 21/3438 Rendez-vous, i.e. searching a destination where several users can meet, and the routes to this destination for these users; Ride sharing, i.e. searching a route such that at least two users can share a vehicle for at least part of the route
• CPC Class Codes: G06Q 10/02 Reservations, e.g. for tickets, services or events
• CPC Class Codes: G06Q 10/025 Coordination of plural reservations, e.g. plural trip segments, transportation combined with accommodation
• CPC Class Codes: G08G 1/0969 having a display in the form of a map

Abstract

A routing system comprising one or more maps; route defining means instantiable to respond to driver interaction with a map to define a proposed pooling route and to store said pooling route; request defining means instantiable to respond to passenger interaction to define a request for a pooling route; search means instantiable to search stored pooling routes for one or more pooling routes suitable for said request; and addition means responsive to passenger selection of a suitable pooling route to include a passenger on said route.

Claims

1. A client-server graphic routing system comprising:

one or more maps

route defining means instantiable to respond to driver interaction with a map to define a proposed pooling route and to store said pooling route, each proposed pooling route including a series of coordinates corresponding to a driver start, any intermediate and an end locations;

request defining means instantiable to respond to passenger interaction to define a request for a pooling route, said pooling request including a pair of coordinates corresponding to passenger start and end locations;

search means instantiable to search stored pooling routes for one or more pooling routes for said request, and including;

linking means for deriving a series of vectors linking said driver defined pooling route coordinates;

determining means for calculating the distance of closest approach from said passenger defined locations to said vectors; and

comparison means for determining that said pooling route is suitable if said distance of closest approach is less than a pre-determined value; and

addition means responsive to passenger selection of a suitable pooling route to include a passenger on said route.

2. A routing system as claimed in claim 1 wherein said pre-determined distance is a passenger provided maximum walking distance.

3. A routing system as claimed in claim 2 wherein said request defining means is adapted to receive each passenger defined location orally via a telephone line and to convert said oral received locations into map coordinates.

4. A routing system as claimed in claim 1 wherein said proposed pooling routes each include a driver start time, and said pooling request includes a passenger start time, and said search means includes means responsive to said driver start time being after said passenger start time plus a pre-determined waiting time less an estimation of the travelling distance for the driver to reach the passenger start location and said driver time plus said estimation of travelling distance being before said passenger start time to determine a proposed pooling route as unsuitable.

5. A routing system as claimed in claim 1 wherein each proposed pooling route includes a maximum number of spaces available and means for storing the number of passengers included on a route by said addition means, and said search means includes means responsive to the maximum number of spaces available being equal to the number of passengers included to determine a pooling route as unsuitable.

6. A routing system as claimed in claim 1 wherein each pooling route includes a maximum and a minimum coordinate for each map axis, and said searching means includes means responsive to a pre-determined area around each said passenger defined locations not overlapping an area bounded by said maximum and minimum coordinates to determine a pooling route as unsuitable.

7. A routing system as claimed in claim 6 wherein said pre-determined areas extend a passenger provided maximum walking distance along each map axis from each passenger defined location.

8. A routing system as claimed in claim 1 wherein said proposed pooling route includes a driver address, said pooling request includes a passenger name and a proposed pick-up point and said addition means is responsive to passenger selection of a suitable route to forward said pooling request to the driver address for said suitable route, said addition means is further responsive to a positive response from said driver address to include said passenger on said suitable route and to notify said passenger of said inclusion.

9. A routing system as claimed in claim 8 wherein said notification includes said driver address.

10. A routing system as claimed in claim 8 wherein said address is an e-mail address.

11. A routing system as claimed in claim 8 wherein said pooling request includes a passenger address.

12. A routing system as claimed in claim 1 comprising a plurality of maps and map selection means responsive to user interaction to display a portion of at least one of said maps.

13. A routing system as claimed in claim 1 wherein said route defining means is adapted to receive and to superimpose each driver defined location in a pooling route over a map.

14. A routing system as claimed in claim 1 wherein said request defining means is adapted to display a map for a passenger and to receive and superimpose each passenger defined location over said map.

15. A computer program product comprising computer program code stored on a computer readable storage medium for, when executed on a computer, operating a routing system, the product comprising a routing system comprising:

one or more maps

route defining means instantiable to respond to driver interaction with a map to define a proposed pooling route and to store said pooling route, each proposed pooling route including a series of coordinates corresponding to a driver start, any intermediate and an end locations;

request defining means instantiable to respond to passenger interaction to define a request for a pooling route, said pooling request including a pair of coordinates corresponding to passenger start and end locations;

search means instantiable to search stored pooling routes for one or more pooling routes for said request, and including

linking means for deriving a series of vectors linking said driver defined pooling route coordinates;

determining means for calculating the distance of closest approach from said passenger defined locations to said vectors

comparison means for determining that said pooling route is suitable if said distance of closest approach is less than a pre-determined value; and

addition means responsive to passenger selection of a suitable pooling route to include a passenger on said route.

16. A Web server including a routing system comprising:

one or more maps

route defining means instantiable to respond to driver interaction with a map to define a proposed pooling route and to store said pooling route, each proposed pooling route including a series of coordinates corresponding to a driver start, any intermediate and an end locations;

request defining means instantiable to respond to passenger interaction to define a request for a pooling route, said pooling request including a pair of coordinates corresponding to passenger start and end locations;

search means instantiable to search stored pooling routes for one or more pooling routes for said request, and including;

linking means for deriving a series of vectors linking said driver defined pooling route coordinates;

determining means for calculating the distance of closest approach from said passenger defined locations to said vectors; and

comparison means for determining that said pooling route is suitable if said distance of closest approach is less than a pre-determined value; and

addition means responsive to passenger selection of a suitable pooling route to include a passenger on said route.

17. In a server computer system including one or more maps, a method of operating a routing system comprising the steps of:

responsive to driver interaction with a map on a client computer system, defining a proposed pooling route and storing said pooling route on said server, each proposed pooling route including a series of coordinates corresponding to a driver start, any intermediate and an end locations;

responsive to passenger interaction, defining a request for a pooling route, said pooling request including a pair of coordinates corresponding to passenger start and end locations;

searching stored pooling routes for one or more routes suitable for said request, comprising the steps of;

deriving a series of vectors linking said driver defined pooling route coordinates;

calculating the distance of closest approach from said passenger defined locations to said vectors; and

determining that said pooling route is suitable if said distance of closest approach is less than a pre-determined value; and

;

responsive to passenger selection of a suitable pooling route, including a passenger on said route.