Raising User Satisfaction in an Automated Ride Sharing System
AssigneeSap SE
InventorsVedran LERENC, Jens LEHMANN, David SOMMER
Life of this patent
Estimating the term…
Abstract
Embodiments of the present invention may provide a various techniques for raising user satisfaction with an automated ride sharing system. In one embodiment, the system may disqualify potential passengers that will force the driver to return to a previously departed area. In another embodiment, the system may consolidate multiple stop locations to reduce the number and frequency of stops in a scheduled ride. In another embodiment, the system may select a best possible ride from a plurality of calculated rides based on user satisfaction factors.
Claims32
A processor-implemented method for arranging a ride, comprising:
- receiving driver parameters, the driver parameters including driver start and end locations;
- receiving passenger parameters, the passenger parameters including passenger start and end locations;
- if the passenger parameters overlap with a previously departed stop location in the ride based on a predefined overlap criterion, disqualify the passenger from the ride;
- and
- if the passenger end location does not overlap with a previously departed stop location in the ride based on the predefined overlap criterion, schedule the ride with the driver and the passenger.
A ride arranging system, comprising:
- a memory to store driver and possible passenger parameters;
- and
- a processor configured to schedule a ride with the driver and possible passenger if the possible passenger parameters do not overlap with a previously departed stop location in the ride based on a predefined overlap criterion, and to disqualify the possible passenger from the ride if the possible passenger parameters overlap with a previously departed stop location in the ride based on the predefined overlap criterion.
A computer-readable medium storing instructions for execution by a processor, which when executed by the processor perform:
- receiving driver parameters, the driver parameters including driver start and end locations for a ride;
- receiving passenger parameters, the passenger parameters including passenger start and end locations;
- if the passenger parameters overlap with a previously departed stop location in the ride based on a predefined overlap criterion, disqualify the passenger from the ride;
- and
- if the passenger end location does not overlap with a previously departed stop location in the ride based on the predefined overlap criterion, schedule the ride with the driver and the passenger.
A processor-implemented method for arranging a ride, comprising:
- extracting stop coordinates of a possible ride;
- extracting walking parameters of at least one passenger on the possible ride, wherein the walking parameters include a walking threshold;
- determining if at least two stop coordinates are within the walking threshold of each other;
- if at least two stop coordinates are within the walking threshold, consolidating the at least two stop coordinates into one stop coordinate.
A processor-implemented method for arranging a ride, comprising:
- based on driver inputted and potential passenger inputted parameters, calculating a plurality of possible ride solutions;
- assigning weights to the plurality of possible ride solutions, wherein the weights are based on factors relating to quality of the ride;
- ranking the weighted possible ride solutions;
- and
- selecting the top ranked possible ride solution for the ride.
Dependencies are inferred from the claim text.