[go: up one dir, main page]

CN116975467A - A boarding point push method, terminal and computer storage medium - Google Patents

A boarding point push method, terminal and computer storage medium Download PDF

Info

Publication number
CN116975467A
CN116975467A CN202310967705.XA CN202310967705A CN116975467A CN 116975467 A CN116975467 A CN 116975467A CN 202310967705 A CN202310967705 A CN 202310967705A CN 116975467 A CN116975467 A CN 116975467A
Authority
CN
China
Prior art keywords
point
preset
aoi
user
generating
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
CN202310967705.XA
Other languages
Chinese (zh)
Inventor
杜帅
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hangzhou Langge Technology Co ltd
Zhejiang Geely Holding Group Co Ltd
Original Assignee
Hangzhou Langge Technology Co ltd
Zhejiang Geely Holding Group Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hangzhou Langge Technology Co ltd, Zhejiang Geely Holding Group Co Ltd filed Critical Hangzhou Langge Technology Co ltd
Priority to CN202310967705.XA priority Critical patent/CN116975467A/en
Publication of CN116975467A publication Critical patent/CN116975467A/en
Withdrawn legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/95Retrieval from the web
    • G06F16/953Querying, e.g. by the use of web search engines
    • G06F16/9537Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/02Reservations, e.g. for tickets, services or events
    • G06Q10/025Coordination of plural reservations, e.g. plural trip segments, transportation combined with accommodation
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00Commerce
    • G06Q30/06Buying, selling or leasing transactions
    • G06Q30/0601Electronic shopping [e-shopping]
    • G06Q30/0633Managing shopping lists, e.g. compiling or processing purchase lists
    • G06Q30/0635Managing shopping lists, e.g. compiling or processing purchase lists replenishment orders; recurring orders

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • Tourism & Hospitality (AREA)
  • General Physics & Mathematics (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Development Economics (AREA)
  • Finance (AREA)
  • Accounting & Taxation (AREA)
  • General Business, Economics & Management (AREA)
  • Marketing (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Human Resources & Organizations (AREA)
  • General Engineering & Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Navigation (AREA)

Abstract

The application relates to a get-on point pushing method, a terminal and a computer storage medium. The get-on point pushing method comprises the following steps: acquiring preset positions in the historical taxi-taking orders, wherein the preset positions comprise a first position, a second position and/or a third position, the first position is a user request position, the second position is a taxi-taking point selected by a user, and the third position is a taxi-taking converging position; determining at least one thermal zone based on the preset position; and generating or recommending corresponding boarding points according to the thermal area. According to the method and the system, the get-on point is generated or recommended to the user based on the actual data of the historical get-on order, so that the actual get-on point which is convenient for the user to get on can be dug out, and the push accuracy of the get-on point is improved.

Description

Get-on point pushing method, terminal and computer storage medium
Technical Field
The application belongs to the technical field of data processing, and particularly relates to a get-on point pushing method, a terminal and a computer storage medium.
Background
With the rapid development of cities, traffic is increasingly congested, and network taxi taking has become a main mode in urban travel. In the network taxi service, a facilitator generally generates a recommended get-on point based on the location of a user and map data. However, during actual completion of the order, the final meeting point may not coincide with the recommended pick-up point. That is, the recommended pick-up point provided is not the optimal pick-up point, and thus, poor experience is brought to the driver and passenger users.
Disclosure of Invention
In order to solve the technical problems, the application provides a get-on point pushing method, a terminal and a computer storage medium, which can dig out the actual get-on point which is convenient for a user to get on and improve the accuracy of the get-on point pushing.
In a first aspect, the present application provides a method for pushing a get-on point, including:
acquiring preset positions in a historical taxi taking order, wherein the preset positions comprise a first position, a second position and/or a third position, the first position is a user request position, the second position is a taxi taking point selected by a user, and the third position is a taxi taking merging position;
determining at least one thermal zone based on the preset position;
and generating or recommending a corresponding boarding point according to the thermal area.
In one embodiment, if the historical driving order is a multi-user historical driving order, the method includes:
determining at least one thermal zone based on the third location;
if the preset get-on point does not exist in the heating power area, generating a corresponding get-on point;
and if the preset get-on point exists in the heating power area, adjusting the recommended priority of the second position.
In one embodiment, if the historical driving order is a single user historical driving order, the method further comprises:
determining at least one thermal zone based on the first location within a preset range;
and generating a corresponding boarding point according to the thermodynamic region and the central point of the preset range.
In an embodiment, after the generating the corresponding get-on point, the method further includes:
and generating the name of the boarding point.
In a second aspect, the present application provides a method for pushing a boarding point, including:
acquiring preset positions in a historical taxi taking order, wherein the preset positions comprise a first position, a second position and/or a third position, the first position is a user request position, the second position is a taxi taking point selected by a user, and the third position is a taxi taking merging position;
executing a corresponding get-on point pushing strategy based on the preset position;
and generating or recommending a corresponding preset get-on point based on the execution result of the get-on point pushing strategy.
In an embodiment, the preset position includes the third position, and the method includes:
if the third position is located in a closed AOI, updating the state of the AOI to be non-closed;
and recommending the preset boarding point of the AOI.
In an embodiment, the preset position includes the first position and the second position, and the method includes:
if the second position is located in the AOI where the first position is located, generating a preset get-on point in the AOI at the second position, and/or lifting the priority of the second position as the preset get-on point;
if the second position is located outside the AOI where the first position is located, establishing an association relation between the second position and the AOI of the first position to generate or recommend the second position as a preset boarding point of the AOI.
In an embodiment, the preset position includes the second position and the third position, and the method further includes:
if the distance between the second position and the third position is smaller than or equal to a preset distance, generating or recommending the third position as a preset get-on point;
if the distance between the second position and the third position is greater than the preset distance, deleting the second position as a preset get-on point, or reducing the priority of the second position as the preset get-on point.
In a third aspect, the present application also provides a terminal comprising a memory, a processor and a computer program stored in the memory and executable on the processor, the processor implementing the steps of the above method when executing the computer program.
In a fourth aspect, the present application also provides a computer storage medium storing a computer program which, when executed by a processor, implements the steps of the above method.
The application provides a get-on point pushing method, a terminal and a computer storage medium, wherein preset positions in a historical get-on order are obtained, the preset positions comprise a first position, a second position and/or a third position, the first position is a user request position, the second position is a get-on point selected by a user, and the third position is a ride merging position; determining at least one thermal zone based on the preset position; and generating or recommending corresponding boarding points according to the thermal area. According to the method and the system, the get-on point is generated or recommended to the user based on the actual data of the historical get-on order, so that the actual get-on point which is convenient for the user to get on can be dug out, and the push accuracy of the get-on point is improved.
Drawings
Fig. 1 is a flow chart of a method for pushing a get-on point according to a first embodiment of the present application;
FIG. 2 is a geographic schematic of a thermal zone provided by a first embodiment of the present application;
fig. 3 is a schematic flowchart of a get-on point pushing method according to a first embodiment of the present application;
FIG. 4 is a geographic schematic diagram of a get-on point generation result provided by the first embodiment of the present application;
fig. 5 is a schematic flow chart of the on-board roll name generation according to the first embodiment of the present application;
fig. 6 is a flow chart of a get-on point pushing method according to a second embodiment of the present application;
fig. 7 is a specific flow chart of a get-on point pushing method according to a second embodiment of the present application;
fig. 8 is a schematic structural diagram of a terminal according to an embodiment of the present application.
Detailed Description
The technical scheme of the application is further elaborated below by referring to the drawings in the specification and the specific embodiments. Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs. The terminology used herein in the description of the application is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. As used herein, "and/or" includes any and all combinations of one or more of the associated listed items.
First embodiment
Fig. 1 is a flow chart of a method for pushing a get-on point according to a first embodiment of the present application. As shown in fig. 1, the get-on point pushing method of the present application may include the following steps:
step S510: the method comprises the steps of obtaining preset positions in historical taxi taking orders, wherein the preset positions comprise a first position, a second position and/or a third position, the first position is a user request position, the second position is a taxi taking point selected by a user, and the third position is a taxi taking merging position.
Step S520: at least one thermal zone is determined based on the predetermined location.
Step S530: and generating or recommending corresponding boarding points according to the thermal area.
In this embodiment, based on any specific area in the map, historical driving order data in the area, such as historical driving orders in one month or one week, is obtained. Each historical drive order may include a first location, a second location, and/or a third location therein. The first location may be a location where the user initiates a taxi taking request, and is generally generated based on positioning information of the user. The second location may be a get-on point selected by the user in the map, or may be a get-on point recommended by the system selected by the user, where the get-on point recommended by the system may be determined according to at least one of POI, AOI or road information in the map data, i.e. a preset get-on point. The second location may also be a location arbitrarily selected by the user on the map. The third position is the actual department meeting point in the order. The geographic coordinates of the first position, the second position, and the third position may or may not be identical. The embodiment of the application particularly aims at the situation that three positions are inconsistent, and corrects the recommended get-on point of the system through the first position or the third position so as to generate or recommend a more accurate and convenient get-on point.
In an embodiment, if the historical driving order is a multi-user historical driving order, the method for pushing the driving point in this embodiment includes:
determining at least one thermal zone based on the third location;
if the preset get-on point does not exist in the heating power area, generating a corresponding get-on point;
if the preset get-on point exists in the heating power area, the recommended priority of the preset get-on point is improved.
As shown in fig. 2 and 3, it is first determined whether the first location falls within the AOI. If yes, counting a first position, a second position and a third position in the current AOI area through the historical taxi taking orders of multiple users in a preset time period. Such as counting the AOI for the presence of a thermal zone of a ride junction location in a 7 day drive-through order. Here, the concentrated area for the third position is determined as the driving thermal area, i.e., the gray area in fig. 2. By way of example, a thermal zone of around 50m in diameter can be created. If the preset get-on point exists in the heating power area, the recommended priority of the preset get-on point is improved. Specifically, if there are multiple preset boarding points in the thermal area, the preset boarding point with a "door" character therein, or the preset boarding point with a door attribute associated with the POI, is set as the priority P0, that is, the highest priority. And setting the priority of other preset boarding points in the heating power area as P1. And setting the priority as P1 for a preset boarding point which is positioned in the non-thermal area and is related to the door. And setting the priority as P2 for a preset boarding point which is positioned in a non-thermal area and has high similarity with the AOI name. And setting the priority as P3 for other preset boarding points.
If the preset get-on point does not exist in the thermal area, a central coordinate point is generated in the thermal area. And adsorbing the central coordinate point to the nearest road to generate a preset get-on point. If the road is separated from the upper line and the lower line, the road is adsorbed to the same side with denser request positions, and if the request quantity of the two sides is not different, the road on the upper line and the road on the lower line respectively generate a preset boarding point.
For a new preset boarding point in the thermal area, a name is also required to be given. The sources of the names may be: 1-door, 2-intersection, 3-bus station, 4-subway access, 5-bank business hall, 6-parking lot access, 7-oriented angle bottom business POI, 8-AOI father point and 9-virtual point.
Specifically, the scheme for determining the name may be named after the boarding point generated by the 1-7 class POI within 10m by taking the preset boarding point as a center point. Or, taking the preset boarding point as a central point, and obtaining the name of the source AOI of the corresponding request position (namely the first position) of the thermal area. Or, the preset get-on point is taken as a center point, and the virtual point of the class 9 get-on point is named within the range of 10 m. Wherein, the virtual point refers to the name generated by combining the source AOI with the direction word. For example: the northeast side of the XX cell.
Next, priority: and judging whether names meeting the conditions are available according to the sequence of 1-9. Meanwhile, considering the cross-road constraint, namely, if the found object in 1-9 needs to cross the road with the preset on-road point, the cross-road constraint is not adopted.
In actual implementation, 7 days of heating power is taken as an excavating period, and the heating power area and the center point of the heating power area are updated each time according to the latest 7 days of multiplying and converging coordinate information. If the preset get-on point exists on the same side of the road where the newly added preset get-on point is located within the range of 10m, the preset get-on point is not added. Therefore, the preset get-on point can be supplemented and the priority can be adjusted according to the historical get-on order, so that the position more suitable for getting-on can be pushed to the user, and the get-on experience of the user is improved.
In an embodiment, if the historical driving order is a single user historical driving order, the method for pushing the driving point in this embodiment further includes:
determining at least one thermal zone based on the first location within a preset range;
and generating a corresponding boarding point according to the central points of the thermal area and the preset range.
The method comprises the steps of extracting historical taxi taking orders of a specific user in a certain area according to taxi taking requirements of the user in the certain area. And generating a preset get-on point which is favorable for getting on the vehicle of the user by analyzing the user request position in the historical get-on order. As shown in FIG. 4, a region of 100m range size may be selected to form a dot density region (i.e., a thermal zone) for the user request locations (i.e., first locations) that have occurred in the historical taxi orders. Four density regions are formed within a circle of 100m in fig. 4: thermal zone a, thermal zone B, thermal zone C, and thermal zone D. Then, using the heat value of each dot density region as a weight, for example, the heat value of the thermal region a is 5, the heat value of the thermal region B is 3, the heat value of the thermal region C is 1, and the heat value of the thermal region D is 2. And (5) carrying out weighted calculation on the central point of the region. After weighting, new coordinate points are formed, i.e., the weighted points in fig. 4. And (3) carrying out road adsorption by using the weighted points, namely taking the weighted points as starting points, making a perpendicular line to the road closest to the weighted points, taking the obtained intersection point as a road adsorption point, and taking the road adsorption point as a new preset boarding point.
In an embodiment, after generating the corresponding get-on point, the method further includes:
and generating the name of the boarding point.
As shown in fig. 5, a user-defined coordinate string is acquired as an input parameter, that is, coordinates of a newly added preset on-boarding point (hereinafter, simply referred to as newly added point). POI ID and POI NAME are optional input parameters.
The naming flow of the newly added points is as follows:
when the input parameters are the newly added point coordinates and the POI ID, it is determined whether there is a stored preset boarding point (hereinafter referred to as a stored point) within 20 m. And judging whether the recall quantity point associated POI ID and the entry POI ID have the same father point or are in a father-son relationship with each other. For example, the entry POI ID is a child POI of the stock point POI, and there is a parent-child relationship between the two. For another example, the participating POI ID and the stock point POI belong to the same parent POI, and then the participating POI ID and the stock point POI have the same parent relationship. If any relation exists, the name of the stock point is highly-optimally applied to the name of the newly added point, and other points are used as suboptimal recall sets. After the stock point judgment is completed, continuing to carry out subsequent judgment according to whether the entering parameters have POI ID and POI NAME.
According to the POIID and POINAME definitions, when the POI ID or POI NAME is involved, the following judgment is carried out according to the POI ID and POI NAME:
judging according to the POI ID: if the POI ID exists in the POI library, judging whether the POI ID is a parent point, if so, judging all child points in the newly added point position 20m, and defining the newly added point name by applying the child point POI name as a candidate set:
judging according to POI NAME: based on the peripheral search of the newly added point coordinates within the range of 20m, judging the name similarity of the input name and the recalled POI, and reserving the POI name with the name similarity more than or equal to 0.7 as a candidate set.
When the entering POI ID and the POI NAME are both null or the POI NAME is not null but the NAME similarity judgment is less than 0.7, based on the peripheral search of the newly added point position within the range of 20m, the POI NAME is acquired according to the following priority and the azimuth word is generated for defining the newly added point.
POI acquisition: 1-door, 2-intersection, 3-bus station, 4-subway entrance and exit, 5-bank business hall, 6-parking lot entrance and exit, 7-oriented angle bottom business POI, 8-190403-building number, class-writing building in 9, 1202, 10-AOI name (intersecting with boundary, AOI does not add azimuth word, AOI plus azimuth word);
azimuth term: generating azimuth words, namely east side, south side, west side, north side, south-east side, north-east side, south-west side and north-west side by calculating the range relation between the coordinates of the newly added points and the coordinates of the acquired POIs;
adding a point naming result: POI NAME + azimuth.
And finally, distinguishing the priority according to the logic processing result, and uniformly calling the judgment of the road and river crossing service by the recall candidate set. If the newly added point and the stock point cross the road or the water channel, deleting the stock point. If the newly added point and the stock point do not cross the road, the nearest POI name in the highest priority is taken to define the newly added point.
The get-on point pushing method of the embodiment includes: acquiring preset positions in the historical taxi-taking orders, wherein the preset positions comprise a first position, a second position and/or a third position, the first position is a user request position, the second position is a taxi-taking point selected by a user, and the third position is a taxi-taking converging position; determining at least one thermal zone based on the preset position; and generating or recommending corresponding boarding points according to the thermal area. According to the method and the system, the get-on point is generated or recommended to the user based on the actual data of the historical get-on order, so that the actual get-on point which is convenient for the user to get on can be dug out, and the push accuracy of the get-on point is improved.
Second embodiment
Fig. 6 is a flowchart of a get-on point pushing method according to a second embodiment of the present application. As shown in fig. 6, the get-on point pushing method of the present application may include the following steps:
step S610: the method comprises the steps of obtaining preset positions in historical taxi taking orders, wherein the preset positions comprise a first position, a second position and/or a third position, the first position is a user request position, the second position is a taxi taking point selected by a user, and the third position is a taxi taking merging position.
Step S620: and executing a corresponding get-on point pushing strategy based on the preset position.
Step S630: and generating or recommending a corresponding preset get-on point based on the execution result of the get-on point pushing strategy.
Referring to fig. 7, after the historical driving order is obtained, different strategies are executed for different position data in the order to add a preset driving point or adjust the recommended priority of the preset driving point.
In one embodiment, the preset position includes a second position, i.e., a user selects a get-on point. And generating a thermal area according to the aggregation condition of the second position. If the thermal area has a preset get-on point recommended by the system, the recommendation priority of the preset get-on point is adjusted according to the occurrence heat of the preset get-on point in the historical get-on order. And (5) lifting the recommended priority for the preset boarding points with heat or high heat, and reducing the recommended priority for the preset boarding points without heat or low heat.
In an embodiment, the preset position includes a third position, and the get-on point pushing method in this embodiment includes:
if the third position is located in a closed AOI, updating the state of the AOI to be non-closed;
and recommending the preset boarding point of the AOI.
And if the acquired third position is located in an AOI. The AOI is considered a closed area in the historical order, and thus the user is not recommended a preset pick-up point located within the AOI area. At this time, the state of the AOI may be updated to be a non-closed area, and a preset entry point in the AOI area may be recommended when the user takes a drive next time.
In an embodiment, the preset positions include a first position and a second position, and the get-on point pushing method in this embodiment includes:
if the second position is located in the AOI where the first position is located, generating a preset get-on point at the second position in the AOI, and/or lifting the priority of the second position as the preset get-on point;
if the second position is located outside the AOI where the first position is located, establishing an association relation between the second position and the AOI of the first position to generate or recommend the second position as a preset boarding point of the AOI.
If the second position is located in the AOI where the first position is located, establishing an association relation with the AOI and improving the recommended priority by a preset get-on point corresponding to the second position or a preset get-on point newly added according to the second position. Thus, the user can recommend the preset get-on point to the user preferentially when the user drives.
If the second location is outside the AOI where the first location is located, the user may select to get on the second location with the first location, indicating that door connectivity exists between the second location and the first location. At this time, the preset get-on point corresponding to the second position or the preset get-on point newly added according to the second position can be associated with the AOI of the first position, but the lower priority is set, so that the user is prevented from getting on the vehicle across the AOI.
In an embodiment, the preset positions include a second position and a third position, and the get-on point pushing method in this embodiment further includes:
if the distance between the second position and the third position is smaller than or equal to the preset distance, generating or recommending the third position as a preset get-on point;
if the distance between the second position and the third position is greater than the preset distance, deleting the second position as the preset get-on point, or reducing the priority of the second position as the preset get-on point.
If the distance between the second position and the third position is shorter, the moving distance that the user needs to reach the final get-on position is shorter, and the third position can be used as a preset get-on point. If the distance between the second position and the third position is longer, the moving distance that the user needs to reach the final get-on position is longer, and the preset get-on point recommended to the user needs to be changed.
Fig. 8 is a schematic structural diagram of a terminal according to an embodiment of the present application. The terminal of the present application comprises: a processor 110, a memory 111 and a computer program 112 stored in the memory 111 and executable on the processor 110. The steps of the above-described embodiments of the get-on-point pushing method are implemented when the processor 110 executes the computer program 112.
Terminals may include, but are not limited to, a processor 110, a memory 111. It will be appreciated by those skilled in the art that fig. 8 is merely an example of a terminal and is not intended to be limiting, and that more or fewer components than shown may be included, or certain components may be combined, or different components may be included, for example, a terminal may also include input and output devices, network access devices, buses, etc.
The processor 110 may be a central processing unit (Central Processing Unit, CPU), but may also be other general purpose processors, digital signal processors (Digital Signal Processor, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), off-the-shelf programmable gate arrays (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
The memory 111 may be an internal storage unit of the terminal, such as a hard disk or a memory of the terminal. The memory 111 may also be an external storage device of the terminal, such as a plug-in hard disk provided on the terminal, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash Card (Flash Card), or the like. Further, the memory 111 may also include both an internal storage unit and an external storage device of the terminal. The memory 111 is used to store computer programs and other programs and data required for the terminal. The memory 111 may also be used to temporarily store data that has been output or is to be output.
The application also provides a computer storage medium, wherein the computer storage medium is stored with a computer program, and the computer program realizes the steps in the embodiment of the get-on point pushing method when being executed by a processor.
The technical features of the above-described embodiments may be arbitrarily combined, and all possible combinations of the technical features in the above-described embodiments are not described for brevity of description, however, as long as there is no contradiction between the combinations of the technical features, they should be considered as the scope of the description.
In this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a list of elements is included, and may include other elements not expressly listed.
The foregoing is merely illustrative of the present application, and the present application is not limited thereto, and any person skilled in the art will readily recognize that variations or substitutions are within the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims (10)

1. The get-on point pushing method is characterized by comprising the following steps of:
acquiring preset positions in a historical taxi taking order, wherein the preset positions comprise a first position, a second position and/or a third position, the first position is a user request position, the second position is a taxi taking point selected by a user, and the third position is a taxi taking merging position;
determining at least one thermal zone based on the preset position;
and generating or recommending a corresponding preset boarding point according to the thermal area.
2. The method of claim 1, wherein if the historical taxi taking order is a multi-user historical taxi taking order, the method comprises:
determining at least one thermal zone based on the third location;
if the preset get-on point does not exist in the heating power area, a corresponding preset get-on point is generated;
if the preset get-on point exists in the heating power area, the recommended priority of the preset get-on point is improved.
3. The method of claim 1, wherein if the historical drive-through order is a single user historical drive-through order, the method further comprises:
determining at least one thermal zone based on the first location within a preset range;
and generating a corresponding preset boarding point according to the thermal area and the central point of the preset range.
4. A method according to claim 2 or 3, wherein after the generating of the corresponding preset get-on point, further comprising:
and generating the name of the preset get-on point.
5. The get-on point pushing method is characterized by comprising the following steps of:
acquiring preset positions in a historical taxi taking order, wherein the preset positions comprise a first position, a second position and/or a third position, the first position is a user request position, the second position is a taxi taking point selected by a user, and the third position is a taxi taking merging position;
executing a corresponding get-on point pushing strategy based on the preset position;
and generating or recommending a corresponding preset get-on point based on the execution result of the get-on point pushing strategy.
6. The method of claim 5, wherein the preset position comprises the third position, the method comprising:
if the third position is located in a closed AOI, updating the state of the AOI to be non-closed;
and recommending the preset boarding point of the AOI.
7. The method of claim 5, wherein the preset position comprises the first position and the second position, the method comprising:
if the second position is located in the AOI where the first position is located, generating a preset get-on point in the AOI at the second position, and/or lifting the priority of the second position as the preset get-on point;
if the second position is located outside the AOI where the first position is located, establishing an association relation between the second position and the AOI of the first position to generate or recommend the second position as a preset boarding point of the AOI.
8. The method of claim 5, wherein the preset position comprises the second position and the third position, the method further comprising:
if the distance between the second position and the third position is smaller than or equal to a preset distance, generating or recommending the third position as a preset get-on point;
if the distance between the second position and the third position is greater than the preset distance, deleting the second position as a preset get-on point, or reducing the priority of the second position as the preset get-on point.
9. A terminal comprising a memory, a processor and a computer program stored in the memory and executable on the processor, the processor implementing the steps of the method according to any one of claims 1 to 8 when the computer program is executed.
10. A computer storage medium storing a computer program, characterized in that the computer program when executed by a processor realizes the steps of the method according to any one of claims 1 to 8.
CN202310967705.XA 2023-08-02 2023-08-02 A boarding point push method, terminal and computer storage medium Withdrawn CN116975467A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310967705.XA CN116975467A (en) 2023-08-02 2023-08-02 A boarding point push method, terminal and computer storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310967705.XA CN116975467A (en) 2023-08-02 2023-08-02 A boarding point push method, terminal and computer storage medium

Publications (1)

Publication Number Publication Date
CN116975467A true CN116975467A (en) 2023-10-31

Family

ID=88474683

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310967705.XA Withdrawn CN116975467A (en) 2023-08-02 2023-08-02 A boarding point push method, terminal and computer storage medium

Country Status (1)

Country Link
CN (1) CN116975467A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN119557507A (en) * 2024-11-07 2025-03-04 北京嘀嘀无限科技发展有限公司 Position pushing method and device
CN119557508A (en) * 2024-11-07 2025-03-04 北京嘀嘀无限科技发展有限公司 Point recommendation method, device and electronic device
CN119783922A (en) * 2024-05-13 2025-04-08 北京航迹科技有限公司 Task processing method, device, electronic equipment and computer readable storage medium

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN119783922A (en) * 2024-05-13 2025-04-08 北京航迹科技有限公司 Task processing method, device, electronic equipment and computer readable storage medium
CN119557507A (en) * 2024-11-07 2025-03-04 北京嘀嘀无限科技发展有限公司 Position pushing method and device
CN119557508A (en) * 2024-11-07 2025-03-04 北京嘀嘀无限科技发展有限公司 Point recommendation method, device and electronic device

Similar Documents

Publication Publication Date Title
CN109313846B (en) System and method for recommending pick-up points
CN116975467A (en) A boarding point push method, terminal and computer storage medium
US12313417B2 (en) Travel route planning method and travel route recommendation method
WO2020078015A1 (en) Road matching-based positioning method, chip subsystem and electronic device
US11967006B2 (en) Systems and methods for generating road map based on level of nodes and target links
WO2021056303A1 (en) Systems and methods for determining a pick-up location
CN111866722B (en) Method, system, device and storage medium for generating electronic fence
JP2014089202A (en) Method and system for dynamically adaptive road network hierarchy and routing
CN116132998B (en) A City Edge Server Deployment Method Based on Intersection Centrality
WO2021052451A1 (en) Method and system for determining estimated time of arrival
CN111243265B (en) Method and system for determining regional traffic information
CN111881226B (en) Method and system for judging passing attribute of planar area
CN113959442A (en) Refined navigation method based on traffic plan route planning in area
CN105701555A (en) Method and system for dividing road network
US20230023255A1 (en) Controlled ingestion of map update data
CN113990066B (en) Road information matching and intersection identification method and device
CN111343582B (en) Method and device for preventing mileage cheating
CN116698075B (en) Road network data processing method and device, electronic equipment and storage medium
CN116935656B (en) Road traffic data processing method and device, electronic equipment and storage medium
CN116508013A (en) System and method for recommending points of interest
CN115808178B (en) Navigation map updating method, device and automatic driving system
CN113008246A (en) Map matching method and device
CN113485347B (en) Motion trail optimization method and system
CN112685531B (en) Vehicle matching method and device, computing device and computer-readable storage medium
CN112052276B (en) Mining method and device for riding route

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
WW01 Invention patent application withdrawn after publication
WW01 Invention patent application withdrawn after publication

Application publication date: 20231031