Patent Grant
10091618
Traditionally, people have requested and received services at fixed locations from specific service providers. For example, various services were fulfilled by making a delivery to a user at a home or work location. Many services can now be accessed through mobile computing devices and fulfilled at arbitrary locations, often by service providers that are activated on demand. Such on-demand service offerings are convenient for users, who do not have to be at fixed locations to receive the services. However, locations provided by requesting computing devices can be inaccurate and not represent a location where a requestor and a provider should meet to fulfill the on-demand service. Inaccurate and/or inefficient identification of locations related to on-demand service requests can lead to inefficient resource allocation. For example, a requestor and provider may not be able to find each other if the location at which they are to meet is inaccurate, and delay in searching for each other can lead to longer travel times and reduced supply of providers. In some cases, the requestor and provider may not be able to locate each other, which can lead to a service request being cancelled and re-placed in the system with a new provider, despite an available provider being in the area This leads to inefficient resource allocation as cancelled and duplicated requests increase bandwidth and processing needs, as well as disrupting efficient allocation of resources in a geographic area.
Various embodiments in accordance with the present disclosure will be described with reference to the drawings, in which:
In the following description, various embodiments will be described. For purposes of explanation, specific configurations and details are set forth in order to provide a thorough understanding of the embodiments. However, it will also be apparent to one skilled in the art that the embodiments may be practiced without the specific details. Furthermore, well-known features may be omitted or simplified in order not to obscure the embodiment being described.
On-demand services, such as a transportation matching service that matches riders and drivers, such as those accessed through mobile devices, are becoming more prevalent. However, due to the distributed and portable nature of providers and requestors being matched by an on-demand matching system, matching providers and requestors efficiently based on location data provided by electronic devices in sometimes challenging environments can be difficult. For example, a requestor may be in a large building that borders several streets with multiple doors to the outside, and the requestor's electronic device reports her location as being in the middle of the building as part of her request to the service provider, for example due to GPS inaccuracy. As the service provider cannot drive into the middle of the building where the requestor's location is being reported, which may not even be accurate at the time, the provider is forced to guess where an efficient pickup location around the building may be. Because the building is large with many doors, the requestor may have to walk a long route to get to the provider's reported location, which could itself be inaccurate.
In some cases, the requestor's ultimate destination may be best served by meeting a provider on a particular road segment adjacent the building that goes in a certain direction (e.g., towards the destination, on a correct one-way street, etc.). Inefficient pickup location determinations create provider downtime, as he must wait for the requestor to arrive, and in some cases can lead to cancellation of requests and re-booking of additional requests if the parties are not able to find each other within an acceptable amount of time. As the provider is part of an on-demand service, he may not be able to simply provide his service to another requestor in his current location if the current request, for which he traveled from another area, is canceled; instead, he may be routed across town for another on-demand request, whereas if he had been able to pick up the requestor at a convenient location around the building, another provider could have accepted the subsequent request across town, perhaps being able to arrive faster. Provider downtime and inefficient utilization of travel time is problematic because it reduces ride system resources in an area and leads to lower utilization of the provider. Accordingly, the difficulty in matching requests with providers using sub-optimal geographic-based estimates leads to mismanagement of provider resources as well as increased system resources usage (e.g., data processing, bandwidth, and system communications). For instance, providers may cancel a matched request where the requestor is not present at the pickup location, so that they do not have so much downtime waiting on a requestor. Thus, requestors must place more requests in order to obtain a ride as one or more matched requests are canceled before the requestor can locate and/or navigate to the provider. Accordingly, more requests may be generated and processed by a matching service, more accepted, rejected, and declined requests must be processed by the requestor and provider devices, and more system resources must be expended for a matched ride to be successfully completed. Cascading requests and cancellations can lead to provider downtime, as multiple providers accept the soon-to-be-cancelled transport requests in lieu of other requests. The cancelled providers may also grow frustrated with the cancellations and stop providing transport altogether in a particular area, leading to a lack to provider service in that area, potentially at a time of actual high demand.
Accordingly, the specific technical problem of inefficient dynamically-created pickup location predictions in a computer-based dynamic transportation matching system lead to mismanagement of provider resources as well as at least increased data processing, bandwidth utilization, memory usage, and system communications as delay accumulates and cascading requests and cancellations are sent to a dynamic transportation matching system. Therefore, the techniques described herein improve the operation and efficiency of a transportation matching system, as well as the computing systems utilized as part of the transportation matching system infrastructure. By alleviating technical problems specific to dynamic transportation matching systems (e.g., inefficient dynamically-created pickup location predictions, cascading requests and cancellations (e.g., “button mashing”), etc.), the techniques described herein improve the computer-related technology of at least network-based dynamic transportation matching systems by increasing at least computational efficiency and computer resource allocation of at least the computer systems on which the techniques are performed.
At least one embodiment provides techniques, including systems and methods, for determining accurate, efficient, and/or convenient pickup location where a provider may meet a requestor. In one embodiment, a set of instances of prior transport data of various types (e.g., prior request locations, prior actual pickup locations, prior transport start locations, prior transport destinations, and/or prior actual drop-off locations) may be associated with a geographic location. For example, a particular requestor may have multiple locations in a geographic area where she generates requests for service, where she is picked up by a provider, where the service actually begins (e.g., where the provider indicates to the transportation matching system that the service has started), where she provides as her destination, and where she is actually dropped-off by a provider. These instances of transport data may cluster around common locations associated with the requestor. As more instances of prior transport data are generated around various geographical areas (e.g., home, work, frequented businesses, transit stops, etc.), a determination of an efficient pickup location (i.e., a pin location) in the vicinity of the geographical areas may be made, according to various embodiments, although other types of locations corresponding to various types of transport data may also be determined according to various embodiments, such as destination, drop-off points, etc.
In an embodiment, a requestor may not be in a location where she has previously generated prior transport data that could be utilized as part of an approach to determine an appropriate pickup location. For example, a requestor may have traveled to a new city for work, and be in a building at which she has never requested transport (or other on-demand) service. The building may be large and border several streets, and have several entrances and exits; therefore, if the requestor makes a request while inside the building, and her GPS location is provided to the dynamic transportation matching system as (accurately or inaccurately) somewhere inside the building rather than at a curb surrounding the building, then neither the requestor nor the provider will know where to meet. For example, which side of the building, which exit, even in some cases, which elevation; such as an airport, where departures may be on one level and arrivals on another level. According to an embodiment, if the requestor is associated with fewer than a threshold number of instances of prior transport data at a location (i.e., a geographical area), then a determination of geohashes corresponding to the location may be made, at varying levels. For example, a geohash of the requestor's location at geohash-6. The geohash may be refined, such as to geohash-7 in some embodiments. In the selected geohash, prior transport data for other people is analyzed to determine various instances of prior transport data corresponding to their previous requests. For example, 100 people in the building may have made numerous prior service requests where their request location was reported to be inside the building; in some embodiments, it is determined how close their prior request locations are to the current requestor's request location. Their actual pickups related to those requests are analyzed to make a prediction where an efficient pickup location around the (unfamiliar to the requestor) building may be, based on other people's prior transport data. In some embodiment, additional signals may be utilized, such as relationship of the other people to the requestor (e.g., location, company, etc.), destinations of the other people, weather, time of day, etc. These signals, including the amount and/or type of prior transport data, may be assigned varying weights in evaluations to determine one or more predicted pickup locations.
Additionally, one or more embodiments may use road segment data, such as may be stored by a data structure related to road segment system nodes associated with length. Direction, elevation, etc., and further associated with pickup/drop-off locations and distance traveled along respective nodes to get there. For example, road segment data having a particular direction in the geographical area related to the request may be determined, and the directionality evaluated with respect to a navigation route to the requested destination. If a road segment within a threshold distance of a predicted pickup location has road segment data that is more efficient (e.g., is in a direction headed towards the destination, etc.), then the predicted pickup location may be adjusted (or initially placed in some embodiments) to be adjacent (e.g., “snapped”) to the appropriate road segment.
Accordingly, embodiments filter potential pickup and/or drop-off locations that will increase the efficiency of the system and optimize the matching system's request matching processing to minimize the number of requests that will require system resources to process. Additionally, filtering transport data related to request locations in order to establish efficient pickup and/or drop-off locations results in more efficient processing of requests by the matching system, leading to fewer system resources necessary to handle a ride request load and an amount of requestor demand in an area. Accordingly, request matching systems are improved through the more efficient matching processing and fewer resources are required to process the same amount of requestor demand.
Although examples described herein generally focus on on-demand ride-sharing applications, any suitable service may be performed using similar functionality. For example, delivery of services may have a similar process implemented to find the location of delivery of the service. Additionally, a “provider” as discussed herein may include, for example, an automated dynamic transportation matching system that dispatches autonomous vehicles to respond to transport requests, an autonomous or otherwise computer-controlled vehicle (in whole or in part), or a human driver.
The requestor computing device may be used to request services (e.g., a ride or transportation, a delivery, etc.) that may be provided by the provider 140A. The provider computing device may be used to contact available providers and match a request with an available provider. However, a location associated with the request may not be the most efficient location with regard to provider travel time to the request location and/or provider travel time from the request location to a destination location. For example, a provider may have to take a long, circuitous route to the request location, whereas if the requestor were to walk down to a new curb segment on an adjacent block, the provider would have a shorter route to the request location, and/or the provider may have a more efficient route to the destination (e.g., not have to loop around a block, etc.). Thus, embodiments provide a solution that allows a dynamic transportation matching system to determine whether another curb segment within a threshold distance of the request location would reduce travel times associated with one or more legs of a journey (e.g., the journey to the request location, the journey from the request location, a journey with multiple request locations and/or destination locations, etc.) to ensure the most efficient matching leading to the least amount of provider downtime and the most possible throughput by the dynamic transportation matching system.
The dynamic transportation matching system (also referred to as a “ride matching system”) 130 may identify available providers that are registered with the dynamic transportation matching system 130 through an application on their provider communication device 150A. The dynamic transportation matching system 130 may send the ride request to a provider communication device 150A and the provider 140A may accept the ride request through the provider communication device 150A. Additionally and/or alternatively, in some embodiments, the provider may be predictively and/or automatically matched with a request such that the provider may not explicitly accept the request. For instance, the provider may enter a mode where the provider agrees to accept all requests that are sent to the provider without the ability to decline and/or review requests before accepting. In either case, the provider computing device may return information indicative of a match indicating that the provider received the transport request. For example, the information indicative of a match may include a provider accept indicator (e.g., a flag) that indicates the provider received and accepts the indicator or could include a variety of different information. For example, the information indicative of a match may include location information, other route information for other passengers in the vehicle, a schedule for the provider providing information regarding future availability (e.g., when they are going to go offline), diagnostics associated with the car (e.g., gas level, battery level, engine status, etc.), and/or any other suitable information. The provider 140A and the requestor 110A may be matched and both parties may receive match information associated with the other respective party including requestor information (e.g., name, representative symbol or graphic, social media profile, etc.), provider information (e.g., name, representative symbol or graphic, etc.), request location, destination location, respective computing device location, rating, past ride history, any of the other transport request information and/or provider acceptance information identified above, and/or any other relevant information for facilitating the match and/or service being provided. Thus, the dynamic transportation matching system 130 may dynamically match requestors and providers that are distributed throughout a geographic area.
According to an embodiment, prior transport data for the particular requestor in the example 200 of
In the example 200 of
In an embodiment, after clusters of prior transport data instances are identified, then it is determined whether the current request location 208 is within a geographical area associated with one or more of the clusters. In the example of
In an embodiment, a sub-cluster of instances of prior transport data may be identified. For example, not all instances of prior transport data in a particular geographical area (e.g., a building) may be as valuable as others. Some may be far away from the geographical area, such as when the requestor previously walked down the block to meet the provider 214, resulting in a prior pickup location instance that is far away from the prior pickup location's corresponding prior request location, and the geographical area. A sub-clustering approach in an embodiment uses a boundary 218 around the current request location 208 and/or the geographical area associated with the cluster. This boundary may be a uniform radius of a particular distance around the request location 208, or may be an irregularly-shaped boundary, depending on the embodiment. For example, “noisy” instances of prior transport data may not be valuable and/or relevant to a current request location 208; therefore, a boundary 218 is generated outside of which instances of prior transport data are disregarded, weighted less heavily, etc. A determination of a boundary 218 may be based on various factors, such as number of instances of prior transport data contained within, as discussed with regard to
In an embodiment, a target pickup location 216 (or in various embodiments, a target drop-off location, etc.) may be determined based on the request location 208, the geographical area associated with the request location 208, and/or a set of instances of prior transport data, among other data. For example, a location of one or more of a set of instances of prior transport data, such as may be within a boundary 218 of the request location 208, may be identified and evaluated to determine a target pickup location 216, which provides a more accurate and efficient location where the requestor and provider 214 should meet. Embodiments of the disclosed techniques therefore offer an intelligent prediction of a requestor's intent. While a requestor may create a transport request that is associated with a location within a building, the intent of the requestor is not for the provider to drive their car into the building; rather, it is to be met on the curb outside the building, perhaps in front of a specific door. By evaluating prior transport data, such as a relationship between where the requestor previously identified as their request location versus where they were actually picked up for that particular request (or an unrelated request), then a dynamic transportation matching system may suggest pickup locations for future requests that are provided to both requestor and provider, rather than send the reported request location to the provider and leave requestor and provider to find each other once they both are in the same general vicinity.
In an embodiment, a set of instances of various types of prior transport data around a request location 208 is determined, such as within a boundary 218. These instances may then be evaluated with regard to each other in order to suggest a target pickup location for the current request location 208. For example, only prior pickup instances may be considered, and an average location of the prior pickup instances selected as the target pickup location 216. In another example, locations of prior pickup instances may be given a weighting value of 1.25, while prior drop-off instances receive a weighting value of 1.05, and prior destination instances receive a weighting value of 0.85. By combining the weighting values of each of the instances with their locations, a target pickup location 216 may be established that is based on the request location 208 as well as a set of prior transport data. In another example, of a set of prior transport data, a prior request location closest to the current request location 208 is determined, and the location of the actual prior pickup location associated with that particular request is determined and set as the target pickup location 216. In an embodiment, the next-closest prior request location in the set of instances of prior transport data is determined, and the location of the actual prior pickup location associated with that particular request is determined, which is then averaged or otherwise combined with the actual pickup location corresponding to the closest prior request location. In an embodiment, the closest prior request location may be weighted more heavily in the determination.
In an embodiment, previous target pickup locations, generated using the techniques described herein, that are within the geographical area may be determined (e.g., within the boundary, etc.), and a distance between each of the previous target pickup locations and the actual pickup location for that particular request is determined. For example, a target pickup location next to one door may have been suggested in the past, but the requestor and provider actually met 20 yards down the sidewalk. For each of the prior actual pickup locations, the associated request location for that request is identified. For example, for the transport request where the actual pickup was 20 yards down the sidewalk, the original request location (e.g., somewhere within the building) is determined. That original request location is then compared to the current request location 208, and the closer that original request location is to the current request location 208, the actual pickup location for that original request location is more heavily weighted in the determination of the target pickup location 216 for the current request. In this manner, inaccuracy of similar former requests can be used to predict pickup locations for a current request. For example, if a large number of prior requests are from locations in a far corner of the building, and for each of those prior requests, a target pickup location was generated that resulted in an actual pickup around the corner, then it may be surmised that future requests from that particular far corner of the building should use the actual pickup locations from the past requests, not another (inaccurate) target pickup location as before. This distance, as well as other distances, may be determined using the Haversine formula or other approach.
In an embodiment, other factors may be used in generating, increasing, decreasing, etc. of various weighting values assigned to instances of prior transport data. For example, weather data may be used. When a request is received on a rainy day, it may be relevant that certain actual pickup locations were used on previous rainy days; for example, by a door with a short distance to a convenient parking spot. Time data may also be used. For example, many people may be congregating outside a building at 5 PM. Prior pickups at this time may have been further down the street that may otherwise be efficient, to avoid the crowds of people and vehicles. Various other data may also be used in the determination of target pickup locations (and in some embodiments, drop-off locations), such as destinations, road data (e.g., construction, traffic, etc.), safety data (e.g., pedestrian accident data), budget for a particular transport request, such as over time or on a particular day, ratings associated with particular providers, etc.
In an embodiment, a target pickup location may be determined based on movement of user-selectable locations in the past. For example, a potential target pickup location 216 may have been sent to a requestor in response to a prior request. In an embodiment, a requestor's computing device receives modified transport information from the dynamic transportation matching system after a transport match is made; for example, the requestor's computing device may receive a potential target pickup location and display it in a manner that visually distinguishes it from the corresponding request location (e.g., a pin vs. a flashing blue dot), along with walking directions to the potential target pickup location. In an embodiment, a requestor would provide an indication of acceptance of the potential target pickup location, although a requestor may in various embodiments move the potential target pickup location to a new location. For example, a “pin” may be placed on a map displayed at the requestor's computing device (e.g., as part of map data provided by the dynamic transportation matching system, or by receiving data indicating a location of the potential target pickup location and the device placing it on previously-existing map data). The requestor may then use the user interface of the computing device to modify the location of the pin (e.g., touching and dragging on a touch-sensitive screen). This modified location is then provided to the dynamic transportation matching system. In an embodiment, a set of previous potential target pickup locations that were subsequently moved is determined, and the current potential target pickup location is analyzed to determine whether it is within a threshold distance of one or more of the previously-moved potential target pickup locations. If so, then the current potential target pickup location may be repositioned automatically (or initially sent corresponding to) to a location corresponding to the ultimate position of one or more of the previously-moved potential target pickup locations. In an embodiment, the movement of potential target pickup locations is used in an averaging and/or weighting approach to determining a potential target pickup location, as discussed herein.
In an embodiment, the movement of a requestor may be analyzed to determine whether an initial location of a potential target pickup location should be modified. For example, a target pickup location 216 is determined, but the requestor is determined to be moving in a direction away from the target pickup location 216, such as down Main Street towards 1st Avenue in the example 200 illustrated in
In an embodiment, a particular boundary 306-310 used in the determination of a potential target pickup location, such as by eliminating or de-emphasizing potential instances of prior transport data, may be accomplished by performing a sub-clustering of instances of prior transport data, for example after a preliminary clustering of instances of prior transport data around geographic locations associated with a requestor, such as described with respect to
In an embodiment, geohash data 412, 414 may be used to determine a particular geohash associated with the current request 404. For example, a geohash at a certain level may first be determined 412, then geohashes at a more granular level may be determined 414. A selected geohash is used to identify instances of prior transport data (e.g., that occurred within the particular geohash). In the example of
For example, geohash data, at varying levels, may be used to determine prior requests that are in proximity to the current request 404. In this example, one prior request 406 is in the same geohash level as the current request 404. In an embodiment, the actual pickup location 406a corresponding to the shared geohash may be used as the target pickup location 404a, or may be given more weight in a determination that uses additional data, such as the other prior requests 408-410, etc. A determination of a degree of importance (e.g., weighting) that may be associated with one or more other instances of prior transport data 406-410, 406a-410a may include a relationship of the requestors associated with the instances of prior transport data; for example, requestors that have devices on or otherwise associated with the same Wi-Fi network may be given greater weight, as it may indicate people who work for the same company. Other requestors who have common authentication or access credentials on their devices may be given greater weight. Common stored addresses (e.g., work, home, restaurants, etc.) on requestors' devices may indicate a relationship that would be useful in determining a potential target pickup location, because people with common features may have a reason to select (or have determined for them) a particular actual pickup location; for example, a pickup location outside a particular door may be most convenient for employees of a particular company that exits out an elevator on one side of the building; thereby eliminating a need to walk all the way across a lobby. Similar destinations may also serve as an indicator or where a target pickup location 404a should be placed. For example, if a subset of prior requests 406-410 shared a certain destination, and a cluster of actual pickup locations for each of the subset may be identified as being outside a particular door, on a particular side of the street, in a particular cul-de-sac nearby, etc., then it may be determined that a current request 404 sharing a destination with one or more of the prior requests 406-410 may be most efficiently served by placing the target pickup location 404a near where the other requests were actually picked up.
In the example 420 of
At step 502, the dynamic transportation matching system receives a ride request from a requestor computing device. The ride request may include a request location (i.e., pick-up location) for the ride request that corresponds to GPS or other location data of the requestor computing device, a request time, a requestor identifier, a requestor computing device location, and/or any other relevant information associated with the ride request and/or requestor.
At step 504, a matched provider is identified. For example, the closest provider is selected to match with the request. The best provider match may be made using any suitable criteria including rating, existing travel route, and/or any other suitable information.
At step 506, clusters of prior transport data are determined. For example, in particular geographical areas that may correspond to a current location of the requestor and/or the requestor computing device, the current ride request, etc. The clusters may comprise instances of prior transport data types, such as prior request locations, prior actual pickup locations, prior transport start locations, prior transport destinations, and/or prior actual drop-off locations. In various embodiments, the instances of prior transport data may be associated with the current requestor or other requestors, such as those who made requests in the past at the same general location, etc. The clusters may be determined to be associated with various locations that have meaning to the requestor, such as their home, their work, frequently-visited businesses, transit stops, etc. The clusters may be comprised of instances of prior transport data that are determined to be related enough to support their inclusion with other instances of prior transport data to form the cluster; for example, being within a threshold distance of each other; being associated with the same building; having common corresponding instance types that reflect one or more legs of a transport request (e.g., request to pickup to start to destination to drop-off), manual adjustment or indication of relatedness, etc.
At step 508, the geographic areas and/or locations (e.g., buildings, etc.) associated with the clusters of instances of prior transport data are compared to the current request location. For example, if the request location is associated with a certain location (e.g., a building), the nearby clusters are evaluated to determine whether one or more of them are within a threshold distance of the request location, or are otherwise related.
At step 510, in an embodiment, a sub-clustering approach is performed, where the cluster or clusters corresponding to the request location (and in some embodiments, a destination location) is modified to select a subset of the instances of prior transport data comprising the cluster. For example, by only utilizing a set of the X closest instances of prior transport data in a determination of a target pickup location, or establishing a boundary around the request location of lesser area than the geographic area associated with the cluster, and selecting the instances of prior transport data within the boundary (or boundaries).
At step 512, a target pickup location is determined, for example based on the location of the request and the instances of prior transport data in the cluster and/or sub-cluster. Various approaches may be utilized to ascertain a target pickup location from locations of instances of prior transport data. For example, all locations of instances of prior transport data may be mapped and a location in the nominal center of the selected instances used as the target pickup location. In other embodiments, various instances of the prior transport data may be weighted in a determination more heavily than other instances. For example, a target pickup location may be placed in a location that relates more to a certain subset of the instances of prior transport data, such as actual pickup locations of requests that share a similar location with the current request, and so forth. Additional signals may be used to determine which instances of prior transport data should be considered more informative/valuable/accurate in a calculation or estimation of a target pickup location; for example, current and past data corresponding to weather, time, holiday, event, traffic, etc. Addresses that are saved on the requestor's device (“shortcuts”) may be used to “pre-fill” a target pickup location (different from the request location) based on the requestor's history and her interaction with the request location in the past.
At step 514, modified ride request information is sent to the provider device. For example, the ride request information sent to the dynamic transportation matching system as part of the request included a request location. As discussed herein, the request location may not accurately reflect the requestor's intent regarding where they would like to actually be picked up. For example, perhaps the GPS signal is inaccurate, or the request location is in a building, etc. Once a target pickup location is determined according to the techniques described herein, the dynamic transportation matching system may modify the ride request information to reflect the target pickup location instead of or in addition to the request location, and send the modified ride request information to the matched provider so they can navigate to the target pickup location.
At step 516, the target pickup location is sent to the requestor computing device, for example as part of the modified ride request information. In an embodiment, the requestor may send an indication to the dynamic transportation matching system that she would like to change the suggested target pickup location, such as by dragging a “pin” to a new location on a map displayed on the screen of the requestor computing device. This will send another set of modified ride request information to the dynamic transportation matching system for additional processing and sending to the provider.
At step 602, the dynamic transportation matching system receives a ride request from a requestor computing device. The ride request may include a request location (i.e., pick-up location) for the ride request that corresponds to GPS or other location data of the requestor computing device, a request time, a requestor identifier, a requestor computing device location, and/or any other relevant information associated with the ride request and/or requestor.
At step 604, a matched provider is identified. For example, the closest provider is selected to match with the request. The best provider match may be made using any suitable criteria including rating, existing travel route, and/or any other suitable information.
At step 606, a determination is made whether a threshold number of instances of prior transport data corresponding to the request location exist. For example, if the location has a cluster of instances of prior transport data around it and the number of instances exceeds a threshold number, then control proceeds to step 506 as described with regard to
If there are insufficient instances of prior transport data associated with the current requestor, then at step 610, geohashes associated with the request location are determined. For example, a geohash-6 and geohash-7 of the request location may be obtained.
At step 612, prior requestors (not the current requestor) who have made requests associated with the selected geohash are determined. In an embodiment, the individual accounts associated with the requests made in the geohash are accessed for analysis, while in an embodiment, only the requests with locations in the geohashes are retrieved.
At step 614, instances of prior transport data, associated with the other requestors, that occurred in the selected geohash are analyzed to determine a predicted target pickup location. For example, the other requests used as part of the determination may only come from requests made in the selected geohash, while in other embodiments, an averaging or weighting approach may be used to determine which locations associated with instances of prior transport data (e.g., actual past pickup locations) will be considered more meaningful in an estimation of a target pickup location. For example, actual past pickup locations of requestors that share a common destination with the current requestor may be weighted more heavily in the determination, along with other signals as discussed herein.
At step 616, modified ride request information is sent to the provider device. For example, the ride request information sent to the dynamic transportation matching system as part of the request included a request location. As discussed herein, the request location may not accurately reflect the requestor's intent regarding where they would like to actually be picked up. For example, perhaps the GPS signal is inaccurate, or the request location is in a building, etc. Once a target pickup location is determined according to the techniques described herein, the dynamic transportation matching system may modify the ride request information to reflect the target pickup location instead of or in addition to the request location, and send the modified ride request information to the matched provider so they can navigate to the target pickup location.
At step 618, the target pickup location is sent to the requestor computing device, for example as part of the modified ride request information. In an embodiment, the requestor may send an indication to the dynamic transportation matching system that she would like to change the suggested target pickup location, such as by dragging a “pin” to a new location on a map displayed on the screen of the requestor computing device. This will send another set of modified ride request information to the dynamic transportation matching system for additional processing and sending to the provider.
Although embodiments may be described in reference to ride requests, any number of different services may be provided through similar request and matching functionality. Accordingly, embodiments are not limited to the matching of ride requests and one of ordinary skill would recognize that embodiments could be implemented for any number of different services that have requestors and providers being matched through a network of connected computing devices.
The requestor interface 131 may include any software and/or hardware components configured to send and receive communications and/or other information between the dynamic transportation matching system 130 and a plurality of requestor computing devices 120. The requestor interface 131 may be configured to facilitate communication between the dynamic transportation matching system 130 and the requestor application 121 operating on each of a plurality of requestor computing devices 120. The requestor interface 131 may be configured to periodically receive ride requests, location information, a request location (also referred to as a “pick-up” location, although in some embodiments, a request location and an actual or target pick-up location are different events), requestor status information, a location of the requestor computing device, progress toward a request location by the requestor computing device, and/or any other relevant information from the requestor computing device 120 when the requestor application 121 is active on the requestor computing device 120. The ride request may include a requestor identifier, location information for the requestor computing device 120, a pick-up location for the ride request, one or more destination locations, a pick-up time, and/or any other suitable information associated with providing a service to a requestor. The ride request may be sent in a single message or may include a series of messages. The ride matching module 133 may receive the ride request and update a historical ride data store 136C with the ride request information, including types of instances of prior transport data (e.g., prior request locations, prior actual pickup locations, prior transport start locations, prior transport destinations, and/or prior actual drop-off locations, etc.).
Additionally, the requestor interface 131 may be configured to send ride match messages, location information for the provider computing device, provider information, travel routes, pick-up estimates, traffic information, requestor updates/notifications, and/or any other relevant information to the requestor application 121 of the requestor computing device 120. The requestor interface 131 may update a requestor information data store 136A with requestor information received and/or sent to the requestor, a status of the requestor, a requestor computing device location, and/or any other relevant information, such as locations of instances of prior transport data as described above.
A requestor computing device 120 may include any device that is configured to communicate with a dynamic transportation matching system 130 and/or provider computing device 150 over one or more communication networks 170. The requestor computing device 120 may comprise a processor, a computer-readable memory, and communication hardware and/or software to allow the requestor computing device 120 to communicate over one or more communication networks 170. For example, a requestor computing device 120 may include a mobile phone, a tablet, a smart watch, a laptop computer, a desktop computer, and/or any other suitable device having a processor, memory, and communication hardware. In some embodiments, the requestor computing device 120 may include a requestor application 121 that is configured to manage communications with the dynamic transportation matching system 130 and interface with the user (i.e., requestor) of the requestor computing device 120. The requestor application 121 may allow a user to request a ride, monitor the status of a matched ride, pay for a ride, monitor past rides, perform any other requestor-oriented services related to the dynamic transportation matching system 130, and/or obtain any other requestor-oriented information from the dynamic transportation matching system 130.
The provider interface 132 may include any software and/or hardware configured to send and receive communications and/or other information between the dynamic transportation matching system 130 and a plurality of provider computing devices 150. The provider interface 132 may be configured to periodically receive location information of the provider computing device 150, provider status information, and/or any other relevant information from the provider computing device 150 when the provider application 151 is active on the provider computing device 150. Additionally, the provider interface 132 may be configured to send ride requests, location information of a requestor computing device 120, pick-up locations, travel routes, pick-up estimates, traffic information, provider updates/notifications, and/or any other relevant information to the provider application 151 of the provider computing device 150. The provider interface 132 may update a provider information data store 136B with provider information received and/or sent to the provider, a status of the provider, a provider computing device location, and/or any other relevant information, including locations of instances of prior transport data as described above.
A provider computing device 150 may include any computing device that is configured to communicate with a dynamic transportation matching system 130 and/or provider computing device 150 over one or more communication networks 170. The provider computing device 150 may comprise a processor, a computer-readable memory, and communication hardware and/or software to allow the provider computing device 150 to communicate over one or more communication networks 170. For example, a provider computing device 150 may include a mobile phone, a tablet, a smart watch, a laptop computer, a desktop computer, and/or any other suitable device having a processor, memory, and communication hardware. In some embodiments, the provider computing device 150 may include a provider application 151 that is configured to manage communications with the dynamic transportation matching system 130 and interface with the user of the provider computing device 150. The provider application 151 may allow a user to accept a ride request, monitor the status of a matched ride, obtain or generate navigation directions or a mapped route for a matched ride, get paid for a ride, monitor past rides, perform any other provider-oriented services related to the dynamic transportation matching system 130, and/or obtain any other provider-oriented information from the dynamic transportation matching system 130.
The ride matching module 133 may include a software module that is configured to process ride requests, ride responses, and other communications between requestors and providers of the dynamic transportation matching system 130 to match a requestor and a provider for a requested service. For example, the ride matching module 133 may be configured to identify available providers for a ride request from a requestor by identifying a geographic region associated with the pick-up location and may search a provider information data store 136B to identify available providers within a predetermined distance of the pick-up location and/or the geographic region.
The ride matching module 133 may include a location estimation module 134 and a provider selection module 135 that are configured to allow the ride matching module to perform efficient matching at target pickup/destination locations using the techniques described herein. For example, when the ride matching module 133 receives the request, the ride matching module 133 may identify available providers in the geographic area around the request location. The ride matching module 133 may use a threshold distance (e.g., 10 miles, 15 miles, etc.), one or more zip codes or other geographic identifiers (e.g., streets, blocks, neighborhoods, city, region, etc.), or any other suitable geographic limitation to identify available providers relevant to a request location. For example, the ride matching module 133 may search the provider information data store 136B to identify any available providers that are located within a certain distance from the request location or have a threshold estimated time of arrival (ETA) to the request location and/or a destination location associated with the request. The ride matching module 133 may also limit the search for available providers to those that meet ride request criteria such that the available provider can serve the request. For example, whether a provider vehicle is a sedan, luxury, SUV, or other type of car, has a particular type of feature or amenity (e.g., car seat, dog friendly, etc.), has a number of available seats (e.g., request for 2 people, etc.), and/or may use any other stored information at the dynamic transportation matching system to limit available providers to those that can serve the request.
Once the ride matching module 133 identifies the available providers in the area, the ride matching module 133 may calculate an estimated travel time for each of the providers from their current location to the request location. As discussed above, the ride matching module 133 may incorporate traffic, weather, road closures, and/or any other conditions that may affect travel time into the estimation. The ride matching module 133 may use historical ride data that is relevant for the time of day, streets and geographic region, as well as stored previous rides over those times, areas, road conditions, and/or any other information to obtain an estimate for the provider to travel from their current location to the request location. For example, the ride matching module 133 may be configured to obtain the location of each of the provider computing devices. The ride matching module 133 may be configured to identify the request location and map navigation routes for each of the providers and the requestor to the request location. The ride matching module 133 may calculate an estimated time of arrival for a variety of different routes based on navigation information obtained from a navigation data store 136D. The navigation information may include real-time and historical traffic information, historical travel time information, known routes for a geographic area or region, traffic rules, and/or any other suitable information for mapping and/or identifying potential routes for traveling from one location to another based on a type of transportation (e.g., driving, biking, sailing, flying, etc.). The ride matching module 133 may map a plurality of possible routes from the provider location to the request location as well as the alternate request locations and generate an estimated arrival time for each of the potential mapped routes. The ride matching module 133 may select the fastest route and/or the most probable route for each of the providers and the corresponding estimated travel time for that route as the estimated travel time for the provider. The ride matching module 133 may incorporate current traffic conditions, road closures, weather conditions, and any other relevant travel time related information to calculate an estimated arrival time for the provider. The estimated arrival time may also be calculated by taking an average of the arrival time of each of the mapped routes, selecting the estimated arrival time for the fastest route, receiving a selection of one of the potential routes by the provider, identifying the route being taken based on the route being used by the provider, and/or through any other suitable method. If the provider makes a wrong turn and/or follows a different route than that calculated by the ride matching module 133, the ride matching module 133 may obtain the updated location of the provider computing device and recalculate the possible routes and estimated arrival times. As such, the estimated travel times may be updated as travel and road conditions, weather, etc. are updated. Accordingly, the ride matching module 133 may determine a navigation route associated with the request location and an estimated travel time for each of the providers. Further, the estimated time may be determined through any suitable method including taking an average of multiple routes, selecting the fastest route, adding additional cushion time when certainty is low for the estimate of the time, etc. Accordingly, the ride matching module 133 may determine an estimated travel time for each of the available providers in the area that may potentially match the request.
The location estimation module 134 may use locations of instances of prior transport data as described above to estimate a target pickup location. For example, the location estimation module may perform clustering of instances of prior transport data and associate the clusters with various locations and/or geographic areas, such as may be obtained from navigation data store 136D or requestor information 136A. The location estimation module 134 may use the instances of prior transport data to estimate a location for a target pickup location that is related to a request location. As discussed herein, a requestor may provide a request location in the middle of a building for various reasons; however, the requestor's intent is to be picked up somewhere outside the building, preferably in a location that leads to an efficient journey and allows the requestor and the provider to meet each other without undue delay. The location estimation module may perform some or all of the techniques described herein to estimate a target pickup location.
The ride matching module 133 may then provide estimated travel times for the providers and the requestor to the provider selection module 135. The provider selection module 135 may obtain the estimated travel times and may select one or more providers that should be matched with the request. Accordingly, the provider selection module 135 may generate a dynamic provider eligibility model that incorporates both the estimated requestor arrival time and the estimated provider times of each of the providers to identify those available providers that are eligible for a match. The provider selection module 135 may then select a subset of the eligible available providers and select one of the providers based on system efficiency, rankings, route, arrival time, and/or any other suitable information that can be used for matching. For example, two available providers may be identified as eligible for a request where one of the providers is traveling away from the request location while the other is traveling toward the request location. The provider selection module 135 may select the provider that is traveling toward the request location because it causes less driving, fewer turns, safer driving, and all the other benefits of allowing providers to maintain their current direction of travel.
Additionally, in some embodiments, the provider selection module 135 may perform available provider prediction to ensure that the best possible match is being made. For instance, the provider selection module 135 may obtain an available provider rate associated with the request location from a historical ride data store 136C that may indicate the historical rate of available providers coming online near the request location. For example, some areas may have a high rate of providers coming online during particular times that the dynamic transportation matching system may use to predict available providers near the request location. For requests that have relatively large requestor arrival times outstanding (e.g., 5+ minutes) and a high rate of predicted available providers, the system may delay matching to an eligible provider even if there are multiple providers that are available and eligible for a request in order to ensure that the a more efficient system match does not arise. Additionally, the ride history data store 136C may be consulted for existing rides that have providers that will be dropping off requestors in the area before the requestor arrival time is up. For instance, if a request is received for a busy area where a number of different providers with requestors are dropping off previously matched requestors and/or where new providers are known to become active during the time frame of the requestor arrival time, the provider selection module 135 may delay matching to see if a provider becomes available in the area that is closer than the existing eligible providers for the request. The ride matching module may repeat the process and monitor the status of the available and matched providers in the area along with the progress of the requestor toward the request location to ensure that a well-matched and eligible provider is matched to the request before the requestor arrives at the request location. Accordingly, by tracking and monitoring system activity as well as using estimated arrival times for the providers and requestor over time, the system can more efficiently and effectively match provider resources with requestor resources to ensure the most efficient matching of resources.
The ride matching module 133 may provide the ride request to the provider interface 132 with the provider contact information or provider identifier so that the ride request may be sent to one or more available providers. The ride matching module 133 may send the ride request and/or the information from the ride request to one or more of the selected available providers to determine whether the available providers are interested in accepting the ride request. The one or more available providers may receive the ride request through the provider application 151 of the provider computing device 150, may evaluate the request, and may accept or deny the request by providing an input through the provider application 151. A ride response message may be sent to the dynamic transportation matching system 130 indicating whether a ride was accepted and including a provider identifier, a location of the provider, and/or any other suitable information to allow the dynamic transportation matching system 130 to process the response. Alternatively, the provider may ignore the request and after a predetermined period of time, the request may be considered denied and a corresponding ride response message may be sent to the dynamic transportation matching system 130. In some embodiments, no response may be sent unless a ride request is accepted and the ride will be assumed to be denied unless a response is received from the provider. In other embodiments, no response is necessary and the ride may be immediately accepted. An indicator, flag, and/or other information may be passed back to the dynamic transportation matching system to assure the system that the provider computing device received the request.
The ride matching module 133 may receive the ride response, evaluate whether the provider accepted or declined the request, and may either find additional available providers for the request (if declined) or determine the ride request has been accepted and send matched ride information to the requestor computing device 120 and the provider computing device 150. The matched ride information may include provider information, requestor information, the pick-up location, the current location of the provider computing device, the current location of the requestor computing device, an estimated time of arrival for the provider, and/or any other suitable information to allow the requestor and the provider to complete the requested service. The ride matching module 133 may update the historical ride data store 136C with the corresponding matched ride information for the matched ride. Accordingly, the ride matching module may perform more efficient and effective matching of requests with providers.
Identity management services 804 may include various identity services, such as access management and authorization services for requestors and providers when interacting with management system 802. This may include, e.g., authenticating the identity of providers and determining that the providers are authorized to provide services through management system 802. Similarly, requestors' identities may be authenticated to determine whether the requestor is authorized to receive the requested services through management system 802. Identity management services 804 may also control access to provider and requestor data maintained by management system 802, such as driving and/or ride histories, personal data, or other user data. Location services 806 may include navigation and/or traffic management services and user interfaces, or other location services.
In various embodiments, ride services 808 may include ride matching and management services to connect a requestor to a provider. Ride services 808 may include a user interface and or may receive data from requestors and providers through applications executing on their respective devices. Ride services 808 may, e.g., confirm the identity of requestors and providers using identity management services 804, and determine that each user is authorized for the requested ride service. In some embodiments, ride services 808 can identify an appropriate provider using a location obtained from a requestor and location services 806 to identify, e.g., a closest provider. As such, ride services 808 can manage the distribution and allocation of provider and requestor resources, consistent with embodiments described herein.
Management system 802 can connect to various devices through network 810 and 812. Networks 810, 812 can include any network configured to send and/or receive data communications using various communication protocols, such as AppleTalk, transmission control protocol/Internet protocol (TCP/IP), Internet packet exchange (IPX), systems network architecture (SNA), etc. In some embodiments, networks 810, 812 can include local area networks (LAN), such as Ethernet, Token-Ring or other LANs. Networks 810, 812 can include a wide-area network and/or the Internet. In some embodiments, networks 810, 812 can include VPNs (virtual private networks), PSTNs (a public switched telephone networks), infra-red networks, or any wireless network, including networks implementing the IEEE 802.11 family of standards, Bluetooth®, Bluetooth® Low Energy, NFC and/or any other wireless protocol. In various embodiments, networks 810, 812 can include a mobile network, such as a mobile telephone network, cellular network, satellite network, or other mobile network. Networks 810, 812 may be the same as communication network 170 in
Users may then utilize one or more services provided by management system 802 using applications executing on provider and requestor devices. As shown in
In some embodiments, provider computing device 818 can include a provider communication device configured to communicate with users, such as drivers, passengers, pedestrians, and other users. In some embodiments, provider communication device 818 can communicate directly with management system 802 or through another provider computing device, such as provider computing device 816. In some embodiments, a requestor computing device can communicate 826 directly with provider communication device 818 over a peer-to-peer connection, Bluetooth connection, NFC connection, ad hoc wireless network, or any other communication channel or connection. Although particular devices are shown as communicating with management system 802 over networks 810 and 812, in various embodiments, management system 802 can expose an interface, such as an application programming interface (API) or service provider interface (SPI) to enable various third parties which may serve as an intermediary between end users and management system 802.
Although requestor/provider management environment 800 is shown with four provider devices and two requestor devices, any number of devices may be supported. The various components shown and described herein may be implemented in hardware, firmware, software, or combinations thereof. Although one embodiment of a requestor/provider management environment is depicted in
As shown in
As shown in
Although a particular implementation of environment 900 is shown in
As shown in
In system 1100, bus 1102 facilitates communication between the various subsystems. Although a single bus 1102 is shown, alternative bus configurations may also be used. Bus 1102 may include any bus or other component to facilitate such communication as is known to one of ordinary skill in the art. Examples of such bus systems may include a local bus, parallel bus, serial bus, bus network, and/or multiple bus systems coordinated by a bus controller. Bus 1102 may include one or more buses implementing various standards such as Parallel ATA, serial ATA, Industry Standard Architecture (ISA) bus, Extended ISA (EISA) bus, MicroChannel Architecture (MCA) bus, Peripheral Component Interconnect (PCI) bus, or any other architecture or standard as is known in the art.
In some embodiments, I/O device subsystem 1104 may include various input and/or output devices or interfaces for communicating with such devices. Such devices may include, without limitation, a touch screen or other touch-sensitive input device, a keyboard, a mouse, a trackball, a motion sensor or other movement-based gesture recognition device, a scroll wheel, a click wheel, a dial, a button, a switch, audio recognition devices configured to receive voice commands, microphones, image capture based devices such as eye activity monitors configured to recognize commands based on eye movement or blinking, and other types of input devices. I/O device subsystem 1104 may also include identification or authentication devices, such as fingerprint scanners, voiceprint scanners, iris scanners, or other biometric sensors or detectors. In various embodiments, I/O device subsystem may include audio output devices, such as speakers, media players, or other output devices.
Computer system 1100 may include a display device subsystem 1106. Display device subsystem may include one or more lights, such as an one or more light emitting diodes (LEDs), LED arrays, a liquid crystal display (LCD) or plasma display or other flat-screen display, a touch screen, a head-mounted display or other wearable display device, a projection device, a cathode ray tube (CRT), and any other display technology configured to visually convey information. In various embodiments, display device subsystem 1106 may include a controller and/or interface for controlling and/or communicating with an external display, such as any of the above-mentioned display technologies.
As shown in
Memory subsystem 1112 can include various types of memory, including RAM, ROM, flash memory, or other memory. Memory 1112 can include SRAM (static RAM) or DRAM (dynamic RAM). In some embodiments, memory 1112 can include a BIOS (basic input/output system) or other firmware configured to manage initialization of various components during, e.g., startup. As shown in
System 1100 can also include a communication subsystem 1120 configured to facilitate communication between system 1100 and various external computer systems and/or networks (such as the Internet, a local area network (LAN), a wide area network (WAN), a mobile network, or any other network). Communication subsystem 1120 can include hardware and/or software to enable communication over various wired (such as Ethernet or other wired communication technology) or wireless communication channels, such as radio transceivers to facilitate communication over wireless networks, mobile or cellular voice and/or data networks, Wi-Fi networks, or other wireless communication networks. For example, the communication network is shown as communication network 170 in
As shown in
Various other configurations are may also be used, with particular elements that are depicted as being implemented in hardware may instead be implemented in software, firmware, or a combination thereof. One of ordinary skill in the art will recognize various alternatives to the specific embodiments described herein.
The specification and figures describe particular embodiments which are provided for ease of description and illustration and are not intended to be restrictive. Embodiments may be implemented to be used in various environments without departing from the spirit and scope of the disclosure.
The use of the terms “a” and “an” and “the” and similar referents in the context of describing the disclosed embodiments (especially in the context of the following claims) are to be construed to cover both the singular and the plural, unless otherwise indicated herein or clearly contradicted by context. The terms “comprising,” “having,” “including,” and “containing” are to be construed as open-ended terms (i.e., meaning “including, but not limited to,”) unless otherwise noted. The term “connected” is to be construed as partly or wholly contained within, attached to, or joined together, even if there is something intervening. Recitation of ranges of values herein are merely intended to serve as a shorthand method of referring individually to each separate value falling within the range, unless otherwise indicated herein and each separate value is incorporated into the specification as if it were individually recited herein. All methods described herein can be performed in any suitable order unless otherwise indicated herein or otherwise clearly contradicted by context. The use of any and all examples, or exemplary language (e.g., “such as”) provided herein, is intended merely to better illuminate embodiments of the disclosure and does not pose a limitation on the scope of the disclosure unless otherwise claimed. No language in the specification should be construed as indicating any non-claimed element as essential to the practice of the disclosure.
Disjunctive language such as the phrase “at least one of X, Y, or Z,” unless specifically stated otherwise, is intended to be understood within the context as used in general to present that an item, term, etc., may be either X, Y, or Z, or any combination thereof (e.g., X, Y, and/or Z). Thus, such disjunctive language is not generally intended to, and should not, imply that certain embodiments require at least one of X, at least one of Y, or at least one of Z to each be present.
Preferred embodiments of this disclosure are described herein, including the best mode known to the inventors for carrying out the disclosure. Variations of those preferred embodiments may become apparent to those of ordinary skill in the art upon reading the foregoing description. The inventors expect skilled artisans to employ such variations as appropriate and the inventors intend for the disclosure to be practiced otherwise than as specifically described herein. Accordingly, this disclosure includes all modifications and equivalents of the subject matter recited in the claims appended hereto as permitted by applicable law. Moreover, any combination of the above-described elements in all possible variations thereof is encompassed by the disclosure unless otherwise indicated herein or otherwise clearly contradicted by context.
All references, including publications, patent applications, and patents, cited herein are hereby incorporated by reference to the same extent as if each reference were individually and specifically indicated to be incorporated by reference and were set forth in its entirety herein.
This present application is a continuation of U.S. application Ser. No. 15/666,446, filed Aug. 1, 2017, which is a continuation of U.S. application Ser. No. 15/479,118, filed Apr. 4, 2017, now issued as U.S. Pat. No. 9,769,616. Each of the aforementioned patents and applications are hereby incorporated by reference in their entirety.
| Number | Name | Date | Kind |
|---|---|---|---|
| 6356838 | Paul | Mar 2002 | B1 |
| 8126903 | Lehmann | Feb 2012 | B2 |
| 8150967 | King et al. | Apr 2012 | B2 |
| 9165074 | Hendrey | Oct 2015 | B2 |
| 9547309 | Ross et al. | Jan 2017 | B2 |
| 9679489 | Lambert et al. | Jun 2017 | B2 |
| 9769616 | Pao et al. | Sep 2017 | B1 |
| 9894484 | Pao et al. | Feb 2018 | B1 |
| 20040260470 | Rast | Dec 2004 | A1 |
| 20050015307 | Simpson et al. | Jan 2005 | A1 |
| 20090216600 | Hill | Aug 2009 | A1 |
| 20100057502 | Arguelles | Mar 2010 | A1 |
| 20100207812 | Demirdjian et al. | Aug 2010 | A1 |
| 20110099040 | Felt | Apr 2011 | A1 |
| 20110301985 | Camp | Dec 2011 | A1 |
| 20110313880 | Paul et al. | Dec 2011 | A1 |
| 20120232943 | Myr | Sep 2012 | A1 |
| 20120290652 | Boskovic | Nov 2012 | A1 |
| 20130132140 | Amin et al. | May 2013 | A1 |
| 20130246301 | Radhakrishnan et al. | Sep 2013 | A1 |
| 20140047381 | Fan et al. | Feb 2014 | A1 |
| 20140062886 | Pasquero et al. | Mar 2014 | A1 |
| 20140129302 | Amin et al. | May 2014 | A1 |
| 20140171039 | Bjontegard | Jun 2014 | A1 |
| 20140188775 | Lehmann | Jul 2014 | A1 |
| 20140188920 | Sharma et al. | Jul 2014 | A1 |
| 20150161554 | Sweeney et al. | Jun 2015 | A1 |
| 20150161564 | Sweeney | Jun 2015 | A1 |
| 20150161697 | Jones | Jun 2015 | A1 |
| 20160027306 | Lambert | Jan 2016 | A1 |
| 20170169535 | Tolkin | Jun 2017 | A1 |
| 20170193404 | Yoo et al. | Jul 2017 | A1 |
| Number | Date | Country |
|---|---|---|
| 2507753 | Oct 2013 | EP |
| WO 2011-069170 | Jun 2011 | WO |
| WO 2011069170 | Jun 2011 | WO |
| Entry |
|---|
| U.S. Appl. No. 13/828,913, dated May 20, 2015, Office Action. |
| U.S. Appl. No. 13/828,913, dated Nov. 11, 2015, Office Action. |
| U.S. Appl. No. 13/828,913, dated Aug. 25, 2016, Office Action. |
| U.S. Appl. No. 13/828,913, dated Apr. 21, 2017, Office Action. |
| U.S. Appl. No. 13/828,913, dated Jan. 9, 2018, Office Action. |
| U.S. Appl. No. 15/479,118, dated Jun. 28, 2017, Notice of Allowance. |
| U.S. Appl. No. 15/666,446, dated Oct. 4, 2017, Notice of Allowance. |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 15666446 | Aug 2017 | US |
| Child | 15880396 | US | |
| Parent | 15479118 | Apr 2017 | US |
| Child | 15666446 | US |
