WO2021147412A1

WO2021147412A1 - Service location recommendation method and apparatus, electronic device, and readable storage medium

Info

Publication number: WO2021147412A1
Application number: PCT/CN2020/123595
Authority: WO
Inventors: 朱敏; 段剑波; 孙振国
Original assignee: 北京畅行信息技术有限公司
Priority date: 2020-01-21
Filing date: 2020-10-26
Publication date: 2021-07-29
Also published as: CN111932330A

Abstract

The present invention relates to the technical field of intelligent transportation, and provides a service location recommendation method and apparatus, an electronic device, and a readable storage medium. The method comprises: receiving service request information sent by a service requester, the service request information comprising a first location; determining at least one second location within a range of a predetermined first threshold distance from the first location; and determining at least one service target location on the basis of future service vehicle information of the second locations.

Description

Service location recommendation method, device, electronic equipment and readable storage medium

Technical field

The present disclosure relates to the field of intelligent transportation technology, and in particular, to a method, a device, an electronic device, and a readable storage medium for recommending a service location.

Background technique

Taking a taxi is an important way for people to travel, and the number of users who use the roadside bidding method to take a taxi is still very high. How to make the users who use the roadside bidding method to get a taxi efficiently has become a problem.

At present, according to the traditional way of raising a taxi on the roadside, the user will randomly select a waiting position and wait for the arrival of the taxi, that is, according to the traditional way of raising a taxi on the roadside, the user does not know where the waiting position is easy to get. The location where the user chooses to wait for a car is random. For example, the user chooses a place where the taxi can stop on the road where the current location is located and waits for the taxi. However, due to the randomness of the user’s choice of waiting position, it is inevitable that the user will call The situation where the car is not available or it takes a long time to get the car. Therefore, the traditional roadside bidding for taxis has the problem of low efficiency.

Summary of the invention

Based on the above-mentioned problem of low taxi efficiency in the prior art, embodiments of the present disclosure provide a method, device, device, and storage medium for recommending a service location, which can improve the efficiency of taxi-hailing.

In the first aspect, an embodiment of the present disclosure provides a method for recommending a service location, and the method includes:

Receiving service request information sent by a service requester, where the service request information includes the first location;

Determining at least one second position within a predetermined first threshold distance from the first position;

Determine at least one service target location based on the future service vehicle information of each second location;

At least one service target location is sent to the service requester.

Optionally, the second location is determined based on historical service location information.

Optionally, determining at least one second position within a predetermined first threshold distance from the first position includes:

Determining a plurality of candidate second positions within a predetermined first threshold distance range from the first position;

Performing aggregation processing on the plurality of candidate second positions by a clustering algorithm to obtain at least one position set;

Acquiring historical service vehicle information of each candidate second location;

A second location is determined from each of the location sets based on the historical service vehicle information of each candidate second location, and at least one second location is obtained.

Optionally, the determining at least one service target location based on the future service vehicle information of each of the second locations includes:

Determining the number of vehicles passing through each of the second locations based on future service vehicle information of each of the second locations;

At least one service target location is determined based on the determined number of vehicles passing through each of the second locations.

Optionally, the method further includes:

Calculating the distance from each of the second positions to the first position;

Sorting each of the second positions based on the distance from each of the second positions to the first position to obtain a second position sorted by distance;

The determining at least one service target location based on the future service vehicle information of each of the second locations includes:

Based on the future service vehicle information of each of the second locations, the second locations sorted by distance are re-sorted to obtain the second location sorted by future service vehicle information. The sorting by future service vehicle information is used for at least two Adjusting the order of the at least two second positions when the distance between the second position and the first position is the same;

At least one service target location is determined based on the second location sorted by future service vehicle information.

Optionally, the method further includes:

The future service vehicle information at the service target location is fed back to the service requester.

Optionally, said feeding back future service vehicle information at the service target location to the service requester includes:

Acquiring vehicle information of at least one candidate vehicle within a predetermined second threshold distance of the service target location in real time;

The candidate vehicles are screened based on the vehicle information of the at least one candidate vehicle to obtain future service vehicle information, and the screening is used to remove vehicles that do not pass through the service target location and/or remove vehicles that are A vehicle that leaves the target recommendation point before the location;

The service vehicle information is fed back to the service requester.

In a second aspect, an embodiment of the present disclosure provides an apparatus for recommending a service location, the apparatus including:

A receiving module, configured to receive service request information sent by a service requester, where the service request information includes the first location;

A first determining module, configured to determine at least one second position within a predetermined first threshold distance range from the first position;

A second determining module, configured to determine at least one service target location based on the future service vehicle information of each of the second locations;

The sending module is used to send the at least one service target location to the service requester.

Optionally, the first determining module includes:

A first determining unit, configured to determine a plurality of candidate second positions within a predetermined first threshold distance range from the first position;

An aggregation unit, configured to perform aggregation processing on the plurality of candidate second positions by a clustering algorithm to obtain at least one position set;

The first acquiring unit is configured to acquire historical service vehicle information of each candidate second location;

The second determining unit is configured to determine a second position from each of the position sets based on the historical service vehicle information of each candidate second position to obtain at least one second position.

Optionally, the second determining module includes:

A third determining unit, configured to determine the number of vehicles passing through each of the second locations based on the future service vehicle information of each of the second locations;

The fourth determining unit is configured to determine at least one service target location based on the determined number of vehicles passing through each of the second locations.

Optionally, the device further includes:

A calculation module, configured to calculate the distance from each of the second positions to the first position;

A sorting module, configured to sort each of the second positions based on the distance from each of the second positions to the first position to obtain a second position sorted by distance;

The second determining module includes:

The reordering unit is configured to reorder the second positions sorted by distance based on the future service vehicle information of each of the second positions, to obtain the second position sorted by future service vehicle information, and the sorted by future service vehicle information Configured to adjust the order of the at least two second positions when the distance between the at least two second positions and the first position is the same;

The fifth determining unit is configured to determine at least one service target location based on the second location sorted by future service vehicle information.

Optionally, the device further includes:

The feedback module is used to feed back future service vehicle information at the service target location to the service requester.

Optionally, the feedback module includes:

A second acquiring unit, configured to acquire vehicle information of at least one candidate vehicle within a predetermined second threshold distance range of the service target location in real time;

The screening unit is configured to screen the candidate vehicles based on the vehicle information of the at least one candidate vehicle to obtain future service vehicle information, and the screening is used to remove vehicles that do not pass through the service target location and/or remove the A vehicle that drives away from the target recommendation point before reaching the service target location;

The feedback unit is used to feed back the service vehicle information to the service requester.

In a third aspect, embodiments of the present disclosure provide an electronic device, including a processor, a storage medium, and a bus. The storage medium stores machine-readable instructions executable by the processor. When the device is running, the processor and the storage medium are Through bus communication, the processor executes machine-readable instructions to execute the steps of the service location recommendation method as described in the first aspect when executed.

In a fourth aspect, an embodiment of the present disclosure provides a storage medium with a computer program stored on the storage medium, and the computer program executes the steps of the service location recommendation method as described in the first aspect when the computer program is run by a processor.

The present disclosure provides a service location recommendation method, device, electronic equipment, and readable storage medium. Compared with the traditional way of raising taxis by the roadside, this application receives service request information sent by the service requester. The service request information includes The first location, at least one second location is determined within a predetermined first threshold distance from the first location, and then at least one service target location is determined based on the future service vehicle information of each second location, and the at least one service target location is sent to Service requester. That is, a number of known recommended pick-up points (ie, the second location) are initially determined within a predetermined range from the user's location (ie, the first location), and then at least one target recommendation is determined based on the future service vehicle information of each recommended pick-up point Recommend a pick-up location (that is, the target location of the service) to the user, so that the target recommended pick-up location is determined based on the future service vehicle information of the known recommended pick-up location, so as to prevent the user from randomly determining the pick-up location and failing to get the car or taking a long time In order to get a taxi, it can improve the efficiency of users.

Description of the drawings

In order to explain the technical solutions of the embodiments of the present disclosure more clearly, the following will briefly introduce the drawings that need to be used in the embodiments. It should be understood that the following drawings only show certain embodiments of the present disclosure, and therefore do not It should be regarded as a limitation of the scope. For those of ordinary skill in the art, other related drawings can be obtained based on these drawings without creative work.

Fig. 1 shows a schematic flowchart of a method for recommending a service location according to an embodiment of the present disclosure;

Fig. 2 shows a schematic structural diagram of an apparatus for recommending a service location according to an embodiment of the present disclosure;

Fig. 3 shows a schematic structural diagram of an electronic device according to an embodiment of the present disclosure;

FIG. 4 shows a schematic flowchart of a method for recommending a service location according to an embodiment of the present disclosure;

FIG. 5 shows a schematic flowchart of a method for recommending a service location according to an embodiment of the present disclosure;

Fig. 6 shows a schematic flowchart of a method for recommending a service location according to an embodiment of the present disclosure;

FIG. 7 shows a schematic flowchart of a method for recommending a service location according to an embodiment of the present disclosure;

Fig. 8 shows a schematic flowchart of a method for recommending a service location according to an embodiment of the present disclosure.

Detailed ways

In order to make the purpose, technical solutions and advantages of the embodiments of the present disclosure clearer, the technical solutions in the embodiments of the present disclosure will be described clearly and completely in conjunction with the accompanying drawings in the embodiments of the present disclosure. It should be understood that the attached The drawings are only for the purpose of illustration and description, and are not used to limit the protection scope of the present disclosure. In addition, it should be understood that the schematic drawings are not drawn to scale. The flowchart used in the present disclosure shows operations implemented according to some embodiments of the present disclosure. It should be understood that the operations of the flowchart may be implemented out of order, and steps without logical context may be reversed in order or implemented at the same time. In addition, under the guidance of the present disclosure, those skilled in the art can add one or more other operations to the flowchart, or remove one or more operations from the flowchart.

In addition, the embodiments described in the present disclosure are only a part of the embodiments of the present disclosure, rather than all the embodiments. The components of the embodiments of the present disclosure generally described and illustrated in the drawings herein may be arranged and designed in various different configurations. Therefore, 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 claimed present disclosure, but merely represents selected embodiments of the present disclosure. Based on the embodiments of the present disclosure, all other embodiments obtained by those skilled in the art without creative work shall fall within the protection scope of the present disclosure.

It should be noted that the term "including" will be used in the embodiments of the present disclosure to indicate the existence of the features declared thereafter, but it does not exclude the addition of other features. It should also be noted that similar reference numerals and letters indicate similar items in the following figures. Therefore, once an item is defined in one figure, it does not need to be further defined and explained in subsequent figures. . In the description of the present disclosure, it should also be noted that the terms “first”, “second”, “third”, etc. are only used to distinguish the description, and cannot be understood as indicating or implying relative importance.

The embodiment of the present disclosure provides a service location recommendation method, which can be applied to a service platform, and the service platform can process a service request initiated by a user based on the method. Ride point, so that users can efficiently take a taxi. The execution subject of the method may be a server or computer of the service platform with data processing capabilities, which is not limited in the present disclosure. Among them, the service platform can be an online car-hailing service platform, a taxi service platform, and a Shunfeng car service platform. For those skilled in the art, without departing from the spirit and scope of the present disclosure, the general principles defined in the following embodiments can also be applied to other service platforms.

In some embodiments, the server may be a single server or a server group. The server group can be centralized or distributed (for example, the server can be a distributed system). In some embodiments, the user may initiate a service request to the server through a terminal such as a mobile phone or a computer. The server may be local or remote relative to the terminal. For example, the server can access the information or data stored in the user terminal or database via the network. In some embodiments, the server can also be implemented on a cloud platform; as an example, a cloud platform can include private cloud, public cloud, hybrid cloud, community cloud, distributed cloud, and inter-cloud. , Multi-cloud, etc., or any combination of them.

Fig. 1 shows a schematic flowchart of a method for recommending a service location according to an embodiment of the present disclosure.

As shown in Figure 1, the service location recommendation method may include:

Step S101: Receive service request information sent by a service requester, where the service request information includes a first location;

According to some embodiments, the server of the service platform receives the service request information sent by the service requester, where the service request information may be initiated by the ride-hailing user through the APP program installed on the mobile phone, or may be initiated through the WeChat applet. The service request information includes, but is not limited to, the user's first location. The first location is the current location of the taxi user, or may be a location manually set by the user, where the first location may be represented by longitude and latitude.

Step S102: Determine at least one second position within a predetermined first threshold distance range from the first position;

In some embodiments, at least one second location is determined within a predetermined first threshold distance from the first location; for example, the predetermined first threshold distance may be 1km, that is, 1km may be the center of the circle at the first location. At least one second location is determined within the radius; wherein, the second location may be a preliminarily determined recommended boarding point.

Step S103: Determine at least one service target location based on the future service vehicle information of each of the second locations;

In some embodiments, the determined multiple second locations may be further screened to determine at least one service target location; wherein, the at least one service target location may be determined according to the predicted future service vehicle information of the second location. Wherein, the future service vehicle information of the second location may be obtained based on the driving track information of the service vehicle obtained by real-time monitoring.

Step S104: Send the at least one service target location to the service requester.

The present disclosure provides a method for recommending a service location. Compared with the traditional way of raising a taxi from the roadside, this application receives service request information sent by a service requester. The service request information includes a first location, and then a distance from the first location. At least one second location is determined within a predetermined first threshold distance, and then at least one service target location is determined based on the future service vehicle information of each second location, and the at least one service target location is sent to the service requester. That is, a number of known recommended pick-up points (ie, the second location) are initially determined within a predetermined range from the user's location (ie, the first location), and then at least one target recommendation is determined based on the future service vehicle information of each recommended pick-up point Recommend a pick-up location (that is, the target location of the service) to the user, so that the target recommended pick-up location is determined based on the future service vehicle information of the known recommended pick-up location, so as to prevent the user from randomly determining the pick-up location and failing to get the car or taking a long time In order to get a taxi, it can improve the efficiency of users.

The embodiment of the present disclosure provides a possible implementation, wherein the second location is determined based on historical service location information.

In some embodiments, the second location can be determined based on historical service location information, for example, it can be obtained through corresponding big data analysis technology based on the collected historical boarding location information or getting off location information of multiple users; In the application scenario of a taxi, the second position is a position that is preliminarily determined to allow boarding.

For the embodiments of the present disclosure, the problem of determining the second position is solved.

The embodiments of the present disclosure provide a possible implementation manner. According to some embodiments, step S102 includes:

Step S1021: Determine a plurality of candidate second positions within a predetermined first threshold distance range from the first position;

Step S1022, performing aggregation processing on the plurality of candidate second positions by a clustering algorithm to obtain at least one position set;

Step S1023: Obtain historical service vehicle information of each candidate second location;

Step S1024: Determine a second location from each of the location sets based on the historical service vehicle information of each candidate second location to obtain at least one second location.

According to some embodiments, a plurality of candidate second positions may be determined within a predetermined first threshold distance from the first position, and then the plurality of candidate second positions may be aggregated by a clustering algorithm to obtain at least one position set, and then based on each candidate The historical service vehicle information of the second location determines at least one second location from each of the location sets. Among them, a second location can be determined for each location set. For example, the number of vehicles passing by each candidate second location can be determined based on the historical service vehicle information of each candidate second location, and then the passing vehicles can be selected from each location set. The position with the largest number of vehicles is taken as the representative of the position set and as the second position.

According to some embodiments, the clustering algorithm can be DBSCAN or K-means algorithm; DBSCAN is a clustering algorithm based on density space. Unlike the KMeans algorithm, it does not need to determine the number of clusters, but is based on data speculation. The number of clusters, which can generate clusters for any shape, combined with the embodiments of the present disclosure, at least one location set can be generated.

According to some embodiments, Epsoiln-neighborhood (E-nbhd for short) can be understood as a density space, which represents an nbhd with a radius of e and containing several points, and the density is equal to the number of points contained/the size of the space. The DBSCAN algorithm needs to determine two parameters first: (1) epsilon: the radius of the adjacent area around a point; (2) minPts: the number of points in the adjacent area at least. According to the above two parameters, combined with the characteristics of epsilon-neighborhood, the points in the sample can be divided into three categories: core point (core point): meet NBHD(p,epsilon)>=minPts, then it is a nuclear sample point; edge point ( border point): NBHD(p,epsilon)<minPts, but the point can be obtained by some core points (density-reachable or directly-reachable); Outlier: it is neither a core point nor an edge point, so it is not Points that fall into this category. The general steps of DBSCAN are: (under the premise that epsilon and minPts are known): Step 1. Choose a point arbitrarily (neither specified to a class nor specified as a peripheral point), and calculate its NBHD(p,epsilon) judgment Whether it is a nuclear point. If it is, create a class around the point, otherwise, set it as an outer point. Step 2. Traverse other points until a class is created. Add the directly-reachable points to the class, and then add the density-reachable points. If the points marked as peripheral are added, the modified state is edge points. Step 3. Repeat steps 1 and 2 until all points are in the class (nucleus point or edge point) or are outer points.

For the embodiment of the present disclosure, a plurality of candidate second positions are determined first, and then the candidate second positions are clustered to obtain a position set, and then the second position is determined from the position set. The aggregation process reduces the number of candidate second positions. Reduce the amount of data processing.

The embodiment of the present disclosure provides a possible implementation, and step S103 includes:

Step S1031: Determine the number of vehicles passing through each of the second locations based on the future service vehicle information of each of the second locations;

Step S1032: Determine at least one service target location based on the determined number of vehicles passing through each of the second locations.

In some embodiments, the number of vehicles passing through each of the second locations may be determined according to the future service vehicle information of each of the second locations, and then at least one service target location may be determined based on the determined number of vehicles passing through each of the second locations .

In some embodiments, the service platform can obtain the driving trajectory information of the service vehicle in real time. Based on the driving trajectory information, it can determine the information of the service vehicle passing the second location in the future. For example, the service vehicle reports its service every predetermined time. Related information (location information, time confidence, vehicle ID, etc.) is sent to the service platform, based on the service-related information, the service platform can draw the service vehicle's driving trajectory information; among them, the service vehicle information passing the second location in the future can be a certain threshold in the future Information about the service vehicles passing through the second location within a time (such as 15 minutes), where the service vehicle information may include specific information of the passing vehicles, such as vehicle ID, passing time, etc. The service vehicle information can be processed accordingly to obtain each The number of vehicles passing through the second location in the future; among them, the service target location may be determined by the one with the highest number of passing vehicles or a plurality of predetermined ones.

For the embodiments of the present disclosure, the target service location is determined based on the number of service vehicles passing through the second location, and the location with many passing vehicles is determined as the target service location, thereby solving the problem of efficient taxi rides.

The embodiment of the present disclosure provides a possible implementation, and further, the method further includes:

Step S105: Calculate the distance from each of the second positions to the first position;

Step S106: Sort each of the second positions based on the distance from each of the second positions to the first position to obtain a second position sorted by distance;

According to some embodiments, the determining at least one service target location based on the future service vehicle information of each of the second locations includes:

Step S1033: Re-sort the second positions sorted by distance based on the future service vehicle information of each of the second positions to obtain the second position sorted by future service vehicle information, and the sort by future service vehicle information is used to Adjusting the sequence of the at least two second positions when the distance between at least two of the second positions and the first position is the same;

Step S1034 determines at least one service target location based on the second location sorted by future service vehicle information.

According to some embodiments, the first position and the second position may be represented by latitude and longitude, and the distance from each second position to the first position may be calculated based on the latitude and longitude of the first position and the second position. Then, the calculated distances are sorted for each of the second positions to obtain the second positions sorted by distance, where the distance may be sorted from small to large. Then, re-sort according to the future service vehicle information of each second location to obtain the second location sorted according to the future service vehicle information, and finally determine at least one service target location based on the second location sorted according to the future service vehicle information. That is, distance is given priority. When the distance is the same, it is sorted by the number of passing vehicles. Exemplarily, the second positions are A, B, C, D, E, F, and the distances from A, B, C, D, E, and F to the first position are 20, 30, 30, 40, 40, 50, sorted by distance as A, B, C, D, E, F; cars passing A, B, C, D, E, F are 20, 40, 50, 30, 30, 35, then sort again The result is A, C, B, D, E, F.

Wherein, a certain threshold value can also be set, and when the number of cars passing through the second position exceeds a certain threshold value, the number of passing cars is given priority. Exemplarily, the number threshold is 10 vehicles, the second positions are A, B, C, D, E, F, and the distances from A, B, C, D, E, and F to the first position are 20, 30, and 30, respectively. 30, 40, 40, 50, sorted by distance as A, B, C, D, E, F; cars passing A, B, C, D, E, F are 20, 40, 50, 30, 30 , 35, the re-sorting result is C, B, D, E, F, A, that is, the number of vehicles in B, C, D, E, and F exceeds the threshold value of 10, and then the sorting of A is adjusted, and the number of F is If the number of D and E does not exceed the threshold of 10, the ranking of F is not adjusted.

For the embodiment of the present disclosure, the second position is sorted twice, and then the service target position is determined, thereby solving the problem of determining the service target position.

Step S107, the future service vehicle information at the service target location is fed back to the service requester.

According to some embodiments, the future service vehicle information of the service target location may be fed back to the service requester, so that the user can determine which service target location to wait for the bus according to each service target location. The future service vehicle information may include but is not limited to Vehicle ID, time of arrival, current location, etc.

For the embodiments of the present disclosure, the future service vehicle information at the service target location is fed back to the service requester for the user to select the service target location for waiting, thereby improving the efficiency of taxi-hailing and further improving user experience.

The embodiments of the present disclosure provide a possible implementation manner. Further, the feedback of future service vehicle information at the service target location to the service requester includes:

Step S1071: Acquire vehicle information of at least one candidate vehicle within a predetermined second threshold distance range of the service target position in real time;

Step S1072: Screen the candidate vehicles based on the vehicle information of the at least one candidate vehicle to obtain future service vehicle information. A vehicle driving away from the target recommendation point in front of the service target location;

In step S1073, the service vehicle information is fed back to the service requester.

According to some embodiments, the vehicle information of at least one candidate vehicle within the predetermined second threshold distance of the service target position can be acquired according to the position information of the service vehicle acquired in real time, and the candidate vehicle can be compared according to the driving trajectory information of the candidate vehicle. Carry out screening to remove vehicles that do not pass the service target location and vehicles that are far away from the service target location.

According to some embodiments, the screening of service vehicles may include: determining the driving direction of the service target location based on the driving trajectories of multiple vehicles, and discarding filtering if the driving direction of the empty vehicle and the driving direction of the service target location are greater than 90 degrees.

For the embodiments of the present disclosure, the problem of how to provide accurate service vehicle information is solved, which provides a basis for the user to select the service target location.

Based on the service location recommendation method described in the foregoing method embodiment, correspondingly, an embodiment of the present disclosure also provides a service location recommendation device. FIG. 2 shows a schematic structural diagram of the service location recommendation device provided by an embodiment of the present disclosure.

As shown in Figure 2, the service location recommendation device may include:

The receiving module 201 is configured to receive service request information sent by a service requester, where the service request information includes the first location;

The first determining module 202 is configured to determine at least one second position within a predetermined first threshold distance range from the first position;

The second determining module 203 is configured to determine at least one service target location based on the future service vehicle information of each of the second locations;

The sending module 204 is configured to send the at least one service target location to the service requester.

The present disclosure provides a service location recommendation device. Compared with the traditional roadside bidding method, the present disclosure receives service request information sent by a service requester. The service request information includes a first location, and the distance from the first location At least one second location is determined within a predetermined first threshold distance, and then at least one service target location is determined based on the future service vehicle information of each second location, and the at least one service target location is sent to the service requester. That is, a number of known recommended pick-up points (ie, the second location) are initially determined within a predetermined range from the user's location (ie, the first location), and then at least one target recommendation is determined based on the future service vehicle information of each recommended pick-up point Recommend a pick-up location (that is, the target location of the service) to the user, so that the target recommended pick-up location is determined based on the future service vehicle information of the known recommended pick-up location, so as to prevent the user from randomly determining the pick-up location and failing to get the car or taking a long time In order to get a taxi, it can improve the efficiency of users.

The embodiments of the present disclosure provide a possible implementation manner. According to some embodiments, the first determining module includes:

The embodiments of the present disclosure provide a possible implementation manner. According to some embodiments, the second determining module includes:

The embodiment of the present disclosure provides a possible implementation, and further, the device further includes:

The second determining module includes:

The embodiments of the present disclosure provide a possible implementation. According to some embodiments, the feedback module includes:

The above-mentioned device can be integrated into a server and other equipment, and the present disclosure is not limited herein. Those skilled in the art can clearly understand that for the convenience and concise description, the specific working process of the service location recommendation device can refer to the corresponding process of the service location recommendation method described in the foregoing method embodiment. Go into details again.

It should be understood that the device embodiments described above are merely illustrative, and the devices and methods disclosed in the embodiments of the present disclosure may also be implemented in other ways. For example, the division of the modules is only a logical function division, and there may be other divisions in actual implementation. For another example, multiple modules or components can be combined or integrated into another system, or some features can be ignored. Or not. In addition, the displayed or discussed mutual coupling or direct coupling or communication connection may be indirect coupling or communication connection through some communication interfaces, devices or modules, and may be in electrical, mechanical or other forms. In addition, the functional units in the various embodiments of the present disclosure may be integrated into one processing unit, or each unit may exist alone physically, or two or more units may be integrated into one unit.

If the function is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a non-volatile computer readable storage medium executable by a processor. Based on this understanding, the technical solution of the present disclosure essentially or the part that contributes to the prior art or the part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including Several instructions are used to make a computer device (which may be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the methods described in the various embodiments of the present disclosure. That is, those skilled in the art should understand that the embodiments of the present disclosure may be implemented in any form of a complete hardware embodiment, a complete software embodiment, or a combination of software and hardware embodiments.

Based on this, the embodiments of the present disclosure also provide a program product. The program product may be a storage medium such as a U disk, a mobile hard disk, ROM, RAM, a magnetic disk, or an optical disk. The storage medium may store a computer program, and the computer program is processed. When the device is running, the steps of the service location recommendation method as described in the foregoing method embodiment are executed. The specific implementation method is similar to the technical effect, and will not be repeated here.

In addition, an embodiment of the present disclosure also provides an electronic device, which may be a device with data processing capabilities such as the above-mentioned personal computer, server, or network device. FIG. 3 shows the structure of the electronic device provided by the embodiment of the present disclosure. Schematic.

As shown in FIG. 3, the electronic device may include a processor 31, a storage medium 32, and a bus 33. The storage medium 32 stores machine-readable instructions executable by the processor 31. When the electronic device is running, the processor 31 and the storage The media 32 communicate through the bus 33, and the processor 31 executes machine-readable instructions to execute the steps of the service location recommendation method in the foregoing method embodiment when executed. The specific implementation method and technical effect are similar, and will not be repeated here again.

For ease of description, only one processor is described in the above electronic device. However, it should be noted that, in some embodiments, the electronic device in the present disclosure may also include multiple processors, and therefore, the steps performed by one processor described in the present disclosure may also be executed jointly or individually by multiple processors.

The above are only specific implementations of the present disclosure, but the protection scope of the present disclosure is not limited thereto. Any person skilled in the art can easily think of changes or substitutions within the technical scope disclosed in the present disclosure, and they shall be covered Within the protection scope of this disclosure. Therefore, the protection scope of the present disclosure should be subject to the protection scope of the claims.

Claims

A method for recommending a service location, characterized in that the method for recommending a service location includes:

Receiving service request information sent by a service requester, where the service request information includes the first location;

Determining at least one second position within a predetermined first threshold distance range from the first position;

Determine at least one service target location based on the future service vehicle information of each of the second locations;

The at least one service target location is sent to the service requester.
The service location recommendation method according to claim 1, wherein the second location is determined based on historical service location information.
The service location recommendation method according to claim 1, wherein the future service vehicle information of the second location is obtained based on real-time monitored service vehicle travel trajectory information.
The service location recommendation method according to claim 1, wherein the determining at least one second location within a predetermined first threshold distance from the first location comprises:

Determining a plurality of candidate second positions within a predetermined first threshold distance range from the first position;

Performing aggregation processing on the plurality of candidate second positions by a clustering algorithm to obtain at least one position set;

Acquiring historical service vehicle information of each candidate second location;

A second location is determined from each of the location sets based on the historical service vehicle information of each candidate second location, and at least one second location is obtained.
The service location recommendation method according to claim 4, wherein the number of vehicles passing by each candidate second location is determined based on the historical service vehicle information of each candidate second location, and the number of vehicles passing by each candidate second location is determined separately from each of the location sets. The position with the largest number of passing vehicles is selected as the second position determined from each of the position sets.
The service location recommendation method according to claim 1, wherein the determining at least one service target location based on future service vehicle information of each of the second locations comprises:

Determining the number of vehicles passing through each of the second locations based on the future service vehicle information of each of the second locations;

At least one service target location is determined based on the determined number of vehicles passing through each of the second locations.
The service location recommendation method according to claim 6, wherein the determining at least one service target location based on the future service vehicle information of each of the second locations comprises:

Obtain real-time information about the driving track of the service vehicle;

Based on the driving trajectory information, determine the information of the service vehicles passing through each of the second locations in the future, where the information of the service vehicles passing through each of the second locations in the future is the information of the service vehicles passing through each of the second locations within a threshold time in the future ；

According to the service vehicle information, the number of vehicles passing through each of the second locations in the future is determined.
The service location recommendation method according to claim 1, wherein the method further comprises:

Calculating the distance from each of the second positions to the first position;

Sorting each of the second positions based on the distance from each of the second positions to the first position to obtain a second position sorted by distance;

The determining at least one service target location based on the future service vehicle information of each of the second locations includes:

Based on the future service vehicle information of each of the second locations, the second locations sorted by distance are re-sorted to obtain the second location sorted by future service vehicle information. The sorting by future service vehicle information is used for at least two Adjusting the order of the at least two second positions when the distance between the second position and the first position is the same;

At least one service target location is determined based on the second location sorted by future service vehicle information.
The service location recommendation method according to claim 8, wherein the future service vehicle information of each of the second locations is the number of vehicles passing through each of the second locations in the future, wherein distance is given priority, and if the distances are the same, Sort by the number of vehicles.
The service location recommendation method according to claim 8, wherein the future service vehicle information of each of the second locations is the number of vehicles passing through each of the second locations in the future, wherein when passing through the second location When the number of vehicles exceeds a threshold, the number of vehicles is given priority.
The service location recommendation method according to any one of claims 1-10, wherein the method further comprises:

The future service vehicle information at the service target location is fed back to the service requester.
The method according to claim 11, wherein the future service vehicle information of the service target location includes at least one of a vehicle ID, time of arrival, and current location.
The service location recommendation method according to claim 11, wherein said feeding back future service vehicle information of the service target location to the service requester comprises:

Acquiring vehicle information of at least one candidate vehicle within a predetermined second threshold distance of the service target location in real time;

The candidate vehicles are screened based on the vehicle information of the at least one candidate vehicle to obtain future service vehicle information at the service target location, and the screening is used to remove vehicles that do not pass through the service target location and/or remove vehicles at the service target location. A vehicle that drives away from the service target location before the user reaches the service target location;

The future vehicle information of the service target location is fed back to the service requester.
The service location recommendation method according to claim 13, wherein the driving direction of the service target location is determined based on the driving trajectory of the at least one candidate vehicle, and the driving direction of the at least one candidate vehicle is driven to the service target location. Candidate vehicles with a direction greater than 90 degrees are discarded.
A device for recommending a service location, characterized in that the device for recommending a service location includes:

A receiving module configured to receive service request information sent by a service requester, the service request information including the first location;

A first determining module configured to determine at least one second position within a predetermined first threshold distance range from the first position;

A second determining module configured to determine at least one service target location based on future service vehicle information of each of the second locations;

A sending module configured to send the at least one service target location to the service requester.
An electronic device, characterized by comprising: a processor, a storage medium and a bus. The storage medium stores machine-readable instructions executable by the processor. When the electronic device is running, the processor and The storage media communicate through a bus, and the processor executes the machine-readable instructions to execute the steps of the service location recommendation method according to any one of claims 1 to 14 when executed.
A readable storage medium, wherein a computer program is stored on the storage medium, and the computer program executes the steps of the service location recommendation method according to any one of claims 1 to 14 when the computer program is run by a processor .