US20200149904A1 - Method of selective ride-sharing among multiple users along an optimized travel route - Google Patents

Method of selective ride-sharing among multiple users along an optimized travel route Download PDF

Info

Publication number
US20200149904A1
US20200149904A1 US16/731,016 US201916731016A US2020149904A1 US 20200149904 A1 US20200149904 A1 US 20200149904A1 US 201916731016 A US201916731016 A US 201916731016A US 2020149904 A1 US2020149904 A1 US 2020149904A1
Authority
US
United States
Prior art keywords
users
travel
destination
origin
travel route
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US16/731,016
Inventor
Tom Lewinson
Sharon Lewinson
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
RideShark Corp
Original Assignee
RideShark Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by RideShark Corp filed Critical RideShark Corp
Priority to US16/731,016 priority Critical patent/US20200149904A1/en
Publication of US20200149904A1 publication Critical patent/US20200149904A1/en
Abandoned legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G01MEASURING; TESTING
    • G01CMEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34Route searching; Route guidance
    • G01C21/3407Route searching; Route guidance specially adapted for specific applications
    • G01C21/3438Rendez-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
    • GPHYSICS
    • G01MEASURING; TESTING
    • G01CMEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34Route searching; Route guidance
    • G01C21/3453Special cost functions, i.e. other than distance or default speed limit of road segments
    • G01C21/3484Personalized, e.g. from learned user behaviour or user-defined profiles
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/02Reservations, e.g. for tickets, services or events

Definitions

  • the present invention relates generally to computerized mapping software programs. More particularly, the present invention relates to computerized mapping software programs that match travel and user preferences to a given Travel Route by matching end points and waypoints along the given route and providing user-enabled filtering among multiple users. The method and system also serve well in finding people whose origin and destination are along the drive route.
  • SOVs single-occupancy vehicles
  • a universal alternative to the use of SOVs is the use of high-occupancy vehicles (HOVs), where multiple individuals share a single vehicle.
  • HOVs high-occupancy vehicles
  • a system to determine which individuals should share a vehicle must analyze the locations of the origins (e.g., homes) and destinations (e.g., places of work) of all the individuals within its scope and group people together based on how close together they live and work, the departure and arrival times, and the available routes suitable for each individual.
  • people can also be grouped to share a vehicle based on the extent to which all of their origins and destinations lie on a straight line, though this approach is subject to inherent inefficiencies when a diversity of individuals are included.
  • the present invention provides Internet-based, computerized mapping software programs that match stored travel and user preferences to a given route by matching end points and waypoints along the given route and providing user-enabled filtering among multiple users. This results in full computerization to provide instant automatic results without requiring human intervention.
  • the present invention provides a mechanism for allowing multiple users to ride match in accordance with their Travel Route (“Travel Route” means an optimized or preferred route based on the actual road system and includes the “Start Point, End Point and the path between the two points) and personal preferences. The method and system also serve well in finding people whose origin and destination are along the drive route.
  • Travel Route means an optimized or preferred route based on the actual road system and includes the “Start Point, End Point and the path between the two points) and personal preferences.
  • the method and system also serve well in finding people whose origin and destination are along the drive route.
  • the present invention is Internet-based, it provides the capability to function anywhere on the planet using existing global locating references.
  • the present invention achieves all of the objectives described above
  • driving routes are stored in a standard relational database management system (RDBMS) using multiple indexes that automatically order the routes simultaneously by end points (i.e., including origin latitude and origin longitude along with corresponding destination latitude and destination longitude).
  • end points i.e., including origin latitude and origin longitude along with corresponding destination latitude and destination longitude.
  • Waypoints i.e., points along the driving route
  • the present invention provides a method, embodied in a computer mapping program, for ride-sharing among multiple users along an optimized travel route, the method including: identifying an origin corresponding to each of two or more users; identifying personal preference criteria related to each of the two or more users; identifying a destination provided by each of the two or more users; correlating the origins and the destinations so as to find matched origins and destinations; determining a matched list of users based upon the origins and the destinations of the two or more users; filtering the matched list of users based upon the personal preference criteria; and determining an optimized travel route corresponding to the origins and destinations related to the matched list of users.
  • a computer-readable medium having computer executable instructions for identifying an optimized travel route to be used for a given ride-sharing requirement, which when executed, include: identifying an origin corresponding to each of two or more users; identifying personal preference criteria related to each of the two or more users; identifying a destination provided by each of the two or more users; correlating the origins and the destinations so as to find matched origins and destinations; determining a matched list of users based upon the origins and the destinations of the two or more users; filtering the matched list of users based upon the personal preference criteria; and determining an optimized travel route corresponding to the origins and destinations related to the matched list of users.
  • the present invention provides an Internet-based system for identifying an optimized travel route to be used for a given ride-sharing requirement, the system including: a means for identifying an origin corresponding to each of two or more users; a means for identifying personal preference criteria related to each of the two or more users; a means for identifying a destination provided by each of the two or more users; a means for correlating the origins and the destinations so as to find matched origins and destinations; a means for determining a matched list of users based upon the origins and the destinations of the two or more users; a means for filtering the matched list of users based upon the personal preference criteria; and a means for determining an optimized travel route corresponding to the origins and destinations related to the matched list of users.
  • FIGS. 1A through 1D are examples of travel filtering as applied by the present invention.
  • FIG. 2 is a generalized schematic of a user and a network implementing the present invention.
  • FIG. 3 is a flowchart showing the ride-sharing method in accordance with the present invention.
  • FIGS. 4 through 6 are generalized screenshots of a graphical user interface corresponding to steps shown in FIG. 3 in accordance with the present invention.
  • FIG. 7 is a table showing the FindNearRoute and FindNearby methods contained in the FindServiceSoap Class of the MapPoint Web Service®.
  • FIG. 8 is a table showing the CalculateRoute and CalculateSimpleRoute methods contained in the RouteServiceSoap Class of the MapPoint Web Service®.
  • the present invention provides a method and system for ride matching among multiple diverse users whom have a variety of travel and personal preferences.
  • the ride matching system is based, without limitation, on the following principles.
  • the present inventive method and system serves to find car pooling partners (2 people) or car pooling groups (more than 2 people) for the purpose of: (1) Sharing transportation costs (benefit to individual); (2) Reducing road congestion (benefit to municipalities and governments); (3) Reducing parking requirements (benefit to organizations who supply parking to their employees); and (4) Reducing toxic and GHG vehicle emissions through a reduction in Total Vehicle km/miles Traveled.
  • Personal Preferences may include, but are not limited to, such preferences as smoker/non-smoker or gender preference.
  • “Travel Route” is defined to be Start Point, End Point and the path between the two points. It should thus be understood that the present invention applies to finding car pool partners along the entire drive route (i.e., the Optimized Travel Route), while prior known methods only match people at the start and the end points, or don't use an “Optimized Travel Route”. It should also be understood that an “Optimized Travel Route” is a route that corresponds to the actual person's route rather than simply some geometric representation (such as a straight line in some prior known methods).
  • Travel Filters can be divided into two sub-Filters including: (1) Travel Schedule Filters and (2) Travel Route Filters.
  • Travel Schedule Filters relate to the time requirements of the given Users such as their work day requires (i.e., 9 AM to 5 PM workday). Applying such Travel Schedule filters is therefore a matter of choosing the proper time windows for commutes into and from work.
  • Travel Route Filters relate to location based requirements in terms of distances between each user with regard to the Travel Route.
  • the Travel Route Filters can be applied in four different ways as shown in FIGS. 1A through 1D and described as follows.
  • a User and Seeker are illustrated along the Travel Path. It should be understood that the Travel Path is unlikely in reality to be a straight line path, and such is only shown for clarity of illustration.
  • the Travel Route Filters can be applied by Users whose Travel Origin is less than a specified distance X away from the Travel Origin of the Seeker and also whose Travel Destination is less than a specified distance Y away from the Travel Destination of the Seeker.
  • the specified distances X and Y can be either set by the Seeker or be automatically set by the application's logic. It should be readily understood that X and Y may be identical values or may be differing values.
  • the application's logic may set a default for X and Y to be within 0.5 kilometer from the Travel Origin and the Travel Destination, whereas a given Seeker may specify a distance of perhaps 1 kilometer. It should therefore be understood that any combination may be used by a Seeker to customize the specific distances from the Travel Origin or Travel Destination.
  • the Travel Route Filters can be applied by Users whose Travel Origin is less than a specified distance X 1 away from the Travel Origin of the Seeker and also whose Travel Destination is less than a specified distance Y 1 away from the Travel Route of the Seeker.
  • the specified distances X 1 and Y 1 can be either set by the Seeker or be automatically set by the application's logic. Such filtering is useful when the User is dropped off along the Travel Route at a point before the Seeker's Destination.
  • the Travel Route Filters can be applied by Users whose Travel Origin is less than a specified distance X 2 away from the Travel Route of the Seeker and also whose Travel Destination is less than a specified distance Y 2 away from the Travel Destination of the Seeker.
  • the specified distances X 2 and Y 2 can be either set by the Seeker or be automatically set by the application's logic. Such filtering is useful when the User is picked up along the Travel Route at a point beyond the Seeker's Origin.
  • the Travel Route Filters can be applied by Users whose Travel Origin is less than a specified distance X 3 away from the Travel Route of the Seeker and also whose Travel Destination is less than a specified distance Y 3 away from a Travel Route Destination of the Seeker.
  • a Travel Route Destination is a destination that is along the Travel Route, but not at the Travel Route endpoint.
  • the specified distances X 3 and Y 3 can be either set by the Seeker or be automatically set by the application's logic.
  • Such filtering is useful when the User is picked up along the Travel Route at a point beyond the Seeker's Origin and the commuting vehicle used (either the Seeker's or User's vehicle) is utilized by a further user (not shown) to commute further to the Travel Path endpoint.
  • FIG. 2 illustrates to basic components of the present invention.
  • a user 50 interfaces with the Internet 52 via one of several types of devices including, but not limited to, a laptop 51 a , a desktop computer 51 b , a personal data assistant 51 c , or a smart phone 51 d .
  • Such device 51 a - 51 d
  • a server 53 a upon which software resides to implement the present invention.
  • mapping module (discussed further hereinbelow) that may reside on a separate server 53 b as seen in FIG. 2 .
  • the mapping module may be integrated in such a manner so that servers 53 a and 53 b may be co-located or otherwise formed as an integral unit (not shown).
  • a User will perform the method as shown in FIG. 3 .
  • a user Via some interface device as mention above such as a desktop computer, a user will first register with the server embodying the inventive system. Such is accomplished in a normal manner whereby Use data such as name and email address are used to create a user identifier and password. Thereafter, the User creates a profile that includes at least an Origin (usually the User's home), a Destination (usually the User's place of work), their commuting schedule, and their preferences.
  • the User is presented with a User Profile graphical user interface (Profile GUI) 400 that includes their contact details 40 (e.g., name, phone number, email address) and their profile 40 a (e.g., graphically illustrated gender, smoker/non-smoker status, passenger/driver status).
  • the Profile GUI 400 also includes a display of the User's commuting schedule 44 which may include certain items in chart such as day, work start and finish times along with an indication of the flexibility with regard to such start and finish times (e.g., 9:00 AM start plus or minus 20 minutes).
  • the User's address information 45 is also shown and may include the User's home, Travel Origin (typically same as home), and Travel Destination (typically one's work address). The nearest intersections to the Travel Origin and Travel Destination may also be included in the User's address information 45 .
  • the Travel Origin and Travel Destination are also displayed in the Profile GUI 400 as a map 43 .
  • the Profile GUI 400 also includes an edit window 41 for editing any of the information shown such as the User's profile, addresses, schedule, or registered login.
  • the Profile GUI 400 includes a Find Match window 42 such that the user may accomplish the next step as shown in FIG. 3 to Find Matches according to the User's profile, addresses, and schedule. In such next step, the User is brought to a Find Matches GUI 500 as shown in FIG. 5 .
  • the User is provided with a Find Matches GUI 500 that does not include any matches whereby some message such as “no matches found” would be provided to the User.
  • the User may edit their profile via an edit button 51 .
  • the User may choose from pull-down menus 53 , 56 such filtering criteria such as rider/passenger status, gender, smoker/non-smoker status, distances to origin, home, and destination.
  • filtering criteria may then be saved via a save preferences button 52 .
  • FIG. 5 as shown includes an instance whereby ride matches a through d are shown in a ride match chart 55 .
  • ride matches a through d are also shown graphically in the ride match map 54 where a indicates the origin of User A and a indicates the destination of User A and so forth.
  • the ride match chart 55 shown in FIG. 5 includes graphical and textual information that may include the ride match's first name, gender, passenger/driver status, smoking preference, and commuting days.
  • the final step as shown in FIG. 3 is accomplished by a “contact by email” button in the ride match chart 55 that corresponds to each ride match found.
  • a “contact by email” button in the ride match chart 55 that corresponds to each ride match found.
  • contacting ride match c will provide the User with the Contact Matching User GUI 600 .
  • Such Contact Matching User GUI 600 includes features of most standard email interfaces including a time/date header 60 and a send button 61 .
  • the Contact Matching User GUI 600 includes a message body that has a generic introduction 65 along with a graphical map display 62 showing the receiver and sender origins and destinations.
  • a commuting information section 64 is shown that may include the sender's profile, preferences, schedule, place of work, and nearest intersections to sender's origin and destination.
  • the Contact Matching User GUI 600 may include a text section 63 for the sender to add further text.
  • MapPoint Web Service® is a programmable mapping web service hosted by Microsoft Corporation of Redmond, WA.
  • MapPoint Web Service® is used by enterprises and independent software developers to integrate location-based services, such as maps, driving directions and proximity searches, into software applications and business processes.
  • the MapPoint Web Service® provides various Object Oriented Programming Classes and Methods. The use of the following Classes is specifically referenced in this Patent Application for the purposes of Carpooling.
  • the table in FIG. 7 shows the FindNearRoute and FindNearby methods contained in the FindServiceSoap Class of the MapPoint Web Service®.
  • the table in FIG. 8 shows the CalculateRoute and CalculateSimpleRoute methods contained in the RouteServiceSoap Class of the MapPoint Web Service®.
  • the CustomerDataService Class of the MapPoint Web Service® contains the methods to programmatically upload the point-of-interest data to the MapPoint servers.
  • This patent application uses this class for the purpose of Uploading User Data (UserlD, Location Info, Properties) for the use by the FindNearby and FindNearRoute Methods of the FindServiceSoap. Data can also be uploaded to the MapPoint Web Service® through manual methods that require Client-Server communication using standard client-server communication protocols such as ftp or http.
  • client-Server communication protocols such as ftp or http.
  • a first aspect of the invention includes a method and related Carpool Matching system where an individual or User provides addresses (such as Home, Origin, Destination or other locations) and the address information is either immediately, or through a scheduled batch process, uploaded to the mapping module (i.e., MapPoint Web Service® Using the CustomerDataService Class).
  • addresses such as Home, Origin, Destination or other locations
  • the mapping module i.e., MapPoint Web Service® Using the CustomerDataService Class
  • a second aspect of the invention includes a method and related Carpool Matching system where an individual or User provides addresses, the address information is either immediately, or at a later time, uploaded manually to the mapping module (i.e., MapPoint Web Service®) through direct Client-Server Communication Protocols such as ftp or http.
  • mapping module i.e., MapPoint Web Service®
  • Client-Server Communication Protocols such as ftp or http.
  • a third aspect of the invention includes a method and related Carpool Matching system where an individual or User provides addresses, the address information is either immediately geocoded by the Carpool Matching system prior to uploading to the mapping module (i.e., MapPoint Web Service®), or is geocoded by the mapping module (i.e., MapPoint Web Service®) after uploading the data points.
  • the mapping module i.e., MapPoint Web Service®
  • MapPoint Web Service® MapPoint Web Service®
  • a fourth aspect of the invention includes a method and related Carpool Matching system where a Seeker uses the system to identify Matched Users whereby the system implements the five (5) methods described below. It should be noted that methods 1, 2, 4 and 5 can be performed in different orders without straying from the intended scope of the present invention. Method 3 must be performed once 1 and 2 have been completed.
  • the various Classes and Methods of the MapPoint Web Service® are used to illustrate this fourth aspect of the invention. However, as mentioned above, any mapping module with similar functionality to the MapPoint Web Service® may be utilized without straying from the intended scope of the present invention.
  • the second method in accordance with the fourth aspect of the invention includes finding other users whose Destination Location is within a specified distance from the Seeker's Travel Route.
  • This method includes the steps whereby: (a) Seekers Travel Points, as defined by Origin Address, Destination Address and Waypoint Addresses (if provided) or by Global Coordinates Locations are converted to a travel route using the MapPoint Web Service® (specifically RouteServiceSoap Class); (b) the returned route is referenced by the FindNearRoute Method of the FindServiceSoap Class; (c) the MapPoint Web Service®'s FindNearRoute Method, is referenced to the Data Source Name of the data which was uploaded by one of the first, second, or third aspects of the invention described above; (d) other parameters are assigned to the FindNearRoute Method as necessary for proper functionality of the method prior to sending the FindNearRoute request; (e) parameters are set for the EntityPropertyValue property of the FindNearRouteSpecification to return only Destination points
  • the third method in accordance with the fourth aspect of the invention includes combining the first and second methods into one single Request from the RouteServiceSoap Class by employing filtering on the Carpool Matching server, rather than through use of the EntityPropertyValue property of the FindNearRouteSpecification Filter.
  • the resultant array for the FindNearRouteMethod would contain both Origin and Destination points along the Route, and then the Carpool Matching application would separate out the matches that were origin points from the destination points.
  • This method includes the steps whereby: (a) Seekers Travel Points, as defined by Origin Address, Destination Address and Waypoint Addresses (if provided) or by Global Coordinates Locations are converted to a travel route using the MapPoint Web Service® (specifically RouteServiceSoap Class); (b) the returned route is referenced by the FindNearRoute Method of the FindServiceSoap Class; (c) the MapPoint Web Service®'s FindNearRoute Method, is referenced to the Data Source Name of the data which was uploaded by one of the first, second, or third aspects of the invention described above; (d) other parameters are assigned to the FindNearRoute Method as necessary for proper functionality of the method prior to sending the FindNearRoute request; (e) the returned array (call it Matched-Origin-OR-Destination-To-Route-Array) represents Users whose Origin OR Destination Points lie within the specified distance from the Seeker's Travel Route; and (f) the returned array can then be split easily into two arrays to match
  • the fourth method in accordance with the fourth aspect of the invention includes finding other users whose Origin is within a specified distance from the Seeker's Origin.
  • This method includes the steps whereby: (a) Seekers' Origin Address or their respective Global Coordinate Origin are provided to the MapPoint Web Service® FindNearBy Method along with a reference to the Data Source Name of the data which was uploaded by one of the first, second, or third aspects of the invention described above; (b) other parameters are assigned to the FindNearBy Method as necessary for proper functionality of the method prior to sending the FindNearRoute request; and (c) the returned array (call it Matched-Origin-Point-Array) represents Users whose Origin Points lie within the specified distance from the Seeker's Origin Point.
  • the fifth method in accordance with the fourth aspect of the invention includes finding other users whose Destination is within a specified distance from the Seeker's Destination.
  • This method includes the steps whereby: (a) Seekers' Destination Address or their respective Global Coordinate Origin are provided to the MapPoint Web Service® FindNearBy Method along with a reference to the Data Source Name of the data which was uploaded by one of the first, second, or third aspects of the invention described above; (b) other parameters are assigned to the FindNearBy Method as necessary for proper functionality of the method prior to sending the FindNearRoute request; and (c) the returned array (call it Matched-Destination-Point-Array) represents Users whose Destination Points lie within the specified distance from the Seeker's Destination Point.
  • a fifth aspect of the invention includes a method and related Carpool Matching system where data exists which was obtained using MapPoint FindNearBy Methods or FindNearRoute Methods and which can be processed using standard array processing methodologies to yield arrays which correspond to the following four (4) arrays: Matched-Origin-To-Route-Array, Matched-Destination-To-Route-Array, Matched-Origin-Point-Array, and Matched-Destination-Point-Array.
  • a sixth aspect of the invention includes a method and related Carpool Matching system where data exists or can be processed to exist and correspond to the Matched-Origin-To-Route-Array, Matched-Destination-To-Route-Array, Matched-Origin-Point-Array, and Matched-Destination-Point-Array so as to find Users who match one of the four (4) following categories.
  • Category One includes Users who match Origin and Destination Points with the Seeker. Such Users must exist in the Matched-Origin-To-Point-Array and the Matched-Destination-Point-Array.
  • Category Two includes Users who match Origin Point and whose Destination is along the Seeker's Route. Such Users must exist in the Matched-Origin-Point-Array and the Matched-Destination-To-Route-Array.
  • Category Three includes Users who match Destination Point and whose Origin is along the Seeker's Route. Such Users must exist in the Matched-Origin-To-Route-Array and the Matched-Destination-Point-Array.
  • Category Four includes Users whose Origin is along the Seeker's Route and also whose Destination is along the Seeker's Route. Such users must exist in the Matched-Origin-To-Route-Array and the Matched-Destination-To-Route-Array.
  • a seventh aspect of the invention includes a method and related Carpool Matching system where data exists, or can be processed to exist, and correspond to the Matched-Origin-To-Route-Array, Matched-Destination-To-Route-Array, Matched-Origin-Point-Array, and Matched-Destination-Point-Array and where a User Corresponds to (Category Four) Users whose Origin is along the Seeker's Route and also whose Destination is along the Seeker's Route whereby such users must exist in the Matched-Origin-To-Route-Array and the Matched-Destination-To-Route-Array.
  • the Travel Direction of the Matched User must match the Travel Direction of the Seeker. This is accomplished through ensuring that: (a) the Distance of (Matched Users Origin to Seeker's Origin) is LESS THAN the Distance of (Matched Users Destination to Seeker's Origin) AND (b) the Distance of (Matched Users Destination to Seeker's Destination) is LESS THAN the Distance of (Matched Users Origin to Seeker's Destination).
  • an addition filter can be applied to ensure that a reasonable distance exists between the Users Start & End Points compared to the Seeker's Travel Route. Such additional filter function is formed by ensuring that the Distance From Matched Users Origin to Matched Users Destination is GREATER THAN the Distance From Seeker's Origin to Seeker's Destination TIMES a given Factor (between 0% and 100% as desired).
  • a User is presented with a web-based interface as shown generally by FIGS. 1 through 6 .
  • the User is prompted to input data including, but not limited to, identifying information such as name, age, gender, home and/or work addresses, or employer. Additionally, personal preferences such as, but not limited to, smoker vs. non-smoker, driver vs. rider, allergies . . . etc. are entered by the User.
  • the use of pull-down menus for populating the initial user information is possible in combination with fillable fields.
  • the Origin can be determined. This is accomplished by checking the address of the User against a database such as a postal database so as to determine with accuracy the Origin.
  • parsing of the address entered by the User may be necessary as data entry may vary among users (e.g., Smith Falls Road, Smiths Falls Rd., and Smithfalls RD). Further, the address entered by the User may involve an area of new housing construction. In such instances, the use of a mapping database (e.g., via Google or MapQuest websites) may be used or the user may be offered the option to indicate their location by clicking on a map. Once the Origin is determined, it is translated into latitudinal and longitudinal coordinates correlated to that User. An optional verification may be used in conjunction with the MapPoint Web Service®.
  • a mapping database e.g., via Google or MapQuest websites
  • RDBMS relational database management system
  • the relational database or Object Oriented database
  • one or more Users would then use the web-based interface to set a destination.
  • the User is prompted to input destination data by addresses.
  • the Destination can be determined. This is accomplished by checking the destination address against a database such as a postal database so as to determine with accuracy the Destination.
  • a database such as a postal database
  • mapping database e.g., via the Google or MapQuest websites
  • the use of a mapping database may be used to locate the Destination. Once the Destination is determined, it is translated into latitudinal and longitudinal coordinates correlated to that Destination. As before with regard to the Origin determination, an optional verification may be used in conjunction with the MapPoint Web Service® to verify the Destination. As well, the use of pull-down menus for populating the Destination is possible in combination with fillable fields. It should be readily apparent that pull-downs are useful for popular destinations (e.g., Eiffel Tower, Empire State Building, and Sears Tower).
  • the inventive system will configure the driving route via the MapPoint Web Service® described hereinabove utilizing the FindRoute function.
  • This serves to automatically order the routes simultaneously by end points (i.e., including origin latitude and origin longitude along with corresponding destination latitude and destination longitude).
  • the User may adjust the route they have provided to the system via selection of Waypoints (i.e., points along the driving route). It should be understood that Waypoints may themselves form an end point (either origin or destination).
  • the inventive system matches Users according to their Origin's and Destination's proximity to their Travel Route. It should be understood that driving direction is taken into account during this process such that only Users traveling the same direction along the driving route are actually matched.
  • the personal preference filters are then applied so as to customize the matched Users. This also serves to limit the number of matched Users. In some instances, the number of matched Users may be too low if all personal preference filter criteria are applied. In such instances, the User may be given the option to remove one or more of the personal preferences. Alternatively, the User may be given the option at the initial data entry stage to rank their personal preferences whereby low ranked preferences could be ignored so as to increase the probability of a ride match.
  • the outcome of the above process in accordance with the inventive system may include, without limitation, a displayed profile and commuting schedule such as shown in FIGS. 1 and 2 , a printed schedule or itinerary, a personalized schedule or itinerary that is physically couriered or electronically mailed to the User, or any combination thereof. It should further be understood that the inventive method and system may be used over wireless (e.g., cellular, WLAN . . . etc.) as well as hard-wired media such as dial-up or DSL Internet services.
  • wireless e.g., cellular, WLAN . . . etc.

Abstract

A computer-implementable method and system for identifying the preferred commuting route to be used for a given route requirement subject to travel and personal preference criteria. The method and system uses computerized mapping software programs that match stored travel and user preferences to a given route by matching end points and waypoints along the given route and providing user-enabled filtering among multiple users. The method and system also serve well in finding people whose origin and destination are along the drive route.

Description

    CROSS REFERENCE TO RELATED APPLICATIONS
  • This application is a continuation of U.S. patent application Ser. No. 11/735,552 filed on Apr. 16, 2007, which claims priority from U.S. Provisional Patent Application Ser. No. 60/803,186 filed on May 25, 2006.
  • FIELD OF THE INVENTION
  • The present invention relates generally to computerized mapping software programs. More particularly, the present invention relates to computerized mapping software programs that match travel and user preferences to a given Travel Route by matching end points and waypoints along the given route and providing user-enabled filtering among multiple users. The method and system also serve well in finding people whose origin and destination are along the drive route.
  • BACKGROUND OF THE INVENTION
  • The widespread use of single-occupancy vehicles (SOVs) in modern industrialized societies is known to be a significant cause of several major economic, social and environmental problems including the inefficient use of energy resources, higher than necessary traffic congestion and higher than necessary levels of air pollution.
  • The alternatives of mass transportation, telecommuting or non-congesting/non-polluting modes of transportation are only available to limited segments of the population. A universal alternative to the use of SOVs is the use of high-occupancy vehicles (HOVs), where multiple individuals share a single vehicle. A system to determine which individuals should share a vehicle must analyze the locations of the origins (e.g., homes) and destinations (e.g., places of work) of all the individuals within its scope and group people together based on how close together they live and work, the departure and arrival times, and the available routes suitable for each individual. Alternatively, people can also be grouped to share a vehicle based on the extent to which all of their origins and destinations lie on a straight line, though this approach is subject to inherent inefficiencies when a diversity of individuals are included.
  • Several existing products, primarily Internet websites, provide ride-matching services such as the website Carpoolworld. None of the existing products, however, include a complete and maximally efficient ride-matching process.
  • It is, therefore, desirable to provide a complete and maximally efficient ride-matching process that provides selective ride-sharing among multiple users along an optimized travel route.
  • SUMMARY OF THE INVENTION
  • It is an object of the present invention to obviate or mitigate at least one disadvantage of previous software-based carpooling methods.
  • The present invention provides Internet-based, computerized mapping software programs that match stored travel and user preferences to a given route by matching end points and waypoints along the given route and providing user-enabled filtering among multiple users. This results in full computerization to provide instant automatic results without requiring human intervention. The present invention provides a mechanism for allowing multiple users to ride match in accordance with their Travel Route (“Travel Route” means an optimized or preferred route based on the actual road system and includes the “Start Point, End Point and the path between the two points) and personal preferences. The method and system also serve well in finding people whose origin and destination are along the drive route. As the present invention is Internet-based, it provides the capability to function anywhere on the planet using existing global locating references. The present invention achieves all of the objectives described above by providing a computer-implementable method of storing routes and matching end points and waypoints among multiple users based upon stored travel and personal preferences.
  • To make the system precise and globally-applicable, it is based on the direct use of standard latitude and longitude coordinates. Several free publicly available resources, including the Internet websites of the United States Geological Survey and the United States Census Bureau, provide latitude and longitude information. Some websites, such as the well-known Google-Maps website, provide geographic information for specific street addresses in the United States, Canada and several European countries, providing latitude and longitude coordinates to a precision of approximately 6 inches. Some websites provide a graphical point-and-click capability to obtain the latitude and longitude coordinates for any point on the planet's surface. Additionally, Global Positioning System (GPS) devices can be obtained by the public that provide latitude and longitude information readings wherever they are used on the planet to a precision of about 30 feet. Additional resources are available in various printed reference resources.
  • To make the system computationally-efficient, driving routes are stored in a standard relational database management system (RDBMS) using multiple indexes that automatically order the routes simultaneously by end points (i.e., including origin latitude and origin longitude along with corresponding destination latitude and destination longitude). Waypoints (i.e., points along the driving route) may themselves form an end point (either origin or destination).
  • In a first embodiment, the present invention provides a method, embodied in a computer mapping program, for ride-sharing among multiple users along an optimized travel route, the method including: identifying an origin corresponding to each of two or more users; identifying personal preference criteria related to each of the two or more users; identifying a destination provided by each of the two or more users; correlating the origins and the destinations so as to find matched origins and destinations; determining a matched list of users based upon the origins and the destinations of the two or more users; filtering the matched list of users based upon the personal preference criteria; and determining an optimized travel route corresponding to the origins and destinations related to the matched list of users.
  • In a further embodiment, there is provided a computer-readable medium having computer executable instructions for identifying an optimized travel route to be used for a given ride-sharing requirement, which when executed, include: identifying an origin corresponding to each of two or more users; identifying personal preference criteria related to each of the two or more users; identifying a destination provided by each of the two or more users; correlating the origins and the destinations so as to find matched origins and destinations; determining a matched list of users based upon the origins and the destinations of the two or more users; filtering the matched list of users based upon the personal preference criteria; and determining an optimized travel route corresponding to the origins and destinations related to the matched list of users.
  • In further embodiment, the present invention provides an Internet-based system for identifying an optimized travel route to be used for a given ride-sharing requirement, the system including: a means for identifying an origin corresponding to each of two or more users; a means for identifying personal preference criteria related to each of the two or more users; a means for identifying a destination provided by each of the two or more users; a means for correlating the origins and the destinations so as to find matched origins and destinations; a means for determining a matched list of users based upon the origins and the destinations of the two or more users; a means for filtering the matched list of users based upon the personal preference criteria; and a means for determining an optimized travel route corresponding to the origins and destinations related to the matched list of users.
  • Other aspects and features of the present invention will become apparent to those ordinarily skilled in the art upon review of the following description of specific embodiments of the invention in conjunction with the accompanying figures.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • Embodiments of the present invention will now be described, by way of example only, with reference to the attached figures.
  • FIGS. 1A through 1D are examples of travel filtering as applied by the present invention.
  • FIG. 2 is a generalized schematic of a user and a network implementing the present invention.
  • FIG. 3 is a flowchart showing the ride-sharing method in accordance with the present invention.
  • FIGS. 4 through 6 are generalized screenshots of a graphical user interface corresponding to steps shown in FIG. 3 in accordance with the present invention.
  • FIG. 7 is a table showing the FindNearRoute and FindNearby methods contained in the FindServiceSoap Class of the MapPoint Web Service®.
  • FIG. 8 is a table showing the CalculateRoute and CalculateSimpleRoute methods contained in the RouteServiceSoap Class of the MapPoint Web Service®.
  • DETAILED DESCRIPTION
  • Generally, the present invention provides a method and system for ride matching among multiple diverse users whom have a variety of travel and personal preferences.
  • The ride matching system is based, without limitation, on the following principles. The present inventive method and system serves to find car pooling partners (2 people) or car pooling groups (more than 2 people) for the purpose of: (1) Sharing transportation costs (benefit to individual); (2) Reducing road congestion (benefit to municipalities and governments); (3) Reducing parking requirements (benefit to organizations who supply parking to their employees); and (4) Reducing toxic and GHG vehicle emissions through a reduction in Total Vehicle km/miles Traveled.
  • In order to match Car Pool partners/groups it is necessary to match various Personal Preference Filters such as, but not limited to, the users: (1) Smoking habits; (2) Gender; (3) Desire to be a Drive or Passenger; (4) Travel Schedule and Schedule Flexibility; and (5) various others as appropriate. In addition, it is essential to match individuals/groups with a Travel Route and Travel Schedule that is convenient for all participants. While this patent application deals mainly with the “Travel Route” aspect of matching car pool partners, it should be understood that various alternative aspects may be possible without straying from the intended scope of the present invention.
  • In terms of the present description, the following terms are all synonymous: (1) Car Pooling, Carpooling; (2) Ride Matching, Ridematching; (3) Ride Sharing, Ridesharing; and (4) Commute Partnering.
  • In terms of the present description, the following terms are defined:
      • i. “Travel Route” means an optimized or preferred route based on the actual road system and includes the start point, end point, and the path between the start and end points.
      • ii. A “Seeker” is the individual who is performing the search for Car Pooling
  • Partners.
      • iii. “Travel Filters” are Travel Preferences established by the Seeker that allow only desired “Users” to pass through. Travel Preferences may include, but are not limited to, such preferences as time of departure/arrival or highway/local road.
      • iv. “Personal Preference Filters” are Personal Preferences established by the
  • Seeker that allow only desired “Users” to pass through. Personal Preferences may include, but are not limited to, such preferences as smoker/non-smoker or gender preference.
      • v. “Travel Schedule Filters” are Filters which are strictly concerned with the travel times and days of the week when car pool travel occurs.
      • vi. A “User” is a potential Matched User or potential Filtered User before any
  • Travel Filters or Personal Preference Filters have been applied.
      • vii. A “Matched User” is a User who passes through the Travel Filters that the Seeker has established, but prior to application of the Personal Preference Filters.
      • viii. A “Filtered User” is a User who matches the Personal Preference Filters which the Seeker has established, but prior to application of the Travel Filters.
      • ix. A “Filtered Matched User” is a User who passes through both the Travel
  • Filters and the Personal Preference Filters that the Seeker has established.
      • x. “Geocoding” is the process of converting a physical address, or a location “indicated on a map by a User” into a Global Latitude-Longitude Coordinate.
  • As mentioned in terms of the present description, “Travel Route” is defined to be Start Point, End Point and the path between the two points. It should thus be understood that the present invention applies to finding car pool partners along the entire drive route (i.e., the Optimized Travel Route), while prior known methods only match people at the start and the end points, or don't use an “Optimized Travel Route”. It should also be understood that an “Optimized Travel Route” is a route that corresponds to the actual person's route rather than simply some geometric representation (such as a straight line in some prior known methods).
  • The present invention preferably provides for the specific technical processes related to applying Travel Route Filters to Users for the purpose of identifying Matched Users and Filtered Matched Users in the scope of Car Pooling. However, it should be readily apparent to one of ordinary skill in the art of mapping that the present invention indeed has uses, applications, and value outside of carpooling such as any other application using optimized travel routes among multiple users having travel and personal preferences. This may include, without limitation, methods of delivery, trucking, door-to-door sales, marketing, and fundraising.
  • In accordance with the present invention, Travel Filters can be divided into two sub-Filters including: (1) Travel Schedule Filters and (2) Travel Route Filters. Travel Schedule Filters relate to the time requirements of the given Users such as their work day requires (i.e., 9 AM to 5 PM workday). Applying such Travel Schedule filters is therefore a matter of choosing the proper time windows for commutes into and from work. Travel Route Filters relate to location based requirements in terms of distances between each user with regard to the Travel Route. The Travel Route Filters can be applied in four different ways as shown in FIGS. 1A through 1D and described as follows.
  • With reference to FIG. 1A, a User and Seeker are illustrated along the Travel Path. It should be understood that the Travel Path is unlikely in reality to be a straight line path, and such is only shown for clarity of illustration. The Travel Route Filters can be applied by Users whose Travel Origin is less than a specified distance X away from the Travel Origin of the Seeker and also whose Travel Destination is less than a specified distance Y away from the Travel Destination of the Seeker. The specified distances X and Y can be either set by the Seeker or be automatically set by the application's logic. It should be readily understood that X and Y may be identical values or may be differing values. For example, the application's logic may set a default for X and Y to be within 0.5 kilometer from the Travel Origin and the Travel Destination, whereas a given Seeker may specify a distance of perhaps 1 kilometer. It should therefore be understood that any combination may be used by a Seeker to customize the specific distances from the Travel Origin or Travel Destination.
  • With reference to FIG. 1B, a User and Seeker are again illustrated along the Travel Path. In this filtering scenario, the Travel Route Filters can be applied by Users whose Travel Origin is less than a specified distance X1 away from the Travel Origin of the Seeker and also whose Travel Destination is less than a specified distance Y1 away from the Travel Route of the Seeker. As above, the specified distances X1 and Y1 can be either set by the Seeker or be automatically set by the application's logic. Such filtering is useful when the User is dropped off along the Travel Route at a point before the Seeker's Destination.
  • With reference to FIG. 1C, a User and Seeker are again illustrated along the Travel Path. Here, the Travel Route Filters can be applied by Users whose Travel Origin is less than a specified distance X2 away from the Travel Route of the Seeker and also whose Travel Destination is less than a specified distance Y2 away from the Travel Destination of the Seeker. Still again, the specified distances X2 and Y2 can be either set by the Seeker or be automatically set by the application's logic. Such filtering is useful when the User is picked up along the Travel Route at a point beyond the Seeker's Origin.
  • With reference to FIG. 1D, a User and Seeker are again illustrated along the Travel Path. In this instance, the Travel Route Filters can be applied by Users whose Travel Origin is less than a specified distance X3 away from the Travel Route of the Seeker and also whose Travel Destination is less than a specified distance Y3 away from a Travel Route Destination of the Seeker. A Travel Route Destination is a destination that is along the Travel Route, but not at the Travel Route endpoint. Yet still again, the specified distances X3 and Y3 can be either set by the Seeker or be automatically set by the application's logic. Such filtering is useful when the User is picked up along the Travel Route at a point beyond the Seeker's Origin and the commuting vehicle used (either the Seeker's or User's vehicle) is utilized by a further user (not shown) to commute further to the Travel Path endpoint.
  • In general, the present invention is used over a network and preferably over the public Internet to allow a maximum amount of users to benefit from commuting. FIG. 2 illustrates to basic components of the present invention. As shown, a user 50 interfaces with the Internet 52 via one of several types of devices including, but not limited to, a laptop 51 a, a desktop computer 51 b, a personal data assistant 51 c, or a smart phone 51 d. Such device (51 a-51 d) is connected in some known manner either wired or wireless to the Internet 52. Similarlyconnected to the Internet 52 is a server 53 a upon which software resides to implement the present invention. One software module in accordance with the present invention is a mapping module (discussed further hereinbelow) that may reside on a separate server 53 b as seen in FIG. 2. However, it should be understood that the mapping module may be integrated in such a manner so that servers 53 a and 53 b may be co-located or otherwise formed as an integral unit (not shown).
  • In implementing the present invention, a User will perform the method as shown in FIG. 3. Via some interface device as mention above such as a desktop computer, a user will first register with the server embodying the inventive system. Such is accomplished in a normal manner whereby Use data such as name and email address are used to create a user identifier and password. Thereafter, the User creates a profile that includes at least an Origin (usually the User's home), a Destination (usually the User's place of work), their commuting schedule, and their preferences. With additional reference to FIG. 4, the User is presented with a User Profile graphical user interface (Profile GUI) 400 that includes their contact details 40 (e.g., name, phone number, email address) and their profile 40 a (e.g., graphically illustrated gender, smoker/non-smoker status, passenger/driver status). The Profile GUI 400 also includes a display of the User's commuting schedule 44 which may include certain items in chart such as day, work start and finish times along with an indication of the flexibility with regard to such start and finish times (e.g., 9:00 AM start plus or minus 20 minutes).
  • The User's address information 45 is also shown and may include the User's home, Travel Origin (typically same as home), and Travel Destination (typically one's work address). The nearest intersections to the Travel Origin and Travel Destination may also be included in the User's address information 45. The Travel Origin and Travel Destination are also displayed in the Profile GUI 400 as a map 43. The Profile GUI 400 also includes an edit window 41 for editing any of the information shown such as the User's profile, addresses, schedule, or registered login. The Profile GUI 400 includes a Find Match window 42 such that the user may accomplish the next step as shown in FIG. 3 to Find Matches according to the User's profile, addresses, and schedule. In such next step, the User is brought to a Find Matches GUI 500 as shown in FIG. 5.
  • If no matches are found, then the User is provided with a Find Matches GUI 500 that does not include any matches whereby some message such as “no matches found” would be provided to the User. In such instance, the User may edit their profile via an edit button 51. Alternatively, the User may choose from pull-down menus 53, 56 such filtering criteria such as rider/passenger status, gender, smoker/non-smoker status, distances to origin, home, and destination. Such filtering criteria may then be saved via a save preferences button 52. FIG. 5 as shown includes an instance whereby ride matches a through d are shown in a ride match chart 55. Such ride matches a through d are also shown graphically in the ride match map 54 where a indicates the origin of User A and a indicates the destination of User A and so forth.
  • The ride match chart 55 shown in FIG. 5 includes graphical and textual information that may include the ride match's first name, gender, passenger/driver status, smoking preference, and commuting days. The final step as shown in FIG. 3 is accomplished by a “contact by email” button in the ride match chart 55 that corresponds to each ride match found. In the present example of ride matches a through d, contacting ride match c will provide the User with the Contact Matching User GUI 600. Such Contact Matching User GUI 600 includes features of most standard email interfaces including a time/date header 60 and a send button 61. However, information in the Contact Matching User GUI 600 and email generated is designed to protect the identity of both the sender and the receiver unless and until the receiver accepts the sender's invitation to ride-share. As seen in FIG. 6, the Contact Matching User GUI 600 includes a message body that has a generic introduction 65 along with a graphical map display 62 showing the receiver and sender origins and destinations. A commuting information section 64 is shown that may include the sender's profile, preferences, schedule, place of work, and nearest intersections to sender's origin and destination. As well, the Contact Matching User GUI 600 may include a text section 63 for the sender to add further text.
  • A specific embodiment of the present invention works in conjunction with the MapPoint Web Service® which is a programmable mapping web service hosted by Microsoft Corporation of Redmond, WA. However, it should be understood that the underlying principles of the present invention may be utilized with any similar mapping web service without straying from the intended scope of the present invention. Indeed, the present invention may utilize a self-contained mapping module integrated into the present invention. However, for the sake of simplicity and clarity of illustration, the present embodiment will be discussed in terms of using the MapPoint Web Service®. MapPoint Web Service® is used by enterprises and independent software developers to integrate location-based services, such as maps, driving directions and proximity searches, into software applications and business processes. The MapPoint Web Service® provides various Object Oriented Programming Classes and Methods. The use of the following Classes is specifically referenced in this Patent Application for the purposes of Carpooling.
  • The table in FIG. 7 shows the FindNearRoute and FindNearby methods contained in the FindServiceSoap Class of the MapPoint Web Service®. The table in FIG. 8 shows the CalculateRoute and CalculateSimpleRoute methods contained in the RouteServiceSoap Class of the MapPoint Web Service®.
  • The CustomerDataService Class of the MapPoint Web Service® contains the methods to programmatically upload the point-of-interest data to the MapPoint servers. This patent application uses this class for the purpose of Uploading User Data (UserlD, Location Info, Properties) for the use by the FindNearby and FindNearRoute Methods of the FindServiceSoap. Data can also be uploaded to the MapPoint Web Service® through manual methods that require Client-Server communication using standard client-server communication protocols such as ftp or http. It should be understood that while the “names” of the services may be changed by Microsoft Corporation, the functionality of these classes (or related classes) with respect to Car pooling forms is utilized within the present patent application. As such, several aspects of the present invention use the above-referenced features of the MapPoint Web Service®.
  • A first aspect of the invention includes a method and related Carpool Matching system where an individual or User provides addresses (such as Home, Origin, Destination or other locations) and the address information is either immediately, or through a scheduled batch process, uploaded to the mapping module (i.e., MapPoint Web Service® Using the CustomerDataService Class).
  • A second aspect of the invention includes a method and related Carpool Matching system where an individual or User provides addresses, the address information is either immediately, or at a later time, uploaded manually to the mapping module (i.e., MapPoint Web Service®) through direct Client-Server Communication Protocols such as ftp or http.
  • A third aspect of the invention includes a method and related Carpool Matching system where an individual or User provides addresses, the address information is either immediately geocoded by the Carpool Matching system prior to uploading to the mapping module (i.e., MapPoint Web Service®), or is geocoded by the mapping module (i.e., MapPoint Web Service®) after uploading the data points.
  • Further, a fourth aspect of the invention includes a method and related Carpool Matching system where a Seeker uses the system to identify Matched Users whereby the system implements the five (5) methods described below. It should be noted that methods 1, 2, 4 and 5 can be performed in different orders without straying from the intended scope of the present invention. Method 3 must be performed once 1 and 2 have been completed. The various Classes and Methods of the MapPoint Web Service® are used to illustrate this fourth aspect of the invention. However, as mentioned above, any mapping module with similar functionality to the MapPoint Web Service® may be utilized without straying from the intended scope of the present invention.
  • The first method in accordance with the fourth aspect of the invention includes finding other users whose Origin is within a specified distance from the Seeker's Travel Route. This method includes the steps whereby: (a) Seekers Travel Points, as defined by Origin Address, Destination Address and Waypoint Addresses (if provided) or by Global Coordinates Locations are converted to a travel route using the MapPoint Web Service® (specifically RouteServiceSoap Class); (b) the returned route is referenced by the FindNearRoute Method of the FindServiceSoap Class; (c) the MapPoint Web Service® ‘s FindNearRoute Method, is referenced to the Data Source Name of the data which was uploaded by one of the first, second, or third aspects of the invention described above; (d) other parameters are assigned to the FindNearRoute Method as necessary for proper functionality of the method prior to sending the FindNearRoute request; (e) parameters are set for the EntityPropertyValue property of the FindNearRouteSpecification to return only Origin points along the route; and (f) the returned array (call it Matched-Origin-To-Route-Array) represents Users whose Points of Origin lie within the specified distance from the Seeker's Travel Route.
  • The second method in accordance with the fourth aspect of the invention includes finding other users whose Destination Location is within a specified distance from the Seeker's Travel Route. This method includes the steps whereby: (a) Seekers Travel Points, as defined by Origin Address, Destination Address and Waypoint Addresses (if provided) or by Global Coordinates Locations are converted to a travel route using the MapPoint Web Service® (specifically RouteServiceSoap Class); (b) the returned route is referenced by the FindNearRoute Method of the FindServiceSoap Class; (c) the MapPoint Web Service®'s FindNearRoute Method, is referenced to the Data Source Name of the data which was uploaded by one of the first, second, or third aspects of the invention described above; (d) other parameters are assigned to the FindNearRoute Method as necessary for proper functionality of the method prior to sending the FindNearRoute request; (e) parameters are set for the EntityPropertyValue property of the FindNearRouteSpecification to return only Destination points along the route; and (f) the returned array (call it Matched-Destination-To-Route-Array) represents Users whose Destination Points lie within the specified distance from the Seeker's Travel Route.
  • The third method in accordance with the fourth aspect of the invention includes combining the first and second methods into one single Request from the RouteServiceSoap Class by employing filtering on the Carpool Matching server, rather than through use of the EntityPropertyValue property of the FindNearRouteSpecification Filter. In other words, the resultant array for the FindNearRouteMethod would contain both Origin and Destination points along the Route, and then the Carpool Matching application would separate out the matches that were origin points from the destination points. This method includes the steps whereby: (a) Seekers Travel Points, as defined by Origin Address, Destination Address and Waypoint Addresses (if provided) or by Global Coordinates Locations are converted to a travel route using the MapPoint Web Service® (specifically RouteServiceSoap Class); (b) the returned route is referenced by the FindNearRoute Method of the FindServiceSoap Class; (c) the MapPoint Web Service®'s FindNearRoute Method, is referenced to the Data Source Name of the data which was uploaded by one of the first, second, or third aspects of the invention described above; (d) other parameters are assigned to the FindNearRoute Method as necessary for proper functionality of the method prior to sending the FindNearRoute request; (e) the returned array (call it Matched-Origin-OR-Destination-To-Route-Array) represents Users whose Origin OR Destination Points lie within the specified distance from the Seeker's Travel Route; and (f) the returned array can then be split easily into two arrays to match the Matched-Origin-To-Route-Array and Matched-Destination-To-Route-Array.
  • The fourth method in accordance with the fourth aspect of the invention includes finding other users whose Origin is within a specified distance from the Seeker's Origin. This method includes the steps whereby: (a) Seekers' Origin Address or their respective Global Coordinate Origin are provided to the MapPoint Web Service® FindNearBy Method along with a reference to the Data Source Name of the data which was uploaded by one of the first, second, or third aspects of the invention described above; (b) other parameters are assigned to the FindNearBy Method as necessary for proper functionality of the method prior to sending the FindNearRoute request; and (c) the returned array (call it Matched-Origin-Point-Array) represents Users whose Origin Points lie within the specified distance from the Seeker's Origin Point.
  • The fifth method in accordance with the fourth aspect of the invention includes finding other users whose Destination is within a specified distance from the Seeker's Destination. This method includes the steps whereby: (a) Seekers' Destination Address or their respective Global Coordinate Origin are provided to the MapPoint Web Service® FindNearBy Method along with a reference to the Data Source Name of the data which was uploaded by one of the first, second, or third aspects of the invention described above; (b) other parameters are assigned to the FindNearBy Method as necessary for proper functionality of the method prior to sending the FindNearRoute request; and (c) the returned array (call it Matched-Destination-Point-Array) represents Users whose Destination Points lie within the specified distance from the Seeker's Destination Point.
  • Still further, a fifth aspect of the invention includes a method and related Carpool Matching system where data exists which was obtained using MapPoint FindNearBy Methods or FindNearRoute Methods and which can be processed using standard array processing methodologies to yield arrays which correspond to the following four (4) arrays: Matched-Origin-To-Route-Array, Matched-Destination-To-Route-Array, Matched-Origin-Point-Array, and Matched-Destination-Point-Array.
  • Yet still further, a sixth aspect of the invention includes a method and related Carpool Matching system where data exists or can be processed to exist and correspond to the Matched-Origin-To-Route-Array, Matched-Destination-To-Route-Array, Matched-Origin-Point-Array, and Matched-Destination-Point-Array so as to find Users who match one of the four (4) following categories.
  • Category One includes Users who match Origin and Destination Points with the Seeker. Such Users must exist in the Matched-Origin-To-Point-Array and the Matched-Destination-Point-Array.
  • Category Two includes Users who match Origin Point and whose Destination is along the Seeker's Route. Such Users must exist in the Matched-Origin-Point-Array and the Matched-Destination-To-Route-Array.
  • Category Three includes Users who match Destination Point and whose Origin is along the Seeker's Route. Such Users must exist in the Matched-Origin-To-Route-Array and the Matched-Destination-Point-Array.
  • Category Four includes Users whose Origin is along the Seeker's Route and also whose Destination is along the Seeker's Route. Such users must exist in the Matched-Origin-To-Route-Array and the Matched-Destination-To-Route-Array.
  • Still further, a seventh aspect of the invention includes a method and related Carpool Matching system where data exists, or can be processed to exist, and correspond to the Matched-Origin-To-Route-Array, Matched-Destination-To-Route-Array, Matched-Origin-Point-Array, and Matched-Destination-Point-Array and where a User Corresponds to (Category Four) Users whose Origin is along the Seeker's Route and also whose Destination is along the Seeker's Route whereby such users must exist in the Matched-Origin-To-Route-Array and the Matched-Destination-To-Route-Array. In such seventh aspect, the Travel Direction of the Matched User must match the Travel Direction of the Seeker. This is accomplished through ensuring that: (a) the Distance of (Matched Users Origin to Seeker's Origin) is LESS THAN the Distance of (Matched Users Destination to Seeker's Origin) AND (b) the Distance of (Matched Users Destination to Seeker's Destination) is LESS THAN the Distance of (Matched Users Origin to Seeker's Destination). Optionally, an addition filter can be applied to ensure that a reasonable distance exists between the Users Start & End Points compared to the Seeker's Travel Route. Such additional filter function is formed by ensuring that the Distance From Matched Users Origin to Matched Users Destination is GREATER THAN the Distance From Seeker's Origin to Seeker's Destination TIMES a given Factor (between 0% and 100% as desired).
  • In operation, a User is presented with a web-based interface as shown generally by FIGS. 1 through 6. The User is prompted to input data including, but not limited to, identifying information such as name, age, gender, home and/or work addresses, or employer. Additionally, personal preferences such as, but not limited to, smoker vs. non-smoker, driver vs. rider, allergies . . . etc. are entered by the User. The use of pull-down menus for populating the initial user information is possible in combination with fillable fields. Once the User provides the initial user information via the web-based interface, the Origin can be determined. This is accomplished by checking the address of the User against a database such as a postal database so as to determine with accuracy the Origin.
  • It should be understood that parsing of the address entered by the User may be necessary as data entry may vary among users (e.g., Smith Falls Road, Smiths Falls Rd., and Smithfalls RD). Further, the address entered by the User may involve an area of new housing construction. In such instances, the use of a mapping database (e.g., via Google or MapQuest websites) may be used or the user may be offered the option to indicate their location by clicking on a map. Once the Origin is determined, it is translated into latitudinal and longitudinal coordinates correlated to that User. An optional verification may be used in conjunction with the MapPoint Web Service®.
  • In system operation, it should be understood that multiple Users would be enabled to provide information and such information would be uploaded multiple times a day. Such information would therefore represent the Origins of many several Users along with their personal preferences. Such Origin data and User preferences would be assembled within the inventive system so as to be computationally-efficient using a standard relational database management system (RDBMS) with multiple indexes.
  • Once the relational database (or Object Oriented database) is formed, one or more Users would then use the web-based interface to set a destination. In much the same manner as setting the Origin, the User is prompted to input destination data by addresses. Once the User provides the destination address via the web-based interface, the Destination can be determined. This is accomplished by checking the destination address against a database such as a postal database so as to determine with accuracy the Destination. Again, it should be understood that parsing of the address entered by the User may be necessary as data entry may vary among users. Further, the address entered by the User may involve an area of new construction or mailbox drop areas vs. actual place of business. In such instances, the use of a mapping database (e.g., via the Google or MapQuest websites) may be used to locate the Destination. Once the Destination is determined, it is translated into latitudinal and longitudinal coordinates correlated to that Destination. As before with regard to the Origin determination, an optional verification may be used in conjunction with the MapPoint Web Service® to verify the Destination. As well, the use of pull-down menus for populating the Destination is possible in combination with fillable fields. It should be readily apparent that pull-downs are useful for popular destinations (e.g., Eiffel Tower, Empire State Building, and Sears Tower).
  • Using the Origin and Destination, the inventive system will configure the driving route via the MapPoint Web Service® described hereinabove utilizing the FindRoute function. This serves to automatically order the routes simultaneously by end points (i.e., including origin latitude and origin longitude along with corresponding destination latitude and destination longitude). The User may adjust the route they have provided to the system via selection of Waypoints (i.e., points along the driving route). It should be understood that Waypoints may themselves form an end point (either origin or destination).
  • Once the driving route is configured, the inventive system matches Users according to their Origin's and Destination's proximity to their Travel Route. It should be understood that driving direction is taken into account during this process such that only Users traveling the same direction along the driving route are actually matched. The personal preference filters are then applied so as to customize the matched Users. This also serves to limit the number of matched Users. In some instances, the number of matched Users may be too low if all personal preference filter criteria are applied. In such instances, the User may be given the option to remove one or more of the personal preferences. Alternatively, the User may be given the option at the initial data entry stage to rank their personal preferences whereby low ranked preferences could be ignored so as to increase the probability of a ride match.
  • The outcome of the above process in accordance with the inventive system may include, without limitation, a displayed profile and commuting schedule such as shown in FIGS. 1 and 2, a printed schedule or itinerary, a personalized schedule or itinerary that is physically couriered or electronically mailed to the User, or any combination thereof. It should further be understood that the inventive method and system may be used over wireless (e.g., cellular, WLAN . . . etc.) as well as hard-wired media such as dial-up or DSL Internet services. It should further be understood that although the above description indicates that the invention is Internet based, the scope of the present invention applies equally to operation internal to a company/enterprise through a LAN or WAN, or VPN (i.e., a company hosts the application on their servers for private network use only). As well, the present invention can alternatively be easily modified to function as a Client Based application.
  • The above-described embodiments of the present invention are intended to be examples only. Alterations, modifications and variations may be effected to the particular embodiments by those of skill in the art without departing from the scope of the invention, which is defined solely by the claims appended hereto.

Claims (21)

What is claimed is:
1. In a computer mapping program, a method for ride-sharing among multiple users along an optimized travel route, said method comprising:
identifying an origin corresponding to each of two or more users;
identifying personal preference criteria related to each of said two or more users;
identifying a destination provided by each of said two or more users;
correlating said origins and said destinations so as to find matched origins and destinations;
determining a matched list of users based upon said origins and said destinations of said two or more users;
filtering said matched list of users based upon said personal preference criteria; and
determining an optimized travel route corresponding to said origins and destinations related to said matched list of users.
2. The method as claimed in claim 1 wherein each said origin corresponding to each of said two or more users is a start point for travel along said optimized travel route.
3. The method as claimed in claim 1 wherein each said destination corresponding to each of said two or more users is an end point for travel along said optimized travel route.
4. The method as claimed in claim 1 wherein at least one said origin corresponding to said two or more users is a waypoint in a travel direction along said optimized travel route.
5. The method as claimed in claim 1 wherein at least one said destination corresponding to said two or more users is a waypoint in a travel direction along said optimized travel route.
6. The method as claimed in claim 1 wherein said step of determining said matched list of users based upon said origins and said destinations of said two or more users further includes applying a travel route filter and a travel schedule filter to said matched list of users.
7. The method as claimed in claim 6 wherein said travel route filters are applied by at least one of said two or more users whose travel origin and travel destination are both less than a specified distance away from a corresponding travel origin and travel destination of another one of said two or more users searching for a ride sharing partner.
8. The method as claimed in claim 6 wherein said travel route filters are applied by at least one of said two or more users
whose travel origin is less than a first specified distance away from a corresponding travel origin of another one of said two or more users searching for a ride sharing partner and
whose travel destination is less than a second specified distance away from a corresponding travel route of said another one of said two or more users.
9. The method as claimed in claim 6 wherein said travel route filters are applied by at least one of said two or more users
whose travel origin is less than a first specified distance away from a corresponding travel route of another one of said two or more users searching for a ride sharing partner and
whose travel destination is less than a second specified distance away from a corresponding travel destination of said another one of said two or more users.
10. The method as claimed in claim 6 wherein said travel route filters are applied by at least one of said two or more users
whose travel origin is less than a first specified distance away from a corresponding travel route of another one of said two or more users searching for a ride sharing partner and
whose travel destination is less than a second specified distance away from a corresponding travel route destination of said another one of said two or more users.
11. A computer-readable medium having computer executable instructions for identifying an optimized travel route to be used for a given ride-sharing requirement, which when executed, comprise:
identifying an origin corresponding to each of two or more users;
identifying personal preference criteria related to each of said two or more users;
identifying a destination provided by each of said two or more users;
correlating said origins and said destinations so as to find matched origins and destinations;
determining a matched list of users based upon said origins and said destinations of said two or more users;
filtering said matched list of users based upon said personal preference criteria; and
determining an optimized travel route corresponding to said origins and destinations related to said matched list of users.
12. An Internet-based system for identifying an optimized travel route to be used for a given ride-sharing requirement, said system comprising:
a means for identifying an origin corresponding to each of two or more users;
a means for identifying personal preference criteria related to each of said two or more users;
a means for identifying a destination provided by each of said two or more users;
a means for correlating said origins and said destinations so as to find matched origins and destinations;
a means for determining a matched list of users based upon said origins and said destinations of said two or more users;
a means for filtering said matched list of users based upon said personal preference criteria; and
a means for determining an optimized travel route corresponding to said origins and destinations related to said matched list of users.
13. The Internet-based system as claimed in claim 12 wherein said means for identifying said origin and said means for identifying said destination form location information established via a graphical user interface available to one or more users searching for a ride sharing partner.
14. The Internet-based system as claimed in claim 13 wherein said location information is uploaded to a mapping module that applies ride-sharing requirements.
15. The Internet-based system as claimed in claim 14 wherein said location information is geocoded prior to uploading to said mapping module.
16. The Internet-based system as claimed in claim 14 wherein said location information is geocoded by said mapping module.
17. The Internet-based system as claimed in claim 14 wherein said mapping module applies said ride-sharing requirements by determining said matched list of users based upon said origins and said destinations of said two or more users and applying a travel route filter and a travel schedule filter to said matched list of users.
18. The Internet-based system as claimed in claim 17 wherein said travel route filters are applied via said graphical user interface by at least one of said two or more users whose travel origin and travel destination are both less than a specified distance away from a corresponding travel origin and travel destination of another one of said two or more users searching for a ride sharing partner.
19. The Internet-based system as claimed in claim 17 wherein said travel route filters are applied via said graphical user interface by at least one of said two or more users
whose travel origin is less than a first specified distance away from a corresponding travel origin of another one of said two or more users searching for a ride sharing partner and
whose travel destination is less than a second specified distance away from a corresponding travel route of said another one of said two or more users.
20. The Internet-based system as claimed in claim 17 wherein said travel route filters are applied via said graphical user interface by at least one of said two or more users
whose travel origin is less than a first specified distance away from a corresponding travel route of another one of said two or more users searching for a ride sharing partner and
whose travel destination is less than a second specified distance away from a corresponding travel destination of said another one of said two or more users.
21. The Internet-based system as claimed in claim 17 wherein said travel route filters are applied via said graphical user interface by at least one of said two or more users
whose travel origin is less than a first specified distance away from a corresponding travel route of another one of said two or more users searching for a ride sharing partner and
whose travel destination is less than a second specified distance away from a corresponding travel route destination of said another one of said two or more users.
US16/731,016 2006-05-25 2019-12-30 Method of selective ride-sharing among multiple users along an optimized travel route Abandoned US20200149904A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US16/731,016 US20200149904A1 (en) 2006-05-25 2019-12-30 Method of selective ride-sharing among multiple users along an optimized travel route

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US80318606P 2006-05-25 2006-05-25
US11/735,552 US10520325B2 (en) 2006-05-25 2007-04-16 Method of selective ride-sharing among multiple users along an optimized travel route
US16/731,016 US20200149904A1 (en) 2006-05-25 2019-12-30 Method of selective ride-sharing among multiple users along an optimized travel route

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US11/735,552 Continuation US10520325B2 (en) 2006-05-25 2007-04-16 Method of selective ride-sharing among multiple users along an optimized travel route

Publications (1)

Publication Number Publication Date
US20200149904A1 true US20200149904A1 (en) 2020-05-14

Family

ID=38750580

Family Applications (2)

Application Number Title Priority Date Filing Date
US11/735,552 Expired - Fee Related US10520325B2 (en) 2006-05-25 2007-04-16 Method of selective ride-sharing among multiple users along an optimized travel route
US16/731,016 Abandoned US20200149904A1 (en) 2006-05-25 2019-12-30 Method of selective ride-sharing among multiple users along an optimized travel route

Family Applications Before (1)

Application Number Title Priority Date Filing Date
US11/735,552 Expired - Fee Related US10520325B2 (en) 2006-05-25 2007-04-16 Method of selective ride-sharing among multiple users along an optimized travel route

Country Status (1)

Country Link
US (2) US10520325B2 (en)

Families Citing this family (106)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080091342A1 (en) * 2006-10-11 2008-04-17 Jeffrey Assael System and method for ride matching
US20080091525A1 (en) * 2006-10-13 2008-04-17 Laurent Kretz Virtual online community with geographically targeted advertising
US20080147652A1 (en) * 2006-12-14 2008-06-19 Bellsouth Intellectual Property Corporation Physical address verification within electronic documents
US20080270019A1 (en) * 2006-12-29 2008-10-30 High Regard Software, Inc. Systems and methods for enhancing private transportation
WO2008100489A2 (en) 2007-02-12 2008-08-21 Sean O'sullivan Shared transport system and service network
EP2153388A1 (en) * 2007-04-30 2010-02-17 Jime Sa Method of intermediation within a social network of users of a service/application to expose relevant media items
US20100312464A1 (en) * 2007-05-01 2010-12-09 Chicke Fitzgerald Advice engine delivering personalized search results and customized roadtrip plans
US20080294337A1 (en) * 2007-05-23 2008-11-27 Christopher James Dawson Travel-related information processing system
US20080293430A1 (en) * 2007-05-23 2008-11-27 Nokia Corporation Method, Apparatus and Computer Program Product for a Social Route Planner
US20090055513A1 (en) * 2007-08-24 2009-02-26 Evite Llc Method and system for communicating carpool information
US20090248587A1 (en) * 2007-08-31 2009-10-01 Van Buskirk Peter C Selectively negotiated ridershare system comprising riders, drivers, and vehicles
EP2881712A1 (en) * 2007-11-24 2015-06-10 Routerank Ltd Optimized route planning
US20090172009A1 (en) * 2007-12-28 2009-07-02 Carpools Consolidated Corporation Carpool or Ride Matching by wireless digital messaging Linked Database
US20090210276A1 (en) * 2008-02-19 2009-08-20 Microsoft Corporation Ad hoc and opportunistic transportation services
US20090234573A1 (en) * 2008-03-17 2009-09-17 Emory University Office Of Technology Transfer Travel Partner Matching Using Selectable Map Interface
US20090281844A1 (en) * 2008-05-09 2009-11-12 Probst Joseph M Charter Transport Service Information Management System
US8762035B2 (en) 2008-05-19 2014-06-24 Waze Mobile Ltd. System and method for realtime community information exchange
JP4623156B2 (en) * 2008-07-25 2011-02-02 トヨタ自動車株式会社 Vehicle information recording system, vehicle information recording device, and vehicle information recording method
US20100211401A1 (en) * 2009-02-16 2010-08-19 Williams David M Transportation System
US8285571B2 (en) * 2009-02-18 2012-10-09 Toyota Motor Engineering & Manufacturing North America (Tema) Rideshare system and associated methodology
US8271057B2 (en) * 2009-03-16 2012-09-18 Waze Mobile Ltd. Condition-based activation, shut-down and management of applications of mobile devices
US20100280884A1 (en) * 2009-04-30 2010-11-04 Uri Levine Automated carpool matching
US20100332242A1 (en) * 2009-06-25 2010-12-30 Microsoft Corporation Collaborative plan generation based on varying preferences and constraints
DE102009026171A1 (en) * 2009-07-14 2010-11-18 Paade Gmbh Procedure to support the formation of carpooling
US8285570B2 (en) * 2009-08-28 2012-10-09 Rideamigos Corp. Matching system for ride reservation platforms
DE102010003610A1 (en) * 2010-04-01 2011-10-06 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Automatic dynamic driving routes aligning method for location-referred riding driving requests requested by persons in transport unit, involves transmitting notification records of alignment unit to terminals of peoples with information
US8412667B2 (en) 2010-05-13 2013-04-02 Microsoft Corporation Comparing and identifying similar tracks
CN102410839B (en) * 2010-09-17 2016-02-17 阿尔派株式会社 The course guiding method of guider and guider
US20120078672A1 (en) * 2010-09-29 2012-03-29 IT Curves LLC Efficient Automated Ride Sharing System
CA2830228C (en) 2011-03-14 2017-08-29 Jonathan David MILLER Processing and fulfilling natural language travel requests
US11763212B2 (en) 2011-03-14 2023-09-19 Amgine Technologies (Us), Inc. Artificially intelligent computing engine for travel itinerary resolutions
US9659099B2 (en) 2011-03-14 2017-05-23 Amgine Technologies (Us), Inc. Translation of user requests into itinerary solutions
TW201239805A (en) * 2011-03-30 2012-10-01 Nat Univ Tsing Hua A system and method for dynamic carpool service
KR101110639B1 (en) 2011-06-22 2012-06-12 팅크웨어(주) Safe service system and method thereof
US20130054281A1 (en) * 2011-08-28 2013-02-28 GreenMiles Technologies LLC Methods and systems for rideshare
US20130054139A1 (en) * 2011-08-30 2013-02-28 International Business Machines Corporation Location of Available Passenger Seats in a Dynamic Transporting Pool
US8799038B2 (en) * 2011-09-07 2014-08-05 National Tsing Hua University Dynamic taxi-sharing system and sharing method thereof
US8868529B2 (en) * 2011-12-16 2014-10-21 Sap Se N-dimensional locking
CN103366222A (en) * 2012-04-05 2013-10-23 创炎资讯科技有限公司 Journey planning system and journey planning, evaluating and automatic generating method
TWI475507B (en) * 2012-08-20 2015-03-01 Univ Nat Taiwan Science Tech Network matchmaking system
US20140173511A1 (en) * 2012-12-13 2014-06-19 Jens Lehmann Process and method for increasing usage for a carpooling system
US9506768B2 (en) * 2013-02-28 2016-11-29 Sap Se Adaptive route proposals based on prior rides
US20140278053A1 (en) * 2013-03-14 2014-09-18 Samsung Electronics Co., Ltd. Navigation system with dynamic update mechanism and method of operation thereof
WO2014203256A1 (en) * 2013-06-20 2014-12-24 Reider David Rideshare system and method of use thereof
CA3194882A1 (en) * 2013-12-11 2015-06-18 Uber Technologies, Inc. Optimizing selection of drivers for transport requests
US20150213474A1 (en) * 2014-01-27 2015-07-30 Mastercard International Incorporated Apparatus, method, and computer program product for transit pooling using payment card data
ES2525738B2 (en) * 2014-01-27 2015-04-13 Martín HERRÁIZ HERRÁIZ Procedure for supervision and control of vehicle routes to optimize the use of their load capacities
US9965783B2 (en) 2014-02-07 2018-05-08 Uber Technologies, Inc. User controlled media for use with on-demand transport services
US9600781B2 (en) * 2014-02-21 2017-03-21 Ebay Inc. Enhanced seat selection
CN104332046A (en) * 2014-02-23 2015-02-04 曾昭兴 Taxi pooling method, system and server
US10198700B2 (en) 2014-03-13 2019-02-05 Uber Technologies, Inc. Configurable push notifications for a transport service
US9888087B2 (en) 2014-03-31 2018-02-06 Uber Technologies, Inc. Adjusting attributes for an on-demand service system based on real-time information
US10282797B2 (en) 2014-04-01 2019-05-07 Amgine Technologies (Us), Inc. Inference model for traveler classification
US9536271B2 (en) 2014-05-16 2017-01-03 Uber Technologies, Inc. User-configurable indication device for use with an on-demand transport service
US9892637B2 (en) 2014-05-29 2018-02-13 Rideshare Displays, Inc. Vehicle identification system
US10467896B2 (en) 2014-05-29 2019-11-05 Rideshare Displays, Inc. Vehicle identification system and method
US9612127B2 (en) * 2014-07-25 2017-04-04 GM Global Technology Operations LLC Carpool finder assistance
CA2956631C (en) 2014-07-30 2022-04-12 Uber Technologies, Inc. Arranging a transport service for multiple users
JP6619797B2 (en) 2014-08-04 2019-12-11 ウーバー テクノロジーズ,インコーポレイテッド Determination of predetermined position data points and supply to service providers
SG11201701332QA (en) 2014-09-05 2017-03-30 Uber Technologies Inc Providing route information to devices during a shared transport service
JP6488136B2 (en) * 2015-01-27 2019-03-20 株式会社日本総合研究所 Server device
US9852551B2 (en) 2015-02-05 2017-12-26 Uber Technologies, Inc. Programmatically determining location information in connection with a transport service
WO2016156900A1 (en) * 2015-04-02 2016-10-06 Nokia Technologies Oy An apparatus and associated methods for use in planning a group journey
US10474978B2 (en) * 2015-04-28 2019-11-12 Adp, Llc Systems and methods for commute analysis and modeling
US20160320195A1 (en) * 2015-04-29 2016-11-03 Ford Global Technologies, Llc Ride-sharing long-term ride-share groups
US10796248B2 (en) 2015-04-29 2020-10-06 Ford Global Technologies, Llc Ride-sharing joint rental groups
CN104931063B (en) * 2015-04-29 2020-08-11 腾讯科技(深圳)有限公司 Path planning method
US11049047B2 (en) 2015-06-25 2021-06-29 Amgine Technologies (Us), Inc. Multiattribute travel booking platform
CA2988975C (en) 2015-06-18 2022-09-27 Amgine Technologies (Us), Inc. Scoring system for travel planning
US11941552B2 (en) 2015-06-25 2024-03-26 Amgine Technologies (Us), Inc. Travel booking platform with multiattribute portfolio evaluation
CN104978420B (en) * 2015-06-30 2018-09-07 百度在线网络技术(北京)有限公司 Traffic route matching process and device
US10408631B2 (en) * 2015-07-24 2019-09-10 International Business Machines Corporation Journey planning
US20170061561A1 (en) * 2015-08-25 2017-03-02 Steve Cha Mobile ride-sharing social networking e-commerce platform
US10586300B2 (en) * 2015-11-10 2020-03-10 Gt Gettaxi Limited Graphical user interface (GUI) for implementing controls for geographic conveyance
US9939279B2 (en) 2015-11-16 2018-04-10 Uber Technologies, Inc. Method and system for shared transport
EP3380956A4 (en) * 2015-11-26 2019-01-09 Beijing Didi Infinity Technology and Development Co., Ltd. Systems and methods for allocating sharable orders
WO2017152115A1 (en) * 2016-03-03 2017-09-08 Loxhub, Llc Methods and systems for aggregating excess carrier capacity
US11216857B2 (en) 2016-06-23 2022-01-04 Stubhub, Inc. Weather enhanced graphical preview for an online ticket marketplace
US10885472B2 (en) * 2016-06-28 2021-01-05 International Business Machines Corporation Dynamic transportation pooling
US9857188B1 (en) 2016-06-29 2018-01-02 Uber Technologies, Inc. Providing alternative routing options to a rider of a transportation management system
US10900795B2 (en) 2016-07-22 2021-01-26 Comuto S.A. Method and system for identifying meeting points
US9813510B1 (en) 2016-09-26 2017-11-07 Uber Technologies, Inc. Network system to compute and transmit data based on predictive information
US10325442B2 (en) 2016-10-12 2019-06-18 Uber Technologies, Inc. Facilitating direct rider driver pairing for mass egress areas
CN106595678A (en) * 2016-11-10 2017-04-26 广州市沃希信息科技有限公司 Passenger positioning method and system
US10156452B2 (en) 2016-11-14 2018-12-18 Conduent Business Service, Llc Method and system for ridesharing management
US10203212B2 (en) 2016-12-16 2019-02-12 Comuto S.A. Method and system for determining detoured trips
US10355788B2 (en) 2017-01-06 2019-07-16 Uber Technologies, Inc. Method and system for ultrasonic proximity service
US10147325B1 (en) * 2017-02-02 2018-12-04 Wells Fargo Bank, N.A. Customization of sharing of rides
US9898791B1 (en) 2017-02-14 2018-02-20 Uber Technologies, Inc. Network system to filter requests by destination and deadline
US20180260787A1 (en) * 2017-03-13 2018-09-13 GM Global Technology Operations LLC Systems, methods and devices for driver-rider matching adaptable to multiple rideshare models
CN109086902B (en) * 2017-06-14 2021-04-02 北京嘀嘀无限科技发展有限公司 Processing method, processing apparatus, server, computer device, and storage medium
US20190072398A1 (en) * 2017-09-05 2019-03-07 Here Global B.V. Navigation using multiple user trip plan integration
US10567520B2 (en) 2017-10-10 2020-02-18 Uber Technologies, Inc. Multi-user requests for service and optimizations thereof
WO2019136472A1 (en) 2018-01-08 2019-07-11 Ho William P C Method and apparatus for route planning
CN108332765B (en) * 2018-01-18 2020-09-22 维沃移动通信有限公司 Carpooling travel route generation method and device
JP7006468B2 (en) * 2018-04-09 2022-01-24 トヨタ自動車株式会社 Information processing equipment, carpool proposal method and program
JP7006503B2 (en) * 2018-05-22 2022-01-24 トヨタ自動車株式会社 Riding support system, riding support device and riding support method
JP2020013451A (en) * 2018-07-20 2020-01-23 パナソニック インテレクチュアル プロパティ コーポレーション オブ アメリカPanasonic Intellectual Property Corporation of America Information processing method
JP2020071107A (en) * 2018-10-30 2020-05-07 トヨタ自動車株式会社 Route search device, route search method, and route search program
JP7206818B2 (en) * 2018-11-01 2023-01-18 トヨタ自動車株式会社 Ride-sharing brokerage system, server, program and ride-sharing brokerage method
US11774256B2 (en) 2019-01-30 2023-10-03 Uber Technologies, Inc. User control of alternate routes
JP7167879B2 (en) * 2019-08-19 2022-11-09 トヨタ自動車株式会社 Server, dispatch method, and dispatch program
US11570276B2 (en) 2020-01-17 2023-01-31 Uber Technologies, Inc. Forecasting requests based on context data for a network-based service
US11093909B1 (en) 2020-03-05 2021-08-17 Stubhub, Inc. System and methods for negotiating ticket transfer
US11657441B2 (en) 2020-04-03 2023-05-23 Toyota Motor North America, Inc. Profile-based service for transports
CN112752232B (en) * 2021-01-07 2022-07-12 重庆大学 Privacy protection-oriented driver-passenger matching method

Family Cites Families (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4360875A (en) * 1981-02-23 1982-11-23 Behnke Robert W Automated, door-to-door, demand-responsive public transportation system
GB9516762D0 (en) 1995-08-16 1995-10-18 Phelan Sean P Computer system for identifying local resources
GB2341708B (en) * 1998-09-18 2002-03-27 Ibm Routing system
AUPQ363299A0 (en) 1999-10-25 1999-11-18 Silverbrook Research Pty Ltd Paper based information inter face
US20010056363A1 (en) * 2000-06-26 2001-12-27 Gantz Donald T. System for providing ride matching services using e-mail and the internet
US6751548B2 (en) 2000-11-20 2004-06-15 Max Fox Matching stored routes to a required route
US7080019B1 (en) * 2001-03-04 2006-07-18 Ducktrip, Llc Ride share contact system
GB2381884A (en) * 2001-07-16 2003-05-14 Pablo D Cappellini A search engine of flexibly-defined paths applicable to the search of transportation-related routes
GB0126809D0 (en) * 2001-11-07 2002-01-02 Isaac Stephen J A car-sharing system
US6584401B2 (en) * 2001-11-27 2003-06-24 Hewlett-Packard Development Company, Lp. Automatic gathering and analysis of data on commute paths
WO2004001541A2 (en) * 2002-06-21 2003-12-31 Nuride, Inc. System and method for facilitating ridesharing
WO2004013733A2 (en) * 2002-08-02 2004-02-12 Limoq, Inc. Method, system and apparatus for providing transportation services
CN100383803C (en) * 2003-02-11 2008-04-23 哈曼贝克自动系统股份有限公司 high occupancy vehicle restriction aware navigation system
US6925381B2 (en) * 2003-06-24 2005-08-02 Bellsouth Intellectual Property Corporation Methods, systems and computer program products for ride matching based on current location information
JP4486331B2 (en) * 2003-08-12 2010-06-23 クラリオン株式会社 Route search method for navigation device
US7062376B2 (en) * 2003-08-28 2006-06-13 General Motors Corporation Method and system for providing a carpool service using a telematics system
DE10343486A1 (en) * 2003-09-19 2005-04-14 Robert Bosch Gmbh System for the provision of services
CA2530909C (en) * 2005-12-20 2011-02-22 Trapeze Software Inc. System and method of optimizing a fixed route transit network
US20080091342A1 (en) * 2006-10-11 2008-04-17 Jeffrey Assael System and method for ride matching

Also Published As

Publication number Publication date
US10520325B2 (en) 2019-12-31
US20070276595A1 (en) 2007-11-29

Similar Documents

Publication Publication Date Title
US20200149904A1 (en) Method of selective ride-sharing among multiple users along an optimized travel route
US11940284B1 (en) Casual driver ride sharing
US9228841B2 (en) Methods and systems for determining routes in a navigation system
US8725612B2 (en) Personalized real-time location-based travel management
US8983973B2 (en) Systems and methods for ranking points of interest
US20080091342A1 (en) System and method for ride matching
US7729947B1 (en) Computer implemented methods and system for providing a plurality of options with respect to a stopping point
US9301099B2 (en) Method of analyzing points of interest with probe data
WO2007040551A2 (en) Method and system for identification of geographic location
US20160292596A1 (en) Methods and systems for scheduling a shared ride among commuters
US20170108348A1 (en) Centrally Managed Waypoints Established, Communicated and Presented via Vehicle Telematics/Infotainment Infrastructure
JP2019508807A (en) Method and system for on-demand customized service
US20070192111A1 (en) Peer-to-peer network method and system for shipment delivery transactions
US20100207812A1 (en) Rideshare system and associated methodology
US20130124279A1 (en) Location of Available Passenger Seats in a Dynamic Transporting Pool
US20140278086A1 (en) Using historical location data to improve estimates of location
US20110054956A1 (en) Matching System for Ride Reservation Platforms
US20120277985A1 (en) Method of analyzing points of interest with probe data
WO2007113844A1 (en) System and method to facilitate travel networking
US20090105941A1 (en) Automatic destination determination for multiple travelers departing from multiple source locations based on user specified criteria
US10503724B2 (en) System and method for contact information access
US20140095221A1 (en) Systems and method for providing recommendations
CA2585412C (en) Method of selective ride-sharing among multiple users along an optimized travel route
NuStats 2010–2012 California Household Travel Survey Final Report
US9154576B2 (en) System and process for communicating between two vehicles

Legal Events

Date Code Title Description
STPP Information on status: patent application and granting procedure in general

Free format text: APPLICATION DISPATCHED FROM PREEXAM, NOT YET DOCKETED

STPP Information on status: patent application and granting procedure in general

Free format text: DOCKETED NEW CASE - READY FOR EXAMINATION

STPP Information on status: patent application and granting procedure in general

Free format text: NON FINAL ACTION MAILED

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION

STPP Information on status: patent application and granting procedure in general

Free format text: RESPONSE TO NON-FINAL OFFICE ACTION ENTERED AND FORWARDED TO EXAMINER

STPP Information on status: patent application and granting procedure in general

Free format text: FINAL REJECTION MAILED

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION