CN112632414A

CN112632414A - Method, apparatus, device, medium and program product for determining candidate get-off location

Info

Publication number: CN112632414A
Application number: CN202011610506.6A
Authority: CN
Inventors: 尹辉
Original assignee: Beijing Didi Infinity Technology and Development Co Ltd
Current assignee: Beijing Didi Infinity Technology and Development Co Ltd
Priority date: 2020-12-30
Filing date: 2020-12-30
Publication date: 2021-04-09
Also published as: CN114692014A

Abstract

A method, apparatus, device, medium, and program product for determining candidate get-off locations are provided according to embodiments of the present disclosure. In the method, candidate drop-off locations are determined for the user trip based on statistical data of historical drop-off locations associated with at least one of a pick-up location and a time of the user trip. Therefore, when the candidate getting-off point is recommended to the user, multi-scale features such as space features, time features, space-time cross features and the like of the getting-off point can be considered, so that the getting-off point which can be satisfied by the user can be recommended, and the user experience is improved.

Description

Method, apparatus, device, medium and program product for determining candidate get-off location

Technical Field

Embodiments of the present disclosure relate to the field of computer technology, and more particularly, to a method, apparatus, device, medium, and program product for determining candidate get-off locations.

Background

With the development of computer technology and network technology, online vehicle service applications have been provided to users. Such an application may be used to submit a corresponding vehicle service request if a user wants to travel from a location to a destination in a ride. During operation, after the user confirms the boarding location, the application may recommend candidate disembarking locations to the user. Currently, there is a need for an efficient method that can recommend a suitable drop-off location for a user.

Disclosure of Invention

Embodiments of the present disclosure provide a method, apparatus, device, medium, and program product for determining a candidate drop-off location.

In a first aspect of the disclosure, a method of determining candidate drop-off locations for a trip of a user is provided. In the method, a boarding location for a trip is determined. Candidate drop-off locations for the trip are then determined based on statistical data for historical drop-off locations associated with at least one of the pick-up location and the time of the trip.

In a second aspect of the present disclosure, an apparatus for determining candidate drop-off locations for a trip of a user is provided. The apparatus includes a first determination module configured to determine a boarding location for a trip. The apparatus also includes a second determination module configured to determine a candidate drop-off location for the trip based on statistics of historical drop-off locations associated with at least one of a pick-up location and a time of the trip.

In a third aspect of the present disclosure, there is provided an electronic device comprising: a memory and a processor; wherein the memory is for storing one or more computer instructions, wherein the one or more computer instructions are executed by the processor to implement the method according to the first aspect of the disclosure.

In a fourth aspect of the present disclosure, there is provided a computer readable storage medium having one or more computer instructions stored thereon, wherein the one or more computer instructions are executed by a processor to implement a method according to the first aspect of the present disclosure.

In a fifth aspect of the disclosure, a computer program product is provided, comprising computer programs/instructions which, when executed by a processor, implement the method according to the first aspect of the disclosure.

Drawings

The features, advantages and other aspects of various implementations of the present disclosure will become more apparent from the following detailed description when taken in conjunction with the accompanying drawings, which illustrate, by way of example and not by way of limitation, several implementations of the present disclosure. In the drawings:

FIG. 1 illustrates a block diagram of a user interface in which an online vehicle service application according to an exemplary implementation of the present disclosure may be used;

fig. 2 illustrates a flow diagram of a method of determining candidate drop-off locations in accordance with certain embodiments of the present disclosure;

fig. 3 illustrates a schematic block diagram of an apparatus for determining candidate get-off locations according to some embodiments of the present disclosure; and

fig. 4 illustrates a block diagram of an electronic device in accordance with an exemplary implementation of the present disclosure.

Detailed Description

Preferred implementations of the present disclosure will be described in more detail below with reference to the accompanying drawings. While a preferred implementation of the present disclosure is shown in the drawings, it should be understood that the present disclosure may be implemented in various forms and should not be limited by the implementations set forth herein. Rather, these implementations are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.

The term "recommendation engine" as used herein refers to a component having a function of recommending an alighting place, which can recommend an appropriate alighting place for a user according to the boarding place of the user. The recommendation engine may be implemented by software, hardware, firmware, or any combination thereof.

The term "include" and variations thereof as used herein is meant to be inclusive in an open-ended manner, i.e., "including but not limited to". Unless specifically stated otherwise, the term "or" means "and/or". The term "based on" means "based at least in part on". The terms "one example implementation" and "one implementation" mean "at least one example implementation". The term "another implementation" means "at least one additional implementation". The terms "first," "second," and the like may refer to different or the same object. Other explicit and implicit definitions are also possible below.

An application environment of an exemplary implementation of the present disclosure is first described with reference to fig. 1. FIG. 1 shows a block diagram 100 of a user interface in which an online vehicle service application according to an example implementation of the present disclosure may be used.

As shown in user interface 110 in fig. 1, the user may enter a pickup location (e.g., home) at block 120. Alternatively, candidate pick-up locations (not shown) may be displayed in block 120. For example, a default candidate pick-up location may be displayed in block 120, which may be determined based on the user's current location or the user's preferences. The user may select the candidate pick-up location, for example, by clicking. A plurality of candidate pick-up locations may also be displayed to the user in block 120 for selection by the user in the form of a drop-down menu.

After the user specifies the departure location, the user is recommended the drop-off location (e.g., company) at block 130. The user may select the recommended drop-off location by clicking on the recommendation box 130. Similar to the display of candidate pick-up locations described above, a plurality of candidate pick-up locations may be displayed to the user in block 130 in the form of a drop-down menu. Alternatively, the user may enter the destination point at block 140 himself.

It is desirable that a destination point of a user can be predicted, so that an appropriate get-off point is recommended to the user, and user experience is improved.

To this end, example embodiments of the present disclosure propose a drop-off point recommendation scheme. The approach determines one or more candidate drop-off locations for the itinerary based on statistics of historical drop-off locations for historical itineraries for respective users associated with at least one of a pick-up location and a time of the itinerary for the user. As an example, when determining the candidate getting-off point, in the spatial dimension, the distribution of the getting-off points of the historical trips taking the current getting-on point as the departure point may be considered, and the distribution of the getting-off points of the historical trips in the vicinity of the current getting-on point of the departure point may also be considered. In the time dimension, the distribution of drop-off locations for historical trips over a period of time (e.g., the same period of each day) within which the trip time is located may be considered.

Therefore, when the candidate getting-off point is recommended to the user, multi-scale features such as space features, time features, space-time cross features and the like of the getting-off point can be considered, so that the getting-off point which can be satisfied by the user can be recommended, and the user experience is improved.

Fig. 2 illustrates a flow diagram of a method 200 of determining candidate drop-off locations in accordance with certain embodiments of the present disclosure. For ease of discussion, the method 200 will be described below in conjunction with FIG. 1.

As shown in FIG. 2, at block 205, a boarding location for the user's trip is determined. The pick-up location may be manually entered by the user, for example, in block 120 of fig. 1. Alternatively or additionally, the user may select a desired pick-up location from a plurality of candidate pick-up locations. For example, after the user clicks on box 120, a drop-down menu may be displayed to the user listing a plurality of candidate pick-up locations for selection by the user. Accordingly, the user may select one boarding location from the plurality of candidate boarding locations as the starting point of the current trip. In some embodiments, the user's pick-up location may also be a default. For example, automatically determined based on the current location of the user.

At block 210, a candidate drop-off location for the trip is determined based on statistics of historical drop-off locations associated with at least one of the pick-up location and the time of the trip. The determined candidate drop-off location may be displayed at block 130 in fig. 1. As described above, a plurality of candidate get-off locations may be recommended to the user. In this case, a plurality of candidate drop-off locations may be presented to the user via a drop-down menu for selection by the user.

The statistical data of the historical drop-off location may relate to a spatial distribution of drop-off locations. In some embodiments, a probability distribution of drop-off locations for historical trips of individual users with the current pick-up location as the trip origin or starting point near the current pick-up location may be considered. As an example, a historical alighting point whose distance from the boarding point is within a predetermined distance range may be considered. For example, the statistical data may include a probability distribution of the point of disembarkation for historical trips to the pickup within 500, 1000 or 2000 meters of the current point of pickup.

In some embodiments, the statistical data for historical drop-off locations may relate to a distribution of drop-off locations over time. For example, a probability distribution of historical drop-off locations for historical trips within a predetermined time period associated with the time of the current trip may be considered. The time of the current trip may be the current time or some future time specified by the user.

As an example, a drop-off location for a historical trip within the same time period as the current trip may be considered. For example, if the time of the current trip is 15 minutes at 2 pm, the probability distribution of the drop-off location for the historical trips of 2 pm to 3 pm every day in the previous week or month may be considered. Alternatively or additionally, workdays and holidays may also be distinguished. For example, if the current trip occurs on a weekday, historical trips over the same period of each weekday in the previous week or month may be considered. If the current trip occurs on a double holiday, historical trips over the same period of the double holiday for the previous month or months may be considered. In addition, the time scale of the day of the week may also be considered. For example, if the current trip occurred on mondays, the probability distribution of drop-off locations for historical trips over the same period of time on each monday for the previous month or months may be considered.

In addition to the period of the current trip, other time periods associated with the time of the current trip may be considered. For example, a probability distribution of drop-off locations for historical trips within a predetermined time period before the current trip, e.g., within one hour before the current trip, may be considered. In the event that a certain trending event occurs, for example, when a concert is to be held, it may be beneficial to consider the alighting location of the historical trip during the most recent period of time when recommending candidate alighting locations to the user.

In some embodiments, the cross-distribution of historical drop-off locations over space and time may be considered. For example, a probability distribution of historical drop-off locations for historical trips within a certain predetermined time period, where the starting point is within a predetermined distance range from the current pick-up location and associated with the time of the current trip, may be considered. For example, a probability distribution of a point of alighting for a historical trip having a starting point within 500 meters of a current point of boarding within the same period of time every day in the previous month may be considered.

The statistical data of the historical drop-off location may include a road crossing cost in addition to a probability distribution of the historical drop-off location. For example, whether or not to cross a road between a get-off point and a get-on point in a historical trip, how many roads to cross, and the like.

In addition to statistical data regarding historical drop-off locations, characteristics of the respective candidate drop-off locations, such as whether hot locations, whether parking sections are being prohibited, and the like, may also be considered in determining the candidate drop-off locations. Alternatively or additionally, characteristics of the user may also be taken into account, such as the user's gender, age, habits, hobbies, etc. user profile information.

The recommendation of candidate drop-off locations may be implemented via a recommendation engine. The recommendation engine may be implemented using any suitable machine learning algorithm, currently known and developed in the future. As an example, the recommendation engine may use algorithms of the Decision Tree class, for example, Gradient Boosting Decision Tree (GBDT) algorithms.

Before a candidate drop-off location is recommended with a recommendation engine, the recommendation engine may be initialized first. For example, the recommendation engine may be trained using historical trip records to initialize or warm-start the recommendation engine. As an example, the recommendation engine may be trained using the boarding location and time of the historical trip as inputs and the corresponding disembarking location as an output. The recommendation engine may be cold started directly without performing this initialization. For example, candidate alighting points may be randomly determined for a certain boarding point.

During operation, the recommendation engine may be trained or updated with historical trips to optimize recommendations for candidate drop-off locations. For example, the recommendation engine may be trained using a set of boarding locations and/or times for historical trips as inputs and corresponding disembarking locations as outputs. The historical trips used for training may be acquired over time. For example, a record of historical trips over the past month may be obtained without regard to the origin and destination of the trips. The records of historical trips may be obtained on different time scales. For example, a record of historical trips for a certain time period may be obtained on a daily, double-holiday, and/or weekday timescale.

The acquisition of historical travel records may also be directed to a certain origin or destination. Travel records may be collected according to boarding or disembarking locations. For example, a record of all historical trips whose origin or destination is a place may be collected. A record of all historical trips that are within a predetermined distance range (e.g., within 500 meters, 1000 meters, or 2000 meters) from the pick-up location to the particular pick-up location may also be collected. Furthermore, the time dimension may also be taken into account together. For example, a record of historical trips during a certain time period of each day, double holidays, and/or weekdays with a particular location as the boarding location or the disembarking location may be obtained.

Near a certain boarding location, there may be a large number of historical trips over a period of time. To further reduce computational complexity and improve computational efficiency in the historical trip collection process, the pick-up location and/or the drop-off location for each trip may be provided with a grid-based index value in the record of historical trips that corresponds to the location of the pick-up location and/or the drop-off location. In this way, when historical travel records near a certain boarding point are collected, the relevant historical travel records can be acquired based on the index value of the boarding point.

For example, when collecting a record of historical trips where the departure point and a certain boarding point are within a certain distance range, the range of difference values of index values corresponding to the distance range may be determined. A record of the corresponding historical trip may be obtained based on the difference range such that the difference between the obtained index value of the boarding location for each trip and the index value of the particular boarding location is within the difference range.

The index values may be calculated or assigned using any suitable spatial indexing algorithm, both currently known and developed in the future. As an example, the S2 indexing algorithm may be employed. In this way, when historical travel records are collected, the distance between each boarding place and a specific boarding place does not need to be calculated one by one, and corresponding travel records can be obtained only by searching according to the index values, so that the time is saved, and the efficiency is improved. By utilizing the collected historical travel records, the recommendation process of candidate get-off places of the recommendation engine can be further optimized, so that the satisfaction degree of the user is improved.

Embodiments of the present disclosure also provide corresponding apparatuses for implementing the above methods or processes. Fig. 3 illustrates a schematic block diagram of an apparatus 300 for determining candidate drop-off locations according to some embodiments of the present disclosure.

As shown in fig. 3, the apparatus 300 may include a first determination module 310 and a second determination module 320. The first determination module 310 is configured to determine a boarding location for a trip of a user. The second determination module 320 is configured to determine candidate drop-off locations for the trip based on statistical data of historical drop-off locations associated with at least one of the pick-up location and the time of the trip.

In some embodiments, the historical drop-off location may include at least one of: a historical getting-off point of a historical trip, wherein the distance between the getting-on point and the current getting-on point is within a preset distance range; and historical drop-off locations for historical trips within one or more predetermined time periods associated with the time of the trip.

In some embodiments, the statistical data for the historical drop-off location may include at least one of a probability distribution and a cross-road condition for the historical drop-off location.

In some embodiments, the second determination module 320 is implemented via a recommendation engine. In this example, the apparatus 300 may further include a first obtaining module configured to obtain a set of records of historical trips. The apparatus 300 may further include an update module configured to update the recommendation engine using at least one of the boarding location and the time for the set of historical trips as an input and the disembarking location for the set of historical trips as an output.

In some embodiments, the distance between the pick-up locations for each trip in the set of historical trips is within a predetermined distance range. In some embodiments, in the set of records of historical trips, the pick-up location for each trip has a grid-based index value corresponding to a location. In this example, the first obtaining module may include a third determining module configured to determine a range of difference values of the index values between the boarding points based on the predetermined distance range. The first obtaining module may further include a second obtaining module configured to obtain a record of a set of historical trips in which a difference in index values between boarding locations is within a range of the difference.

The modules included in the apparatus 300 may be implemented in a variety of ways including software, hardware, firmware, or any combination thereof. In some embodiments, one or more modules may be implemented using software and/or firmware, such as machine-executable instructions stored on a storage medium. In addition to, or in the alternative to, machine-executable instructions, some or all of the elements in apparatus 300 may be implemented at least in part by one or more hardware logic components. By way of example, and not limitation, exemplary types of hardware logic components that may be used include Field Programmable Gate Arrays (FPGAs), Application Specific Integrated Circuits (ASICs), Application Specific Standards (ASSPs), systems on a chip (SOCs), Complex Programmable Logic Devices (CPLDs), and so forth.

It should be understood that the operations and features described above in connection with fig. 1 and 2 are equally applicable to the various modules of the apparatus 300 and have the same effect, and detailed description is omitted.

FIG. 4 illustrates a block diagram of an electronic device 400 in which one or more embodiments of the disclosure may be implemented. It should be understood that the electronic device 400 illustrated in FIG. 4 is merely exemplary and should not be construed as limiting in any way the functionality and scope of the embodiments described herein.

As shown in fig. 4, electronic device 400 may be in the form of a general purpose computing device, for example, implemented by a computing device and/or server. The components of electronic device 400 may include, but are not limited to, one or more processors or processing units 410, memory 420, storage 430, one or more communication units 440, one or more input devices 450, and one or more output devices 460. The processing unit 410 may be a real or virtual processor and may be capable of performing various processes according to programs stored in the memory 420. In a multi-processor system, multiple processing units execute computer-executable instructions in parallel to improve the parallel processing capabilities of electronic device 400.

Electronic device 400 typically includes a number of computer storage media. Such media may be any available media that is accessible by electronic device 400 and includes, but is not limited to, volatile and non-volatile media, removable and non-removable media. Memory 420 may be volatile memory (e.g., registers, cache, Random Access Memory (RAM)), non-volatile memory (e.g., Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory), or some combination thereof. Storage device 430 may be a removable or non-removable medium and may include a machine-readable medium, such as a flash drive, a magnetic disk, or any other medium that may be capable of being used to store information and/or data (e.g., training data for training) and that may be accessed within electronic device 400.

The electronic device 400 may further include additional removable/non-removable, volatile/nonvolatile storage media. Although not shown in FIG. 4, a magnetic disk drive for reading from and writing to a removable, non-volatile magnetic disk (e.g., a "floppy disk") and an optical disk drive for reading from or writing to a removable, non-volatile optical disk may be provided. In these cases, each drive may be connected to a bus (not shown) by one or more data media interfaces. Memory 420 may include a computer program product 425 having one or more program modules configured to perform the various methods or acts of the various embodiments of the disclosure.

The communication unit 440 enables communication with other computing devices over a communication medium. Additionally, the functionality of the components of the electronic device 400 may be implemented in a single computing cluster or multiple computing machines, which are capable of communicating over a communications connection. Thus, the electronic device 400 may operate in a networked environment using logical connections to one or more other servers, network Personal Computers (PCs), or another network node.

Input device 450 may be one or more input devices such as a mouse, keyboard, trackball, or the like. Output device 460 may be one or more output devices such as a display, speakers, printer, or the like. Electronic device 400 may also communicate with one or more external devices (not shown), such as storage devices, display devices, etc., as desired through communication unit 440, with one or more devices that enable a user to interact with electronic device 400, or with any device (e.g., network card, modem, etc.) that enables electronic device 400 to communicate with one or more other computing devices. Such communication may be performed via input/output (I/O) interfaces (not shown).

According to an exemplary implementation of the present disclosure, a computer-readable storage medium is provided, on which one or more computer instructions are stored, wherein the one or more computer instructions are executed by a processor to implement the above-described method.

Various aspects of the present disclosure are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products implemented in accordance with the disclosure. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer-readable program instructions.

These computer-readable program instructions may be provided to a processing unit of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processing unit of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer-readable program instructions may also be stored in a computer-readable storage medium that can direct a computer, programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer-readable medium storing the instructions comprises an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.

The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer, other programmable apparatus or other devices implement the functions/acts specified in the flowchart and/or block diagram block or blocks.

The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various implementations of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

The foregoing has described implementations of the present disclosure, and the above description is illustrative, not exhaustive, and not limited to the implementations disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described implementations. The terminology used herein was chosen in order to best explain the principles of implementations, the practical application, or improvements to the technology in the marketplace, or to enable others of ordinary skill in the art to understand the implementations disclosed herein.

Claims

1. A method of determining candidate drop-off locations for a trip of a user, comprising:

determining a boarding location for the trip; and

determining the candidate drop-off location for the trip based on statistics of historical drop-off locations associated with at least one of the pick-up location and the time of the trip.

2. The method of claim 1, wherein the historical drop-off location comprises at least one of:

a historical getting-off point of a historical trip, wherein the distance between the getting-on point and the getting-on point is within a preset distance range; and

a historical drop-off location for a historical trip within one or more predetermined time periods associated with the time of the trip.

3. The method of claim 1, wherein the statistical data for the historical drop-off location includes at least one of a probability distribution and a cross-road situation for the historical drop-off location.

4. The method of claim 1, wherein determining the candidate drop-off location is accomplished via a recommendation engine, and the method further comprises:

acquiring a group of records of historical trips; and

updating the recommendation engine using at least one of a boarding location and a time for the set of historical trips as an input and a disembarking location for the set of historical trips as an output.

5. The method of claim 4, wherein the distance between pick-up locations for each trip in the set of historical trips is within a predetermined distance range.

6. The method of claim 5, wherein in the record of the set of historical trips, a pick-up location for each trip has a grid-based index value corresponding to a location, and obtaining the record of the set of historical trips comprises:

determining a range of difference values of index values between boarding locations based on the predetermined distance range; and

obtaining a record of the set of historical trips for which the difference in index values between pick-up locations is within the range of the difference.

7. An apparatus for determining candidate drop-off locations for a trip of a user, comprising:

a first determination module configured to determine a boarding location for the trip; and

a second determination module configured to determine the candidate drop-off location for the trip based on statistics of historical drop-off locations associated with at least one of the pick-up location and the time of the trip.

8. An electronic device, comprising:

a memory and a processor;

wherein the memory is to store one or more computer instructions, wherein the one or more computer instructions are to be executed by the processor to implement the method of any one of claims 1 to 6.

9. A computer readable storage medium having one or more computer instructions stored thereon, wherein the one or more computer instructions are executed by a processor to implement the method of any one of claims 1 to 6.

10. A computer program product comprising computer programs/instructions, characterized in that the computer programs/instructions, when executed by a processor, implement the steps of the method of claim 1.