CN116222594A

CN116222594A - Get-on point recommendation method, device, equipment and storage medium

Info

Publication number: CN116222594A
Application number: CN202111478188.7A
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: 2021-12-06
Filing date: 2021-12-06
Publication date: 2023-06-06

Abstract

The present disclosure provides a get-on point recommendation method, device, equipment, and storage medium, where when a travel request of a user is received, at least one get-on point recommended in a scene where the user is located is obtained, and a mapping relationship between at least one historical play area and at least one get-on point recommended in the scene, where the at least one historical play area is actually determined according to a history of a historical travel order in the scene, so that a target get-on point to be recommended to the user can be determined based on the user position and the mapping relationship. Therefore, more proper boarding points can be recommended for the user, the rationality and accuracy of the recommended boarding points are improved, the matching degree of the recommended boarding points and the travel demands of the user is improved, the time cost of the user for going to the boarding points is effectively reduced, the riding efficiency of the user is improved, the travel demands of the user are met, and the riding experience of the user is improved.

Description

Get-on point recommendation method, device, equipment and storage medium

Technical Field

The disclosure relates to the technical field of mobile communication, in particular to a get-on point recommendation method, device, equipment and storage medium.

Background

With the rapid development of mobile communication technology, more and more users select taxi taking software through an intelligent terminal to use online taxi calling service, the users only need to send a bill through the taxi taking software and go to a preset taxi taking point to wait for receiving a drive, and can enjoy the trip service, and the users can get to the taxi without going out, so that the trip requirement of the users is met.

In order to facilitate the user to get on the bus, the taxi taking software generally has a function of recommending a get-on point, and can help the user to quickly select the get-on point. However, in an actual taxi calling scene, when a taxi taking point is recommended for a user, a nearby taxi taking point is recommended for the user according to a travel habit of the user or according to a statistical place where the user can get on, but for some complex scenes, especially scenes with a large range and complex road conditions, the recommended taxi taking point may be scattered, or the recommended taxi taking point is difficult to find and reach for the user or a driver, so that the recommended taxi taking point is poor in rationality, low in accuracy and difficult to use, the taxi taking efficiency of the user is low, the taxi seeking consumption time is long, and the taxi taking experience of the user is unfavorable.

Disclosure of Invention

The embodiment of the disclosure at least provides a get-on point recommendation method, device, equipment and storage medium.

The embodiment of the disclosure provides a get-on point recommendation method, which comprises the following steps:

receiving a travel request of a user, wherein the travel request comprises a user position when the user sends the travel request;

acquiring at least one recommended get-on point preset in a scene where the user is located and a mapping relation between at least one historical get-on point and at least one historical get-on area in the scene, wherein the mapping relation is a corresponding relation between the historical get-on point and the historical get-on area determined according to the actual historical position of a historical trip order in the scene;

and determining a target get-on point to be recommended to the user from the at least one recommended get-on point based on the user position and the mapping relation.

In an alternative embodiment, the mapping relationship is determined based on the following steps:

acquiring a plurality of historical travel orders in the scene, wherein the historical travel orders comprise historical actual vehicle positions and historical issuing positions;

determining at least one historical receipt area based on the historical actual vehicle location and the historical receipt location;

Determining at least one recommended get-on point in the scene based on scene information of the scene;

and generating a mapping relation between the at least one historical receipt area and the at least one recommended get-on point.

In an alternative embodiment, the determining at least one historic ticket area based on the historic actual vehicle position and the historic ticket position includes:

determining a preferred boarding position corresponding to each historical starting position based on the obtained historical actual boarding positions and the historical starting positions, wherein the preferred boarding position is a boarding position obtained through comprehensive calculation of the historical actual boarding positions;

clustering the obtained multiple preferable boarding positions to obtain at least one position cluster;

determining historical ticket positions corresponding to a plurality of preferred boarding positions in each position cluster aiming at each position cluster;

and generating a history receipt area corresponding to the position cluster based on a plurality of history receipt positions corresponding to the position cluster.

In an alternative embodiment, the determining, based on the acquired plurality of historic actual vehicle positions and the plurality of historic sending units, the preferred loading position corresponding to each historic sending unit includes:

For each historical receipt position, detecting whether adjacent receipt positions exist in a preset range taking the historical receipt position as a center, wherein the plurality of historical receipt positions comprise the adjacent receipt positions;

if the adjacent issuing position exists, calculating a preferable boarding position corresponding to the historical issuing position based on the historical actual boarding position corresponding to the historical issuing position and the historical actual boarding position corresponding to the adjacent issuing position;

and if the adjacent issuing position does not exist, taking the history actual vehicle position corresponding to the history issuing position as the preferable boarding position corresponding to the history issuing position.

In an optional implementation manner, if the adjacent order sending position exists, calculating a preferred boarding position corresponding to the historical order sending position based on the historical actual boarding position corresponding to the historical order sending position and the historical actual boarding position corresponding to the adjacent order sending position, including:

if the adjacent issuing units exist, determining the historical actual vehicle position corresponding to the adjacent issuing units;

clustering is carried out on the historical actual vehicle position corresponding to the historical engine position and the historical actual vehicle position corresponding to the adjacent engine position to obtain at least one historical cluster;

And determining a central point of the at least one history cluster aiming at the at least one history cluster, and taking the central point as a preferable boarding position corresponding to the history sender.

for each historical actual vehicle position, acquiring adjacent vehicle loading positions existing in a preset range with the historical actual vehicle positions as centers, wherein the plurality of historical actual vehicle positions comprise the adjacent vehicle loading positions;

calculating a central boarding position corresponding to the historical actual boarding position based on the adjacent boarding positions and the historical actual boarding position;

and determining the center boarding position as a preferred boarding position corresponding to a historical starting position corresponding to the historical actual parking position.

In an alternative embodiment, the generating a mapping relationship between the at least one historical receipt area and the at least one recommended boarding point includes:

determining the position cluster corresponding to the historical receipt area according to each historical receipt area;

Determining a recommended get-on point with the minimum distance from the position cluster in the at least one recommended get-on point;

and generating a mapping relation between the at least one history list area and the at least one recommended get-on point based on the corresponding relation between the history list area and the position cluster and the corresponding relation between the position cluster and the recommended get-on point with the minimum distance, wherein the mapping relation comprises the corresponding relation between each history list area and the recommended get-on point with the minimum distance.

In an optional implementation manner, the determining, based on the user location and the mapping relationship, a target boarding point to be recommended to the user from the at least one recommended boarding point includes:

determining whether the user is in the at least one historical receipt area based on the user location;

if the user is in the at least one historical receipt area, determining a target area where the user is located, wherein the target area is the historical receipt area where the user is located in the at least one historical receipt area;

determining a first get-on point corresponding to the target area from the at least one recommended get-on point based on the mapping relation;

And taking the first get-on point as a target get-on point to be recommended to the user.

In an alternative embodiment, after said determining whether said user is in said at least one history list area based on said user location, said method comprises:

if the user is not in the at least one historical order issuing area, determining a second get-on point with the minimum distance from the user position from the at least one recommended get-on point;

and taking the second get-on point as a target get-on point to be recommended to the user.

The embodiment of the disclosure also provides a get-on point recommendation device, which comprises:

the receiving module is used for receiving a travel request of a user, wherein the travel request comprises a user position when the user sends the travel request;

the system comprises an acquisition module, a storage module and a display module, wherein the acquisition module is used for acquiring at least one recommended get-on point preset in a scene where a user is located and a mapping relation between at least one historical get-on point in the scene and the at least one recommended get-on point, wherein the mapping relation is a corresponding relation between a historical get-on point and a historical get-on point which is determined according to the actual vehicle position of a historical travel order in the scene;

And the determining module is used for determining a target get-on point to be recommended to the user from the at least one recommended get-on point based on the user position and the mapping relation.

In an alternative embodiment, the obtaining module determines the mapping relation based on:

In an alternative embodiment, the acquiring module is specifically configured to, when configured to determine at least one historic ticket area based on the historic actual vehicle position and the historic ticket position:

In an alternative embodiment, the obtaining module is specifically configured to, when determining the preferred boarding location corresponding to each historical transmission location based on the obtained plurality of actual vehicle locations and the plurality of historical transmission locations:

In an alternative embodiment, the obtaining module is configured to calculate, if the adjacent ticket location exists, a preferred boarding location corresponding to the historical ticket location based on the historical actual boarding location corresponding to the historical ticket location and the historical actual boarding location corresponding to the adjacent ticket location, where the preferred boarding location corresponding to the historical ticket location includes:

In an alternative embodiment, the obtaining module is configured to determine, based on the obtained plurality of actual vehicle positions and the plurality of historical transmission positions, a preferred boarding position corresponding to each historical transmission position, and includes:

In an optional implementation manner, the obtaining module is specifically configured to, when used to generate a mapping relationship between the at least one historical receipt area and the at least one recommended boarding point:

In an alternative embodiment, the determining module is specifically configured to:

In an alternative embodiment, the determining module, after being configured to determine, based on the user location, whether the user is in the at least one historical receipt area, is further configured to:

The embodiment of the disclosure also provides an electronic device, including: the system comprises a processor, a memory and a bus, wherein the memory stores machine-readable instructions executable by the processor, when the electronic device runs, the processor and the memory are communicated through the bus, and the machine-readable instructions are executed by the processor to execute the steps of the get-on point recommendation method.

The disclosed embodiments also provide a computer readable storage medium having a computer program stored thereon, which when executed by a processor performs the steps of the get-on point recommendation method described above.

The disclosed embodiments also provide a computer program product comprising a computer program/instructions which, when executed by a processor, implement the steps of the get-on point recommendation method described above.

According to the get-on point recommendation method, device, equipment and storage medium, when a travel request of a user is received, at least one recommended get-on point preset in a scene where the user is located and a mapping relation between at least one historical play list area which is actually determined according to the history of historical travel orders in the scene and at least one recommended get-on point in the scene can be obtained, and then a target get-on point to be recommended to the user can be determined from the at least one recommended get-on point based on the position and the mapping relation of the user.

Therefore, through the position of the user in the scene and combining the mapping relation between the historical order sending area and the recommended get-on point, which is determined according to the historical actual vehicle position of the historical travel order in the scene, the nearby get-on point is recommended to the user, so that the recommended get-on point which is convenient for the user and is easy for the driver to find is recommended to the user, the user and the driver can conveniently reach the position where the recommended get-on point are located, the user can recommend the get-on point which is easy to reach and is more suitable, the rationality and the accuracy of the recommended get-on point can be improved based on the mapping relation, the matching degree of the recommended get-on point and the travel requirement of the user is improved, the recommended get-on point is more striking and convenient to reach in the scene, the time cost of the user and the driver to get-on point is effectively reduced, the riding efficiency of the user is improved, the riding experience of the user is met, and the traveling experience of the user is improved.

The foregoing objects, features and advantages of the disclosure will be more readily apparent from the following detailed description of the preferred embodiments taken in conjunction with the accompanying drawings.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present disclosure, the drawings required for the embodiments are briefly described below, which are incorporated in and constitute a part of the specification, these drawings showing embodiments consistent with the present disclosure and together with the description serve to illustrate the technical solutions of the present disclosure. It is to be understood that the following drawings illustrate only certain embodiments of the present disclosure and are therefore not to be considered limiting of its scope, for the person of ordinary skill in the art may admit to other equally relevant drawings without inventive effort.

Fig. 1 shows a flowchart of a get-on point recommendation method provided by an embodiment of the present disclosure;

FIG. 2 is a flowchart of a mapping relation generation method according to an embodiment of the present disclosure;

FIG. 3 shows a schematic view of a preferred boarding location;

FIG. 4 shows a schematic diagram of a mapping relationship;

FIG. 5 shows one of the schematic diagrams for determining a target get-on point;

FIG. 6 shows a second schematic diagram of determining a target pick-up point;

FIG. 7 is a flowchart of another method for get-on point recommendation provided by an embodiment of the present disclosure;

fig. 8 is a schematic diagram of a get-on point recommendation device according to an embodiment of the disclosure;

fig. 9 shows a schematic diagram of an electronic device provided by an embodiment of the disclosure.

Detailed Description

For the purposes of making the objects, technical solutions and advantages of the embodiments of the present disclosure more apparent, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below with reference to the drawings in the embodiments of the present disclosure, and it is apparent that the described embodiments are only some embodiments of the present disclosure, but not all embodiments. The components of the embodiments of the present disclosure, which are generally described and illustrated in the figures herein, may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present disclosure provided in the accompanying drawings is not intended to limit the scope of the disclosure, as claimed, but is merely representative of selected embodiments of the disclosure. All other embodiments, which can be made by those skilled in the art based on the embodiments of this disclosure without making any inventive effort, are intended to be within the scope of this disclosure.

It should be noted that: like reference numerals and letters denote like items in the following figures, and thus once an item is defined in one figure, no further definition or explanation thereof is necessary in the following figures.

The term "and/or" is used herein to describe only one relationship, meaning that there may be three relationships, e.g., a and/or B, which may mean: a exists alone, A and B exist together, and B exists alone. In addition, the term "at least one" herein means any one of a plurality or any combination of at least two of a plurality, for example, including at least one of A, B, C, and may mean including any one or more elements selected from the group consisting of A, B and C.

According to the research, in an actual calling scene, when a user sends a bill in a certain area, such as a building, a recommended boarding point is easy to be unstable due to positioning drift, accuracy of a recommendation algorithm and the like, for example, the recommended boarding point is obviously very close, but can be reached only by a plurality of routes, the recommended boarding point is poor in rationality and accuracy, the matching degree with the travel requirement of the user is low, the riding efficiency of the user is reduced, and the riding experience of the user is influenced. Therefore, how to provide more excellent recommended boarding points for users is a key for improving the riding experience of users.

Based on the above research, the present disclosure provides a get-on point recommendation method, device, equipment and storage medium, which can recommend a target get-on point for a user according to a recommended get-on point which is more convenient and easy to find by a user and a driver in a scene, and in combination with a history order-issuing area which is determined according to a history actual parking place of a history travel order in the scene, not only can recommend a more suitable get-on point for the user, but also can improve the rationality and accuracy of the recommended get-on point, and improve the matching degree of the recommended get-on point and the travel requirement of the user, but also can obviously and conveniently arrive at the recommended target get-on point in the scene, effectively reduce the time cost of the user for going to the get-on point, improve the riding efficiency of the user, satisfy the travel requirement of the user, and improve the riding experience of the user.

The present invention is directed to a method for manufacturing a semiconductor device, and a semiconductor device manufactured by the method.

For the sake of understanding the present embodiment, first, a description will be given in detail of a get-on point recommendation method disclosed in the present embodiment, where an execution body of the get-on point recommendation method provided in the present embodiment is generally a computer device with a certain computing capability, and the computer device includes, for example: a terminal device or server or other processing device, etc. In some possible implementations, the get-on-point method may be implemented by way of a processor invoking computer readable instructions stored in a memory.

The following describes a get-on point recommendation method provided in the embodiment of the present disclosure, taking an execution subject as a server as an example.

Referring to fig. 1, a flowchart of a get-on point recommendation method provided by an embodiment of the present disclosure is shown, where the method includes steps S101 to S103, where:

s101: and receiving a travel request of a user, wherein the travel request comprises a user position when the user sends the travel request.

In the step, whether the user submits the travel request or not can be detected in real time, and the travel request of the user can be received under the condition that the user submits the travel request is detected.

Here, the travel request of the user may be received through a service platform for the internet or other network platforms, where the service platform may be used to implement network taxi service, such as taxi taking, special taking, express taking, carpooling taking, and the like. The travel request can be that when the user wants to go out, the user needs to submit the travel order, but before the travel order is submitted, the travel request of the user can be obtained when conditions such as a destination, a departure place and travel time are selected by entering a ordering interface, so that the user can be helped to recommend a get-on point later for the user to select, and the user can get-on conveniently.

It can be understood that the travel request may include a user position when the user sends the travel request, and may further include a destination position of the user, a requirement of the user for dispatching a vehicle, and the like.

Here, the user position when the user sends the travel request is the order sending position of the user.

When a user submits a travel request, a travel service needs to be provided for the user, so that the user position when the user sends the travel request needs to be determined. In the embodiment of the disclosure, the position of the user at the moment when the user sends the travel request can be positioned by receiving the travel request of the user, so that the position of the user is determined.

S102: and acquiring at least one recommended get-on point preset in a scene where the user is located and a mapping relation between at least one historical get-on point and at least one historical get-on point in the scene, wherein the mapping relation is a corresponding relation between the historical get-on point and the historical get-on point determined according to the actual vehicle position of the history of the historical trip order in the scene.

In this step, after determining the user position, a get-on point may be recommended to the user, so that the user may set the get-on point conveniently, so that a scene where the user is located may be determined based on the user position first, and then at least one recommended get-on point preset in the scene and a mapping relationship between at least one historical list area in the scene and the at least one recommended get-on point may be obtained, so that a get-on point suitable for recommending to the user may be determined later.

The boarding point may refer to a position where the driver connects the driver, that is, a position where the driver starts to provide travel service for the user, and also a position where the user waits for the driver to connect the driver. Illustratively, the user sets the boarding point to be a hospital hall, and the user may wait for the driver to pick up at the hospital hall, and the driver may pick up the user at the hospital hall and send the user to the user's destination.

It can be understood that in the actual taxi calling service, the user needs to set the get-on point, so that the user can conveniently and quickly set the get-on point, and the recommended get-on point can be provided for the user. Here, the recommended get-on point may be a logo location in the scene or a location in the scene that is more conspicuous and convenient for the user to wait and the driver to park.

For example, for a hospital, the recommended pick-up point may be a hospital hall, a hospital front gate, a hospital side gate, or the like.

Further, the user may select the recommended get-on point, or may select another position to set as the get-on point by himself.

The mapping relationship is a corresponding relationship between the historical order issuing area and the recommended boarding point, and the historical order issuing area is determined according to a historical actual carport of a historical trip order in the scene.

It can be understood that, based on the scenario, a historical travel order in the scenario may be obtained, where the historical travel order includes a historical actual vehicle position, and the historical actual vehicle position may refer to a position where a user actually takes a network about vehicle, i.e. a position where a driver actually takes a drive, in a scenario where the user calls a vehicle corresponding to the historical travel order. Further, aiming at the historical actual vehicle position of the historical travel orders in the scene, the actual vehicle position is processed, and at least one historical order issuing area can be obtained.

Here, the history order issuing area may be a hot order issuing area in the scene, and the history order issuing area may be obtained by performing statistics on a history travel order, for example, an integration process is performed on a history upper vehicle position in the history order issuing area to obtain the history order issuing area, or may be obtained based on traffic statistics, for example, an area where more users issue the travel request is used as the history order issuing area.

Furthermore, a mapping relationship exists between the historical order issuing area and the recommended get-on point, so that the get-on point suitable for being recommended to the user can be conveniently determined based on the user position.

In order to recommend a suitable get-on point to the user, the mapping relationship may be generated in advance, where the mapping relationship is a corresponding relationship between the historical get-on area and the recommended get-on point, which is determined according to a historical actual vehicle position of a historical travel order in the scene. Specifically, referring to fig. 2, a flowchart of a mapping relation generating method provided in an embodiment of the disclosure is shown. As shown in fig. 2, in some possible embodiments, the mapping relationship is determined based on the following steps:

s201: a plurality of historical travel orders in the scene are acquired, wherein the historical travel orders comprise historical actual vehicle positions and historical issuing positions.

In this step, under the condition of determining the user position, a scene in which the user is located may be determined based on the user position, so as to obtain a plurality of historical travel orders in the scene, and for the historical travel orders, a historical actual vehicle position and a historical order-issuing position are extracted from each of the historical travel orders.

The historical actual vehicle position can refer to the position of the user getting on the vehicle in the historical travel order, namely the position of the user receiving the vehicle by the driver in the scene corresponding to the historical travel order. In addition, the history sending unit may refer to a position at which the user sends the travel request time in a scenario corresponding to the history travel order. It will be appreciated that each of the historical travel orders includes a historical actual vehicle location and a historical origin location, the historical actual vehicle location and the historical origin location having a correspondence therebetween.

S202: at least one historic ticket area is determined based on the historic actual vehicle location and the historic ticket location.

In this step, when the actual vehicle position of the history and the history receipt position are determined, the actual vehicle position of the history and the history receipt position may be processed to obtain at least one history receipt area.

Specifically, a polygon may be constructed by a geometric algorithm based on the actual vehicle position of the history and the history ticket position, and the polygon may be used as the history ticket region, or a bitmap may be constructed by blocks according to the actual vehicle position of the history and the history ticket position, and the history ticket region may be obtained by indexing according to longitude and latitude coordinates of the actual vehicle position of the history and the history ticket position.

S203: based on the scene information of the scene, at least one recommended get-on point in the scene is determined.

It can be understood that in the actual taxi calling service, the user needs to set the get-on point, so that the user can conveniently and quickly set the get-on point, and the recommended get-on point can be provided for the user. Here, at least one recommended entry point in the scene may be determined based on scene information of the scene, and the at least one recommended entry point in the scene may be a landmark position in the scene or a position in the scene that is more conspicuous and convenient for a user to wait and a driver to park.

The scene information may refer to information included in an area corresponding to the scene, for example, at least one recommended get-on point, road distribution of the area, traffic light layout of the area, traffic flow condition of the area, and the like.

Specifically, the recommended boarding point for the hospital can be a marked front door of the hospital, a parking lot convenient for a driver to park, a crossing convenient for a user to wait, a certain building with a more striking structure in the hospital, and the like.

S204: and generating a mapping relation between the at least one historical receipt area and the at least one recommended get-on point.

In this step, under the condition that the at least one history list area and the at least one recommended get-on point are determined, a corresponding relationship between each history list area and each recommended get-on point may be determined, so as to generate a mapping relationship between the at least one history list area and the at least one recommended get-on point.

The above steps S102 and S103 are carried out: and determining a target get-on point to be recommended to the user from the at least one recommended get-on point based on the user position and the mapping relation.

In this step, under the condition that the user position and the mapping relationship are determined, the target boarding point to be recommended to the user may be determined from the at least one recommended boarding point based on the correspondence relationship between the at least one history list area and the at least one recommended boarding point included in the mapping relationship, and then the user position is combined.

It may be appreciated that the at least one recommended get-on point includes the target get-on point, that is, the target get-on point is a recommended get-on point that is most suitable for being recommended to the user among the at least one recommended get-on points.

Next, the present embodiment will be further described with reference to some specific embodiments.

In order to obtain at least one history order area, in some possible embodiments, the determining at least one history order area based on the history actual vehicle position and the history order position includes:

In this step, under the condition that a plurality of historical actual vehicle positions and a plurality of historical vehicle-on positions are obtained, the plurality of historical actual vehicle positions can be integrated to obtain preferred vehicle-on positions, where each preferred vehicle-on position can correspond to one historical vehicle-on position, then the obtained plurality of preferred vehicle-on positions can be clustered to obtain at least one position cluster, and for each position cluster, a plurality of preferred vehicle-on positions exist in the position cluster, and the historical vehicle-on positions corresponding to the plurality of preferred vehicle-on positions in the position cluster can be obtained based on the corresponding relation between the preferred vehicle-on positions and the historical vehicle-on positions, so that the historical vehicle-on region corresponding to the position cluster can be generated based on the plurality of historical vehicle-on positions corresponding to the position cluster.

The clustering processing of the obtained plurality of preferable get-on positions may be processing by applying a density-based clustering algorithm, and then the algorithm parameters to be used need to be predetermined, so that the clustering processing of the plurality of preferable get-on positions is performed based on the algorithm parameters.

Optionally, the algorithm parameter may be a preset and default algorithm parameter, or may be an algorithm parameter that is generated to match the plurality of preferred boarding positions based on a positional relationship between the plurality of preferred boarding positions.

In the actual clustering, a DBSCAN algorithm may be applied to the obtained multiple preferred boarding positions, where the algorithm may adaptively perform clustering, and may obtain clusters with arbitrary shapes and arbitrary sizes, and the clustering result may not be biased, for example, a neighborhood radius of 5 meters and a density threshold of 10 points may be set, and the multiple preferred boarding positions may be processed to obtain at least one position cluster.

In determining a plurality of history list positions corresponding to the position cluster, a convex hull algorithm may be utilized to generate a convex hull for the plurality of history list areas, so as to obtain a history list area corresponding to the position cluster, and it can be understood that the convex hull is the history list area.

By way of example, taking fig. 3 as an example, fig. 3 is a schematic diagram of a preferred boarding location, and as shown in fig. 3, taking a hospital as an example, it can be seen that in a hospital area, there are a plurality of historic sender locations 310 and a plurality of historic preferred boarding locations 320, for which a clustering process can be performed, a location cluster can be generated, and a historic sender area corresponding to the location cluster can be generated.

In order to obtain the position cluster, the preferred boarding position needs to be predetermined, alternatively, the preferred boarding position can be calculated by detecting the position with the historical transmission unit as a center. In some possible implementations, the determining, based on the acquired plurality of historic actual vehicle positions and the plurality of historic sending units, a preferred boarding position corresponding to each historic sending unit includes:

In this step, for each history list position, a preset range centered on the history list position may be determined, and then whether an adjacent list position exists in the preset range may be detected.

The calculating the preferred boarding position corresponding to the historical unit position may be performing aggregation processing on the historical actual boarding position corresponding to the historical unit position and the historical actual boarding position corresponding to the adjacent unit position, so as to generate the preferred boarding position corresponding to the aggregation result.

In the actual calculation, each historical unit position may be taken as a grid center, a grid may be constructed, a nine-square grid with the grid as the center is taken as the preset range, whether other historical unit positions exist in the nine-square grid is detected, if the other historical unit positions exist, the other historical unit positions are taken as adjacent unit positions, further calculation processing is performed to obtain a preferred boarding position, and if the other historical unit positions do not exist, a historical actual boarding position corresponding to the historical unit positions may be taken as the preferred boarding position corresponding to the historical unit positions.

In the case where there is a neighboring order location, to determine a preferred boarding location, in some possible embodiments, the calculating, if there is the neighboring order location, the preferred boarding location corresponding to the historical order location based on the historical actual boarding location corresponding to the historical order location and the historical actual boarding location corresponding to the neighboring order location includes:

In this step, when the adjacent order location exists, it is known based on the above analysis that the plurality of history order locations include the adjacent order location, so that a history actual vehicle location corresponding to the adjacent order location may be determined based on the history travel order, further, a clustering process may be performed on the history actual vehicle location corresponding to the history order location and the history actual vehicle location corresponding to the adjacent order location, and at least one history cluster may be obtained, and for the at least one history cluster, a center point of the at least one history cluster may be determined, thereby taking the center point as a preferred vehicle loading location corresponding to the history order location.

Alternatively, for the at least one history cluster, one history actual vehicle position with the most dense surrounding history actual vehicle position is selected from the at least one history cluster as a center point of the at least one history cluster.

In order to obtain the position cluster, the preferred boarding position needs to be determined in advance, and optionally, the preferred boarding position can be calculated by detecting the position with the actual parking position of the history as the center. In some possible implementations, the determining, based on the acquired plurality of historic actual vehicle positions and the plurality of historic sending units, a preferred boarding position corresponding to each historic sending unit includes:

In this step, for each historical actual vehicle position, a preset range with the historical actual vehicle position as a center can be determined, and then whether an adjacent vehicle position exists in the preset range can be detected, it can be understood that the plurality of historical actual positions include the adjacent vehicle position, if the adjacent vehicle position exists in the preset range, the center vehicle position corresponding to the historical actual vehicle position can be calculated based on the adjacent vehicle position and the historical actual vehicle position, and then the center vehicle position can be determined to be a preferred vehicle position corresponding to the historical actual vehicle position.

Further, if the adjacent boarding location does not exist in the preset range, the historical actual boarding location can be used as the preferred boarding location corresponding to the historical starting location.

The calculating the central boarding position corresponding to the historical actual boarding position can be to aggregate the historical actual boarding position and the adjacent boarding position to generate a central boarding position corresponding to an aggregate result.

In the actual calculation, each historical actual vehicle position may be taken as a grid center, a grid may be constructed, a nine grid with the grid as a center is taken as the preset range, whether other historical actual positions exist in the nine grid is detected, if the other historical actual vehicle positions exist, the other historical actual vehicle positions are taken as adjacent vehicle-on positions, further calculation processing is performed to obtain a center vehicle-on position, and if no other historical actual vehicle positions exist, the historical actual vehicle positions may be taken as the center vehicle-on positions corresponding to the historical actual vehicle positions.

Further, in the case where the adjacent boarding locations exist, based on the above analysis, the plurality of historic actual boarding locations include the adjacent boarding locations, and therefore, clustering can be performed on the historic actual boarding locations and the adjacent boarding locations, and at least one history cluster is obtained, for which a center point of the at least one history cluster can be determined, so that the center point is taken as the center boarding location corresponding to the historic actual boarding locations.

The longitude and latitude coordinates of the actual vehicle position and the adjacent vehicle position of the history included in the history cluster can be determined, and then the longitude and latitude coordinates are averaged to obtain an average longitude and latitude coordinate, wherein the position corresponding to the average longitude and latitude coordinate is the center vehicle position.

In the case of determining the at least one history list area and the at least one recommended get-on point, a mapping relationship between the at least one history list area and the at least one recommended get-on point may be generated. In some possible implementations, the generating the mapping relationship between the at least one historical receipt area and the at least one recommended boarding point includes:

In this step, under the condition that the history list area is determined, a location cluster corresponding to the history list area may be determined for each history list area, so that, for the at least one recommended get-on point, a distance between each recommended get-on point and each location cluster is calculated, the distances are compared and ordered, and a minimum distance is determined, so that a recommended get-on point with the minimum distance from the at least one recommended get-on point may be determined, and then, based on a correspondence between the history list area and the location cluster and a correspondence between the location cluster and the corresponding recommended get-on point with the minimum distance, a mapping relationship between the at least one history list area and the at least one recommended get-on point may be generated, where the mapping relationship includes a correspondence between each history list area and the recommended get-on point with the minimum distance.

The calculation of the distance between each recommended get-on point and each position cluster may be a straight line distance calculation method or a curved surface distance calculation method, which is not limited in any way.

Optionally, for each position cluster, a position cluster center point of the position cluster may be calculated, specifically, coordinates of a plurality of preferred boarding positions in the position cluster may be averaged, so as to obtain coordinates of the position cluster center point, and further determine the position cluster center point, and then a distance between each position cluster center point and each recommended boarding point may be calculated as a distance between each position cluster and each recommended boarding point.

For example, taking fig. 4 as an example, fig. 4 is a schematic diagram of a mapping relationship, and as shown in fig. 4, the mapping relationship includes a history list area 410, a history list area 420, a history list area 430, a position cluster 440, a position cluster 450, a position cluster 460, a recommended getting-on point 470, a recommended getting-on point 480, and a recommended getting-on point 490, it can be seen that the history list area 410 corresponds to the position cluster 440, the history list area 420 corresponds to the position cluster 450, the history list area 430 corresponds to the position cluster 460, the recommended getting-on point with the smallest distance from the position cluster 440 is the recommended getting-on point 470, the recommended getting-on point with the smallest distance from the position cluster 450 is the recommended getting-on point 490, so that the mapping relationship can be determined between the history list area 410 and the recommended getting-on point 470, the history list area 420 and the recommended getting-on point 480 form the mapping relationship, and the history list area 430 forms the mapping relationship with the recommended getting-on point 490.

Under the condition of determining the mapping relation, the target get-on point to be recommended to the user can be determined from at least one recommended get-on point based on the corresponding relation between at least one historical get-on area and at least one recommended get-on point included in the mapping relation and then combined with the user position. In some possible implementations, the determining, based on the user location and the mapping relationship, a target get-on point to be recommended to the user from the at least one recommended get-on point includes:

In this step, when the user position is determined, the user position and the at least one history list area may be compared to determine whether the user is in the at least one history list area, if the user is in the at least one history list area, a target area where the user is located is determined, it may be understood that the target area is the history list area where the user is located in the at least one history list area, and when the target area is determined, a first get-on point corresponding to the target area may be determined from the at least one recommended get-on point based on a mapping relationship between the at least one history list area and the at least one recommended get-on point, so that the first get-on point may be used as a target get-on point to be recommended to the user.

For example, taking fig. 5 as an example, fig. 5 is one of schematic diagrams for determining a target get-on point, as shown in fig. 5, including a history list area 410, a history list area 420, a history list area 430, a location cluster 440, a location cluster 450, a location cluster 460, a recommended get-on point 470, a recommended get-on point 480, a recommended get-on point 490, and a user location 510, it can be seen that the user location 510 is in the history list area 430, and based on the above analysis, the history list area 430 and the recommended get-on point 490 form a mapping relationship, so that the recommended get-on point 490 may be regarded as the target get-on point to be recommended to the user.

Optionally, the user may not be in the at least one history list area, in which case, in some possible implementations, after the determining whether the user is in the at least one history list area based on the user location, the method includes:

In this step, when the user position is determined, the user position and the at least one history list area may be compared to determine whether the user is in the at least one history list area, and if the user is not in the at least one history list area, a distance between each recommended get-on point and the user position may be determined, so that a second get-on point with the minimum distance from the user position may be determined from the at least one recommended get-on point, and further the second get-on point may be used as a target get-on point to be recommended to the user.

The calculation of the distance between each recommended get-on point and each user position may be a straight line distance calculation method or a curved surface distance calculation method, which is not limited in any way.

For example, taking fig. 6 as an example, fig. 6 is a second schematic diagram for determining a target get-on point, as shown in fig. 6, including a history list area 410, a history list area 420, a history list area 430, a location cluster 440, a location cluster 450, a location cluster 460, a recommended get-on point 470, a recommended get-on point 480, a recommended get-on point 490, and a user location 610, it can be seen that the user location 610 is not in any history list area, and it can be seen that the recommended get-on point 480 is the recommended get-on point with the minimum distance from the user location 610 among the three recommended get-on points, and therefore, the recommended get-on point 480 can be taken as the target get-on point to be recommended to the user.

According to the get-on point recommendation method provided by the embodiment of the disclosure, a travel request of a user can be received, the travel request comprises a user position when the user sends the travel request, at least one recommended get-on point preset in a scene where the user is located, and a mapping relation between at least one historical get-on point and at least one recommended get-on point in the scene, wherein the mapping relation is a corresponding relation between the historical get-on point and the recommended get-on point determined according to a historical actual position of a historical travel order in the scene, and a target get-on point to be recommended to the user is determined based on the user position and the mapping relation.

Referring to fig. 7, a flowchart of another get-on point recommendation method according to an embodiment of the disclosure is shown, where the method includes steps S701 to S704, in which:

s701: and receiving a travel request of a user, wherein the travel request comprises a user position when the user sends the travel request.

S702: and acquiring at least one recommended get-on point preset in a scene where the user is located and a mapping relation between at least one historical get-on point and at least one historical get-on point in the scene, wherein the mapping relation is a corresponding relation between the historical get-on point and the historical get-on point determined according to the actual vehicle position of the history of the historical trip order in the scene.

S703: and determining a target get-on point to be recommended to the user from the at least one recommended get-on point based on the user position and the mapping relation.

The descriptions of the steps S701 to S703 may refer to the descriptions of the steps S101 to S103, and may achieve the same technical effects and solve the same technical problems, which are not described herein.

S704: and receiving a travel order of the user taking the target boarding point as a departure place, and matching a target vehicle for providing travel service for the user according to the travel order.

In this step, under the condition that the target get-on point is determined, a travel order of the user may be received, and it may be understood that, in the travel order, the target get-on point is taken as a departure place of the user, where the departure place is a position where the user gets on the vehicle, that is, a position where the user gets on the vehicle to provide travel service, and further, a target vehicle that provides travel service may be matched for the user according to a destination position of the user included in the travel order, a requirement of the user for dispatching the vehicle, and the like.

It will be appreciated by those skilled in the art that in the above-described method of the specific embodiments, the written order of steps is not meant to imply a strict order of execution but rather should be construed according to the function and possibly inherent logic of the steps.

Based on the same inventive concept, the embodiment of the disclosure further provides a get-on point recommendation device corresponding to the get-on point recommendation method, and since the device in the embodiment of the disclosure has a similar principle of solving the problem as the get-on point recommendation method in the embodiment of the disclosure, the implementation of the device can refer to the implementation of the method, and the repetition is omitted.

Referring to fig. 8, fig. 8 is a schematic diagram of a get-on point recommendation according to an embodiment of the disclosure. As shown in fig. 8, an on-coming point recommendation device 800 provided in an embodiment of the present disclosure includes:

a receiving module 810, configured to receive a travel request of a user, where the travel request includes a user position when the user sends the travel request;

the obtaining module 820 is configured to obtain at least one recommended get-on point preset in a scene where the user is located, and a mapping relationship between at least one historical get-on point and at least one historical get-on area in the scene, where the mapping relationship is a corresponding relationship between the historical get-on area and the recommended get-on point that is determined according to a historical actual vehicle position of a historical trip order in the scene;

a determining module 830, configured to determine a target get-on point to be recommended to the user from the at least one recommended get-on point based on the user location and the mapping relationship.

In an alternative embodiment, the obtaining module 820 determines the mapping relationship based on:

In an alternative embodiment, the obtaining module 820 is specifically configured to, when configured to determine at least one historic ticket area based on the historic actual vehicle position and the historic ticket position:

In an alternative embodiment, the obtaining module 820 is specifically configured to, when determining the preferred boarding location corresponding to each of the historical transmission locations based on the obtained plurality of actual boarding locations and the plurality of historical transmission locations:

In an alternative embodiment, the obtaining module 820 is configured to calculate, if the adjacent ticket location exists, a preferred boarding location corresponding to the historical ticket location based on the historical actual boarding location corresponding to the historical ticket location and the historical actual boarding location corresponding to the adjacent ticket location, and includes:

In an alternative embodiment, the obtaining module 820 is configured to determine a preferred boarding location corresponding to each of the historical transmission locations based on the obtained plurality of actual boarding locations and the plurality of historical transmission locations, and includes:

In an alternative embodiment, the obtaining module 820 is specifically configured to, when configured to generate a mapping relationship between the at least one historical receipt area and the at least one recommended boarding point:

In an alternative embodiment, the determining module 830 is specifically configured to:

In an alternative embodiment, the determining module 830, after being configured to determine, based on the user location, whether the user is in the at least one historical receipt area, is further configured to:

The process flow of each module in the apparatus and the interaction flow between the modules may be described with reference to the related descriptions in the above method embodiments, which are not described in detail herein.

According to the get-on point recommending device provided by the embodiment of the disclosure, a travel request of a user can be received, the travel request comprises a user position when the user sends the travel request, at least one recommended get-on point preset in a scene where the user is located, and a mapping relation between at least one historical get-on point and at least one recommended get-on point in the scene, wherein the mapping relation is a corresponding relation between the historical get-on point and the recommended get-on point, which is determined according to a historical actual position of a historical travel order in the scene, and a target get-on point to be recommended to the user is determined from the at least one recommended get-on point based on the user position and the mapping relation.

Corresponding to the get-on point recommendation method in fig. 1, the embodiment of the present disclosure further provides an electronic device 900, as shown in fig. 9, which is a schematic structural diagram of the electronic device 900 provided in the embodiment of the present disclosure, including:

a processor 910, a memory 920, and a bus 930; memory 920 is used to store execution instructions, including memory 921 and external memory 922; the memory 921 is also referred to as an internal memory, and is used for temporarily storing operation data in the processor 910 and data exchanged with an external memory 922 such as a hard disk, and the processor 910 exchanges data with the external memory 922 through the memory 921, and when the electronic device 900 operates, the processor 910 and the memory 920 communicate with each other through the bus 930, so that the processor 910 may perform the steps of the above-mentioned approach point recommendation method.

It should be understood that the structures illustrated in the embodiments of the present application do not constitute a specific limitation on the electronic device 900. In other embodiments of the present application, electronic device 900 may include more or less components than illustrated, or certain components may be combined, or certain components may be split, or different arrangements of components. The illustrated components may be implemented in hardware, software, or a combination of software and hardware.

The disclosed embodiments also provide a computer readable storage medium having a computer program stored thereon, which when executed by a processor performs the steps of the get-on point recommendation method described in the above method embodiments. Wherein the storage medium may be a volatile or nonvolatile computer readable storage medium.

The embodiment of the disclosure further provides a computer program product, which includes computer instructions that, when executed by a processor, may perform the steps of the get-on point recommendation method described in the above method embodiment, and specifically, reference the above method embodiment, which is not described herein.

Wherein the above-mentioned computer program product may be realized in particular by means of hardware, software or a combination thereof. In an alternative embodiment, the computer program product is embodied as a computer storage medium, and in another alternative embodiment, the computer program product is embodied as a software product, such as a software development kit (Software Development Kit, SDK), or the like.

It will be clearly understood by those skilled in the art that, for convenience and brevity of description, specific working processes of the apparatus, device and storage medium described above may refer to corresponding processes in the foregoing method embodiments, which are not described herein again. In the several embodiments provided in the present disclosure, it should be understood that the disclosed method, apparatus, device, and storage medium may be implemented in other manners. The above-described apparatus embodiments are merely illustrative, for example, the division of the units is merely a logical function division, and there may be other manners of division in actual implementation, and for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be through some communication interface, device or unit indirect coupling or communication connection, which may be in electrical, mechanical or other form.

The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

In addition, each functional unit in each embodiment of the present disclosure may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit.

The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a non-volatile computer readable storage medium executable by a processor. Based on such understanding, the technical solution of the present disclosure may be embodied in essence or a part contributing to the prior art or a part of the technical solution, or in the form of a software product stored in a storage medium, including several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in the embodiments of the present disclosure. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a magnetic disk, or an optical disk, or other various media capable of storing program codes.

Finally, it should be noted that: the foregoing examples are merely specific embodiments of the present disclosure, and are not intended to limit the scope of the disclosure, but the present disclosure is not limited thereto, and those skilled in the art will appreciate that while the foregoing examples are described in detail, it is not limited to the disclosure: any person skilled in the art, within the technical scope of the disclosure of the present disclosure, may modify or easily conceive changes to the technical solutions described in the foregoing embodiments, or make equivalent substitutions for some of the technical features thereof; such modifications, changes or substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the disclosure, and are intended to be included within the scope of the present disclosure. Therefore, the protection scope of the present disclosure shall be subject to the protection scope of the claims.

Claims

1. A method for recommending a get-on point, the method comprising:

2. The method of claim 1, wherein the mapping relationship is determined based on the steps of:

3. The method of claim 2, wherein the determining at least one historic ticket area based on the historic actual vehicle location and the historic ticket location comprises:

4. The method of claim 3, wherein determining a preferred boarding location for each historic hair unit based on the acquired plurality of historic actual car locations and the plurality of historic hair units comprises:

5. The method of claim 4, wherein the calculating the preferred boarding location for the historic sender location based on the historic actual boarding location for the historic sender location and the historic actual boarding location for the neighborhood sender location if the neighborhood sender location exists comprises:

6. The method of claim 3, wherein determining a preferred boarding location for each historic hair unit based on the acquired plurality of historic actual car locations and the plurality of historic hair units comprises:

7. The method of claim 2, wherein the generating a mapping relationship between the at least one historical receipt area and the at least one recommended boarding point comprises:

8. The method of claim 1, wherein the determining a target boarding point to be recommended to the user from the at least one recommended boarding point based on the user location and the mapping relationship comprises:

9. The method of claim 8, wherein after said determining whether said user is in said at least one historic receipt area based on said user location, said method comprises:

10. A get-on point recommendation device, the device comprising:

11. An electronic device, comprising: a processor, a memory and a bus, the memory storing machine readable instructions executable by the processor, the processor and the memory in communication over the bus when the electronic device is running, the machine readable instructions when executed by the processor performing the steps of the get-on point recommendation method according to any of claims 1 to 9.

12. A computer-readable storage medium, characterized in that the computer-readable storage medium has stored thereon a computer program which, when executed by a processor, performs the steps of the get-on point recommendation method according to any one of claims 1 to 9.

13. A computer program product comprising computer instructions which, when executed by a processor, implement the steps of the get on point recommendation method of any one of claims 1 to 9.