System and method for recommending bidding bundle options in bidding-based ridesharing

US2021201214A1 · US · A1

Patent metadata
FieldValue
Publication numberUS-2021201214-A1
Application numberUS-202017062386-A
CountryUS
Kind codeA1
Filing dateOct 2, 2020
Priority dateDec 31, 2019
Publication dateJul 1, 2021
Grant date

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for bidding-based ridesharing are described. One exemplary method includes: obtaining a price range of a trip request for a rider; determining a plurality of trip setting candidates based on the trip request, and a plurality of price candidates based on the price range; generating a plurality of bidding bundle option candidates based on a plurality of combinations of the plurality of trip setting candidates and the plurality of price candidates; determining, based on a trained machine-learning classifier, a selection probability for the rider to select each of the plurality of bidding bundle option candidates; and ranking the plurality of bidding bundle option candidates based on corresponding probabilities; and transmitting one or more of the plurality of bidding bundle option candidates with top selection probabilities to a terminal device associated with the rider.

First claim

Opening claim text (preview).

What is claimed is: 1 . A method for bidding bundle option recommendation for ridesharing, the method comprising: obtaining, by a computing device of a ridesharing platform, a price range of a trip request for a rider; determining, by the computing device, a plurality of trip setting candidates based on the trip request, and a plurality of price candidates based on the price range; generating, by the computing device, a plurality of bidding bundle option candidates based on a plurality of combinations of the plurality of trip setting candidates and the plurality of price candidates; determining, by the computing device based on a trained machine-learning classifier, a selection probability for the rider to select each of the plurality of bidding bundle option candidates, wherein for each of the plurality of bidding bundle option candidates, the trained machine-learning classifier accepts input comprising at least one of the following: information of the rider, the bidding bundle option candidate, trip attributes of a hypothetical trip configured based on the bidding bundle option candidate and generates output comprising the selection probability for the rider to select the bidding bundle option candidate; and ranking, by the computing device, the plurality of bidding bundle option candidates based on corresponding probabilities; and transmitting one or more of the plurality of bidding bundle option candidates with top selection probabilities to a terminal device associated with the rider. 2 . The method of claim 1 , wherein the obtaining a price range comprises: obtaining the price range input from the terminal device associated with the rider. 3 . The method of claim 1 , wherein the price range is learned from historical trip requests from the rider and other riders sharing a plurality of rider features with the rider. 4 . The method of claim 1 , further comprising: training the machine-learning classifier based on a plurality of historical trips taken by the rider, wherein each of the plurality of historical trips comprising a first historical bidding bundle option candidate selected by the rider and one or more second historical bidding bundle option candidates offered to but not selected by the rider. 5 . The method of claim 4 , wherein the training the machine-learning classifier based on a plurality of historical trips taken by the rider comprises: training the machine-learning classifier with the first historical bidding bundle option candidate as a positive sample, and the one or more second historical bidding bundle option candidates as negative samples. 6 . The method of claim 1 , wherein information of the rider comprises at least one of the following: origins of the rider's historical trips; destinations of the rider's historical trips; temporal information of the rider's historical trips; estimated income level; and the rider's historical preference over different trip settings. 7 . The method of claim 1 , further comprising: determining the estimated income level of the rider with a machine learning model based on at least one of the following: one or more addresses associated with the rider and a plurality of historical trips taken by the rider. 8 . The method of claim 1 , wherein the determining a plurality of trip setting candidates based on the trip request comprises: determining one or more settings for each of the plurality of trip options, wherein the trip options comprise at least one of the following: a carpool option, a pickup location option, a vehicle type option, a vehicle capacity option, and a car seat option. 9 . The method of claim 8 , wherein the one or more settings of the pickup location option are determined based on the origin in the trip request. 10 . The method of claim 1 , wherein the trip attributes comprise at least one of the following: an estimated waiting time; an estimated time of arrival (ETA); a pickup distance; and temporal information. 11 . The method of claim 1 , wherein the machine-learning classifier is trained as one of the following models: Logistic Regression (LR), Random Forest (RF), and Deep Neural Network (DNN). 12 . A system comprising one or more processors and one or more non-transitory computer-readable memories coupled to the one or more processors, the one or more non-transitory computer-readable memories storing instructions that, when executed by the one or more processors, cause the system to perform operations comprising: obtaining a price range of a trip request for a rider; determining a plurality of trip setting candidates based on the trip request, and a plurality of price candidates based on the price range; generating a plurality of bidding bundle option candidates based on a plurality of combinations of the plurality of trip setting candidates and the plurality of price candidates; determining, based on a trained machine-learning classifier, a selection probability for the rider to select each of the plurality of bidding bundle option candidates, wherein for each of the plurality of bidding bundle option candidates, the trained machine-learning classifier accepts input comprising information of the rider, the bidding bundle option candidate, trip attributes of a hypothetical trip configured based on the bidding bundle option candidate and generates output comprising the selection probability for the rider to select the bidding bundle option candidate; and ranking the plurality of bidding bundle option candidates based on corresponding probabilities; and transmitting one or more of the plurality of bidding bundle option candidates with top selection probabilities to a terminal device associated with the rider. 13 . The system of claim 12 , wherein the operations further comprise: training the machine-learning classifier based on a plurality of historical trips taken by the rider, wherein each of the plurality of historical trips comprising a first historical bidding bundle option candidate selected by the rider and one or more second historical bidding bundle option candidates offered to but not selected by the rider. 14 . The system of claim 13 , wherein the training the machine-learning classifier based on a plurality of historical trips taken by the rider comprises: training the machine-learning classifier with the first historical bidding bundle option candidate as a positive sample, and the one or more second historical bidding bundle option candidates as negative samples. 15 . The system of claim 12 , wherein the operations further comprise: determining the estimated income level of the rider with a machine learning model based on at least one of the following: one or more addresses associated with the rider and a plurality of historical trips taken by the rider. 16 . The system of claim 12 , wherein the trip attributes comprise at least one of the following: an estimated waiting time; an estimated time of arrival (ETA); a pickup distance; and 17 . A non-transitory computer-readable storage medium storing instructions that, when executed by one or more processors, cause the one or more processors to perform operations comprising: obtaining a price range of a trip request for a rider; determining a plurality of trip setting candidates based on the trip request, and a plurality of price candidates based on the price range; generating a plurality of bidding bundle option candidates based on a plurality of combinations of the plurality of trip setting candidates and the plurality of price candidates; determinin

Assignees

Inventors

Classifications

  • G06Q10/02Primary

    Reservations, e.g. for tickets, services or events · CPC title

  • Tree-organised classifiers · CPC title

  • Generating training patterns; Bootstrap methods, e.g. bagging or boosting · CPC title

  • Supervised learning · CPC title

  • Machine learning · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US2021201214A1 cover?
Methods, systems, and apparatus, including computer programs encoded on computer storage media, for bidding-based ridesharing are described. One exemplary method includes: obtaining a price range of a trip request for a rider; determining a plurality of trip setting candidates based on the trip request, and a plurality of price candidates based on the price range; generating a plurality of bidd…
Who is the assignee on this patent?
Beijing Didi Infinity Technology & Dev Co Ltd
What technology area does this patent fall under?
Primary CPC classification G06Q10/02. Mapped technology areas include Physics.
When was this patent published?
Publication date Thu Jul 01 2021 00:00:00 GMT+0000 (Coordinated Universal Time) (A1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).