CN111813817B - Method and device for naming boarding points, storage medium and electronic equipment - Google Patents
Method and device for naming boarding points, storage medium and electronic equipment Download PDFInfo
- Publication number
- CN111813817B CN111813817B CN201911365067.4A CN201911365067A CN111813817B CN 111813817 B CN111813817 B CN 111813817B CN 201911365067 A CN201911365067 A CN 201911365067A CN 111813817 B CN111813817 B CN 111813817B
- Authority
- CN
- China
- Prior art keywords
- point
- name
- points
- boarding
- relevant
- 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.)
- Active
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2457—Query processing with adaptation to user needs
- G06F16/24578—Query processing with adaptation to user needs using ranking
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/248—Presentation of query results
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06Q—INFORMATION 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
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/40—Business processes related to the transportation industry
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Computational Linguistics (AREA)
- Health & Medical Sciences (AREA)
- Remote Sensing (AREA)
- Economics (AREA)
- General Health & Medical Sciences (AREA)
- Human Resources & Organizations (AREA)
- Marketing (AREA)
- Primary Health Care (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Navigation (AREA)
Abstract
The disclosure provides a naming method, device, storage medium and electronic equipment of a get-on point, wherein the method comprises the following steps: determining a preset number of related points related to the get-on point according to the first position information of the get-on point; and determining the name of the boarding point according to the name of the related point. According to the method and the device, the related points meeting the preset conditions in a plurality of related points related to the boarding point are judged in sequence according to the priority from high to low, the names of the related points are used as the names of the boarding point, the unique names of the boarding points in a relatively close area range are guaranteed by combining with the cache hit design, so that good position distinction of users is guaranteed, the situation that the users cannot correctly arrive at the boarding point due to the fact that the boarding points with different longitudes and latitudes use the same name is reduced, and the use experience of the users is improved.
Description
Technical Field
The disclosure relates to the field of mobile internet, and in particular relates to a method and a device for naming a boarding point, a storage medium and electronic equipment.
Background
In the use process of the network taxi-taking software or the navigation software, a user usually selects a taxi-taking point according to the own position before calling the vehicle to take over, and the software gives a name to the taxi-taking point according to the current position of the user and through information point (POI, point of Interest) data or road network data near the position. However, the density of POI data or road network data and the density of on-vehicle point positions on which the naming service depends may be different, so that multiple on-vehicle points with relatively close distances and different actual longitudes and latitudes may be named by using the same name, which causes trouble to the user during use and reduces the use experience of the user.
Disclosure of Invention
The embodiment of the disclosure aims to provide a naming method, a naming device, a storage medium and electronic equipment for getting-on points, so as to solve the problems that names among multiple getting-on points with relatively close distances are the same, which causes trouble when a user uses the device and reduces use experience in the prior art.
In order to solve the above technical problems, the embodiments of the present disclosure adopt the following technical solutions: a method for naming a get-on point, comprising: determining a preset number of related points related to the get-on point according to the first position information of the get-on point; and determining the name of the boarding point according to the name of the related point.
Further, the determining the name of the boarding point according to the name of the relevant point includes: sequentially judging whether the names of all the related points accord with preset conditions according to the order of the priority of all the related points from high to low; and under the condition that the name of the current relevant point accords with the preset condition, displaying the name of the current relevant point as the name of the boarding point.
Further, the correlation point includes at least one of: the system comprises an information point and a road network point, wherein the priority of the information point is higher than that of the road network point.
Further, when the name of the current relevant point meets the preset condition, displaying the name of the current relevant point as the name of the get-on point further includes: and under the condition that the names of all the related points do not meet the preset conditions, determining the names of the boarding points based on the names of the related points with the highest priority, and displaying.
Further, the sequentially judging whether the name of each relevant point meets the preset condition includes: judging whether a result list corresponding to the key value exists in a cache by taking the name of the current relevant point as the key value; under the condition that the result list corresponding to the key value does not exist in the cache, determining that the name of the current relevant point accords with the preset condition; judging whether a first result exists in the result list or not under the condition that the result list corresponding to the key value exists in the cache, wherein the distance between second position information of the first result and first position information of the boarding point is in a preset range; under the condition that the first result does not exist, determining that the name of the current relevant point accords with the preset condition; and under the condition that the first result exists, determining that the name of the current relevant point does not accord with the preset condition, acquiring the next relevant point with the priority lower than the current relevant point in the priority sequence, and judging whether the name of the next relevant point accords with the preset condition.
Further, after the displaying the name of the current relevant point as the name of the get-on point, the method further includes: taking the name of the current relevant point as a key value, and storing the first position information of the boarding point into a result list corresponding to the key value; and taking the time of storing the first position information of the get-on point into the result list as the starting time, and deleting the first position information of the get-on point from the result list after the preset duration.
The embodiment of the disclosure also discloses a naming device for the boarding points, comprising: the relevant point determining module is used for determining a preset number of relevant points relevant to the boarding point according to the first position information of the boarding point; and the naming module is used for determining the name of the boarding point according to the name of the related point.
Further, the naming module is specifically configured to: sequentially judging whether the names of all the related points accord with preset conditions according to the order of the priority of all the related points from high to low; and under the condition that the name of the current relevant point accords with the preset condition, displaying the name of the current relevant point as the name of the boarding point.
Further, the correlation point includes at least one of: the system comprises an information point and a road network point, wherein the priority of the information point is higher than that of the road network point.
Further, the naming module is further configured to: and under the condition that the names of all the related points do not meet the preset conditions, determining the names of the boarding points based on the names of the information points with the highest priority, and displaying.
Further, the judging module is specifically configured to: judging whether a result list corresponding to the key value exists in a cache by taking the name of the current relevant point as the key value; under the condition that the result list corresponding to the key value does not exist in the cache, determining that the name of the current relevant point accords with the preset condition; judging whether a first result exists in the result list or not under the condition that the result list corresponding to the key value exists in the cache, wherein the distance between second position information of the first result and first position information of the boarding point is in a preset range; under the condition that the first result exists, determining that the name of the current relevant point accords with the preset condition; and under the condition that the first result does not exist, acquiring a next relevant point with a priority lower than the current relevant point in the priority sequence, and judging whether the name of the next relevant point meets the preset condition.
Further, the method further comprises the following steps: the cache module is used for storing the first position information of the boarding point into a result list corresponding to the key value by taking the name of the current relevant point as the key value; and taking the time of storing the first position information of the get-on point into the result list as the starting time, and deleting the first position information of the get-on point from the result list after the preset duration.
The embodiment of the disclosure further provides a storage medium storing a computer program, wherein the computer program is executed by a processor to implement the steps of the method in any one of the above technical solutions.
The embodiment of the disclosure also provides an electronic device, at least comprising a memory and a processor, wherein the memory stores a computer program, and the electronic device is characterized in that the processor realizes the steps of the method in any one of the above technical schemes when executing the computer program on the memory.
The beneficial effects of the embodiment of the disclosure are that: according to the priority order from high to low, the relevant points meeting the preset conditions in a plurality of relevant points related to the boarding point are judged in sequence, the names of the relevant points are used as the names of the boarding points, and the unique names of the boarding points in a relatively close area range are guaranteed by combining with the cache hit design, so that good position distinction of users is guaranteed, the situation that the users cannot correctly arrive at the boarding points due to the fact that the boarding points with different longitudes and latitudes use the same name is reduced, and the use experience of the users is improved.
Drawings
In order to more clearly illustrate the embodiments of the present disclosure or the technical solutions in the prior art, the drawings that are required to be used in the embodiments or the description of the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments described in the present disclosure, and other drawings may be obtained according to these drawings without inventive effort to a person of ordinary skill in the art.
FIG. 1 is a flow chart of a naming method of a get-on point in a first embodiment of the present disclosure;
fig. 2 is a flowchart for determining whether the names of related points meet a preset condition in a first embodiment of the present disclosure;
fig. 3 is a schematic structural diagram of a naming device of a get-on point in a second embodiment of the present disclosure;
FIG. 4 is a schematic diagram of another configuration of a naming apparatus for get-on points according to a second embodiment of the present disclosure;
fig. 5 is a schematic structural diagram of an electronic device according to a fourth embodiment of the present disclosure.
Detailed Description
Various aspects and features of the disclosure are described herein with reference to the drawings.
It should be understood that various modifications may be made to the embodiments of the application herein. Therefore, the above description should not be taken as limiting, but merely as exemplification of the embodiments. Other modifications within the scope and spirit of this disclosure will occur to persons of ordinary skill in the art.
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments of the disclosure and, together with a general description of the disclosure given above and the detailed description of the embodiments given below, serve to explain the principles of the disclosure.
These and other characteristics of the present disclosure will become apparent from the following description of a preferred form of embodiment, given as a non-limiting example, with reference to the accompanying drawings.
It should also be understood that, although the present disclosure has been described with reference to some specific examples, a person skilled in the art will certainly be able to achieve many other equivalent forms of the present disclosure, having the characteristics as set forth in the claims and hence all coming within the field of protection defined thereby.
The above and other aspects, features and advantages of the present disclosure will become more apparent in light of the following detailed description when taken in conjunction with the accompanying drawings.
Specific embodiments of the present disclosure will be described hereinafter with reference to the accompanying drawings; however, it is to be understood that the disclosed embodiments are merely examples of the disclosure, which may be embodied in various forms. Well-known and/or repeated functions and constructions are not described in detail to avoid obscuring the disclosure in unnecessary or unnecessary detail. Therefore, specific structural and functional details disclosed herein are not intended to be limiting, but merely serve as a basis for the claims and as a representative basis for teaching one skilled in the art to variously employ the present disclosure in virtually any appropriately detailed structure.
The specification may use the word "in one embodiment," "in another embodiment," "in yet another embodiment," or "in other embodiments," which may each refer to one or more of the same or different embodiments in accordance with the disclosure.
The first embodiment of the present disclosure provides a method for naming a get-on point, which is mainly applied to a situation that a user needs to select a get-on point to use a network for a taxi, and a flowchart of the method is shown in fig. 1, and mainly includes steps S101 to S102:
s101, determining a preset number of related points related to the boarding point according to first position information of the boarding point;
s102, determining the name of the boarding point according to the name of the relevant point.
In actual use, the user may determine a boarding point currently desired to be ridden by a drag-and-drop manner, a manual input manner, or a global positioning system (GPS, global Positioning System) positioning manner, and determine the longitude and latitude of the boarding point as the first location information. After the first position information is determined, naming operation of the getting-on point can be performed, firstly, a preset number of relevant points related to the getting-on point are determined according to the first position information of the getting-on point, wherein the relevant points are mainly information points (POI points) or road points which are close to the getting-on point, the number of the relevant points which are obtained specifically is generally determined according to the actual situation of the information points or the road points which are close to the getting-on point, and in general, when the server of the network taxi software or the navigation software obtains the relevant points, at least two POI points which are closest to the getting-on point and one road point which is closest to the getting-on point are determined, and when no POI point or less than two POI points exist near the getting-on point, more road points can be obtained, and vice versa.
After the relevant points related to the get-on point are acquired, the get-on point name can be determined according to the names of the relevant points. Specifically, the name of the closest related point to the getting-on point may be used as the name of the getting-on point, or the name of the highest-rank related point among the above-described plurality of related points may be used as the name of the getting-on point. In this embodiment, when determining the roll-up call according to the names of the relevant points, firstly, sequentially judging whether the names of all relevant points meet the preset conditions according to the order of the priorities of all relevant points from high to low; and then, under the condition that the name of the current relevant point accords with the preset condition, displaying the name of the current relevant point as the name of the boarding point.
It should be understood that, when all relevant points are ranked from high to low according to the priority of each relevant point, the priority of the POI points is higher than the priority of the road network points, and the priority between the POI points is determined according to the distance between the road network points and the boarding points, the frequency of using the POI points, the grade of the POI points and other factors. In this embodiment, the closer to the get-on point, the higher the priority of the POI point is, for example, the distance between the point a and the get-on point is 50 meters, and the distance between the point B and the get-on point is 45 meters, then the priority of the point B is higher than that of the point a; the higher the use frequency of the POI point is, the higher the priority is, for example, the use frequency of the point A serving as the getting-on point is 5 times, the use frequency of the point B is 8 times, and the priority of the point B is higher than that of the point A; the higher the level of the POI point is, the higher the priority is, for example, the point A is a subway front door station, which is a secondary information point, the point B is a C outlet of the subway front door station, which is a tertiary information point, and compared with the point A, the position described by the point B is easier to find, so the priority of the point B is higher than that of the point A; in actual use, a weight score can be set for the judgment factor of each priority of the POI points, and finally the priority ranking among the POI points is determined according to the weight score.
After the priority of each relevant point is determined, judging whether the name of each relevant point accords with preset conditions or not sequentially from the relevant point with highest priority to the low priority, directly using the name of the relevant point with highest priority as the name of the previous point to display under the condition that the name of the relevant point with highest priority accords with the preset conditions, judging whether the name of the relevant point with next highest priority accords with the preset conditions or not under the condition that the name of the relevant point with highest priority does not accord with the preset conditions, and displaying the name of the relevant point with next highest priority as the name of the previous point under the condition that the name of the relevant point with next highest priority accords with the preset conditions or not, and judging whether the name of the relevant point with next highest priority accords with the preset conditions or not under the condition that the name of the relevant point with next highest priority does not accord with the preset conditions or not until the name of the relevant point accords with the preset conditions. If the names of all the related points do not meet the preset conditions, naming the getting-on point based on the name of the related point with the highest priority, for example, taking the name of the related point with the highest priority as a main body, and adding a suffix number behind the main body according to the arrival order of the user request so as to distinguish the positions of different getting-on points, such as a subway X station C outlet-1, a subway X station C outlet-2 and the like.
The determination of whether the name of the relevant point meets the preset condition is mainly determined according to whether a hit result exists in the cache, and the flowchart is shown in fig. 2. Specifically, a result list with a relevant point name as a key value and position information of the current use name as a result is cached in a cache, when judging whether the name of the current relevant point meets a preset condition, the name of the current relevant point is firstly used as the key value, whether the result list corresponding to the key value exists in the cache is inquired, if the result list corresponding to the key value does not exist in the cache, the fact that the name of the relevant point is used as the get-on point name by the current no get-on point is proved, the situation that the name of the get-on point is repeated does not occur, at this time, the name of the current relevant point meets the preset condition, namely the name of the relevant point is used as the get-on point name, and the judgment of the subsequent relevant point is stopped; under the condition that a result list corresponding to a key value exists in a cache, the fact that other get-on points currently use the names of the related points as names is indicated, in order to avoid that two different positions use the same names in a relatively close geographical range, whether a first result exists in the result list is judged, wherein the distance between second position information corresponding to the first result and first position information of the get-on points is in a preset range, the preset range is preferably set to be 500 meters to 1000 meters, namely, the distance between the first result and the get-on points is greater than 500 meters and smaller than 1000 meters, wherein 500 meters is the limit distance that a user is willing to reach the get-on points in a walking mode when selecting the get-on points, namely, the user can get-on points in a walking mode, the two positions with the distance of more than 1000 meters cannot be called two points with relatively close distances, at the moment, even if the two positions use the same name user usually cannot generate relatively large points, the same name is used, the two positions are different in the preset range, namely, the two positions with the distance between the first position information and the second position information are located in the range of 500 meters are located, namely, the distance between the two positions is not equal to the preset points, the preset name is lower than 500 meters, the name is required, the user can be judged to have the related name, and the related names in the current condition when the two positions are different from the preset points, and the user has the same priority, and the name; if the first result does not exist in the result list, the name of the current relevant point is determined to be in accordance with the preset condition, and the name of the current relevant point can be used as the name of the get-on point.
Further, in order to avoid that the subsequent get-on point uses the same name as the current get-on point, after determining to use the name of the current related point as the name of the get-on point for display, the name of the current related point is used as a key value, and the first position information of the current get-on point is stored in a result list corresponding to the key value; in general, after a user calls a network about car, the network about car can be driven within a few minutes, after the network about car is driven, the on-car roll names used by the user can be released for other position information to use, so that after the first position information of the current on-car point is stored in a result list corresponding to a key value, the time of storing the first position information of the current on-car point in the result list is taken as the starting time, the first position information is deleted from the result list after a preset time period passes, and the preset time period in the embodiment can be set as the average on-car driving time of a network about car driver, such as 1 minute, 3 minutes, 5 minutes and the like, and the network about car is specifically set according to practical conditions.
When the naming method provided in this embodiment is actually used, when the relevant point related to the get-on point is obtained, firstly, according to the position information of the get-on point, the relevant point with the highest priority is obtained to judge whether the preset condition is met, and when the name of the relevant point with the highest priority does not meet the preset condition, the next relevant point is obtained according to the position information of the get-on point to judge whether the preset condition is met, if the name of the relevant point with the highest priority already meets the preset condition, other relevant points do not need to be obtained, so that the calculation amount of the data acquisition quantity to reduce the priority can be reduced.
According to the embodiment of the disclosure, the related points meeting the preset conditions in the plurality of related points related to the boarding point are sequentially judged according to the order of the priority from high to low, the names of the related points are used as the names of the boarding points, and the unique names of the boarding points in a relatively close area range are ensured by combining with the cache hit design, so that good position distinction of users is ensured, the situation that the users cannot correctly arrive at the boarding points due to the fact that the boarding points with different longitudes and latitudes use the same name is reduced, and the use experience of the users is improved.
The second embodiment of the present disclosure provides a naming device for boarding points, which is mainly applied to a server of network taxi-taking software or navigation software, and is used for real-time naming of boarding points fed back by a user, and the structural schematic diagram is shown in fig. 3, and mainly includes: a related point determining module 10, configured to determine a preset number of related points related to the get-on point according to the first position information of the get-on point; the naming module 20 is coupled to the relevant point determining module 10 for determining the name of the boarding point according to the name of the relevant point.
In actual use, the user can determine the boarding point of the current hope of taking the bus through a drawing mode, a manual input mode or a GPS positioning mode, and determine the longitude and the latitude of the boarding point as first position information. After the first position information is determined, the naming device may perform a naming operation on the get-on point, firstly, according to the first position information of the get-on point, a preset number of related points related to the get-on point are determined by the related point determining module 10, where the related points are mainly POI points or road points with a relatively short distance from the get-on point, and the number of related points that are specifically obtained is generally determined according to the actual situation of information points or road points near the get-on point, and in general, when obtaining the related points, a server of the network bus tie software or navigation software determines at least two POI points closest to the get-on point and one road point closest to the get-on point, and when there are no POI points or less than two POI points near the get-on point, more road points may be obtained, and vice versa.
After the related point determining module 10 obtains the preset number of related points, the naming module 20 may determine the roll call name according to the names of the related points. Specifically, the naming module 20 may use the name of the closest relevant point to the getting-on point as the name of the getting-on point, or may use the name of the highest-ranking relevant point among the above-mentioned multiple relevant points as the name of the getting-on point. In this embodiment, when the naming module 20 determines the name of the get-on roll according to the names of the relevant points, it sequentially determines whether the name of each relevant point meets the preset condition according to the order of the priority of all the relevant points from high to low; and then, under the condition that the name of the current relevant point accords with the preset condition, displaying the name of the current relevant point as the name of the boarding point.
It should be understood that the naming module 20 sorts all relevant points according to the priority of each relevant point from high to low, wherein the priority of POI points is higher than that of road points, and the priority between POI points is determined according to the distance between the points and the getting-on point, the frequency of using the POI points, the grade of the POI points, and the like. In this embodiment, the higher the priority of the POI point which is closer to the boarding point is set, the higher the use frequency of the POI point is, the higher the priority is, and the higher the grade of the POI point is; in actual use, a weight score can be set for the judgment factor of each priority of the POI points, and finally the priority ranking among the POI points is determined according to the weight score.
After determining the priority of each relevant point, the naming module 20 sequentially determines, according to the order from high to low, whether the name of each relevant point meets the preset condition from the relevant point with highest priority, if the name of the relevant point with highest priority meets the preset condition, the naming module 20 directly uses the name of the relevant point with highest priority as the name of the boarding point to display, and then other relevant points do not need to be determined, if the name of the relevant point with highest priority does not meet the preset condition, the naming module 20 again determines whether the name of the relevant point with next highest priority meets the preset condition, and if the name of the relevant point with next highest priority meets the preset condition, the naming module 20 displays the name of the boarding point with next highest priority as the name of the boarding point, and does not determine whether the names of the relevant points with next highest priority meet the preset condition, if the names of the relevant points with next highest priority do not meet the preset condition, and then determines whether the names of the relevant points with next highest priority meet the preset condition until the preset condition exists. If the names of all the related points do not meet the preset condition, the naming module 20 names the getting-on point based on the name of the related point with the highest priority, for example, the name of the related point with the highest priority is taken as a main body, and suffix numbers are added behind the main body according to the arrival order of the user request so as to distinguish the positions of different getting-on points.
The naming module 20 determines whether the name of the relevant point meets the preset condition mainly according to whether the hit result exists in the cache. Specifically, the cache has a result list with a key value corresponding to a relevant point, and the location information of the current use name is taken as a result, when the naming module 20 judges whether the name of the current relevant point meets a preset condition, the name of the current relevant point is firstly taken as the key value, whether the result list corresponding to the key value exists in the cache is queried, if the result list corresponding to the key value does not exist in the cache, the fact that the name of the relevant point is used as the get-on point name is proved to be not used by the current get-on point, the situation that the name of the get-on point is repeated does not occur, at this time, the naming module 20 can determine that the name of the current relevant point meets the preset condition, namely the name of the relevant point can be used as the get-on point name, and stop the judgment of the subsequent relevant point; under the condition that a result list corresponding to a key value exists in a cache, the fact that other boarding points currently use the name of the relevant point as a name is indicated, whether a first result exists in the result list or not is judged in order to avoid the fact that two different positions use the same name in a relatively close geographic range, wherein the distance between second position information corresponding to the first result and first position information of the boarding points is in a preset range, the preset range is preferably set to be 500 meters to 1000 meters, under the condition that the first result exists in the result list, the fact that the name of the current relevant point does not accord with preset conditions is determined, at the moment, the next relevant point with priority lower than that of the current relevant point in a priority sequence can be obtained, and whether the name accords with the preset conditions or not is judged; if the first result does not exist in the result list, the name of the current relevant point is determined to be in accordance with the preset condition, and the name of the current relevant point can be used as the name of the get-on point.
Further, the naming apparatus may further include a cache module 30 coupled to the naming module 20, and the naming apparatus is schematically shown in fig. 4. In order to avoid that the subsequent get-on point uses the same name as the current get-on point, after determining to use the name of the current related point as the name of the get-on point for display, the cache module 30 uses the name of the current related point as a key value, and stores the first position information of the current get-on point into a result list corresponding to the key value; in general, after a user calls a network about car, the network about car can be driven within a few minutes, after the network about car is driven, the roll call of the on-car used by the user can be released for other position information to use, so after the first position information of the current on-car point is stored in a result list corresponding to a key value, the time of storing the first position information of the current on-car point in the result list is taken as the starting time, and after a preset time period, the buffer module 30 deletes the first position information of the current on-car point from the result list, the preset time period in the embodiment can be set as the average driving time of a network about car driver, such as1 minute, 3 minutes, 5 minutes and the like, and the time is specifically set according to practical situations.
In practical use, when the related point obtaining module 10 obtains the related point related to the get-on point, firstly, according to the position information of the get-on point, the related point with the highest priority is obtained to judge whether the related point meets the preset condition, and when the name of the related point with the highest priority does not meet the preset condition, the next related point is obtained according to the position information of the get-on point to judge whether the related point meets the preset condition, if the name of the related point with the highest priority already meets the preset condition, other related points are not required to be obtained, so that the calculation amount of the data obtaining quantity to reduce the priority can be reduced.
According to the embodiment of the disclosure, the related points meeting the preset conditions in the plurality of related points related to the boarding point are sequentially judged according to the order of the priority from high to low, the names of the related points are used as the names of the boarding points, and the unique names of the boarding points in a relatively close area range are ensured by combining with the cache hit design, so that good position distinction of users is ensured, the situation that the users cannot correctly arrive at the boarding points due to the fact that the boarding points with different longitudes and latitudes use the same name is reduced, and the use experience of the users is improved.
A third embodiment of the present disclosure provides a storage medium, which is a computer-readable medium storing a computer program that, when executed by a processor, implements the method provided by any embodiment of the present disclosure, including steps S11 and S12 as follows:
S11, determining a preset number of relevant points related to the boarding point according to the first position information of the boarding point;
s12, determining the name of the boarding point according to the name of the relevant point.
When the computer program is executed by the processor to determine the name of the boarding point according to the name of the relevant point, the specific steps are executed by the processor as follows: sequentially judging whether the name of each relevant point accords with a preset condition according to the order of the priority of all relevant points from high to low; and under the condition that the name of the current relevant point accords with the preset condition, displaying the name of the current relevant point as the name of the boarding point.
Specifically, the relevant points include at least one of: the information points and the road points, wherein the priority of the information points is higher than that of the road points.
The computer program is executed by the processor, and when the name of the current relevant point meets the preset condition, the name of the current relevant point is displayed as the name of the boarding point, and then the processor further executes the following steps: and under the condition that the names of all the related points do not meet the preset conditions, determining the names of the boarding points based on the names of the related points with the highest priority, and displaying.
When the computer program is executed by the processor to judge whether the name of each related point accords with the preset condition, the specific executed steps are as follows: judging whether a result list corresponding to the key value exists in the cache by taking the name of the current relevant point as the key value; under the condition that a result list corresponding to the key value does not exist in the cache, determining that the name of the current relevant point accords with a preset condition; judging whether a first result exists in a result list or not under the condition that a result list corresponding to the key value exists in a cache, wherein the distance between second position information of the first result and first position information of a boarding point is in a preset range; under the condition that the first result does not exist, determining that the name of the current relevant point accords with a preset condition; and under the condition that a first result exists, determining that the name of the current relevant point does not accord with a preset condition, acquiring the next relevant point with the priority lower than the current relevant point in the priority sequence, and judging whether the name of the next relevant point accords with the preset condition.
After the computer program is executed by the processor to display the name of the current relevant point as the name of the get-on point, the following steps are further executed by the processor: the name of the current relevant point is used as a key value, and the first position information of the boarding point is stored in a result list corresponding to the key value; and taking the time of storing the first position information of the boarding point into the result list as the starting time, and deleting the first position information of the boarding point from the result list after the preset duration.
According to the embodiment of the disclosure, the related points meeting the preset conditions in the plurality of related points related to the boarding point are sequentially judged according to the order of the priority from high to low, the names of the related points are used as the names of the boarding points, and the unique names of the boarding points in a relatively close area range are ensured by combining with the cache hit design, so that good position distinction of users is ensured, the situation that the users cannot correctly arrive at the boarding points due to the fact that the boarding points with different longitudes and latitudes use the same name is reduced, and the use experience of the users is improved.
A fourth embodiment of the present disclosure provides an electronic device, which may include at least a memory 100 and a processor 200, as shown in fig. 5, where the memory 100 stores a computer program, and the processor 200 implements the method provided by any embodiment of the present disclosure when executing the computer program on the memory 100. Exemplary, electronic device computer program steps are as follows S21 and S22:
S21, determining a preset number of relevant points related to the boarding point according to the first position information of the boarding point;
s22, determining the name of the boarding point according to the name of the relevant point.
The processor, when executing the name of the get-on point stored on the memory according to the name of the related point, specifically executes the following computer program: sequentially judging whether the name of each relevant point accords with a preset condition according to the order of the priority of all relevant points from high to low; and under the condition that the name of the current relevant point accords with the preset condition, displaying the name of the current relevant point as the name of the boarding point.
Specifically, the relevant points include at least one of: the information points and the road points, wherein the priority of the information points is higher than that of the road points.
The processor further executes the following computer program after displaying the name of the current relevant point as the name of the get-on point under the condition that the name of the current relevant point stored in the execution memory meets the preset condition: and under the condition that the names of all the related points do not meet the preset conditions, determining the names of the boarding points based on the names of the related points with the highest priority, and displaying.
When the processor executes the names of the related points stored in the memory and judges whether the names of the related points meet preset conditions in sequence, the processor specifically executes the following computer program: judging whether a result list corresponding to the key value exists in the cache by taking the name of the current relevant point as the key value; under the condition that a result list corresponding to the key value does not exist in the cache, determining that the name of the current relevant point accords with a preset condition; judging whether a first result exists in a result list or not under the condition that a result list corresponding to the key value exists in a cache, wherein the distance between second position information of the first result and first position information of a boarding point is in a preset range; under the condition that the first result does not exist, determining that the name of the current relevant point accords with a preset condition; and under the condition that a first result exists, determining that the name of the current relevant point does not accord with a preset condition, acquiring the next relevant point with the priority lower than the current relevant point in the priority sequence, and judging whether the name of the next relevant point accords with the preset condition.
After executing the display of the name of the current relevant point stored on the memory as the name of the get-on point, the processor also executes the following computer program: the name of the current relevant point is used as a key value, and the first position information of the boarding point is stored in a result list corresponding to the key value; and taking the time of storing the first position information of the boarding point into the result list as the starting time, and deleting the first position information of the boarding point from the result list after the preset duration.
According to the embodiment of the disclosure, the related points meeting the preset conditions in the plurality of related points related to the boarding point are sequentially judged according to the order of the priority from high to low, the names of the related points are used as the names of the boarding points, and the unique names of the boarding points in a relatively close area range are ensured by combining with the cache hit design, so that good position distinction of users is ensured, the situation that the users cannot correctly arrive at the boarding points due to the fact that the boarding points with different longitudes and latitudes use the same name is reduced, and the use experience of the users is improved.
In some embodiments, the clients, servers may communicate using any currently known or future developed network protocol, such as HTTP (HyperText Transfer Protocol ), and may be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a Local Area Network (LAN), a Wide Area Network (WAN), the internet (e.g., the internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future developed networks.
The storage medium may be contained in the electronic device; or may exist alone without being incorporated into the electronic device.
The storage medium carries one or more programs that, when executed by the electronic device, cause the electronic device to: acquiring at least two internet protocol addresses; sending a node evaluation request comprising at least two internet protocol addresses to node evaluation equipment, wherein the node evaluation equipment selects an internet protocol address from the at least two internet protocol addresses and returns the internet protocol address; receiving an Internet protocol address returned by node evaluation equipment; wherein the acquired internet protocol address indicates an edge node in the content distribution network.
Or the storage medium carries one or more programs that, when executed by the electronic device, cause the electronic device to: receiving a node evaluation request comprising at least two internet protocol addresses; selecting an internet protocol address from at least two internet protocol addresses; returning the selected internet protocol address; wherein the received internet protocol address indicates an edge node in the content distribution network.
Computer program code for carrying out operations of the present disclosure may be written in one or more programming languages, including, but not limited to, an object oriented programming language such as Java, smalltalk, C ++ and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (for example, through the Internet using an Internet service provider).
It should be noted that the storage medium described in the present disclosure may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this disclosure, a computer-readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present disclosure, however, the computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any storage medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a storage medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, fiber optic cables, RF (radio frequency), and the like, or any suitable combination of the foregoing.
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units involved in the embodiments of the present disclosure may be implemented by means of software, or may be implemented by means of hardware. Wherein the names of the units do not constitute a limitation of the units themselves in some cases.
The functions described above herein may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: a Field Programmable Gate Array (FPGA), an Application Specific Integrated Circuit (ASIC), an Application Specific Standard Product (ASSP), a system on a chip (SOC), a Complex Programmable Logic Device (CPLD), and the like.
In the context of this disclosure, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. The machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
The foregoing description is only of the preferred embodiments of the present disclosure and description of the principles of the technology being employed. It will be appreciated by persons skilled in the art that the scope of the disclosure referred to in this disclosure is not limited to the specific combinations of features described above, but also covers other embodiments which may be formed by any combination of features described above or equivalents thereof without departing from the spirit of the disclosure. Such as those described above, are mutually substituted with the technical features having similar functions disclosed in the present disclosure (but not limited thereto).
Moreover, although operations are depicted in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order. In certain circumstances, multitasking and parallel processing may be advantageous. Likewise, while several specific implementation details are included in the above discussion, these should not be construed as limiting the scope of the present disclosure. Certain features that are described in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination.
Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are example forms of implementing the claims.
While various embodiments of the present disclosure have been described in detail, the present disclosure is not limited to these specific embodiments, and various modifications and embodiments can be made by those skilled in the art on the basis of the concepts of the present disclosure, and these modifications and modifications should be within the scope of the present disclosure as claimed.
Claims (12)
1. The method for naming the boarding point is characterized by comprising the following steps of:
determining a preset number of related points related to the get-on point according to the first position information of the get-on point;
sequentially judging whether the name of each relevant point accords with a preset condition according to the priority order of all relevant points from high to low and whether hit results exist in a cache;
and under the condition that the name of the current relevant point accords with the preset condition, displaying the name of the current relevant point as the name of the boarding point.
2. The naming method of claim 1 wherein the relevant points include at least one of: the system comprises an information point and a road network point, wherein the priority of the information point is higher than that of the road network point.
3. The naming method according to claim 2, wherein, in the case where the name of the current relevant point meets the preset condition, after displaying the name of the current relevant point as the name of the boarding point, further comprising:
And under the condition that the names of all the related points do not meet the preset conditions, determining the names of the boarding points based on the names of the related points with the highest priority, and displaying.
4. The naming method according to claim 1, wherein said sequentially determining whether the name of each of the related points meets a preset condition comprises:
Judging whether a result list corresponding to the key value exists in a cache by taking the name of the current relevant point as the key value;
under the condition that the result list corresponding to the key value does not exist in the cache, determining that the name of the current relevant point accords with the preset condition;
Judging whether a first result exists in the result list or not under the condition that the result list corresponding to the key value exists in the cache, wherein the distance between second position information of the first result and first position information of the boarding point is in a preset range;
Under the condition that the first result does not exist, determining that the name of the current relevant point accords with the preset condition;
and under the condition that the first result exists, determining that the name of the current relevant point does not accord with the preset condition, acquiring the next relevant point with the priority lower than the current relevant point in the priority sequence, and judging whether the name of the next relevant point accords with the preset condition.
5. The naming method of claim 4, wherein after displaying the name of the current relevant point as the name of the get-on point, further comprising:
taking the name of the current relevant point as a key value, and storing the first position information of the boarding point into a result list corresponding to the key value;
and taking the time of storing the first position information of the get-on point into the result list as the starting time, and deleting the first position information of the get-on point from the result list after the preset duration.
6. A naming device for a boarding point, comprising:
The relevant point determining module is used for determining a preset number of relevant points relevant to the boarding point according to the first position information of the boarding point;
The naming module is used for judging whether the name of each relevant point accords with a preset condition according to the sequence from high priority to low priority of all relevant points and whether hit results exist in the cache; and displaying the name of the current relevant point as the name of the boarding point under the condition that the name of the current relevant point accords with the preset condition.
7. The naming apparatus of claim 6, wherein the relevant points include at least one of: the system comprises an information point and a road network point, wherein the priority of the information point is higher than that of the road network point.
8. The naming apparatus of claim 7, wherein the naming module is further configured to: and under the condition that the names of all the related points do not meet the preset conditions, determining the names of the boarding points based on the names of the information points with the highest priority, and displaying.
9. Naming apparatus as defined in claim 6, wherein the naming module is specifically configured to:
Judging whether a result list corresponding to the key value exists in a cache by taking the name of the current relevant point as the key value;
under the condition that the result list corresponding to the key value does not exist in the cache, determining that the name of the current relevant point accords with the preset condition;
Judging whether a first result exists in the result list or not under the condition that the result list corresponding to the key value exists in the cache, wherein the distance between second position information of the first result and first position information of the boarding point is in a preset range;
under the condition that the first result exists, determining that the name of the current relevant point accords with the preset condition;
And under the condition that the first result does not exist, acquiring a next relevant point with a priority lower than the current relevant point in the priority sequence, and judging whether the name of the next relevant point meets the preset condition.
10. The naming apparatus of claim 9, further comprising:
The cache module is used for storing the first position information of the boarding point into a result list corresponding to the key value by taking the name of the current relevant point as the key value; and taking the time of storing the first position information of the get-on point into the result list as the starting time, and deleting the first position information of the get-on point from the result list after the preset duration.
11. A storage medium storing a computer program, which when executed by a processor performs the steps of the method according to any one of claims 1 to 5.
12. An electronic device comprising at least a memory, a processor, the memory having stored thereon a computer program, characterized in that the processor, when executing the computer program on the memory, implements the steps of the method according to any of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911365067.4A CN111813817B (en) | 2019-12-26 | 2019-12-26 | Method and device for naming boarding points, storage medium and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911365067.4A CN111813817B (en) | 2019-12-26 | 2019-12-26 | Method and device for naming boarding points, storage medium and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111813817A CN111813817A (en) | 2020-10-23 |
| CN111813817B true CN111813817B (en) | 2024-08-02 |
Family
ID=72844519
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911365067.4A Active CN111813817B (en) | 2019-12-26 | 2019-12-26 | Method and device for naming boarding points, storage medium and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111813817B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2016116048A1 (en) * | 2015-01-20 | 2016-07-28 | 北京嘀嘀无限科技发展有限公司 | Information providing system and method for on-demand service |
| WO2019024078A1 (en) * | 2017-08-04 | 2019-02-07 | Beijing Didi Infinity Technology And Development Co., Ltd. | Methods and systems for naming a pick up location |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP4692644B2 (en) * | 2009-01-30 | 2011-06-01 | 富士ゼロックス株式会社 | Information processing program and information processing apparatus |
| JP6732675B2 (en) * | 2017-02-09 | 2020-07-29 | 株式会社トヨタマップマスター | Map creation device, map creation method and program, recording medium |
| CN109425351B (en) * | 2017-08-24 | 2022-02-15 | 北京嘀嘀无限科技发展有限公司 | Travel processing method and device |
| CN109062928A (en) * | 2018-06-11 | 2018-12-21 | 北京嘀嘀无限科技发展有限公司 | A kind of method and system that prompt recommendation is got on the bus a little |
| CN110533081B (en) * | 2019-08-07 | 2025-05-27 | 北京三快在线科技有限公司 | A method, device, equipment and storage medium for determining boarding point information |
-
2019
- 2019-12-26 CN CN201911365067.4A patent/CN111813817B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2016116048A1 (en) * | 2015-01-20 | 2016-07-28 | 北京嘀嘀无限科技发展有限公司 | Information providing system and method for on-demand service |
| WO2019024078A1 (en) * | 2017-08-04 | 2019-02-07 | Beijing Didi Infinity Technology And Development Co., Ltd. | Methods and systems for naming a pick up location |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111813817A (en) | 2020-10-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3683548B1 (en) | Road matching-based positioning method, chip subsystem and electronic device | |
| CN108765933B (en) | Method, device, equipment and storage medium for recommending boarding points | |
| CN108133619B (en) | Parking lot parking prediction method and device, storage medium and terminal equipment | |
| US6701251B2 (en) | Method and system for providing multiple beginning maneuvers for navigation of a vehicle | |
| CN107491825B (en) | Taxi booking processing method and system | |
| US20150012510A1 (en) | Point of interest database maintenance system | |
| CN107767206B (en) | Order allocation method and device | |
| AU2014362392A1 (en) | Intelligent queuing for user selection in providing on-demand services | |
| CN111814070B (en) | Method, system, storage medium and electronic device for recommending boarding point | |
| WO2024146201A1 (en) | Parking space recommendation method and apparatus, and vehicle and storage medium | |
| CN108537352A (en) | A kind of data processing method, device and server | |
| CN113607182A (en) | Vehicle driving route navigation method and device, storage medium and terminal | |
| CN111737601A (en) | Recommended method, device, device and storage medium for travel strategy | |
| US20020067728A1 (en) | Route guidance service using the internet | |
| CN113380037A (en) | Traffic information acquisition method and device | |
| CN114500428B (en) | Navigation sharing method and device, electronic equipment, storage medium | |
| CN111813817B (en) | Method and device for naming boarding points, storage medium and electronic equipment | |
| US20220101209A1 (en) | Information processing device, information processing system, and method of information processing | |
| JP2006170759A (en) | Method, device, and system for managing reserved object | |
| CN106895842A (en) | A kind of method of vehicle route amendment, car-mounted terminal and intelligent automobile | |
| CN106895843A (en) | A kind of method of vehicle routing plan, car-mounted terminal and intelligent automobile | |
| CN117928586A (en) | Public transport travel path determining method, device, equipment and storage medium | |
| JP2020149124A (en) | Program and information processing method | |
| CN111695920B (en) | Tourist attraction recommendation system and method of automobile leasing platform and electronic equipment | |
| CN111242331B (en) | Information processing method and device |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TG01 | Patent term adjustment | ||
| TG01 | Patent term adjustment |