WO2018057036A1

WO2018057036A1 - Selective ride sharing

Info

Publication number: WO2018057036A1
Application number: PCT/US2016/053757
Authority: WO
Inventors: Anthony Prozzi; Connie ZENG; Casey Bryan FELDMAN; Alexander Silvio MULLER; Owen Carpenter
Original assignee: Ford Global Technologies, Llc
Priority date: 2016-09-26
Filing date: 2016-09-26
Publication date: 2018-03-29

Abstract

The present invention extends to methods, systems, and computer program products for selective ride sharing. A plurality of users interacts with a ride-sharing system. Using the ride-sharing system, a user can select to be a rider or a driver. The user enters the desired destination into the ride-sharing system and the approximate starting time of his/her trip. A map populates on the screen with visual representations (e.g., dots) of individual drivers and/or riders that satisfy various criteria. In one aspect, the map is a street map with the locations of user's indicated on the street map. The various criteria can include predetermined distances, predetermined times, and social profile information. Users sharing the same rider are able to view social profile information for one another.

Description

SELECTIVE RIDE SHARING

CROSS-REFERENCE TO RELATED APPLICATIONS

[0001] Not applicable.

BACKGROUND

[0002] 1. Field of the Invention

[0003] This invention relates generally to the field of ride sharing, and, more particularly, to user configurable and user selectable ride sharing based on social profile information and filters. 2. Related Art

[0004] Ride sharing systems typically include a driver selecting one or more riders they would like to transport from a list of riders. Selections are primarily made based on having a common destination and a rider's proximity to the driver for pickup. However, drivers and riders have limited ability to customize their ride sharing experience.

BRIEF DESCRIPTION OF THE DRAWINGS

[0005] The specific features, aspects and advantages of the present invention will become better understood with regard to the following description and accompanying drawings where:

[0006] Figure 1 illustrates an example block diagram of a computing device.

[0007] Figure 2 illustrates an example computer architecture that facilitates selective ride sharing.

[0008] Figure 3 illustrates a flow chart of an example method for selective ride sharing.

[0009] Figure 4 illustrates an example data flow for selective ride sharing.

DETAILED DESCRIPTION

[0011] The present invention extends to methods, systems, and computer program products for selective ride sharing. Aspects of the invention include coordinating rides between people based on interests and preferences.

[0012] A plurality of users interacts with a ride-sharing system. Using the ride-sharing system, a user can select to be a rider or a driver. The user enters a desired destination into the ride-sharing system and the approximate starting time of his/her trip. If the user selects driver (to indicate that the user wants to be a driver), a map populates on the screen with visual representations (e.g., dots) of individual riders that satisfy various criteria. In one aspect, the map is a street map with the locations of other users (drivers and/or riders) indicated on the street map. The various criteria can include geographic compatibility matching and criteria temporal compatibility matching criteria from a driver's perspective.

[0013] In one alternative, geographic compatibility matching criteria can be used to match riders within a predetermined distance from the driver and that are going to a destination within a predetermined distance from the destination of the driver. In another alternative, geographic compatibility matching criteria can be used to match riders within a predetermined distance from the driver and that are going to a destination within a predetermined distance from some point along the driver's route. In further alternative, geographic compatibility matching criteria can be used to match riders that are to be picked up within a predetermined distance from some point along the driver's route and that are going to a destination within a predetermined distance from the destination of the driver. In an additional alternative, geographic compatibility matching criteria can be used to match riders that are to be picked up within a predetermined distance from some point along the driver's route and that are going to a destination within the (same or a different) predetermined distance from another point along the driver's route. In some aspects, a plurality of the different alternatives can be used to match a driver with one or more riders.

[0014] In one aspect, geographic compatibility matching criteria include a "distance shared" criterion. The ride-sharing system estimates a distance a driver and rider would travel together if the rider were to share a ride with the driver. If the estimated shared distance satisfies the "disturbance shared" criterion (e.g., a specified number of miles), a rider may be identified as a match for a driver.

[0015] Temporal compatibility matching criteria can be used to match a driver to one or more riders based on one or more of: the driver's approximate starting time, the driver's estimated times of arrival (ETAs) at various points along the driver's route, and the driver's estimated time of arrival at his/her destination. Estimated times of arrival (ETA) can take into account time for delivering other riders already selected for a ride to their destinations.

[0016] In one aspect, temporal compatibility matching criteria a "time shared" criterion. The ride-sharing system estimates an amount of time a driver and rider would travel together if the rider were to share a ride with the driver. If the estimated shared amount of time satisfies the "time shared" criterion (e.g., a specified number of minutes), a rider may be identified as a match for a driver.

[0017] On the other hand, if the user selects rider (to indicate that the user wants to be a rider), a map populates on the screen with visual representations (e.g., dots) of individual drivers that satisfy the various criteria. In one aspect, the map is a street map with the locations of other users (drivers and/or riders) indicated on the street map. The various criteria can include geographic compatibility matching criteria and temporal compatibility matching criteria from a rider's perspective. [0018] Accordingly, the ride-sharing system can filter out candidates for ride sharing by distance or time incompatibilities. For example, when a driver has to go too far out of his/her way to pick up a potential rider. The ride-sharing system can use algorithms that combine variations of the described matching techniques potentially combined with preferences specified in social profile information and/or other profile information.

[0019] Users of the ride-sharing system are provided information about other vehicle occupants (e.g., the driver and any other riders). The provided information can include pickup and drop off locations for other riders and estimated pickup and drop off times for other riders. Thus, users have better control over who rides along with them, including choosing not to ride with other riders that could affect their time of arrival (ETA) to a destination point due to having to drop off other riders. This provided information can also include social settings, such as, for example, whether a driver or other riders are interested in talking or not. Thus, users can select a more social or a quieter atmosphere for a ride.

[0020] In one aspect, a ride-sharing system accesses profile information for users. Profile information can be entered during a registration process with the ride-sharing system. Alternately or in combination, the ride-sharing system can access profile information from one or more networking sites for each user. Profile information can include social profile information as well as other types of profile information, such as, for example, status, temperament, traits, etc.

[0021] Users (both drivers and riders) have the ability to filter their corresponding visual representation on a map. In one aspect, a user-interface for a map incudes filter buttons used to apply different filtering criteria. Filter criteria can be used to filter prospective drivers and/or riders by different profile information, such as, for example, primary interests, preference for a silent or social ride, etc. Filter criteria can also be used to filter drivers and/or riders by rating (e.g., 1-5 stars). Depending on applied filters, the number of dots on the screen may increase or decrease. The same values entered by the user for each individual filter criterion can be applied automatically for following rides until the user makes a change (then the changed value can remain until further changes).

[0022] To assist a driver with the selection process, a driver can select potential rider(s) (e.g., driver clicks on a rider dot on the map) and a suggested (e.g., street) route is displayed. The suggested route is calculated based at least on the current locations and the destinations of the selected potential rider(s) and the driver (e.g., using a shortest trip time algorithm that covers the destinations and the starting points). The route can indicate ETAs of each potential rider's pickup point and destination/drop off point. ETA information can be displayed on a map or in a chart.

[0023] A driver can also access more information about each potential rider. For each potential rider, the map can provide a user-interface control for accessing (e.g., social and/or other) profile information about the potential rider. If the driver likes a potential rider based on the current route plan and/or his/her profile information, the driver can make his/her final selection of the rider by clicking a further user-interface control (e.g., a ' Select this Rider' button).

[0024] When the rider(s) are selected, the ride-sharing system sends a notification to the rider(s), offering them a ride in the driver's vehicle. Sending a notification can include the ride- sharing system changing a visual representation of a driver on the rider's map. For example, ride-sharing system can highlight or pulsate a dot representing the driver. [0025] The notification (e.g., highlighted or pulsating dot on the rider's map) serves as an indication of the driver's invitation. The rider can then choose whether or not to accept the driver's invitation. Prior to accepting a driver's invitation, a rider can access more information about the driver and more information about other riders that have accepted the driver's invitation for the ride. For the driver and other riders, the map can provide a user-interface control for accessing (e.g., social and/or other) profile information about the driver and each other rider. If the rider likes the ride based on the current route plan and/or profile information for the driver and other riders, the rider can accept the invitation by clicking a further user- interface control (e.g., an 'Accept Invitation for this Ride' button).

[0026] The driver can repeat the notification (invitation) process for one or more additional riders.

[0027] In one aspect, the first N riders to accept an invitation are assigned to the trip. N can be a maximum number of available seats indicated by the driver in his/her profile. When N riders have accepted an invitation, the ride-sharing system can retract the invitation from other potential riders. In one aspect, the invitation can be removed from a map (e.g., by greying out a visual representation, for example, a dot, for the driver).

[0028] A driver can choose to start a trip or invite more riders at any time when fewer than N riders have accepted an invitation for a ride. When N riders have accepted an invitation for a ride, the ride-sharing system can prevent the driver from sending additional invitations for the ride.

[0029] To help riders with the selection process, a rider can select user-interface controls (e.g., a driver dot) for potential driver(s) on the map. The ride-sharing system can provide a suggested (e.g., street) route based on the current locations and the destinations of the driver, (if applicable) any previously selected riders, and the rider. The route can be calculated and displayed on the map to the rider. The route can be calculated based on based on an existing shortest trip time algorithm that covers the destinations and the starting points for driver, (if applicable) any previously selected riders, and the rider. The route can display ETAs of each rider's pick-up point and destination/drop off points. ETA information can be displayed on a map or in a chart.

[0030] In one aspect, information presented to potential riders is limited until a ride invitation is accepted. For example, clicking on the profile of the driver's currently selected riders shows limited information until the rider himself is locked for the ride. For example, a profile view can show interests, location, and destination but hide things that would be more important to identifying them, such as, for example, name, gender, occupation, etc. until the route is locked in.

[0031] A rider can also access more information about potential drivers. For each potential driver, the map can provide a user-interface control for accessing (e.g., social and/or other) profile information about the potential driver. If the rider likes a potential driver based on the current route plan and/or his/her profile information, the rider can make his/her final selection of the driver by clicking a further user-interface control (e.g., a ' Select this Driver' button).

[0032] When driver(s) are selected, the ride-sharing system sends a notification to the drivers(s), letting the drivers know that the rider is interested in joining his/her vehicle and requesting a ride. Sending a notification can include the ride-sharing system changing a visual representation of a rider on the driver's map. For example, ride-sharing system can highlight or pulsate a dot representing the driver. [0033] The notification (e.g., highlighted or pulsating dot on driver's map) serves as an indication of the rider's request. The driver can then choose whether or not to accept the rider's request. Prior to accepting a rider's request, a driver can access more information about the rider. For the driver, the map can provide a user-interface control for accessing (e.g., social and/or other) profile information about the rider. If the driver likes the rider based on the current route plan and/or profile information for the rider, the can accept the request by clicking a further user-interface control (e.g., an 'Accept Request for this Ride' button). The first driver to accept the request can lock the trip with the rider.

[0034] Anytime a driver/rider rejects a request/invitation or if a rider unlocks himself/herself, he/she will be highlighted in a specific way (e.g., dot turns black or grayed-out) on the original requester or the driver's map. Anytime a driver decides to start a ride using the ride-sharing system, a notification is sent to the rider(s) and the driver, and GPS navigation initiates with the location(s) of the rider(s). Once a ride has started, new riders can be prevented from joining the ride.

[0035] When riders finish a trip, the rider can rate the driver and other rider(s) from the trip (e.g., 1-5 stars). When a driver finishes a trip, the driver can rate rider(s) from the trip (e.g., 1-5 stars).

[0036] Aspects of the invention can be implemented in a variety of different types of computing devices. Figure 1 illustrates an example block diagram of a computing device 100. Computing device 100 can be used to perform various procedures, such as those discussed herein. Computing device 100 can function as a server, a client, or any other computing entity. Computing device 100 can perform various communication and data transfer functions as described herein and can execute one or more application programs, such as the application programs described herein. Computing device 100 can be any of a wide variety of computing devices, such as a mobile telephone or other mobile device, a desktop computer, a notebook computer, a server computer, a handheld computer, tablet computer and the like.

[0037] Computing device 100 includes one or more processor(s) 102, one or more memory device(s) 104, one or more interface(s) 106, one or more mass storage device(s) 108, one or more Input/Output (I/O) device(s) 110, and a display device 130 all of which are coupled to a bus 112. Processor(s) 102 include one or more processors or controllers that execute instructions stored in memory device(s) 104 and/or mass storage device(s) 108. Processor(s) 102 may also include various types of computer storage media, such as cache memory.

[0038] Memory device(s) 104 include various computer storage media, such as volatile memory (e.g., random access memory (RAM) 114) and/or nonvolatile memory (e.g., read-only memory (ROM) 116). Memory device(s) 104 may also include rewritable ROM, such as Flash memory.

[0039] Mass storage device(s) 108 include various computer storage media, such as magnetic tapes, magnetic disks, optical disks, solid state memory (e.g., Flash memory), and so forth. As depicted in Figure 1, a particular mass storage device is a hard disk drive 124. Various drives may also be included in mass storage device(s) 108 to enable reading from and/or writing to the various computer readable media. Mass storage device(s) 108 include removable media 126 and/or non-removable media.

[0040] I/O device(s) 110 include various devices that allow data and/or other information to be input to or retrieved from computing device 100. Example I/O device(s) 110 include cursor control devices, keyboards, keypads, barcode scanners, microphones, monitors or other display devices, speakers, printers, network interface cards, modems, cameras, lenses, radars, CCDs or other image capture devices, and the like.

[0041] Display device 130 includes any type of device capable of displaying information to one or more users of computing device 100. Examples of display device 130 include a monitor, display terminal, video projection device, and the like.

[0042] Interface(s) 106 include various interfaces that allow computing device 100 to interact with other systems, devices, or computing environments as well as humans. Example interface(s) 106 can include any number of different network interfaces 120, such as interfaces to personal area networks (PANs), local area networks (LANs), wide area networks (WANs), wireless networks (e.g., near field communication (NFC), Bluetooth, Wi-Fi, etc., networks), and the Internet. Other interfaces include user interface 118 and peripheral device interface 122.

[0043] Bus 112 allows processor(s) 102, memory device(s) 104, interface(s) 106, mass storage device(s) 108, and I/O device(s) 110 to communicate with one another, as well as other devices or components coupled to bus 112. Bus 112 represents one or more of several types of bus structures, such as a system bus, PCI bus, IEEE 1394 bus, USB bus, and so forth.

[0044] Figure 2 illustrates an example computer architecture 200 that facilitates selective ride sharing. As depicted, computer architecture 200 includes ride-sharing system 201, social media sites 261, and computing devices 212, 222, 232, and 242. Ride-sharing system 201, social media sites 261, and computing devices 212, 222, 232, and 242 can be connected to (or be part of) a network, such as, for example, a Local Area Network ("LAN"), a Wide Area Network ("WAN"), and even the Internet. Accordingly, ride-sharing system 201, social media sites 261, and computing devices 212, 222, 232, and 242 as well as any other connected computer systems and their components can create and exchange message related data (e.g., Internet Protocol ("IP") datagrams and other higher layer protocols that utilize IP datagrams, such as, Transmission Control Protocol ("TCP"), Hypertext Transfer Protocol ("HTTP"), Simple Mail Transfer Protocol ("SMTP"), Simple Object Access Protocol (SOAP), etc. or using other non- datagram protocols) over the network.

[0045] In general, ride-sharing system 201 is configured to arrange a ride to be shared between a driver and one or more riders. As depicted, ride-sharing system 201 includes matching module 202, filter module 203, and map updater 204. Matching module 202 is configured to receive ride requests from one or more riders and available rides from one or more drivers. From ride requests and available rides, matching module 202 can derive match information indicating potential matching users (e.g., a driver and one or more riders) for ride sharing. The match information can be derived based on starting points, destinations, estimated pickup times, and estimated drop off times from ride requests and available rides. Matching module 202 can also consider other combinations of geographic compatibility matching criteria and/or temporal compatibility matching criteria when matching drivers and riders.

[0046] Filter module 203 is configured to receive match information from matching module 202. From the match information, filter module 203 can derive compatibility information for a subset of potentially matching users that are compatible to share a ride. The compatibility information indicates compatibility between users, such as, for example, between a driver and a rider. The compatibility information can be derived based on (e.g., social and/or other) profile information and filtering criteria for potentially matching users indicated in the match information.

[0047] Map updater 204 is configured to receive compatibility information from filter module 203. From the compatibility information, map updater 204 can send map updates to one or more users of ride-sharing system 201. A map update can indicate that the visual representation of a user-interface element is to be changed on a user's map. For example, a map update sent to a user can indicate that the color of a dot representing another user is to be changed on the user's map. The change in color can indicate to the other user is compatible with the user. In other aspects, a dot can be highlighted or pulsate.

[0048] From map updates, a driver can view profile information for possible riders. Likewise, a rider can view profile information for possible drivers. A driver can also send a ride invitation for a possible rider to ride-sharing system 201. Ride-sharing system 201 can notify the possible rider of the ride invitation. The possible rider can accept the ride invitation.

[0049] When a rider accepts a rider invitation, ride-sharing system 201 can send further map updates. The further map updates can indicate further changes to visual representations on user maps. For example, a map update sent to a driver can indicate that the color (or other characteristics) of a dot representing a rider is to be changed on the driver's map. The further change in color (or other characteristics) can indicate to the driver that the rider has accepted the ride invitation.

[0050] When a new rider accepts a ride invitation for a ride, ride-sharing system 201 can send map updates to existing riders of the ride. For example, a map update sent to a rider can indicate that the color (or other characteristics) of a dot representing another rider is to be changed on the driver's map. The further change in color (or other characteristics) can indicate to the rider that the other rider has accepted the ride invitation. The map update can also include a user-interface component for selecting (e.g., social and/or other) profile information for the new rider. As such, each rider can view profile information for all other riders. Riders are also given the option of leaving a ride at any time. In one aspect, in response to viewing a new rider's profile information, an existing rider can choose to leave a ride.

[0051] Each of rider 211 and drivers 221, 231, and 241 can use (and may have an account with) ride-sharing system 201 to share rides with others. Ride-sharing system 201 can provide maps (e.g., street maps) to each of riders 211 and drivers 221, 231, and 241. For example, map 213 is provided to rider 211 at computing device 212. Similarly, maps 223, 233, and 243 are provided to drivers 221, 231, and 241 respectively at computing devices 222, 232, and 242 respectively.

[0052] Rider 211 can also have social media accounts with one or more of social media sites 261. Social profile information 218 represents at least some of the profile information stored for rider 211 at social media sites 261. One or more of drivers 221, 231, and 241 can also have social media accounts with one or more of social media sites 261. The one or more social media sites 261 can store social profile information for each of the one or more of drivers 221, 231, and 241.

[0053] Figure 3 illustrates a flow chart of an example method 300 for selective ride sharing. Method 300 will be described with respect to the components and data of computer architecture 200.

[0054] Method 300 includes receiving an indication from an individual that the individual is desirous of sharing a ride from a starting point to a destination (301). For example, ride-sharing system 201 can receive ride request 214 from computing device 212. Rider 211 can use input components (e.g., one or more of a keyboard, mouse, touch screen, etc.) at computing device 212 to enter rider request 214. As depicted, ride request 214 is requesting a ride from starting point 216 to destination 217. Ride request 214 can also include a start time and a desired time of arrival to reach destination 217.

[0055] Method 300 includes accessing profile information for the individual (302). For example, ride-sharing system 201 can access social profile information 218 for rider 211. Ride- sharing system 201 can also access other types of profile information for rider 211 such as, for example, status, temperament, traits, etc. for rider 211.

[0056] Method 300 includes identifying one or more other individuals desirous of sharing a ride, the one or more individuals within a predetermined distance from the starting point and traveling to within a further predetermined distance of the destination (303). For example, ride- sharing system 201 can receive available rides 224, 234, and 244 from computing devices 222, 232, and 242 respectively. Drivers 221, 231, and 241 can use input components (e.g., one or more of a keyboard, mouse, touch screen, etc.) at computing devices 222, 232, and 242 respectively to enter available rides 224, 234, and 244. As depicted, available ride 224 is going from starting point 226 to destination 227. Similarly, available ride 234 is going from starting point 236 to destination 237. Likewise, available ride 244 is going from starting point 246 to destination 247. Each of available rides 224, 234, and 244 can also include a start time and estimated time of arrival at a corresponding destination.

[0057] Matching module 202 can compare starting point 216 to starting points 226, 236, and 246 and can compare destination 217 to destinations 227, 237, and 247. From the comparisons, based on starting point 236 and destination 237, matching module 202 can determine that driver 231 is to travel within a predetermined distance of starting point 216 and to within a further predetermined distance of destination 217. Similarly, from the comparisons, based on starting point 246 and destination 247, matching module 202 can determine that driver 241 is also to travel within a predetermined distance of starting point 216 and to within a further predetermined distance of destination 217.

[0058] In one aspect, matching module 202 also compares start times and estimated times of arrival. Matching module 202 can also determine that a start time and an estimated time of arrival for available rides 224 and 234 are suitable for the start time and estimated time of arrival for ride request 214. For example, if rider 211 is to participate in available ride 234 or 244, rider 211 would get picked up at starting point 216 within a specified time of rider 21 l 's requested start time and would get dropped off at destination 217 within a further specified time of rider 211 's requested time of arrival.

[0059] As such, matching module 202 can derive match information 253 indicating driver 231 and driver 241 as possible drivers to handle ride request 214. Matching module 202 can also consider other combinations of geographic compatibility matching criteria and/or temporal compatibility matching criteria to identify driver 231 and driver 241 as possible drivers to handle ride request 214 and to eliminate driver 211 as a possible driver to handle ride request 214.

[0060] Method 300 includes for each of the one or more other individuals, filtering the profile information using filter criteria selected by the other individual to determine if the individual is compatible to share a ride with the other individual (304). Filter module 203 can access filtering criteria 238 for driver 231 and filtering criteria 248 for driver 241. Filter module 203 can filter social profile information 218 (and/or other types or profile information) using filtering criteria 238 to determine that driver 231 is not compatible to share a ride with rider 211. On the other hand, filter module 203 can filter social profile information 218 (and/or other types or profile information) using filtering criteria 248 to determine that driver 241 is compatible to share a ride with rider 211. [0061] Filter module 203 can derive compatibility information 206 indicating that driver 241 is compatible with rider 211.

[0062] Method 300 includes for any of the one or more other individuals that are compatible, sending a map update for the other individual to indicate that the individual is compatible for sharing a ride with the other individual (305). For example, based on compatibility information 206, map updater 204 can send map update 207 (e.g., a color change) to computing device 242 update map 243. Map update 207 can indicate to driver 241 that rider 211 is compatible for sharing a ride with driver 241. Method 300 includes for any of the one or more other individuals that are compatible, sending a map update for the individual to indicate that the other individual is compatible for sharing a ride with the individual (306). For example, based on compatibility information 206, map updater 204 can send map update 208 (e.g., a color change) to computing device 212 to update map 213. Map update 208 can indicate to rider 211 that driver 241 is compatible for sharing a ride with rider 211.

[0063] In response to map update 207, driver 241 can use input devices of computing device 242 to send invitation 251 to ride-sharing system 201. Invitation 251 indicates that driver 241 has invited rider 211 to share a ride. Driver 241 may also view social profile information 218 (and/or other profile information) prior to sending invitation 251. In response to receiving invitation 251, ride-sharing system 201 can send notification 252 to computing device 212 to notify rider 211 of invitation 251.

[0064] In response to notification 252, rider 211 can use input devices of computing device 212 to send acceptance 271 to ride-sharing system 201. Rider 211 can also view social profile information (and/or other profile information) for driver 241 (and possibly other riders invited by driver 241) prior to sending acceptance 271. In response to acceptance 271, map updater 204 can send additional map updates to indicate to rider 211 and driver 241 (as well as any other riders for the shared ride) that rider 211 accepted invitation 251.

[0065] Turning to Figure 4, an example data flow 400 for selective ride sharing is depicted. Data flow 400 can be implemented for a user of ride-sharing system 200 or another similar ride- sharing system. A program starts at 401. In one aspect, a user can choose to be a driver and enter a destination 411. When a user chooses to be a driver, the ride-sharing system can provide the user a map (e.g., a street map) with qualified riders, requesting riders, and previously selected riders 402. The ride-sharing system can apply filters 412 on an ongoing basis to identify qualified riders, for example, based on geographic compatibility matching criteria and/or temporal compatibility matching criteria for potential riders and based on social profile information and/or other profile information for potential riders.

[0066] The user (driver) can select rider(s) 413 from the map. The ride-sharing system can indicate a route on the map based on rider(s) estimated times of arrival (ETAs) 403. Using the routes, the user can send a request to or reject rider(s) and iterate to the map to select more rider(s) 415. For each route, the user can also click on a rider profile to find out more information about the rider 414. The user can also accept a rider's request or receive indications that riders have accepted requests from the user 416.

[0067] Alternately, the user can chose to be a rider and enter a destination 417. When a user chooses to be a rider, the ride-sharing system can provide the user a map (e.g., a street map) with qualified drivers, requesting drivers, and previously selected riders 404. The ride-sharing system can apply filters 426 on an ongoing basis to identify qualified drivers, for example, based on geographic compatibility matching criteria and/or temporal compatibility matching criteria for potential drivers and based on social profile information and/or other profile information for potential drivers.

[0068] The user (rider) can select drivers(s) 419 from the map. The ride-sharing system can indicate a route on the map based on driver(s) estimated times of arrival (ETAs) 405. Using the routes, the user can send a request to or reject drivers(s) and iterate the map to select more drivers(s) 421. For each route, the user can also click on a driver profile or rider profile (for other riders) to find out more information about the driver or rider 420. The user can also accept a driver's request or receive indications that other riders have accepted requests from the user 422.

[0069] Rider(s) are locked in for the trip 406. N riders are accumulated for the trip 423. The trip is started 407.

[0070] A wide variety of ride sharing scenarios are possible. In one example scenario, a driver selects a rider using a ride-sharing system, such as, for example, ride-sharing system 201. The ride-sharing system suggests a route based on current location and destination of both the rider and the driver. The suggested route can be displayed on the driver's map. The suggested route can be calculated based on existing shortest trip time algorithm that covers the destinations and the starting points for the driver and rider. The displayed route can include ETA to pick-up the rider, ETA to drop off the rider (i.e., destination point for the rider), and ETA of final destination for the driver.

[0071] In another example scenario, a driver selects two riders: rider A and rider B, using a ride-sharing system, such as, for example, ride-sharing system 201. The ride-sharing system suggests a route based on current location and destination of both riders and the driver. The suggested route can be displayed on the driver's map. The suggested route can be calculated based on existing shortest trip time algorithm that covers the destinations and the starting points for the driver, for rider A, and for rider B. The displayed route can include ETA to pick-up the rider A, ETA to puck-up rider B, ETA to drop off rider A (i.e., destination point for rider A), ETA to drop off rider B (i.e., destination point for rider B), and ETA of final destination for the driver.

[0072] In a further example scenario, a driver selects rider C and already has locked-in two riders in his/her vehicle: rider D and rider E, using a ride-sharing system, such as, for example, ride-sharing system 201. The ride-sharing system suggests a route based on current location and destination of riders C, D, and E and the driver. The suggested route can be displayed on rider C's map. The suggested route can be calculated based on existing shortest trip time algorithm that covers the destinations and the starting points for the driver, for rider C, for rider D, and for rider E. The displayed route can include ETA to pick-up rider C, ETA pick-up the rider D, ETA to puck-up rider E, ETA to drop off rider C (i.e., destination point for rider C), ETA to drop off rider D (i.e., destination point for rider D), ETA to drop off rider E (i.e., destination point for rider E), and ETA of final destination for the driver.

[0073] Drivers and riders can view multiple different possible routes and ride-sharing scenarios simultaneously on their (e.g., street) map. The routes and ride-sharing scenarios can be updated through map updates as rides are filled and other rides become available.

[0074] In one aspect, one or more processors are configured to execute instructions (e.g., computer-readable instructions, computer-executable instructions, etc.) to perform any of a plurality of described operations. The one or more processors can access information from system memory and/or store information in system memory. The one or more processors can transform information between different formats, such as, for example, social profile information, other profile information, ride requests, available riders, starting points, destinations, start times, estimated times of arrival, maps, filtering criteria, map updates, match information, compatibility information, ride invitations, notifications, ride acceptances, etc.

[0075] System memory can be coupled to the one or more processors and can store instructions (e.g., computer-readable instructions, computer-executable instructions, etc.) executed by the one or more processors. The system memory can also be configured to store any of a plurality of other types of data generated by the described components, such as, for example, social profile information, other profile information, ride requests, available riders, starting points, destinations, start times, estimated times of arrival, maps, filtering criteria, map updates, match information, compatibility information, ride invitations, notifications, ride acceptances, etc.

[0076] In the above disclosure, reference has been made to the accompanying drawings, which form a part hereof, and in which is shown by way of illustration specific implementations in which the disclosure may be practiced. It is understood that other implementations may be utilized and structural changes may be made without departing from the scope of the present disclosure. References in the specification to "one embodiment," "an embodiment," "an example embodiment," etc., indicate that the embodiment described may include a particular feature, structure, or characteristic, but every embodiment may not necessarily include the particular feature, structure, or characteristic. Moreover, such phrases are not necessarily referring to the same embodiment. Further, when a particular feature, structure, or characteristic is described in connection with an embodiment, it is submitted that it is within the knowledge of one skilled in the art to affect such feature, structure, or characteristic in connection with other embodiments whether or not explicitly described. [0077] Implementations of the systems, devices, and methods disclosed herein may comprise or utilize a special purpose or general-purpose computer including computer hardware, such as, for example, one or more processors and system memory, as discussed herein. Implementations within the scope of the present disclosure may also include physical and other computer-readable media for carrying or storing computer-executable instructions and/or data structures. Such computer-readable media can be any available media that can be accessed by a general purpose or special purpose computer system. Computer-readable media that store computer-executable instructions are computer storage media (devices). Computer-readable media that carry computer-executable instructions are transmission media. Thus, by way of example, and not limitation, implementations of the disclosure can comprise at least two distinctly different kinds of computer-readable media: computer storage media (devices) and transmission media.

[0078] Computer storage media (devices) includes RAM, ROM, EEPROM, CD-ROM, solid state drives ("SSDs") (e.g., based on RAM), Flash memory, phase-change memory ("PCM"), other types of memory, other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store desired program code means in the form of computer-executable instructions or data structures and which can be accessed by a general purpose or special purpose computer.

[0079] An implementation of the devices, systems, and methods disclosed herein may communicate over a computer network. A "network" is defined as one or more data links that enable the transport of electronic data between computer systems and/or modules and/or other electronic devices. When information is transferred or provided over a network or another communications connection (either hardwired, wireless, or a combination of hardwired or wireless) to a computer, the computer properly views the connection as a transmission medium. Transmissions media can include a network and/or data links, which can be used to carry desired program code means in the form of computer-executable instructions or data structures and which can be accessed by a general purpose or special purpose computer. Combinations of the above should also be included within the scope of computer-readable media.

[0080] Computer-executable instructions comprise, for example, instructions and data which, when executed at a processor, cause a general purpose computer, special purpose computer, or special purpose processing device to perform a certain function or group of functions. The computer executable instructions may be, for example, binaries, intermediate format instructions such as assembly language, or even source code. Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the described features or acts described above. Rather, the described features and acts are disclosed as example forms of implementing the claims.

[0081] Those skilled in the art will appreciate that the disclosure may be practiced in network computing environments with many types of computer system configurations, including, an in- dash or other vehicle computer, personal computers, desktop computers, laptop computers, message processors, hand-held devices, multi-processor systems, microprocessor-based or programmable consumer electronics, network PCs, minicomputers, mainframe computers, mobile telephones, PDAs, tablets, pagers, routers, switches, various storage devices, and the like. The disclosure may also be practiced in distributed system environments where local and remote computer systems, which are linked (either by hardwired data links, wireless data links, or by a combination of hardwired and wireless data links) through a network, both perform tasks. In a distributed system environment, program modules may be located in both local and remote memory storage devices.

[0082] Further, where appropriate, functions described herein can be performed in one or more of: hardware, software, firmware, digital components, or analog components. For example, one or more application specific integrated circuits (ASICs) can be programmed to carry out one or more of the systems and procedures described herein. Certain terms are used throughout the description and claims to refer to particular system components. As one skilled in the art will appreciate, components may be referred to by different names. This document does not intend to distinguish between components that differ in name, but not function.

[0083] It should be noted that the sensor embodiments discussed above may comprise computer hardware, software, firmware, or any combination thereof to perform at least a portion of their functions. For example, a sensor may include computer code configured to be executed in one or more processors, and may include hardware logic/electrical circuitry controlled by the computer code. These example devices are provided herein purposes of illustration, and are not intended to be limiting. Embodiments of the present disclosure may be implemented in further types of devices, as would be known to persons skilled in the relevant art(s).

[0084] At least some embodiments of the disclosure have been directed to computer program products comprising such logic (e.g., in the form of software) stored on any computer useable medium. Such software, when executed in one or more data processing devices, causes a device to operate as described herein.

[0085] While various embodiments of the present disclosure have been described above, it should be understood that they have been presented by way of example only, and not limitation. It will be apparent to persons skilled in the relevant art that various changes in form and detail can be made therein without departing from the spirit and scope of the disclosure. Thus, the breadth and scope of the present disclosure should not be limited by any of the above-described exemplary embodiments, but should be defined only in accordance with the following claims and their equivalents. The foregoing description has been presented for the purposes of illustration and description. It is not intended to be exhaustive or to limit the disclosure to the precise form disclosed. Many modifications and variations are possible in light of the above teaching. Further, it should be noted that any or all of the aforementioned alternate implementations may be used in any combination desired to form additional hybrid implementations of the disclosure.

Claims

CLAIMS What is claimed:

1. A method, the method comprising:

accessing profile information for a plurality of individuals desirous of sharing a ride from a location within a predetermined distance of a starting point and to location within a further predetermined distance of a destination;

filtering the profile information using filter criteria to determine that an individual is compatible to share a ride with another individual; and notifying the individual and other individual of the compatibility.

2. The method of claim 1, wherein accessing profile information for a plurality of individuals comprises accessing interests for each of the plurality of individuals from one or more social media sites.

3. The method of claim 1, wherein filtering the profile information using filter criteria comprises filtering the profile information using filter criteria selected by the plurality of individuals.

4. The method of claim 1, wherein notifying the individual and other individual of the compatibility comprises:

sending an update to a graphical user interface at a computing device used by the individual to indicate to the individual that the other individual is compatible to share a ride; and sending an update to a graphical user interface at a computing device used by the other individual to indicate to the other individual that the individual is compatible to share a ride.

5. The method of claim 4, wherein sending an update to a graphical user interface at a computing device used by the individual sending an update for a graphical element displayed on a map at the computing device used by the individual; and

wherein sending an update to a graphical user interface at a computing device used by the other individual comprises sending an update for another graphical element displayed on another map at the computing device used by the other individual.

6. The method of claim 1, wherein notifying the individual and other individual of the compatibility comprises notifying a driver and a rider of compatibility to share a ride with one another.

7. A computer system, the computer system comprising:

one or more processors;

system memory coupled to one or more processors, the system memory storing instructions that are executable by the one or more processors; and

the one or more processors configured to execute the instructions stored in the system memory to select plurality of individuals for sharing a ride, including the following:

receive an indication from an individual that the individual is desirous of sharing a ride from a starting point to a destination;

access profile information for the individual;

identify one or more other individuals desirous of sharing a ride, the one or more individuals traveling within a predetermined distance from the starting point and traveling to within a further predetermined distance of the destination; for each of the one or more other individuals, filter the profile information using filter criteria selected by the other individual to determine if the individual is compatible to share a ride with the other individual;

for any of the one or more other individuals that are compatible:

send a map update for the other individual to indicate that the individual is compatible for sharing a ride with the other individual; and send a map update for the individual to indicate that the other individual is compatible for sharing a ride with the individual.

8. The computer system of claim 7, wherein the one or more processors configured to execute the instructions stored in the system memory to receive an indication from an individual that the individual is desirous of sharing a ride from a starting point to a destination comprises the one or more processors configured to execute the instructions stored in the system memory to receive an indication from one of: a driver or a rider that is desirous of sharing a ride.

9. The computer system of claim 7, wherein the one or more processors configured to execute the instructions stored in the system memory to access profile information for the individual comprises the one or more processors configured to execute the instructions stored in the system memory to access social profile information for the individual from a plurality of social media networks.

10. The computer system of claim 7, wherein the one or more processors configured to execute the instructions stored in the system memory to identify one or more other individuals desirous of sharing a ride comprises the one or more processors configured to execute the instructions stored in the system memory to identify one or more riders desirous of sharing a ride with a driver.

11. The computer system of claim 7, wherein the one or more processors configured to execute the instructions stored in the system memory to identify one or more other individuals desirous of sharing a ride comprises the one or more processors configured to execute the instructions stored in the system memory to identify one or more drivers desirous of sharing a ride with a rider.

12. The computer system of claim 7, wherein the one or more processors configured to execute the instructions stored in the system memory to filter the profile information using filter criteria selected by the other individual comprises the one or more processors configured to execute the instructions stored in the system memory to filter social profile information using filter criteria to determine that the individual and the other individual have common social interests.

13. The computer system of claim 7, wherein the one or more processors configured to execute the instructions stored in the system memory to send a map update for the other individual to indicate that the individual is compatible for sharing a ride with the other individual comprises the one or more processors configured to execute the instructions stored in the system memory to send a map update for a driver to indicate that a potential rider is compatible for sharing a ride with the driver by sending a map update to change the characteristics of a graphical element representing the potentially rider on the map; and

further comprising the one or more processors configured to execute the instructions stored in the system memory to send another map update to indicate a route to be shared by the driver and potential rider on the map.

14. The computer system of claim 13, further comprising the one or more processors configured to execute the instructions stored in the system memory to:

receive an indication that the driver has selected the potential rider for ride sharing; and send a further map update for the potential rider to indicate that the driver has invited the potential rider to share a ride.

15. The computer system of claim 7, wherein the one or more processors configured to execute the instructions stored in the system memory to send a map update for the other individual to indicate that the individual is compatible for sharing a ride with the other individual comprises the one or more processors configured to execute the instructions stored in the system memory to send a map update for a rider to indicate that a potential driver is compatible for sharing a ride with the rider by sending a map update to change the characteristics of a graphical element representing the potentially driver on the map; and

further comprising the one or more processors configured to execute the instructions stored in the system memory to send another map update to indicate a route to be shared by the rider and potential driver on the map.

16. The computer system of claim 15, further comprising the one or more processors configured to execute the instructions stored in the system memory to:

receive an indication that the rider has selected the potential driver for ride sharing; and

send a further map update for the potential driver to indicate that the rider has requested to share a ride with the potential driver.

17. A method for selecting a plurality of individuals for ride sharing, the method comprising:

receiving an indication from an individual that the individual is desirous of sharing a ride from a starting point to a destination;

accessing social profile information for the individual;

identifying one or more other individuals desirous of sharing a ride, the one or more individuals within a predetermined distance from the starting point and traveling to within a further predetermined distance of the destination;

for each of the one or more other individuals, filtering the social profile information using filter criteria selected by the other individual to determine if the individual is compatible to share a ride with the other individual;

for any of the one or more other individuals that are compatible:

sending a map update for the other individual to indicate that the individual is compatible for sharing a ride with the other individual; and

sending a map update for the individual to indicate that the other individual is compatible for sharing a ride with the individual.

18. The method of claim 17, further comprising accumulate a specified number of riders for a shared ride.

19. The method of claim 17, wherein receiving an indication from an individual that the individual is desirous of sharing a ride from a starting point to a destination comprises receiving an indication from one of: a driver or a rider that is desirous of sharing a ride.

20. The method of claim 17, wherein accessing social profile information for the individual comprises accessing social profile information for the individual from a plurality of social media sites.