CN111813817A - Method and device for naming boarding point, storage medium and electronic equipment - Google Patents
Method and device for naming boarding point, storage medium and electronic equipment Download PDFInfo
- Publication number
- CN111813817A CN111813817A CN201911365067.4A CN201911365067A CN111813817A CN 111813817 A CN111813817 A CN 111813817A CN 201911365067 A CN201911365067 A CN 201911365067A CN 111813817 A CN111813817 A CN 111813817A
- Authority
- CN
- China
- Prior art keywords
- point
- name
- points
- relevant
- boarding
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 35
- 238000004590 computer program Methods 0.000 claims description 23
- 238000013461 design Methods 0.000 abstract description 6
- 238000010586 diagram Methods 0.000 description 9
- 230000006870 function Effects 0.000 description 6
- 230000003287 optical effect Effects 0.000 description 6
- 238000011156 evaluation Methods 0.000 description 5
- 238000012986 modification Methods 0.000 description 4
- 230000004048 modification Effects 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- 230000004075 alteration Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 239000013307 optical fiber Substances 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR 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; CALCULATING OR 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; CALCULATING OR 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; CALCULATING OR 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)
- Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- General Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Computational Linguistics (AREA)
- Business, Economics & Management (AREA)
- General Business, Economics & Management (AREA)
- Tourism & Hospitality (AREA)
- Strategic Management (AREA)
- Primary Health Care (AREA)
- Marketing (AREA)
- Human Resources & Organizations (AREA)
- Remote Sensing (AREA)
- General Health & Medical Sciences (AREA)
- Economics (AREA)
- Health & Medical Sciences (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Navigation (AREA)
Abstract
The disclosure provides a naming method and device of a boarding point, a storage medium and electronic equipment, wherein the method comprises the following steps: determining a preset number of related points related to the boarding points according to the first position information of the boarding points; and determining the name of the boarding point according to the name of the related point. According to the method, the relevant points which accord with the preset conditions in the multiple relevant points relevant to the vehicle-entering point are sequentially judged according to the sequence of the priorities from high to low, the names of the relevant points are used as the names of the vehicle-entering points, and the unique names of the vehicle-entering points in a near area range are guaranteed by combining the design of cache hit, so that the user is guaranteed to well distinguish the positions, the situation that the user cannot correctly reach the vehicle-entering points due to the fact that the vehicle-entering points with different longitudes and latitudes use the same name is reduced, and the use experience of the user is improved.
Description
Technical Field
The present disclosure relates to the field of mobile internet, and in particular, to a method and an apparatus for naming a boarding point, a storage medium, and an electronic device.
Background
In the use process of the network booking software or the navigation software, before calling a vehicle for receiving, a user usually selects a boarding Point according to the position of the user, and the software gives a name to the boarding Point through Point of Interest (POI) data or road network data near the position according to the current position of the user. However, the POI data or road network data depended on by the naming service may have different densities and the points of the boarding points may have different densities, so that multiple boarding points which are close in distance but different in actual longitude and latitude may use the same name for naming, which causes confusion when a user uses the system and reduces the user experience.
Disclosure of Invention
An object of the embodiments of the present disclosure is to provide a method and an apparatus for naming a boarding point, a storage medium, and an electronic device, so as to solve the problems that names named among a plurality of boarding points that are closer to each other in the prior art are the same, which causes confusion when a user uses the device, and reduces use experience.
In order to solve the technical problem, the embodiment of the present disclosure adopts the following technical solutions: a method for naming a boarding point comprises the following steps: determining a preset number of related points related to the boarding points according to first position information of the boarding points; 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 name of each relevant point meets a preset condition or not according to the sequence of the priorities 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.
Further, the correlation points include at least one of: the system comprises information points and routing points, wherein the priority of the information points is higher than that of the routing points.
Further, when the name of the current relevant point meets the preset condition, after the name of the current relevant point is displayed as the name of the boarding point, the method further includes: and under the condition that the names of all the relevant points do not accord with the preset conditions, determining the name of the boarding point to display based on the name of the relevant point with the highest priority.
Further, the sequentially judging whether the name of each relevant point meets a preset condition includes: judging whether a result list corresponding to the key value exists in a cache or not by taking the name of the current relevant point as the key value; determining that the name of the current relevant point meets the preset condition under the condition that the result list corresponding to the key value does not exist in the cache; under the condition that the result list corresponding to the key value exists in the cache, judging whether a first result exists in the result list or not, wherein the distance between second position information of the first result and first position information of the vehicle-entering point is in a preset range; determining that the name of the current relevant point meets the preset condition under the condition that the first result does not exist; 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 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 accords with the preset condition.
Further, after the displaying the name of the current relevant point as the name of the boarding point, the method further includes: taking the name of the current relevant point as a key value, and storing first position information of the boarding point into a result list corresponding to the key value; and taking the time for storing the first position information of the vehicle-entering point into the result list as the starting time, and deleting the first position information of the vehicle-entering point from the result list after a preset time length.
The embodiment of the present disclosure further discloses a device for naming a boarding point, including: the relevant point determining module is used for determining a preset number of relevant points relevant to the vehicle-loading point according to the first position information of the vehicle-loading 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 name of each relevant point meets a preset condition or not according to the sequence of the priorities 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.
Further, the correlation points include at least one of: the system comprises information points and routing points, wherein the priority of the information points is higher than that of the routing points.
Further, the naming module is further configured to: and under the condition that the names of all the related points do not accord with the preset conditions, determining the name of the boarding point to display based on the name of the information point with the highest priority.
Further, the determining module is specifically configured to: judging whether a result list corresponding to the key value exists in a cache or not by taking the name of the current relevant point as the key value; determining that the name of the current relevant point meets the preset condition under the condition that the result list corresponding to the key value does not exist in the cache; under the condition that the result list corresponding to the key value exists in the cache, judging whether a first result exists in the result list or not, wherein the distance between second position information of the first result and first position information of the vehicle-entering point is in a preset range; determining that the name of the current relevant point meets the preset condition under the condition that the first result exists; 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 order, and judging whether the name of the next relevant point meets the preset condition or not.
Further, still include: 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 for storing the first position information of the vehicle-entering point into the result list as the starting time, and deleting the first position information of the vehicle-entering point from the result list after a preset time length.
The embodiment of the present disclosure further provides a storage medium storing a computer program, where the computer program is executed by a processor to implement the steps of the method in any one of the above technical solutions.
An embodiment of the present disclosure further provides an electronic device, which at least includes a memory and a processor, where the memory stores a computer program, and the processor implements the steps of the method in any one of the above technical solutions when executing the computer program on the memory.
The beneficial effects of this disclosed embodiment lie in: according to the priority from high to low, the related points which accord with the preset conditions in the multiple related points related to the vehicle-entering point are sequentially judged, the names of the related points are used as the names of the vehicle-entering points, and the unique names of the vehicle-entering points in a relatively close area range are ensured by combining the design of cache hit, so that the user can be ensured to well distinguish the positions, the situation that the user cannot correctly reach the vehicle-entering points due to the fact that the vehicle-entering points with different longitudes and latitudes use the same name is reduced, and the use experience of the user 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 needed to be used in the description of the embodiments or the prior art will be briefly introduced below, it is obvious that the drawings in the following description are only some embodiments described in the present disclosure, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
FIG. 1 is a flow chart of a method for naming a pick-up point according to a first embodiment of the present disclosure;
fig. 2 is a flowchart illustrating a first embodiment of the present disclosure for determining whether a name of a related point meets a predetermined condition;
FIG. 3 is a schematic structural diagram of a device for naming a boarding point according to a second embodiment of the present disclosure;
fig. 4 is another schematic structural diagram of a device for naming a boarding point in a second embodiment of the present disclosure;
fig. 5 is a schematic structural diagram of an electronic device in 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 will be understood that various modifications may be made to the embodiments of the present application. Accordingly, the foregoing description should not be construed as limiting, but merely as exemplifications of embodiments. Other modifications will occur to those skilled in the art within the scope and spirit of the disclosure.
The accompanying drawings, which are incorporated in and constitute a part of the 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 preferred forms of embodiment, given as non-limiting examples, with reference to the attached drawings.
It should also be understood that, although the present disclosure has been described with reference to some specific examples, a person of skill in the art shall certainly be able to achieve many other equivalent forms of the 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 view of the following detailed description when taken in conjunction with the accompanying drawings.
Specific embodiments of the present disclosure are described hereinafter with reference to the accompanying drawings; however, it is to be understood that the disclosed embodiments are merely exemplary of the disclosure that may be embodied in various forms. Well-known and/or repeated functions and structures have not been described in detail so as not to obscure the present disclosure with unnecessary or unnecessary detail. Therefore, specific structural and functional details disclosed herein are not to be interpreted as limiting, but merely 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 phrases "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.
A first embodiment of the present disclosure provides a method for naming a boarding point, which is mainly applied to a situation where a user needs to select a boarding point for online taxi appointment, and a flowchart thereof is shown in fig. 1, and mainly includes steps S101 to S102:
s101, determining a preset number of related points related to the vehicle-entering point according to the first position information of the vehicle-entering point;
and 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 where the user currently wants to board the vehicle by a drawing method, a manual input method, or a Global Positioning System (GPS) positioning method, and determine the longitude and latitude of the boarding point as the first position information. After the first position information is determined, a naming operation of the vehicle-entering point can be performed, firstly, a preset number of relevant points relevant to the vehicle-entering point are determined according to the first position information of the vehicle-entering point, wherein the relevant points are mainly information points (POI points) or road network points which are close to the vehicle-entering point, and the number of the specifically acquired relevant points is generally determined according to actual conditions of the information points or the road network points which are close to the vehicle-entering point.
After the relevant point related to the boarding point is acquired, the name of the boarding point can be determined according to the name of the relevant point. Specifically, the name of the closest relevant point to the upper vehicle point may be used as the name of the upper vehicle point, or the name of the highest relevant point among the plurality of relevant points may be used as the name of the upper vehicle point. In this embodiment, when determining the names of the boarding points according to the names of the relevant points, firstly, sequentially judging whether the name of each relevant point meets a preset condition according to the sequence of the priorities of all relevant points from high to low; and then, under the condition that the name of the current relevant point meets 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 that of the network points, and the priority between the POI points is determined according to the distance from the vehicle-entering point, the frequency of use of the POI points, the rank of the POI points and other factors. In this embodiment, the closer to the departure point, the higher the priority of the POI point is, for example, the distance between the point a and the departure point is 50 meters, and the distance between the point B and the departure point is 45 meters, then the priority of the point B is higher than that of the point a; the higher the frequency of use of the POI points is, the higher the priority is, for example, the number of use of the point a as the boarding point is 5 times, and the number of use of the point B is 8 times, the higher the priority of the point B is than 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 and is a second-level information point, the point B is a C exit of the subway front door station and is a third-level 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 practical use, a weight score can be set for each priority decision factor of the POI points, and finally, the priority ranking among the POI points is determined according to the size of the weight score.
After the priority of each relevant point is determined, whether the name of each relevant point accords with a preset condition or not is sequentially judged from the relevant point with the highest priority according to the sequence of the priorities from high to low, the name of the relevant point with the highest priority is directly used as the name of a vehicle-entering point to be displayed under the condition that the name of the relevant point with the highest priority accords with the preset condition, other subsequent relevant points do not need to be judged, whether the name of the relevant point with the next highest priority accords with the preset condition or not is judged under the condition that the name of the relevant point with the highest priority does not accord with the preset condition, the name of the relevant point with the next highest priority is used as the name of the vehicle-entering point to be displayed under the condition that the name of the relevant point with the next highest priority accords with the preset condition or not is judged, and under the condition that the name of the relevant point with the next highest priority does not accord with the preset condition, and judging whether the name of the related point with the third highest priority accords with the preset condition or not until the name of one related point accords with the preset condition. If the names of all the related points do not meet the preset conditions, the vehicle-entering point is named 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 sequence of user requests so as to distinguish different vehicle-entering point positions, such as an exit-1 of a subway X station C, an exit-2 of the subway X station C and the like.
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 a flow chart is shown in fig. 2. Specifically, a result list which takes the name of the relevant point as a key value and takes the position information of the currently used name as a result is cached in the cache, when whether the name of the currently relevant point meets the preset condition is judged, firstly, the name of the currently relevant point is taken 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 used by the currently-absent boarding point is taken as the name of the boarding point is proved, the situation that the name of the boarding point is repeated cannot occur, at the moment, the name of the currently relevant point can be determined to meet the preset condition, namely, the name of the relevant point can be taken as the name of the boarding point, and the judgment of the; under the condition that a result list corresponding to a key value exists in a cache, it is indicated that other boarding points use the name of the relevant point as a name, in order to avoid two different positions in a closer geographical range from using the same name, 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 boarding points is within 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 boarding points is greater than 500 meters and less than 1000 meters, wherein 500 meters is a limit distance at which a user can reach the boarding points through a way of willing to walk when selecting the boarding points, namely the user can reach the named points to take a bus through a way of walking, and two positions with the distance of more than 1000 meters cannot be called as two points with the closer distance, at this time, even if the two positions use the same name, the user usually does not have great trouble, and only when the distance between the first position information and the second position information is in the range of 500 meters to 1000 meters, the use trouble of the user is caused when the two points with different positions use the same name, so that under the condition that the first result exists in the result list, the name of the current relevant point is determined not to accord with the preset condition, and at this time, the next relevant point with the priority lower than the current relevant point in the priority order can be obtained, and whether the name accords with the preset condition or not is judged; if the first result does not exist in the result list, determining that the name of the current relevant point meets the preset condition, and taking the name as the name of the boarding point.
Further, in order to avoid the use of the same name as the current boarding point by the subsequent boarding point, after the name of the current relevant point is determined to be used as the name of the boarding point for display, the name of the current relevant point is used as a key value, and the first position information of the current boarding point is stored in a result list corresponding to the key value; in a general situation, after a user calls a network car booking, the network car booking will be picked up within several minutes, and after the car booking is picked up, the name of a boarding point used by the user can be released for other position information to use, so that after the first position information of the current boarding point is stored in a result list corresponding to a key value, the time when the first position information of the current boarding point is stored in the result list is taken as the starting time, and the time is deleted from the result list after a preset time period.
In practical use of the naming method provided in this embodiment, when the related points related to the previous vehicle point are obtained, first, a related point with the highest priority is obtained according to the location information of the previous vehicle point to determine 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, a next related point is obtained according to the location information of the previous vehicle point to determine whether the related point meets the preset condition, and if the name of the related point with the highest priority already meets the preset condition, it is not necessary to obtain other related points, so that the number of data acquisition is reduced, and the calculation amount of the priority is reduced.
According to the embodiment of the invention, the relevant points which accord with the preset conditions in the multiple relevant points relevant to the vehicle-entering point are sequentially judged according to the sequence of the priorities from high to low, the names of the relevant points are used as the names of the vehicle-entering points, and the unique names of the vehicle-entering points in a near area range are ensured by combining the design of cache hit, so that the users can be ensured to carry out good position distinguishing, the situation that the users cannot correctly reach the vehicle-entering points due to the fact that the vehicle-entering points with different longitudes and latitudes use the same name is reduced, and the use experience of the users is improved.
A second embodiment of the present disclosure provides a device for naming a boarding point, which can be mainly applied to a server of network car booking software or navigation software, and is used for naming a boarding point fed back by a user in real time, where a schematic structural diagram of the device is shown in fig. 3, and the device mainly includes: a relevant point determining module 10, configured to determine a preset number of relevant points relevant to a boarding point according to first location information of the boarding 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 may determine a boarding point where the user currently wants to board a car by a drag-map method, a manual input method, or a GPS positioning method, and determine the longitude and latitude of the boarding point as the first position information. After the first location information is determined, the naming device may perform a naming operation on the boarding point, and first, according to the first location information of the boarding point, the related point determining module 10 determines a preset number of related points related to the boarding point, where the related points are mainly POI points or road network points that are closer to the boarding point, and the number of the specifically acquired related points is usually determined according to actual situations of information points or road network points near the boarding point.
After the related point determining module 10 obtains the preset number of related points, the naming module 20 may determine the names of the boarding points according to the names of the related points. Specifically, the naming module 20 may use the name of the closest related point to the upper point as the name of the upper point, or may use the name of the highest related point among the plurality of related points as the name of the upper point. In this embodiment, when the naming module 20 determines the names of the boarding points according to the names of the relevant points, it first sequentially determines whether the name of each relevant point meets the preset condition according to the order from high to low of the priority of all relevant points; and then, under the condition that the name of the current relevant point meets 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 ranks all the related points from high to low according to the priority of each related point, wherein the priority of the POI point is higher than that of the road network point, and the priority between the POI points is determined according to the distance to the upper vehicle point, the frequency of using the POI points, the rank of the POI points, and other factors. In this embodiment, it is set that the closer the POI point to the upper vehicle, the higher the frequency of use of the POI point, the higher the priority, and the higher the rank of the POI point, the higher the priority; in practical use, a weight score can be set for each priority decision factor of the POI points, and finally, the priority ranking among the POI points is determined according to the size of the weight score.
After determining the priority of each relevant point, the naming module 20 sequentially judges whether the name of each relevant point from the highest-priority relevant point meets the preset condition according to the sequence of the priority from high to low, if the name of the highest-priority relevant point meets the preset condition, the naming module 20 directly uses the name of the highest-priority relevant point as the name of the upper vehicle point for display, and other subsequent relevant points do not need to be judged, and if the name of the highest-priority relevant point does not meet the preset condition, the naming module 20 then judges whether the name of the highest-priority relevant point meets the preset condition, and if the name of the highest-priority relevant point meets the preset condition, the naming module 20 displays the name of the highest-priority relevant point as the name of the upper vehicle point, and does not judge whether other relevant points meet the preset condition any more, and under the condition that the name of the related point with the second highest priority does not accord with the preset condition, judging whether the name of the related point with the third highest priority accords with the preset condition or not until the name of the related point accords with the preset condition. If the names of all the relevant points do not meet the preset condition, the naming module 20 names the boarding point based on the name of the relevant point with the highest priority, for example, the name of the relevant point with the highest priority is taken as a main body, and suffix numbers are added behind the main body according to the arrival sequence of the user request, so as to distinguish the positions of different boarding points.
The naming module 20 determines whether the name of the relevant point meets the predetermined condition mainly according to whether there is a hit result in the cache. Specifically, a result list with the name of the relevant point as a key value and the position information of the currently used name as a result is cached in the cache, when the naming module 20 judges whether the name of the currently relevant point meets the preset condition, the name of the currently relevant point is firstly taken 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, it is proved that the name of the relevant point used by the currently absent boarding point is taken as the name of the boarding point, the situation that the name of the boarding point is repeated does not occur, at this time, the naming module 20 can determine that the name of the currently relevant point meets the preset condition, that is, the name of the relevant point is taken as the name of the boarding point, and the judgment of the subsequent relevant point is; under the condition that a result list corresponding to the key value exists in the cache, it is indicated that other boarding points use the name of the relevant point as the name, in order to avoid two different positions in a closer geographical range from using the same name, 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 boarding points is within 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 name of the current relevant point is determined not to accord with a preset condition, at this moment, a next relevant point with a priority lower than the current relevant point in the priority sequence can be obtained, and whether the name of the current relevant point accords with the preset condition is judged; if the first result does not exist in the result list, determining that the name of the current relevant point meets the preset condition, and taking the name as the name of the boarding point.
Further, the naming device may further include a cache module 30 coupled to the naming module 20, and the structure of the naming device is schematically shown in fig. 4. In order to avoid that the subsequent boarding point uses the same name as the current boarding point, after the name of the current relevant point is determined to be used as the name of the boarding point for display, the cache module 30 takes the name of the current relevant point as a key value, and stores the first position information of the current boarding point into a result list corresponding to the key value; in a general situation, after a user calls a network car booking, the network car booking will be picked up within several minutes, and after the car booking is picked up, the name of a boarding point used by the user can be released for other position information to use, so that after the first position information of the current boarding point is stored in a result list corresponding to a key value, the time when the first position information of the current boarding point is stored in the result list is taken as the starting time, and after a preset time length, the cache module 30 deletes the first position information from the result list.
In actual use, when the related point acquiring module 10 acquires related points related to a boarding point, first, a related point with the highest priority is acquired according to the position information of the boarding point to determine whether the related point meets a preset condition, and when the name of the related point with the highest priority does not meet the preset condition, a next related point is acquired according to the position information of the boarding point to determine whether the related point meets the preset condition, and if the name of the related point with the highest priority meets the preset condition, other multiple related points do not need to be acquired, so that the number of acquired data is reduced, and the calculation amount of the priority is reduced.
According to the embodiment of the invention, the relevant points which accord with the preset conditions in the multiple relevant points relevant to the vehicle-entering point are sequentially judged according to the sequence of the priorities from high to low, the names of the relevant points are used as the names of the vehicle-entering points, and the unique names of the vehicle-entering points in a near area range are ensured by combining the design of cache hit, so that the users can be ensured to carry out good position distinguishing, the situation that the users cannot correctly reach the vehicle-entering points due to the fact that the vehicle-entering 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 in any of the embodiments of the present disclosure, including the following steps S11 and S12:
s11, determining a preset number of related points related to the vehicle-entering point according to the first position information of the vehicle-entering point;
and 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 processor specifically executes the following steps: sequentially judging whether the name of each relevant point meets a preset condition or not according to the sequence of the priorities of all relevant points from high to low; and under the condition that the name of the current relevant point meets 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 network points, wherein the priority of the information points is higher than that of the road network points.
The computer program is executed by the processor, under the condition that the name of the current relevant point meets the preset condition, after the name of the current relevant point is displayed as the name of the boarding point, the processor further executes the following steps: and under the condition that the names of all the relevant points do not accord with the preset conditions, determining the name of the boarding point to display based on the name of the relevant point with the highest priority.
When the computer program is executed by the processor to sequentially judge whether the name of each relevant point meets the preset condition, the processor specifically executes the following steps: judging whether a result list corresponding to the key value exists in the cache or not by taking the name of the current relevant point as the key value; determining that the name of the current relevant point meets a preset condition under the condition that a result list corresponding to the key value does not exist in the cache; under the condition that a result list corresponding to the key value exists in the cache, judging whether a first result exists in the result list or not, wherein the distance between second position information of the first result and first position information of a vehicle-entering 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 meets a 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 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 accords with the preset condition or not.
The computer program is executed by the processor to display the name of the current relevant point as the name of the boarding point, and then the processor executes the following steps: taking the name of the current relevant point as a key value, and storing first position information of the boarding point into a result list corresponding to the key value; and taking the time for 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 time length.
According to the embodiment of the invention, the relevant points which accord with the preset conditions in the multiple relevant points relevant to the vehicle-entering point are sequentially judged according to the sequence of the priorities from high to low, the names of the relevant points are used as the names of the vehicle-entering points, and the unique names of the vehicle-entering points in a near area range are ensured by combining the design of cache hit, so that the users can be ensured to carry out good position distinguishing, the situation that the users cannot correctly reach the vehicle-entering points due to the fact that the vehicle-entering 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, a schematic structural diagram of which may be as shown in fig. 5, and the electronic device at least includes a memory 100 and a processor 200, where the memory 100 stores a computer program, and the processor 200 implements the method provided in any embodiment of the present disclosure when executing the computer program on the memory 100. Illustratively, the electronic device computer program steps are as follows S21 and S22:
s21, determining a preset number of related points related to the vehicle-entering point according to the first position information of the vehicle-entering point;
and S22, determining the name of the boarding point according to the name of the relevant point.
When the processor determines the name of the boarding point according to the name of the relevant point, which is stored in the memory, the processor specifically executes the following computer program: sequentially judging whether the name of each relevant point meets a preset condition or not according to the sequence of the priorities of all relevant points from high to low; and under the condition that the name of the current relevant point meets 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 network points, wherein the priority of the information points is higher than that of the road network points.
The processor displays 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 stored in the execution memory meets the preset condition, and then executes the following computer program: and under the condition that the names of all the relevant points do not accord with the preset conditions, determining the name of the boarding point to display based on the name of the relevant point with the highest priority.
When the processor sequentially judges whether the name of each relevant point stored in the execution memory meets the preset condition, the following computer program is specifically executed: judging whether a result list corresponding to the key value exists in the cache or not by taking the name of the current relevant point as the key value; determining that the name of the current relevant point meets a preset condition under the condition that a result list corresponding to the key value does not exist in the cache; under the condition that a result list corresponding to the key value exists in the cache, judging whether a first result exists in the result list or not, wherein the distance between second position information of the first result and first position information of a vehicle-entering 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 meets a 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 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 accords with the preset condition or not.
The processor, after executing the computer program stored in the memory to display the name of the current relevant point as the name of the boarding point, further executes the following computer program: taking the name of the current relevant point as a key value, and storing first position information of the boarding point into a result list corresponding to the key value; and taking the time for 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 time length.
According to the embodiment of the invention, the relevant points which accord with the preset conditions in the multiple relevant points relevant to the vehicle-entering point are sequentially judged according to the sequence of the priorities from high to low, the names of the relevant points are used as the names of the vehicle-entering points, and the unique names of the vehicle-entering points in a near area range are ensured by combining the design of cache hit, so that the users can be ensured to carry out good position distinguishing, the situation that the users cannot correctly reach the vehicle-entering points due to the fact that the vehicle-entering 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 communications 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 network.
The storage medium may be included in the electronic device; or may exist separately without being assembled 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 the internet protocol addresses from the at least two internet protocol addresses and returns the internet protocol addresses; receiving an internet protocol address returned by the node evaluation equipment; wherein the obtained internet protocol address indicates an edge node in the content distribution network.
Alternatively, 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 for the present disclosure may be written in any combination of 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 type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
It should be noted that the storage media described above in this disclosure can be computer readable signal media or computer readable storage media or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination 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 present 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 contrast, in the present disclosure, a computer readable signal medium may comprise a propagated data signal with computer readable program code embodied therein, either in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any storage medium 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, optical cables, RF (radio frequency), etc., or any suitable combination of the foregoing.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various 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 described in the embodiments of the present disclosure may be implemented by software or hardware. Where the name of an element does not in some cases constitute a limitation on the element itself.
The functions described herein above 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: field Programmable Gate Arrays (FPGAs), Application Specific Integrated Circuits (ASICs), Application Specific Standard Products (ASSPs), systems on a chip (SOCs), Complex Programmable Logic Devices (CPLDs), 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. A 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 exemplary of the preferred embodiments of the disclosure and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the disclosure herein is not limited to the particular combination of features described above, but also encompasses other embodiments in which any combination of the features described above or their equivalents does not depart from the spirit of the disclosure. For example, the above features and (but not limited to) the features disclosed in this disclosure having similar functions are replaced with each other to form the technical solution.
Further, while 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. Under 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 limitations on the scope of the 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 disclosed as example forms of implementing the claims.
While the present disclosure has been described in detail with reference to the embodiments, the present disclosure is not limited to the specific embodiments, and those skilled in the art can make various modifications and alterations based on the concept of the present disclosure, and the modifications and alterations should fall within the scope of the present disclosure as claimed.
Claims (14)
1. A method for naming a boarding point is characterized by comprising the following steps:
determining a preset number of related points related to the boarding points according to first position information of the boarding points;
and determining the name of the boarding point according to the name of the related point.
2. The naming method according to claim 1, wherein said determining the name of said pick-up point from the name of said associated point comprises:
sequentially judging whether the name of each relevant point meets a preset condition or not according to the sequence of the priorities 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.
3. The naming method according to claim 2, characterized in that said associated points comprise at least one of the following: the system comprises information points and routing points, wherein the priority of the information points is higher than that of the routing points.
4. The naming method according to claim 3, wherein, when 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, the method further comprises:
and under the condition that the names of all the relevant points do not accord with the preset conditions, determining the name of the boarding point to display based on the name of the relevant point with the highest priority.
5. The naming method according to claim 2, wherein said sequentially determining whether the name of each of said associated points meets a predetermined condition comprises:
judging whether a result list corresponding to the key value exists in a cache or not by taking the name of the current relevant point as the key value;
determining that the name of the current relevant point meets the preset condition under the condition that the result list corresponding to the key value does not exist in the cache;
under the condition that the result list corresponding to the key value exists in the cache, judging whether a first result exists in the result list or not, wherein the distance between second position information of the first result and first position information of the vehicle-entering point is in a preset range;
determining that the name of the current relevant point meets the preset condition under the condition that the first result does not exist;
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 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 accords with the preset condition.
6. The naming method according to claim 5, wherein after displaying the name of the current relevant point as the name of the boarding point, the method further comprises:
taking the name of the current relevant point as a key value, and storing first position information of the boarding point into a result list corresponding to the key value;
and taking the time for storing the first position information of the vehicle-entering point into the result list as the starting time, and deleting the first position information of the vehicle-entering point from the result list after a preset time length.
7. A device for naming a boarding point, comprising:
the relevant point determining module is used for determining a preset number of relevant points relevant to the vehicle-loading point according to the first position information of the vehicle-loading point;
and the naming module is used for determining the name of the boarding point according to the name of the related point.
8. The naming device of claim 7, wherein the naming module is specifically configured to:
sequentially judging whether the name of each relevant point meets a preset condition or not according to the sequence of the priorities 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.
9. Naming means according to claim 8, characterized in that said associated points comprise at least one of the following: the system comprises information points and routing points, wherein the priority of the information points is higher than that of the routing points.
10. The naming apparatus of claim 9, wherein the naming module is further configured to: and under the condition that the names of all the related points do not accord with the preset conditions, determining the name of the boarding point to display based on the name of the information point with the highest priority.
11. The naming device of claim 8, wherein the naming module is specifically configured to:
judging whether a result list corresponding to the key value exists in a cache or not by taking the name of the current relevant point as the key value;
determining that the name of the current relevant point meets the preset condition under the condition that the result list corresponding to the key value does not exist in the cache;
under the condition that the result list corresponding to the key value exists in the cache, judging whether a first result exists in the result list or not, wherein the distance between second position information of the first result and first position information of the vehicle-entering point is in a preset range;
determining that the name of the current relevant point meets the preset condition under the condition that the first result exists;
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 order, and judging whether the name of the next relevant point meets the preset condition or not.
12. The naming apparatus according to claim 11, 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 for storing the first position information of the vehicle-entering point into the result list as the starting time, and deleting the first position information of the vehicle-entering point from the result list after a preset time length.
13. A storage medium storing a computer program, characterized in that the computer program realizes the steps of the method of any one of claims 1 to 6 when executed by a processor.
14. An electronic device comprising at least a memory, a processor, the memory having a computer program stored thereon, wherein the processor, when executing the computer program on the memory, is adapted to carry out the steps of the method of any of claims 1 to 6.
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 true CN111813817A (en) | 2020-10-23 |
| CN111813817B 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 (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101794286A (en) * | 2009-01-30 | 2010-08-04 | 富士施乐株式会社 | Information processing method and information processing device |
| WO2016116048A1 (en) * | 2015-01-20 | 2016-07-28 | 北京嘀嘀无限科技发展有限公司 | Information providing system and method for on-demand service |
| JP2018128587A (en) * | 2017-02-09 | 2018-08-16 | 株式会社トヨタマップマスター | Map creation device, map creation method and program thereof, and recording medium |
| CN109062928A (en) * | 2018-06-11 | 2018-12-21 | 北京嘀嘀无限科技发展有限公司 | A kind of method and system that prompt recommendation is got on the bus a little |
| 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 |
| WO2019037549A1 (en) * | 2017-08-24 | 2019-02-28 | Beijing Didi Infinity Technology And Development Co., Ltd. | System and method for destination predicting |
| CN110533081A (en) * | 2019-08-07 | 2019-12-03 | 北京三快在线科技有限公司 | A kind of determination is got on the bus method, apparatus, equipment and the storage medium of information |
-
2019
- 2019-12-26 CN CN201911365067.4A patent/CN111813817B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101794286A (en) * | 2009-01-30 | 2010-08-04 | 富士施乐株式会社 | Information processing method and information processing device |
| WO2016116048A1 (en) * | 2015-01-20 | 2016-07-28 | 北京嘀嘀无限科技发展有限公司 | Information providing system and method for on-demand service |
| JP2018128587A (en) * | 2017-02-09 | 2018-08-16 | 株式会社トヨタマップマスター | Map creation device, map creation method and program thereof, and recording medium |
| 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 |
| WO2019037549A1 (en) * | 2017-08-24 | 2019-02-28 | Beijing Didi Infinity Technology And Development Co., Ltd. | System and method for destination predicting |
| CN109062928A (en) * | 2018-06-11 | 2018-12-21 | 北京嘀嘀无限科技发展有限公司 | A kind of method and system that prompt recommendation is got on the bus a little |
| CN110533081A (en) * | 2019-08-07 | 2019-12-03 | 北京三快在线科技有限公司 | A kind of determination is got on the bus method, apparatus, equipment and the storage medium of information |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111813817B (en) | 2024-08-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| 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 | |
| JP6576327B2 (en) | Method and system for combining local weather forecast and itinerary planning | |
| US11507606B2 (en) | Visual search system for finding trip destination | |
| EP1674889A1 (en) | Technique for creating, directing, storing and automatically delivering a message to an intended recipient based on climatic conditions | |
| CN111814070A (en) | Method and system for recommending boarding points, storage medium and electronic equipment | |
| CN103424121A (en) | Vehicle navigation method and system based on cloud server | |
| CN113254105B (en) | Resource processing method and device, storage medium and electronic equipment | |
| CN112637287A (en) | Load balancing method and equipment | |
| TW201518760A (en) | Method and system for combining localized weather forecasting and itinerary planning | |
| CN113190613A (en) | Vehicle route information display method and device, electronic equipment and readable medium | |
| CN111309254B (en) | Data processing method and device, readable medium and electronic equipment | |
| CN114500428B (en) | Navigation sharing method and device, electronic equipment and storage medium | |
| WO2008088128A1 (en) | Method for sensing covering state according to velocity and system for providing traffic information using the same method | |
| CN111813817A (en) | Method and device for naming boarding point, storage medium and electronic equipment | |
| CN113380037A (en) | Traffic information acquisition method and device | |
| EP1388824A2 (en) | Communication terminal and information processing apparatus of a payment system | |
| US10834524B2 (en) | Delegating cloud-side roles to devices | |
| US20200149908A1 (en) | Secure data navigation | |
| CN111242331B (en) | Information processing method and device | |
| CN113537680B (en) | Method and device for determining completion time of transportation task | |
| CN109029476A (en) | A kind of method and apparatus for determining range coverage | |
| CN110677504B (en) | Method and apparatus for determining location information | |
| KR102472406B1 (en) | Apparatus and method of managing poi information | |
| CN112258270A (en) | Method and device for generating carpooling travel |
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 |