CN112527163A - Intersection retrieval method, device, equipment and storage medium - Google Patents
Intersection retrieval method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN112527163A CN112527163A CN202011444092.4A CN202011444092A CN112527163A CN 112527163 A CN112527163 A CN 112527163A CN 202011444092 A CN202011444092 A CN 202011444092A CN 112527163 A CN112527163 A CN 112527163A
- Authority
- CN
- China
- Prior art keywords
- intersection
- branch
- candidate
- road
- retrieved
- 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 54
- 230000002452 interceptive effect Effects 0.000 claims abstract description 58
- 230000015654 memory Effects 0.000 claims description 20
- 238000000605 extraction Methods 0.000 claims description 8
- 230000008569 process Effects 0.000 claims description 6
- 230000001960 triggered effect Effects 0.000 claims description 6
- 238000013473 artificial intelligence Methods 0.000 abstract description 2
- 238000010586 diagram Methods 0.000 description 11
- 238000004891 communication Methods 0.000 description 4
- 238000004590 computer program Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 238000011161 development Methods 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 230000003993 interaction Effects 0.000 description 2
- 239000004973 liquid crystal related substance Substances 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 230000004044 response Effects 0.000 description 2
- 238000000926 separation method Methods 0.000 description 2
- 230000000007 visual effect Effects 0.000 description 2
- 230000001413 cellular effect Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000009401 outcrossing Methods 0.000 description 1
- 230000001953 sensory effect Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 238000007619 statistical method Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/01—Input arrangements or combined input and output arrangements for interaction between user and computer
- G06F3/048—Interaction techniques based on graphical user interfaces [GUI]
- G06F3/0481—Interaction techniques based on graphical user interfaces [GUI] based on specific properties of the displayed interaction object or a metaphor-based environment, e.g. interaction with desktop elements like windows or icons, or assisted by a cursor's changing behaviour or appearance
-
- 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
-
- 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
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/01—Input arrangements or combined input and output arrangements for interaction between user and computer
- G06F3/048—Interaction techniques based on graphical user interfaces [GUI]
- G06F3/0484—Interaction techniques based on graphical user interfaces [GUI] for the control of specific functions or operations, e.g. selecting or manipulating an object, an image or a displayed text element, setting a parameter value or selecting a range
- G06F3/0486—Drag-and-drop
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Human Computer Interaction (AREA)
- Computational Linguistics (AREA)
- Remote Sensing (AREA)
- Navigation (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application discloses a method, a device, equipment and a storage medium for road junction retrieval, and relates to the technical field of artificial intelligence and intelligent traffic. The specific implementation scheme is as follows: acquiring a fork characteristic of the intersection to be retrieved, which is input by a user on an interactive interface; according to the branch characteristics of the intersection to be retrieved and the branch characteristics of the candidate intersections in the road network, carrying out intersection retrieval; the branch characteristics comprise the number of branches of the intersection and the angle relation of the branches. The intersection retrieval cost can be reduced, and the retrieval efficiency and accuracy are improved. Provides a new idea for intersection retrieval.
Description
Technical Field
The application relates to the technical field of computers, in particular to the technical field of artificial intelligence and intelligent traffic. In particular to a method, a device, equipment and a storage medium for searching intersections.
Background
In the course of city planning, there is a need to retrieve various types of city intersections in a city. At present, a worker is usually required to drag an electronic map interface to manually judge and read intersections to be retrieved from massive map data, and the problems of high intersection retrieval cost and low efficiency exist. Particularly, when the types of intersections to be searched are complex or the number of intersections in an actual road network is small, the searching difficulty is higher.
Disclosure of Invention
The disclosure provides a method, a device, equipment and a storage medium for intersection retrieval.
According to a first aspect of the present disclosure, there is provided an intersection retrieval method, including:
acquiring a fork characteristic of the intersection to be retrieved, which is input by a user on an interactive interface;
according to the branch characteristics of the intersection to be retrieved and the branch characteristics of the candidate intersections in the road network, carrying out intersection retrieval; the branch characteristics comprise the number of branches of the intersection and the angle relation of the branches.
According to a second aspect of the present disclosure, there is provided an intersection retrieval device, the device including:
the interface information extraction module is used for acquiring the fork characteristics of the intersection to be retrieved, which are input by a user on the interactive interface;
the intersection retrieval module is used for retrieving intersections according to the branch characteristics of the intersections to be retrieved and the branch characteristics of the candidate intersections in the road network; the branch characteristics comprise the number of branches of the intersection and the angle relation of the branches.
According to a third aspect of the present disclosure, there is provided an electronic apparatus comprising:
at least one processor; and
a memory communicatively coupled to the at least one processor; wherein,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the intersection retrieval method of any of the embodiments of the present application.
According to a fourth aspect of the present disclosure, a non-transitory computer-readable storage medium having computer instructions stored thereon is provided. The computer instructions are used for causing a computer to execute the intersection retrieval method of any embodiment of the application.
According to the technology of the application, the problems of high cost and low efficiency of manually searching the intersection are solved, and a new idea is provided for intersection searching.
It should be understood that the statements in this section do not necessarily identify key or critical features of the embodiments of the present disclosure, nor do they limit the scope of the present disclosure. Other features of the present disclosure will become apparent from the following description.
Drawings
The drawings are included to provide a better understanding of the present solution and are not intended to limit the present application. Wherein:
fig. 1A is a flowchart of an intersection retrieval method provided according to an embodiment of the present application;
FIG. 1B is a diagram illustrating the effect of a search result according to an embodiment of the present disclosure;
FIG. 2A is a flow chart of another intersection retrieval method provided according to the embodiment of the application;
FIG. 2B is a schematic illustration of an interactive interface provided in accordance with an embodiment of the present application;
FIG. 3A is a flow chart of another intersection retrieval method provided according to an embodiment of the application;
FIG. 3B is a schematic diagram of a candidate intersection according to an embodiment of the present application;
FIG. 3C is a schematic diagram of another alternative intersection provided by an embodiment of the present application;
FIG. 4 is a flow chart of another intersection retrieval method provided according to an embodiment of the application;
fig. 5 is a schematic structural diagram of an intersection search device according to an embodiment of the present application;
fig. 6 is a block diagram of an electronic device for implementing an intersection search method according to an embodiment of the present application.
Detailed Description
The following description of the exemplary embodiments of the present application, taken in conjunction with the accompanying drawings, includes various details of the embodiments of the application for the understanding of the same, which are to be considered exemplary only. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the present application. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
Fig. 1A is a flowchart of an intersection retrieval method provided according to an embodiment of the present application; fig. 1B is a diagram illustrating a search result according to an embodiment of the present application. The embodiment is suitable for the condition of searching the target intersection in a large number of intersections in the road network. The embodiment may be performed by an intersection retrieval apparatus configured in an electronic device, and the apparatus may be implemented by software and/or hardware. As shown in fig. 1A-1B, the method includes:
s101, obtaining the fork characteristics of the intersection to be retrieved, which are input by a user on the interactive interface.
The interactive interface of the embodiment of the present application may be an interface designed specifically for intersection retrieval and interacting with a user, where the interactive interface may be used by the user to input relevant information of an intersection to be retrieved, and it should be noted that the interactive interface of the embodiment of the present application is used by the user to input a name that is not the intersection to be retrieved or a name of a branch belonging to the intersection to be retrieved, but is used by the user to input a branch feature of the intersection to be retrieved. The branch characteristics include the number of branches at the intersection and the angle relationship between the branches. In general, a single intersection is composed of at least three branches, the number of branches may be the number of branches constituting the single intersection, and the branch angle relationship may be an angular relationship between each branch constituting the intersection and a reference direction and/or between two branches.
Optionally, in this embodiment of the application, when a user has a need for intersection retrieval, if the user knows the branch characteristics of the intersection to be retrieved, the specific branch number and the branch angle relationship of the intersection to be retrieved may be directly input in the interactive interface. If the user does not know the specific branch feature of the intersection to be retrieved, only knows the intersection structure which the user wants to retrieve, such as the geometric shape formed by a plurality of branches forming the intersection, the intersection structure to be retrieved can be input in the interactive interface, and at the moment, the intersection retrieving device can determine the branch feature of the intersection to be retrieved based on the intersection structure input in the interactive interface by the user. According to the embodiment of the application, the turnout characteristics of the intersection to be retrieved input by the user on the interactive interface can be flexibly obtained according to the actual situation.
And S102, carrying out intersection retrieval according to the branch characteristics of the intersection to be retrieved and the branch characteristics of the candidate intersections in the road network.
In the embodiment of the present application, each intersection actually existing in the road network can be used as a candidate intersection. Similar to the intersection to be retrieved, each candidate intersection also has corresponding branch characteristics, namely the relation between the number of branches and the angle of the branch. It should be noted that the branch feature of the intersection to be retrieved is input by the user through the interactive interface. And the branch characteristics of the candidate intersection can be pre-counted. For example, the number of branches and the angle relationship between the branches at each intersection in the road network may be counted in advance to form the branch characteristics of the intersection. Specific statistical methods will be described in detail in the following examples. This embodiment will not be described in detail herein.
Optionally, in the embodiment of the present application, consistency comparison may be performed between the branch characteristics of the intersection to be retrieved and the branch characteristics of each candidate intersection in the road network in sequence, and if the branch characteristics of the candidate intersection are consistent with the branch characteristics of the intersection to be retrieved, the candidate intersection is a target intersection meeting the current retrieval requirement. Optionally, the target intersection searched this time can be displayed to the user through an interactive interface in the embodiment of the application. Specifically, the search result may be displayed in the form of a picture and/or a text. For example, as shown in fig. 1B, if there are two retrieved target intersections, that is, intersection a and intersection B, then the actual intersection pictures of intersection a and intersection B, that is, picture 10 and picture 11, can be displayed in the interactive interface, and related introduction information of intersection a and intersection B, such as intersection name, location, and branch information, can also be displayed.
According to the technical scheme of the embodiment of the application, the number of the to-be-retrieved intersections and the intersection angle relation input by a user on the interactive interface are obtained and used as the intersection characteristics, and the intersection characteristics are compared with the intersection characteristics of the candidate intersections in the road network to determine the intersection retrieval result. The scheme of the application interacts with the user through the interactive interface, and intersection retrieval is carried out based on the intersection characteristics of the intersection to be retrieved, which are input by the user. Road network data of the road junction is decoupled from road network data of the road junction, and only one-time development is needed, so that road junction retrieval service can be provided for users with different retrieval requirements, manpower is saved, and resource cost is reduced. In addition, the intersection is searched in the whole intersection by taking the branch road characteristics as the index, so that the searching efficiency is improved, and the comprehensiveness and the accuracy of the searching result are improved. Provides a new idea for intersection retrieval.
FIG. 2A is a flow chart of another intersection retrieval method provided according to the embodiment of the application; fig. 2B is a schematic diagram of an interactive interface provided according to an embodiment of the present application. On the basis of the above embodiments, the present embodiment performs further optimization, and gives a description of a specific situation of obtaining the branch feature of the intersection to be retrieved, which is input by the user on the interactive interface. As shown in fig. 2A-2B, the method includes:
s201, responding to a fork dragging operation and/or a fork setting operation triggered by a user on the interactive interface, and displaying an intersection structure of the intersection to be retrieved in a direction coordinate system of the interactive interface.
Optionally, the interactive interface in the embodiment of the present application may include two parts, namely, a direction coordinate system and a diversion setting window, and may support a user to input information in two forms. Wherein the direction coordinate system may be a disk marked with an angle scale, such as the direction disk 21 in fig. 2B. The user can directly execute the turnout dragging operation in the direction coordinate system of the interactive interface so as to realize the input of different types and angles of turnouts on the interactive interface. The switch setting window may be a switch information setting interface, such as block 22 in fig. 2B. The user can directly select or input the relevant information of the branch in the branch setting window, such as setting the angle of the branch, adding or deleting the branch, setting the attribute of the branch, and the like.
Optionally, in this embodiment of the application, when a user has a need for intersection retrieval, in the interactive interface, a fork entering the intersection and a fork exiting the intersection may be dragged to the direction coordinate system, and then an angle of the dragged fork is adjusted to form a simple intersection structure of the intersection to be retrieved. Illustratively, if the user drags in the steering wheel 21 in fig. 2B one branch of the incoming intersection and two branches of the outgoing intersection, and the positions of the three branches are adjusted, that is, the direction of the branch of the incoming intersection is 180 °, the direction of the branch of the outgoing intersection is 0 °, and the direction of the branch of the outgoing intersection is 45 °, the intersection retrieving means may generate the intersection structure shown in the steering wheel 21 in response to the above-described branch dragging operation by the user. Wherein, the broken line in the crossing structure represents the branch of the driving-in crossing, and the solid line represents the branch of the driving-out crossing. Alternatively, the interactive interface may also characterize the direction of the diversion by other means, such as by color.
Optionally, in this embodiment of the application, when a user has a crossing retrieval request, a window may be set in a branch of the interactive interface, and a branch entering the crossing and a branch exiting the crossing of the crossing to be retrieved are set. Specifically, addition and deletion of the branch, setting of the angle and attribute of the branch, and the like are performed. Correspondingly, after the intersection retrieval device detects the turnout setting operation of the user, the intersection retrieval device responds to the turnout setting operation and displays the intersection structure of the intersection to be retrieved in the direction coordinate system based on the content set by the user. For example, if the user clicks the plus sign at the upper right corner of the switch setting window of the entry intersection in the box 22 in fig. 2B, a switch of the entry intersection may be created in the window, and the angle of the switch is set to 180 °; similarly, the intersection search device may create the intersection structure shown in the steering wheel 21 in response to the above-described branch setting operation by the user by clicking the plus sign at the upper right corner on the branch setting window of the outgoing intersection to create two branches of the outgoing intersection and setting the angles of the two branches to 0 ° and 45 °. Optionally, in the process of setting the window for the branch, if the setting is wrong, the user may click a delete button to delete the setting information of the branch for resetting.
Optionally, in this embodiment of the application, when a user has a need for intersection retrieval, the branch dragging operation and the branch setting operation may be combined, for example, a branch corresponding to an intersection to be retrieved is quickly input through the branch dragging operation, and then the direction of the branch is accurately adjusted through the branch setting operation. The intersection retrieval device provided by the embodiment of the application can support a user to select a corresponding operation mode according to actual requirements, and is higher in flexibility. For example, if the user has a strict requirement on the angle of the intersection to be retrieved, the setting can be accurately performed through the intersection setting operation, and if the user needs to perform quick retrieval and the requirement on the angle is not strict, the retrieval operation can be quickly triggered through the intersection dragging operation.
S202, determining the branch characteristics of the intersection to be retrieved according to the line segment information of the intersection structure and the position of the intersection structure in the direction coordinate system.
The line segment information of the intersection structure may be related information of each line segment constituting the intersection structure, for example, the line segment information at least includes: the number of line segments and the road driving direction corresponding to the line segments (such as the direction of entering the intersection or the direction of exiting the intersection), may further include: the road type (such as an expressway, a side road or a non-motor lane) and the number of lane lines corresponding to the line segment.
Optionally, in the embodiment of the present application, the number of the branches of the intersection to be retrieved may be determined according to the number of the line segments in the line segment information of the intersection structure determined by the above operation, for example, for the intersection structure shown in fig. 2B, the number of the line segments is 3, and then there are three branches of the intersection to be retrieved, specifically, there are one branch entering the intersection and two branches exiting the intersection. Since the intersection structure is displayed in the direction coordinate system in the interactive interface, the embodiment of the application can determine the angle relationship of each line segment, namely the intersection angle relationship, based on the position of each line segment in the intersection structure in the direction coordinate system. Illustratively, the angles corresponding to the three branches (i.e., the three line segments) of the intersection structure shown in fig. 2B are 0 °, 45 °, and 180 °, respectively, and the angular relationship of the three branches (i.e., the branch angular relationship) is determined based on the corresponding angles of the three branches in the direction disk 21, for example, the angles between the three branches and a certain reference direction (e.g., the north direction) may be included, or the angles between adjacent branches in the three branches may be included; an angle between a branch in a certain traveling direction and a branch in the traveling direction or another traveling direction may be used. And then taking the relationship between the number of the branches and the angle of the branches determined according to the intersection structure as the branch characteristics of the intersection to be retrieved by the user.
S203, according to the branch characteristics of the intersection to be retrieved and the branch characteristics of the candidate intersections in the road network, the intersection retrieval is carried out.
According to the technical scheme of the embodiment of the application, the intersection structure of the intersection to be retrieved can be displayed in the direction coordinate system of the interactive interface based on the intersection dragging operation and/or the intersection setting operation triggered by the user on the interactive interface, the intersection characteristic of the intersection to be retrieved is determined based on the line segment information of the intersection structure and the position of the intersection structure in the direction coordinate system, and then the intersection characteristic of the intersection to be retrieved is compared with the intersection characteristics of all candidate intersections in the intersection, and the retrieval result is determined. According to the scheme of the embodiment of the application, the spatial angle relation of the intersection data layer is obtained in an interactive interface mode, even if a user does not know the specific angle relation of the intersection, the user can drag the intersection to form a rough intersection structure for retrieval, and the professional requirements on a retrieval user are reduced. In addition, the interactive interface is visual and concise, various modes of operation can be supported, the structure of the intersection central point and the intersection of the intersection central point is abstracted and expressed through the direction coordinate system with the fine angle ruler, a user can simply and clearly edit the intersection structure to be searched on the interactive interface, and the convenience of user operation is improved under the condition that the comprehensive, accurate and efficient search result is ensured.
FIG. 3A is a flow chart of another intersection retrieval method provided according to an embodiment of the application; FIG. 3B is a schematic diagram of a candidate intersection according to an embodiment of the present application; fig. 3C is a schematic diagram of another alternative intersection provided according to an embodiment of the present application. Based on the above embodiments, the present embodiment performs further optimization, and gives a specific description how to count the branch characteristics of the candidate intersections in the intersection. As shown in fig. 3A-3C, the method includes:
s301, counting the number of branches of the candidate intersections in the road network.
Optionally, there are many ways to count the number of branches at the candidate intersection in the road network in this step, for example:
the first method may be to count the number of all road segments (i.e., a road between two intersections is taken as a road segment) entering or exiting the intersection based on each candidate intersection in the intersections as the number of branches of the candidate intersection.
In the second mode, since the general intersection search is performed when the urban vehicle roads are planned, the intersection where the motor vehicle runs is considered to be the important consideration, so when the number of the branches of the candidate intersection in the intersection is counted, the number of the motor vehicle roads of the candidate intersection in the road network can be counted as the number of the branches of the candidate intersection. Specifically, when the number of the branches of the candidate intersection is counted, the non-motor vehicle roads and the internal roads (such as the internal roads in a shopping square, a park or a factory) on which the motor vehicles do not run are removed from the intersection, and only the number of the roads on which the motor vehicles run is counted as the number of the branches.
In the third mode, since the split road in the general road and the auxiliary road of the split road can be regarded as one road, in order to improve the efficiency of intersection retrieval, in the process of counting the number of the branches of the candidate intersection in the road network, the split road of the candidate intersection can be regarded as one branch; or taking a separation type road of the candidate intersection and a subsidiary road of the separation type road as a branch road.
And fourthly, combining the second mode with the third mode to count the number of the branches of the candidate intersection.
For example, for the intersection a shown in fig. 3B, if the road segments 3-6 are provincial roads; road segment 1 and road segment 2 are the side roads of road segment 3 and road segment 4, respectively; road segment 7 and road segment 8 are side roads of road segment 5 and road segment 6, respectively; the road section 9-intersection 12 is a county road; the road section 13 is a non-motorized lane. If the first mode is adopted, the counted number of the branches of the intersection A is 13; if the second mode is adopted, the number of the branches of the intersection A is counted to be 12; if the third mode is adopted, the counted number of the branches of the intersection A is 5, and if the fourth mode is adopted, the counted number of the branches of the intersection A is 4
The step can set specific turnout number statistical rules according to actual requirements, and the flexibility is stronger, so that the accuracy of determining the number of the turnouts is improved, and a guarantee is provided for subsequent accurate intersection retrieval.
S302, counting the turnout angle relation of the candidate intersection in the road network.
Optionally, in the embodiment of the present application, after the number of the branches of the candidate intersection is determined in S301, the branch angle relationship may be determined for each branch of the candidate intersection. Specifically, when the branch angle relationship of the candidate intersection in the road network is counted, at least one of the following angle relationships may be determined: the angle relation is I, and the angles of the turnouts of the candidate intersections and the reference direction; the angle relation II, the angle between adjacent branches of the candidate intersection; angle relation III, angle between the branches of the candidate crossing; the angle relation is four, and the angle between the branches of the driving-out candidate intersection; and the angle relation five is the angle between the branch road of the driving candidate crossing and the branch road of the driving candidate crossing.
Specifically, as shown in fig. 3C, if the candidate intersection is intersection a, which has four branches, that is, branch S1-branch S4, and branch S1 and branch S2 are branches exiting intersection a, and branch S3 and branch S4 are branches entering intersection a, this step may count the angles between branch S1-branch S4 and the true north direction, respectively, when the angle relationship is counted up in this step; when the second angle relationship is counted, the angle relationship between two adjacent branches (for example, the branch S1 and the branch S2, the branch S2 and the branch S4, the branch S3 and the branch S4, and the branch S1 and the branch S3) in the branch S1-the branch S4 may be counted; when the angle relationship three is counted, the angle between the branch S3 and the branch S4 may be counted; when the angle relationship is counted four, the angle between the branch S1 and the branch S2 may be counted; when the angle relationship is counted up, the angle between the branch S3 and the branch S1, the angle between the branch S3 and the branch S2, the angle between the branch S4 and the branch S1, and the angle between the branch S4 and the branch S2 may be counted up.
According to the embodiment of the application, at least one of the five angle relationships can be flexibly selected and counted according to actual requirements, and the five angle relationships are preferably counted. By counting various different angle relationships, the accuracy and comprehensiveness of determining the turnout characteristics of the candidate intersection are guaranteed, and the subsequent accurate intersection retrieval is guaranteed.
It should be noted that in the embodiment of the present application, the operation of counting the branch characteristics of the candidate intersection by S301-S302 need not be performed once before each intersection search, and may be counted once before the first search; or counting once every preset time period; the statistics can be performed once when the statistical rule changes, once when the intersection in the road network changes, and the like.
S303, acquiring the fork characteristics of the intersection to be retrieved, which are input by the user on the interactive interface.
It should be noted that, in the embodiment of the present application, the branch characteristics of the intersection to be retrieved and the branch characteristics of the candidate intersection are corresponding, that is, both include the number of branches and the angle relationship between the branches. The principle according to which the number of the branches of the intersection to be retrieved is determined in this step is the same as the principle according to which the number of the branches of the candidate intersection in the road network is counted as described in S301, for example, if the number of the motor vehicle roads at the candidate intersection in the road network is counted as the number of the branches of the candidate intersection in S301. Determining the number of motor vehicle lanes in the intersection to be retrieved as the number of branches of the intersection to be retrieved; if S301 counts the number of the branches of the candidate intersection in the road network, taking the separated road of the candidate intersection as a branch; or the separated road of the candidate intersection and the auxiliary road of the separated road are used as a branch road, and the separated road is also used as a branch road when the number of the branch roads of the intersection to be searched is determined in the step; or the split road and the sub road of the split road are taken as a branch road. So as to ensure the accuracy of subsequent retrieval.
Optionally, different retrieval users have different requirements for the retrieval result, for example, some users only pay attention to the angle relationship between the branches in the intersection to be retrieved, and do not pay attention to the direction of the intersection. Some pay attention to not only the angle relationship and intersection orientation between the branches in the intersection to be searched, but also the angle relationship between the branches in different driving directions. Therefore, the step can determine the angle relationship of the intersection to be retrieved according to the requirements of the user. However, it should be noted that the angular relationship of the intersection to be retrieved determined in this step is to belong to one or more of the angular relationships determined in S302.
S304, according to the branch characteristics of the intersection to be retrieved and the branch characteristics of the candidate intersections in the road network, the intersection retrieval is carried out.
According to the scheme of the embodiment of the application, the number of the branches of the candidate intersections in the road network and the angle relation of the branches are counted as the branch characteristics of the candidate intersections, when a user has a retrieval requirement, the branch characteristics of the intersections to be retrieved input by the user on an interactive interface are obtained, then the candidate intersections and the branch characteristics of the intersections to be retrieved are compared, and the target intersections to be retrieved are determined from the candidate intersections. The scheme of the application provides various implementable modes of the relation between the number of the branches of the candidate intersection and the angle of the branches, can be flexibly set according to the actual requirements of users, and ensures the flexibility and comprehensiveness of the branch characteristics of the candidate intersection for statistics. Therefore, the intersection searched based on the branch characteristics of the candidate intersection can better meet the requirements of different users, and the accuracy is higher.
Fig. 4 is a flowchart of another intersection retrieval method provided according to an embodiment of the present application. The embodiment is further optimized on the basis of the above embodiment, and a preferred embodiment of the intersection retrieval method is provided. As shown in fig. 4, the method includes:
s401, the fork characteristics of the intersection to be retrieved input by the user on the interactive interface are obtained.
S402, road network data of the intersection to be retrieved, which is input by the user on the interactive interface, is obtained.
The road network data may be road basic data of each branch road in the intersection in the road network, and may include, but is not limited to: the name, number of lane lines, type (e.g., provincial, prefectural, side road, non-motor lane, etc.), location, etc. of the branch.
Optionally, in this embodiment of the application, if the user has more precise restrictions on each branch road in the intersection to be retrieved, the road network data of the intersection to be retrieved may be set through the interactive interface, for example, in the interactive interface shown in fig. 2B, the user may click the attribute setting button in the box 22, at this time, the system may pop up a setting option window related to the road network information, and the user may set the road network data of each branch road of the intersection to be retrieved in the setting option window. At the moment, the intersection retrieval device can respond to the setting operation of the user and acquire road network data of the intersection to be retrieved, which is input by the user on the interactive interface.
And S403, performing intersection retrieval according to the intersection characteristics and road network data of the intersection to be retrieved and the intersection characteristics and road network data of the candidate intersections in the road network.
The road network data of the candidate intersection in the road network in the embodiment of the present application is similar to the road network data of the intersection to be retrieved, and may include but is not limited to: the name, number of lane lines, type (e.g., provincial, prefectural, side road, non-motor lane, etc.), location, etc. of the branch. However, in order to ensure the accuracy of the search result, the road network data of the candidate intersection is more comprehensive in type. In the embodiment of the present application, the determination method of the road network data of the candidate intersection may be that, for each candidate intersection in the road network, each branch corresponding to the candidate intersection is determined, and then the road network data corresponding to each branch is obtained as the road network data of the candidate intersection based on the basic data of each candidate intersection in the electronic map. Optionally, the branch characteristics and road network data of the candidate intersections in the road network may be statistically obtained in advance.
In the step of searching intersections, consistency comparison can be carried out on the intersection characteristics and road network data of the intersection to be searched respectively in the intersection characteristics and road network data of each candidate intersection, and the candidate intersection with the intersection characteristics and the road network data consistent with the intersection to be searched is taken as a target intersection meeting the searching requirement.
According to the scheme of the embodiment of the application, the branch characteristics and the road network data of the intersection to be retrieved, which are input by a user on the interactive interface, are obtained, and the branch characteristics and the road network data of the intersection to be retrieved are compared with the branch characteristics and the road network data of the candidate intersection in the road network, so that the retrieval result is determined. According to the scheme of the embodiment of the application, when the intersection is searched, the intersection characteristics of the intersection and the road network data of the intersection are combined, so that the intersection searching result is more accurate.
Fig. 5 is a schematic structural diagram of an intersection search device according to an embodiment of the present application. The embodiment is suitable for the condition of searching a target intersection from a large number of intersections in a road network, and the device can realize the intersection searching method in any embodiment of the application. The apparatus 500 specifically includes the following:
the interface information extraction module 501 is configured to obtain a branch feature of the intersection to be retrieved, which is input by a user on the interactive interface;
the intersection retrieval module 502 is used for retrieving intersections according to the branch characteristics of the intersections to be retrieved and the branch characteristics of the candidate intersections in the road network; the branch characteristics comprise the number of branches of the intersection and the angle relation of the branches.
According to the scheme of the embodiment of the application, the number of the to-be-retrieved intersections and the intersection angle relation input by the user on the interactive interface are obtained and used as the intersection characteristics, and the intersection characteristics are compared with the intersection characteristics of the candidate intersections in the road network to determine the intersection retrieval result. The scheme of the application interacts with the user through the interactive interface, and intersection retrieval is carried out based on the intersection characteristics of the intersection to be retrieved, which are input by the user. Road network data of the road junction is decoupled from road network data of the road junction, and only one-time development is needed, so that road junction retrieval service can be provided for users with different retrieval requirements, manpower is saved, and resource cost is reduced. In addition, the intersection is searched in the whole intersection by taking the branch road characteristics as the index, so that the searching efficiency is improved, and the comprehensiveness and the accuracy of the searching result are improved. Provides a new idea for intersection retrieval.
Further, the interface information extraction module 501 is specifically configured to:
responding to a fork dragging operation and/or a fork setting operation triggered by a user on an interactive interface, and displaying an intersection structure of an intersection to be retrieved in a direction coordinate system of the interactive interface;
and determining the branch characteristics of the intersection to be retrieved according to the line segment information of the intersection structure and the position of the intersection structure in the direction coordinate system.
Further, the apparatus further comprises:
and the branch road number counting module is used for counting the number of the motor vehicle roads of the candidate intersection in the road network as the number of the branch roads of the candidate intersection.
Further, the apparatus further comprises:
the intersection number counting module is specifically used for taking the separated road of the candidate intersection as an intersection in the process of counting the number of the intersections of the candidate intersection in the road network; or the separated road of the candidate intersection and the auxiliary road of the separated road are taken as a branch road.
Further, the branch angle relationship in the branch characteristics of the candidate intersections in the road network includes at least one of the following:
angles of the turnouts of the candidate intersections and the reference direction;
an angle between adjacent turnouts of the candidate intersection;
angles between the turnouts of the candidate intersection;
driving out the angle between the branches of the candidate intersection;
an angle between a branch entering the candidate intersection and a branch exiting the candidate intersection.
Further, the interface information extraction module 501 is further configured to: acquiring road network data of the intersection to be retrieved, which is input by the user on the interactive interface;
correspondingly, the intersection retrieving module 502 is specifically configured to:
and according to the branch road characteristics and road network data of the intersection to be retrieved and the branch road characteristics and road network data of the candidate intersections in the road network, carrying out intersection retrieval.
According to an embodiment of the present application, an electronic device and a readable storage medium are also provided.
Fig. 6 is a block diagram of an electronic device of an intersection search method according to an embodiment of the present application. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. The electronic device may also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be examples only, and are not meant to limit implementations of the present application that are described and/or claimed herein.
As shown in fig. 6, the electronic apparatus includes: one or more processors 601, memory 602, and interfaces for connecting the various components, including a high-speed interface and a low-speed interface. The various components are interconnected using different buses and may be mounted on a common motherboard or in other manners as desired. The processor may process instructions for execution within the electronic device, including instructions stored in or on the memory to display graphical information of a GUI on an external input/output apparatus (such as a display device coupled to the interface). In other embodiments, multiple processors and/or multiple buses may be used, along with multiple memories and multiple memories, as desired. Also, multiple electronic devices may be connected, with each device providing portions of the necessary operations (e.g., as a server array, a group of blade servers, or a multi-processor system). In fig. 6, one processor 601 is taken as an example.
The memory 602 is a non-transitory computer readable storage medium as provided herein. The memory stores instructions executable by at least one processor, so that the at least one processor executes the intersection retrieval method provided by the application. The non-transitory computer-readable storage medium of the present application stores computer instructions for causing a computer to execute the intersection retrieval method provided by the present application.
The memory 602 is used as a non-transitory computer readable storage medium for storing non-transitory software programs, non-transitory computer executable programs, and modules, such as program instructions/modules (for example, the interface information extraction module 501 and the intersection retrieval module 502 shown in fig. 5) corresponding to the intersection retrieval method in the embodiment of the present application. The processor 601 executes various functional applications and data processing of the server by running non-transitory software programs, instructions and modules stored in the memory 602, that is, the intersection retrieval method in the above method embodiment is implemented.
The memory 602 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store data created according to the use of the electronic device of the intersection retrieval method, and the like. Further, the memory 602 may include high speed random access memory, and may also include non-transitory memory, such as at least one magnetic disk storage device, flash memory device, or other non-transitory solid state storage device. In some embodiments, the memory 602 optionally includes memory located remotely from the processor 601, and these remote memories may be connected to the electronic device of the intersection retrieval method through a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The electronic device of the intersection retrieval method may further include: an input device 603 and an output device 604. The processor 601, the memory 602, the input device 603 and the output device 604 may be connected by a bus or other means, and fig. 6 illustrates the connection by a bus as an example.
The input device 603 may receive input numeric or character information and generate key signal inputs related to user settings and function control of the electronic equipment of the intersection retrieval method, such as a touch screen, a keypad, a mouse, a track pad, a touch pad, a pointing stick, one or more mouse buttons, a track ball, a joystick, or other input devices. The output devices 604 may include a display device, auxiliary lighting devices (e.g., LEDs), and tactile feedback devices (e.g., vibrating motors), among others. The display device may include, but is not limited to, a Liquid Crystal Display (LCD), a Light Emitting Diode (LED) display, and a plasma display. In some implementations, the display device can be a touch screen.
Various implementations of the systems and techniques described here can be realized in digital electronic circuitry, integrated circuitry, application specific ASICs (application specific integrated circuits), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs that are executable and/or interpretable on a programmable system including at least one programmable processor, which may be special or general purpose, receiving data and instructions from, and transmitting data and instructions to, a storage system, at least one input device, and at least one output device.
These computer programs (also known as programs, software applications, or code) include machine instructions for a programmable processor, and may be implemented using high-level procedural and/or object-oriented programming languages, and/or assembly/machine languages. As used herein, the terms "machine-readable medium" and "computer-readable medium" refer to any computer program product, apparatus, and/or device (e.g., magnetic discs, optical disks, memory, Programmable Logic Devices (PLDs)) used to provide machine instructions and/or data to a programmable processor, including a machine-readable medium that receives machine instructions as a machine-readable signal. The term "machine-readable signal" refers to any signal used to provide machine instructions and/or data to a programmable processor.
To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and a pointing device (e.g., a mouse or a trackball) by which a user can provide input to the computer. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic, speech, or tactile input.
The systems and techniques described here can be implemented in a computing system that includes a back-end component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such back-end, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), Wide Area Networks (WANs), and the Internet.
The computer system may include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The server can be a cloud server, also called a cloud computing server or a cloud host, and is a host product in a cloud computing service system, so that the defects of high management difficulty and weak service expansibility in the traditional physical host and VPS service are overcome.
According to the technical scheme of the embodiment of the application, the number of the intersections and the intersection angle relation input by a user on the interactive interface are obtained as the intersection characteristics, and the intersection characteristics are compared with the intersection characteristics of the candidate intersections in the road network to determine the intersection retrieval result. The scheme of the application interacts with the user through the interactive interface, and intersection retrieval is carried out based on the intersection characteristics of the intersection to be retrieved, which are input by the user. Road network data of the road junction is decoupled from road network data of the road junction, and only one-time development is needed, so that road junction retrieval service can be provided for users with different retrieval requirements, manpower is saved, and resource cost is reduced. In addition, the intersection is searched in the whole intersection by taking the branch road characteristics as the index, so that the searching efficiency is improved, and the comprehensiveness and the accuracy of the searching result are improved. Provides a new idea for intersection retrieval.
It should be understood that various forms of the flows shown above may be used, with steps reordered, added, or deleted. For example, the steps described in the present application may be executed in parallel, sequentially, or in different orders, and the present invention is not limited thereto as long as the desired results of the technical solutions disclosed in the present application can be achieved.
The above-described embodiments should not be construed as limiting the scope of the present application. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may be made in accordance with design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present application shall be included in the protection scope of the present application.
Claims (14)
1. An intersection retrieval method, comprising:
acquiring a fork characteristic of the intersection to be retrieved, which is input by a user on an interactive interface;
according to the branch characteristics of the intersection to be retrieved and the branch characteristics of the candidate intersections in the road network, carrying out intersection retrieval; the branch characteristics comprise the number of branches of the intersection and the angle relation of the branches.
2. The method of claim 1, wherein the obtaining of the intersection characteristics of the intersection to be retrieved, input by the user on the interactive interface, comprises:
responding to a fork dragging operation and/or a fork setting operation triggered by a user on an interactive interface, and displaying an intersection structure of an intersection to be retrieved in a direction coordinate system of the interactive interface;
and determining the branch characteristics of the intersection to be retrieved according to the line segment information of the intersection structure and the position of the intersection structure in the direction coordinate system.
3. The method of claim 1, further comprising:
and counting the number of motor vehicle roads of the candidate intersection in the road network as the number of branches of the candidate intersection.
4. The method of claim 1 or 3, further comprising:
in the process of counting the number of the branches of the candidate intersection in the road network, taking the separated road of the candidate intersection as a branch; or the separated road of the candidate intersection and the auxiliary road of the separated road are taken as a branch road.
5. The method of claim 1, wherein the branch angle relationship in the branch characteristics of the candidate intersections in the road network comprises at least one of:
angles of the turnouts of the candidate intersections and the reference direction;
an angle between adjacent turnouts of the candidate intersection;
angles between the turnouts of the candidate intersection;
driving out the angle between the branches of the candidate intersection;
an angle between a branch entering the candidate intersection and a branch exiting the candidate intersection.
6. The method of claim 1, further comprising:
acquiring road network data of the intersection to be retrieved, which is input by the user on the interactive interface;
correspondingly, according to the branch characteristics of the intersection to be retrieved and the branch characteristics of the candidate intersections in the road network, the intersection retrieval is carried out, and the method comprises the following steps:
and according to the branch road characteristics and road network data of the intersection to be retrieved and the branch road characteristics and road network data of the candidate intersections in the road network, carrying out intersection retrieval.
7. An intersection retrieval device comprising:
the interface information extraction module is used for acquiring the fork characteristics of the intersection to be retrieved, which are input by a user on the interactive interface;
the intersection retrieval module is used for retrieving intersections according to the branch characteristics of the intersections to be retrieved and the branch characteristics of the candidate intersections in the road network; the branch characteristics comprise the number of branches of the intersection and the angle relation of the branches.
8. The apparatus according to claim 7, wherein the interface information extraction module is specifically configured to:
responding to a fork dragging operation and/or a fork setting operation triggered by a user on an interactive interface, and displaying an intersection structure of an intersection to be retrieved in a direction coordinate system of the interactive interface;
and determining the branch characteristics of the intersection to be retrieved according to the line segment information of the intersection structure and the position of the intersection structure in the direction coordinate system.
9. The apparatus of claim 7, further comprising:
and the branch road number counting module is used for counting the number of the motor vehicle roads of the candidate intersection in the road network as the number of the branch roads of the candidate intersection.
10. The apparatus of claim 7 or 9, comprising:
the intersection number counting module is specifically used for taking the separated road of the candidate intersection as an intersection in the process of counting the number of the intersections of the candidate intersection in the road network; or the separated road of the candidate intersection and the auxiliary road of the separated road are taken as a branch road.
11. The apparatus of claim 7, wherein the branch angle relationship in the branch characteristics of the candidate intersections in the road network comprises at least one of:
angles of the turnouts of the candidate intersections and the reference direction;
an angle between adjacent turnouts of the candidate intersection;
angles between the turnouts of the candidate intersection;
driving out the angle between the branches of the candidate intersection;
an angle between a branch entering the candidate intersection and a branch exiting the candidate intersection.
12. The apparatus of claim 7, wherein,
the interface information extraction module is further configured to: acquiring road network data of the intersection to be retrieved, which is input by the user on the interactive interface;
correspondingly, the intersection retrieval module is specifically configured to:
and according to the branch road characteristics and road network data of the intersection to be retrieved and the branch road characteristics and road network data of the candidate intersections in the road network, carrying out intersection retrieval.
13. An electronic device, comprising:
at least one processor; and
a memory communicatively coupled to the at least one processor; wherein,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the intersection retrieval method of any of claims 1-6.
14. A non-transitory computer-readable storage medium storing computer instructions for causing a computer to perform the intersection retrieval method of any one of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011444092.4A CN112527163B (en) | 2020-12-08 | 2020-12-08 | Intersection retrieval method, device, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011444092.4A CN112527163B (en) | 2020-12-08 | 2020-12-08 | Intersection retrieval method, device, equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112527163A true CN112527163A (en) | 2021-03-19 |
| CN112527163B CN112527163B (en) | 2022-05-24 |
Family
ID=74999967
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011444092.4A Active CN112527163B (en) | 2020-12-08 | 2020-12-08 | Intersection retrieval method, device, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112527163B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113566842A (en) * | 2021-07-26 | 2021-10-29 | 北京百度网讯科技有限公司 | Data processing method, device, equipment and storage medium |
| CN113704304A (en) * | 2021-08-30 | 2021-11-26 | 北京百度网讯科技有限公司 | Intersection data processing method, intersection retrieval method and device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2002148066A (en) * | 2000-11-13 | 2002-05-22 | Toyota Motor Corp | Route searching device and medium thereof |
| CN101149271A (en) * | 2006-09-20 | 2008-03-26 | 高德软件有限公司 | Crossing point crossing searching device |
| CN109443376A (en) * | 2018-09-25 | 2019-03-08 | 斑马网络技术有限公司 | Intersection searching method, device, electronic equipment and storage medium |
| CN110926486A (en) * | 2019-11-26 | 2020-03-27 | 百度在线网络技术（北京）有限公司 | Route determining method, device, equipment and computer storage medium |
| US20200184278A1 (en) * | 2014-03-18 | 2020-06-11 | Z Advanced Computing, Inc. | System and Method for Extremely Efficient Image and Pattern Recognition and Artificial Intelligence Platform |
-
2020
- 2020-12-08 CN CN202011444092.4A patent/CN112527163B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2002148066A (en) * | 2000-11-13 | 2002-05-22 | Toyota Motor Corp | Route searching device and medium thereof |
| CN101149271A (en) * | 2006-09-20 | 2008-03-26 | 高德软件有限公司 | Crossing point crossing searching device |
| US20200184278A1 (en) * | 2014-03-18 | 2020-06-11 | Z Advanced Computing, Inc. | System and Method for Extremely Efficient Image and Pattern Recognition and Artificial Intelligence Platform |
| CN109443376A (en) * | 2018-09-25 | 2019-03-08 | 斑马网络技术有限公司 | Intersection searching method, device, electronic equipment and storage medium |
| CN110926486A (en) * | 2019-11-26 | 2020-03-27 | 百度在线网络技术（北京）有限公司 | Route determining method, device, equipment and computer storage medium |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113566842A (en) * | 2021-07-26 | 2021-10-29 | 北京百度网讯科技有限公司 | Data processing method, device, equipment and storage medium |
| CN113566842B (en) * | 2021-07-26 | 2024-06-25 | 北京百度网讯科技有限公司 | Data processing method, device, equipment and storage medium |
| CN113704304A (en) * | 2021-08-30 | 2021-11-26 | 北京百度网讯科技有限公司 | Intersection data processing method, intersection retrieval method and device |
| CN113704304B (en) * | 2021-08-30 | 2024-03-05 | 北京百度网讯科技有限公司 | Intersection data processing method, intersection retrieval method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112527163B (en) | 2022-05-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11361005B2 (en) | Method for processing map data, device, and storage medium | |
| CN111695488A (en) | Interest plane identification method, device, equipment and storage medium | |
| CN110765227A (en) | Road traffic network model construction method and device | |
| CN113139118B (en) | Parking lot recommendation method and device, electronic equipment and medium | |
| CN112527163B (en) | Intersection retrieval method, device, equipment and storage medium | |
| CN112013865B (en) | Method, system, electronic device and medium for determining traffic gate | |
| KR20210040879A (en) | Method and device for marking virtual lane at intersection | |
| CN110660219A (en) | Parking lot parking prediction method and device | |
| CN115265559B (en) | Automatic map generation method, device, equipment and medium | |
| CN112100302B (en) | Map information point display method, apparatus, device and readable storage medium | |
| CN112131335B (en) | Lane-level map data processing method and device, electronic equipment and storage medium | |
| CN111324616A (en) | Method, device and equipment for detecting lane line change information | |
| CN110888963A (en) | Data acquisition method and device, electronic equipment and storage medium | |
| CN113160693B (en) | Road intersection processing method, device, equipment and storage medium | |
| CN111637899A (en) | Navigation method, navigation device, electronic equipment and storage medium | |
| CN111597287A (en) | Map generation method, device and equipment | |
| CN112486817B (en) | Evaluation method, device, equipment and storage medium for data update | |
| CN112539761B (en) | Data processing method, apparatus, device, storage medium and computer program product | |
| CN111694914B (en) | Method and device for determining resident area of user | |
| CN113012255B (en) | Road edge extraction method, device, equipment and medium | |
| CN113124887A (en) | Route information processing method, device, equipment and storage medium | |
| CN112419728B (en) | Method, device, equipment and storage medium for determining road condition information | |
| CN111782748A (en) | Map retrieval method, and information point POI semantic vector calculation method and device | |
| CN112530161B (en) | Road data processing method, device and equipment and computer storage medium | |
| CN111998866B (en) | Method, apparatus, device and medium for setting vehicle entrance position for information point |
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 |