CN111143495B - Road missing discovery method and device - Google Patents
Road missing discovery method and device Download PDFInfo
- Publication number
- CN111143495B CN111143495B CN201911313033.0A CN201911313033A CN111143495B CN 111143495 B CN111143495 B CN 111143495B CN 201911313033 A CN201911313033 A CN 201911313033A CN 111143495 B CN111143495 B CN 111143495B
- Authority
- CN
- China
- Prior art keywords
- road
- track
- distance
- data
- node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 39
- 239000013589 supplement Substances 0.000 claims abstract description 10
- 238000004891 communication Methods 0.000 claims description 21
- 238000001514 detection method Methods 0.000 claims description 2
- 238000005065 mining Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 5
- 238000009412 basement excavation Methods 0.000 description 2
- 238000010276 construction Methods 0.000 description 2
- 230000007547 defect Effects 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000001133 acceleration Effects 0.000 description 1
- 230000006978 adaptation Effects 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000002265 prevention Effects 0.000 description 1
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/29—Geographical information databases
Abstract
The invention discloses a method and a device for finding road missing, comprising the following steps: searching road nodes in a preset range of the driving track from the basic road data; acquiring road description information of a road where the road node is located from an established data table; dividing road nodes with the same road description information into a group; determining the Frechet distance between the road node and the driving track in each group; if the determined French distance is larger than the distance threshold value, adding 1 to the number of times; and when the number of times exceeds the threshold value, outputting a road missing notification containing the driving track so as to prompt a user to supplement the missing road to the basic road data. The road nodes in the track range are searched, the Frechet distance is calculated after the road nodes are grouped according to the same road, so that the shape matching of the track and the road is realized, the accurate identification of the road missing is realized according to the unmatched times, and the mismatching problem is avoided.
Description
Technical Field
The invention relates to the technical field of computers, in particular to a method and a device for discovering road missing.
Background
With acceleration of urban and rural construction, popularization of mobile internet map navigation application and vehicle navigation, electronic maps play an increasingly important role. How to quickly and accurately find map changes, especially newly opened roads, becomes important.
The current road missing mining model is to find out the road missing phenomenon of the basic road data by matching the driving track with the basic road data.
However, the matching accuracy of the existing road loss mining model is very low, so that the problem that the track is mismatched to a nearby road easily occurs, and the accurate judgment of the road loss result is affected.
Disclosure of Invention
The invention aims at providing a missing road discovery method and device aiming at the defects of the prior art, and the purpose is achieved through the following technical scheme.
The first aspect of the present invention proposes a road loss discovery method, the method comprising:
for each track point in a driving track, searching road nodes positioned in a preset range of the track point from basic road data, wherein the driving track is derived from track data uploaded by a vehicle-mounted terminal on a truck;
acquiring road description information of a road where the road node is located from an established data table;
dividing road nodes with the same road description information into a group;
for each group, determining the Frechet distance between the road node and the driving track in the group;
if the determined French distance is larger than the distance threshold value, adding 1 to the unmatched times, and recording the driving track;
and when the number of mismatching times exceeds a time threshold, outputting a road missing notification containing the recorded driving tracks so as to prompt a user to supplement the missing road into the basic road data according to the driving tracks.
A second aspect of the present invention proposes a road loss finding apparatus, the apparatus comprising:
the searching module is used for searching road nodes positioned in a preset range of the track points from the basic road data aiming at each track point in the track, wherein the track is derived from track data uploaded by a vehicle-mounted terminal on a truck;
the acquisition module is used for acquiring road description information of the road where the road node is located from the established data table;
the grouping module is used for dividing the road nodes with the same road description information into a group;
the determining module is used for determining the French distance between the road node and the driving track in each group;
the statistics module is used for adding 1 to the unmatched times and recording the driving track if the determined French distance is larger than the distance threshold value;
and the prompting module is used for outputting a road missing notification containing the recorded driving tracks when the number of mismatching times exceeds a number threshold so as to prompt a user to supplement the missing road into the basic road data according to the driving tracks.
In the embodiment of the invention, the vehicle track is intercepted from track data uploaded by a truck, and for each track point in the vehicle track, a road node in a preset range of the track point is searched from basic road data, then road description information of a road where the road node is located is obtained from an established data table, road nodes with the same road description information are divided into groups, and finally, for each group, the French distance between the road node in the group and the vehicle track is determined, if the French distance greater than a distance threshold exists in the determined French distance, the unmatched times are increased by 1, the vehicle track is recorded, and further, when the unmatched times exceed the frequency threshold, a road missing notification containing the recorded vehicle track is output, so that a user is prompted to supplement the missing road into the basic road data according to the vehicle track.
Based on the above description, the track source data of the present invention is derived from the vehicle-mounted terminal of the truck, and the truck needs to travel over a long distance and must upload tracks, so that the track coverage is comprehensive and the tracks are continuous. When matching is carried out, the road nodes in the range of the driving track are searched, the road nodes are grouped according to the same road, and then the form matching of the track and the road data is realized by calculating the French distance, so that the unmatched times are updated according to the French distance, the accurate identification of the road missing is realized according to the comparison of the unmatched times and a threshold value, and the mismatching problem is avoided.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the invention and do not constitute a limitation on the invention. In the drawings:
FIG. 1 is a schematic diagram of a track matching result of a road loss mining model in the related art;
FIG. 2A is a flowchart illustrating an embodiment of a method for finding a road loss according to an exemplary embodiment of the present invention;
FIG. 2B is a diagram of trace matching results according to the embodiment of FIG. 2A;
FIG. 3 is a hardware block diagram of an electronic device according to an exemplary embodiment of the present invention;
fig. 4 is a flowchart illustrating an embodiment of a road loss discovery apparatus according to an exemplary embodiment of the present invention.
Detailed Description
Reference will now be made in detail to exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, the same numbers in different drawings refer to the same or similar elements, unless otherwise indicated. The implementations described in the following exemplary examples do not represent all implementations consistent with the invention. Rather, they are merely examples of apparatus and methods consistent with aspects of the invention as detailed in the accompanying claims.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used in this specification and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used herein refers to and encompasses any or all possible combinations of one or more of the associated listed items.
It should be understood that although the terms first, second, third, etc. may be used herein to describe various information, these information should not be limited by these terms. These terms are only used to distinguish one type of information from another. For example, first information may also be referred to as second information, and similarly, second information may also be referred to as first information, without departing from the scope of the invention. The word "if" as used herein may be interpreted as "at … …" or "at … …" or "responsive to a determination", depending on the context.
Fig. 1 is a schematic diagram of a track matching result of a road missing excavation model in the related art, where a driving track actually runs on a missing expressway instead of the "mining road" in fig. 1, and a conventional road missing excavation model matches the driving track to a nearby "mining road", so as to affect accurate determination of a road missing result.
In addition, the data sources of the driving tracks used by the traditional road missing mining model are all track source data uploaded by a vehicle-mounted end of a small vehicle or a mobile phone terminal positioning program, and the track source data usually have certain defects, such as limited track coverage range, uploading tracks according to user wishes, and discontinuous tracks are likely to cause a plurality of problems that newly-increased roads cannot be found.
In order to solve the technical problems, the invention provides a road missing finding method, which is characterized in that a driving track is intercepted from track data uploaded by a truck, and for each track point in the driving track, road nodes in a preset range of the track point are searched from basic road data, then road description information of a road where the road nodes are located is obtained from an established data table, the road nodes with the same road description information are divided into groups, and finally, for each group, the French distance between the road nodes in the group and the driving track is determined, if the French distance greater than a distance threshold exists in the determined French distance, the unmatched times are increased by 1, the driving track is recorded, and then when the unmatched times exceed the frequency threshold, a road missing notification containing the recorded driving track is output, so that a user is prompted to supplement the missing road into the basic road data according to the driving track.
Based on the above description, the track source data of the present invention is derived from the vehicle-mounted terminal of the truck, and the truck needs to travel over a long distance and must upload tracks, so that the track coverage is comprehensive and the tracks are continuous. When matching is carried out, the road nodes in the range of the driving track are searched, the road nodes are grouped according to the same road, and then the form matching of the track and the road data is realized by calculating the French distance, so that the unmatched times are updated according to the French distance, the accurate identification of the road missing is realized according to the comparison of the unmatched times and a threshold value, and the mismatching problem is avoided.
The road loss finding method proposed by the invention is explained in detail below with specific examples.
Fig. 2A is a flowchart of an embodiment of a method for finding a road loss according to an exemplary embodiment of the present invention, where the method for finding a road loss may be applied to an electronic device (such as a PC, a terminal, etc.). As shown in fig. 2A, the road loss discovery method includes the steps of:
step 201: and searching road nodes positioned in a preset range of the track points from the basic road data aiming at each track point in the driving track.
In the invention, the driving track is derived from track data uploaded by a vehicle-mounted terminal on a truck. The base road data includes road node data and road link line data.
Each road node in the road node data comprises information such as a node ID, a longitude value, a latitude value, an attribute identifier of whether the road node is an intersection or not, and the like; the road link data includes information such as road topology constituted by node IDs, road names and road grades of each road, and the like.
In one example, the track may be selected from the track data for a predetermined period of time (e.g., 2 minutes) before the current system time.
In another example, road nodes within a preset radius (e.g., 1 km or 500 meters) may be searched for in the base road data with the track point as the center of the circle.
Step 202: and acquiring the road description information of the road where the road node is located from the established data table.
Prior to performing step 202, the data table creation process may be: and searching road description information of a road where the road node is located from the road connection line data aiming at each road node in the road node data, and adding the road node and the searched road description information into a data table correspondingly.
The road description information comprises a road name and a road grade.
For example, the roads are classified into expressways, primary roads, secondary roads, tertiary roads, and quaternary roads by functional class; the road class is classified into national road, provincial road and county road according to administrative level.
Step 203: the road nodes whose road description information is the same are divided into one group.
The road description information is the same and indicates that the road name and the road grade are the same. The road nodes in each group all belong to the same road.
Step 204: for each group, a Frechet distance between a road node and a path of travel in the group is determined.
In an embodiment, polynomial curve fitting may be performed by using the longitude value and the latitude value of each track point in the track to obtain a curve L, and a preset number of points are collected at equal intervals on the curve L according to the direction of the transverse axis to form a first point set, and polynomial curve fitting is performed by using the longitude value and the latitude value of each road node in the group to obtain a curve R, and a preset number of points are collected at equal intervals on the curve R according to the direction of the transverse axis to form a second point set, and then the furcher distance between the first point set and the second point set is calculated.
In order to improve the accuracy of curve fitting, when polynomial curve fitting is performed, an initial track point and a final track point in the driving track can be obtained, and if the latitude difference between the initial track point and the final track point is greater than the longitude difference, polynomial curve fitting is performed by taking latitude as a horizontal axis and longitude as a vertical axis; otherwise, the longitude is used as a horizontal axis, and the latitude is used as a vertical axis to perform polynomial curve fitting. That is, the horizontal coordinate difference value between the two coordinate points is always larger than the vertical coordinate difference value.
It should be noted that, if the latitude is taken as the horizontal axis, the abscissa of each point in the first point set and the second point set obtained by collection is located between the latitude value of the start track point and the latitude value of the end track point in the vehicle track. If the longitude is taken as the horizontal axis, the horizontal coordinate of each point in the first point set and the second point set is positioned between the longitude value of the starting track point and the longitude value of the ending track point in the running track.
For example, the curve fitting of the polynomial may employ a curve fitting of a cubic polynomial.
It will be appreciated by those skilled in the art that the process of calculating the French distance between the first set of points and the second set of points may be implemented using a computing algorithm that is related to the French distance, as the invention is not limited in this respect.
Step 205: if the determined French distance is larger than the distance threshold, adding 1 to the number of mismatching times, and recording the driving track.
If the fraiche distance is larger than the distance threshold, the track is not matched with the basic road data, and the track is likely to belong to the data of the missing road.
It should be noted that, when the determined fraiche distance has a fraiche distance greater than the distance threshold, the problem of erroneous judgment may be avoided by checking connectivity. And if the communication result is that the initial track point and the final track point are communicated, acquiring road nodes with the attribute of the intersection from the group corresponding to the Frechet distance larger than the distance threshold, determining the communication result between each track point in the track and each road node with the attribute of the intersection, judging whether each track point is communicated with the same road node according to the communication result, and if not, adding 1 to the unmatched times.
In the present invention, the number of mismatching refers to the number of trails that do not match the basic road data. After one driving track is selected from the track data for matching, if the driving track is not matched with the basic road data, the number of times of mismatching is increased by 1.
Step 206: and when the number of mismatching times exceeds a time threshold, outputting a road missing notification containing the recorded driving tracks so as to prompt a user to supplement the missing road into the basic road data according to the driving tracks.
When the number of times of mismatch exceeds a number threshold, the current basic road data is indicated to have the problem of road missing, and updating is needed to provide accurate services for functions such as follow-up overspeed reminding, position monitoring reminding and the like, and provide powerful data bottom support for follow-up active prevention and control of road driving risks.
For example, the number of times threshold may be set based on practical experience.
In an exemplary scenario, as shown in fig. 2B, after the above-mentioned track shown in fig. 1 is matched with the basic road data, it may be obviously found that the track is not matched with "mining Lin Lu", and further a missing road is found, where the missing road is actually a capital loop line with high speed, and the basic road data is not updated yet because of the late construction time.
In this embodiment, a vehicle track is intercepted from track data uploaded by a truck, and for each track point in the vehicle track, a road node located in a preset range of the track point is searched from basic road data, then road description information of a road where the road node is located is obtained from an established data table, road nodes with the same road description information are divided into groups, and finally for each group, the furrest distance between the road node in the group and the vehicle track is determined, if the furrest distance greater than a distance threshold exists in the determined furrest distance, the number of mismatching times is increased by 1, the vehicle track is recorded, and further when the number of mismatching times exceeds the number threshold, a road deletion notification containing the recorded vehicle track is output to prompt a user to supplement a missing road into the basic road data according to the vehicle track.
Based on the above description, the track source data of the present invention is derived from the vehicle-mounted terminal of the truck, and the truck needs to travel over a long distance and must upload tracks, so that the track coverage is comprehensive and the tracks are continuous. When matching is carried out, the road nodes in the range of the driving track are searched, the road nodes are grouped according to the same road, and then the form matching of the track and the road data is realized by calculating the French distance, so that the unmatched times are updated according to the French distance, the accurate identification of the road missing is realized according to the comparison of the unmatched times and a threshold value, and the mismatching problem is avoided.
Fig. 3 is a hardware configuration diagram of an electronic device according to an exemplary embodiment of the present invention, the electronic device including: a communication interface 301, a processor 302, a machine-readable storage medium 303, a physical storage medium 305, and a bus 304; wherein the communication interface 301, the processor 302 and the machine-readable storage medium 303 perform communication with each other via a bus 304. The processor 302 may perform the road loss discovery method described above by reading and executing machine-executable instructions in the machine-readable storage medium 303 corresponding to the control logic of the road loss discovery method, the details of which are described above with reference to the above embodiments and will not be further described here.
The machine-readable storage medium 303 of the present invention may be any electronic, magnetic, optical, or other physical storage device that may contain or store information, such as executable instructions, data, or the like. For example, a machine-readable storage medium may be: volatile memory, nonvolatile memory, or similar storage medium. In particular, the machine-readable storage medium 303 may be RAM (Random Access Memory ), flash memory, a storage drive (e.g., hard drive), any type of storage disk (e.g., optical disk, DVD, etc.), or a similar storage medium, or a combination thereof.
The invention also provides an embodiment of the road loss finding device corresponding to the embodiment of the road loss finding method.
Fig. 4 is a flowchart illustrating an embodiment of a road loss discovery apparatus according to an exemplary embodiment of the present invention, which may be applied to an electronic device. As shown in fig. 4, the road loss finding device includes:
the searching module 410 is configured to search, for each track point in a driving track, for a road node located in a preset range of the track point from the basic road data, where the driving track is derived from track data uploaded by a vehicle-mounted terminal on a truck;
an obtaining module 420, configured to obtain, from an established data table, road description information of a road where the road node is located;
a grouping module 430, configured to divide the road nodes with the same road description information into a group;
a determining module 440, configured to determine, for each group, a furcher distance between a road node and a driving track in the group;
a statistics module 450, configured to add 1 to the number of mismatching times and record a driving track if the determined fraiche distance has a fraiche distance greater than the distance threshold;
and the prompting module 460 is configured to output a road missing notification including the recorded driving track when the number of times of mismatch exceeds the number of times threshold, so as to prompt the user to supplement the missing road into the basic road data according to the driving track.
In an alternative implementation, the base road data includes road node data and road link line data, and the apparatus further includes (not shown in fig. 4):
the data table building module is used for searching road description information of a road where the road node is located from the road connecting line data aiming at each road node in the road node data; and adding the road node and the found road description information into a data table correspondingly.
In an optional implementation manner, the determining module 440 is specifically configured to perform polynomial curve fitting by using the longitude value and the latitude value of each track point in the vehicle track to obtain a curve L; according to the transverse axis direction, a preset number of points are acquired on the curve L at equal intervals to form a first point set; performing polynomial curve fitting by utilizing the longitude value and the latitude value of each road node in the group to obtain a curve R; according to the transverse axis direction, a preset number of points are acquired on the curve R at equal intervals to form a second point set; a Frechet distance between the first set of points and the second set of points is calculated.
In an alternative implementation, the polynomial curve fitting process includes: acquiring an initial track point and a final track point in the driving track; if the latitude difference between the initial track point and the termination track point is larger than the longitude difference, performing polynomial curve fitting by taking latitude as a horizontal axis and longitude as a vertical axis; otherwise, the longitude is used as a horizontal axis, and the latitude is used as a vertical axis to perform polynomial curve fitting.
In an alternative implementation, the apparatus further comprises (not shown in fig. 4):
the detection module is used for determining a communication result between an initial track point and an end track point in the driving track when the French distance larger than the distance threshold exists in the French distances; if the communication result is communication, acquiring road nodes with the attribute of the intersection from the groups corresponding to the Frechet distances larger than the distance threshold value, and determining the communication result between each track point in the driving track and each road node with the attribute of the intersection; judging whether each track point is communicated with the same road node according to the communication result; if not, the number of mismatches is increased by 1.
In an alternative implementation, the road description information includes a road name and a road class.
The implementation process of the functions and roles of each unit in the above device is specifically shown in the implementation process of the corresponding steps in the above method, and will not be described herein again.
For the device embodiments, reference is made to the description of the method embodiments for the relevant points, since they essentially correspond to the method embodiments. The apparatus embodiments described above are merely illustrative, wherein the elements illustrated as separate elements may or may not be physically separate, and the elements shown as elements may or may not be physical elements, may be located in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purposes of the present invention. Those of ordinary skill in the art will understand and implement the present invention without undue burden.
Other embodiments of the invention will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This invention is intended to cover any variations, uses, or adaptations of the invention following, in general, the principles of the invention and including such departures from the present disclosure as come within known or customary practice within the art to which the invention pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the invention being indicated by the following claims.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article or apparatus that comprises the element.
The foregoing description of the preferred embodiments of the invention is not intended to be limiting, but rather to enable any modification, equivalent replacement, improvement or the like to be made within the spirit and principles of the invention.
Claims (6)
1. A method of finding a road loss, the method comprising:
for each track point in a driving track, searching road nodes positioned in a preset range of the track point from basic road data, wherein the driving track is derived from track data uploaded by a vehicle-mounted terminal on a truck;
acquiring road description information of a road where the road node is located from an established data table;
dividing road nodes with the same road description information into a group;
for each group, determining the Frechet distance between the road node and the driving track in the group;
if the determined French distance is larger than the distance threshold value, adding 1 to the unmatched times, and recording the driving track;
when the number of times of mismatching exceeds a number threshold, outputting a road missing notification containing recorded driving tracks so as to prompt a user to supplement the missing road into basic road data according to the driving tracks;
the method further comprises the steps of:
if the determined French distance is larger than the distance threshold, determining a communication result between an initial track point and an end track point in the driving track;
if the communication result is communication, acquiring road nodes with the attribute of the intersection from the groups corresponding to the Frechet distances larger than the distance threshold value, and determining the communication result between each track point in the driving track and each road node with the attribute of the intersection;
judging whether each track point is communicated with the same road node according to the communication result;
if not, adding 1 to the unmatched times;
determining the fraiche distance between the road node and the path of the vehicle in the group comprises:
performing polynomial curve fitting by utilizing the longitude value and the latitude value of each track point in the driving track to obtain a curve L; according to the transverse axis direction, a preset number of points are acquired on the curve L at equal intervals to form a first point set;
performing polynomial curve fitting by utilizing the longitude value and the latitude value of each road node in the group to obtain a curve R; according to the transverse axis direction, a preset number of points are acquired on the curve R at equal intervals to form a second point set;
a Frechet distance between the first set of points and the second set of points is calculated.
2. The method of claim 1, wherein the base road data comprises road node data and road link line data, and wherein the creating of the data table comprises:
for each road node in the road node data, searching road description information of a road where the road node is located from the road connection line data;
and adding the road node and the found road description information into a data table correspondingly.
3. The method of claim 1, wherein the polynomial curve fitting process comprises:
acquiring an initial track point and a final track point in the driving track;
if the latitude difference between the initial track point and the termination track point is larger than the longitude difference, performing polynomial curve fitting by taking latitude as a horizontal axis and longitude as a vertical axis;
otherwise, the longitude is used as a horizontal axis, and the latitude is used as a vertical axis to perform polynomial curve fitting.
4. A method according to any one of claims 1-3, characterized in that the road description information comprises a road name and a road grade.
5. A road loss finding apparatus, characterized by comprising:
the searching module is used for searching road nodes positioned in a preset range of the track points from the basic road data aiming at each track point in the track, wherein the track is derived from track data uploaded by a vehicle-mounted terminal on a truck;
the acquisition module is used for acquiring road description information of the road where the road node is located from the established data table;
the grouping module is used for dividing the road nodes with the same road description information into a group;
the determining module is used for determining the French distance between the road node and the driving track in each group; the determining module is specifically configured to perform polynomial curve fitting by using a longitude value and a latitude value of each track point in the driving track to obtain a curve L; according to the transverse axis direction, a preset number of points are acquired on the curve L at equal intervals to form a first point set; performing polynomial curve fitting by utilizing the longitude value and the latitude value of each road node in the group to obtain a curve R; according to the transverse axis direction, a preset number of points are acquired on the curve R at equal intervals to form a second point set; calculating a Frechet distance between the first point set and the second point set;
the statistics module is used for adding 1 to the unmatched times and recording the driving track if the determined French distance is larger than the distance threshold value;
the prompting module is used for outputting a road missing notification containing the recorded driving tracks when the number of mismatching times exceeds a number threshold so as to prompt a user to supplement the missing road into basic road data according to the driving tracks;
the apparatus further comprises:
the detection module is used for determining a communication result between an initial track point and an end track point in the driving track when the French distance larger than the distance threshold exists in the French distances; if the communication result is communication, acquiring road nodes with the attribute of the intersection from the groups corresponding to the Frechet distances larger than the distance threshold value, and determining the communication result between each track point in the driving track and each road node with the attribute of the intersection; judging whether each track point is communicated with the same road node according to the communication result; if not, the number of mismatches is increased by 1.
6. The apparatus of claim 5, wherein the polynomial curve fitting process comprises: acquiring an initial track point and a final track point in the driving track; if the latitude difference between the initial track point and the termination track point is larger than the longitude difference, performing polynomial curve fitting by taking latitude as a horizontal axis and longitude as a vertical axis; otherwise, the longitude is used as a horizontal axis, and the latitude is used as a vertical axis to perform polynomial curve fitting.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911313033.0A CN111143495B (en) | 2019-12-18 | 2019-12-18 | Road missing discovery method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911313033.0A CN111143495B (en) | 2019-12-18 | 2019-12-18 | Road missing discovery method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111143495A CN111143495A (en) | 2020-05-12 |
| CN111143495B true CN111143495B (en) | 2024-01-30 |
Family
ID=70518837
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911313033.0A Active CN111143495B (en) | 2019-12-18 | 2019-12-18 | Road missing discovery method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111143495B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111750876A (en) * | 2020-06-16 | 2020-10-09 | 北京百度网讯科技有限公司 | Road network repairing method, device, equipment and storage medium |
| CN112365722B (en) * | 2020-09-22 | 2022-09-06 | 浙江大华系统工程有限公司 | Road monitoring area identification method and device, computer equipment and storage medium |
| CN112530158B (en) * | 2020-10-27 | 2022-05-13 | 北方信息控制研究院集团有限公司 | Road network supplementing method based on historical track |
| CN113834496A (en) * | 2021-08-25 | 2021-12-24 | 深圳市跨越新科技有限公司 | Road data missing track matching method, system, terminal device and storage medium |
| CN115731261B (en) * | 2021-08-27 | 2023-06-16 | 河北省交通规划设计研究院有限公司 | Vehicle lane change behavior recognition method and system based on expressway radar data |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106840175A (en) * | 2016-12-06 | 2017-06-13 | 北京中交兴路信息科技有限公司 | A kind of vehicle driving trace matches the method and device of road network |
| CN107133700A (en) * | 2017-05-12 | 2017-09-05 | 西南交通大学 | Mobile phone signaling data road network method based on R* tree indexes |
| CN109035783A (en) * | 2018-09-17 | 2018-12-18 | 东南大学 | A kind of virtual networks missing section automatic identifying method based on public transport GPS track |
-
2019
- 2019-12-18 CN CN201911313033.0A patent/CN111143495B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106840175A (en) * | 2016-12-06 | 2017-06-13 | 北京中交兴路信息科技有限公司 | A kind of vehicle driving trace matches the method and device of road network |
| CN107133700A (en) * | 2017-05-12 | 2017-09-05 | 西南交通大学 | Mobile phone signaling data road network method based on R* tree indexes |
| CN109035783A (en) * | 2018-09-17 | 2018-12-18 | 东南大学 | A kind of virtual networks missing section automatic identifying method based on public transport GPS track |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111143495A (en) | 2020-05-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111143495B (en) | Road missing discovery method and device | |
| US10323948B2 (en) | GPS data repair | |
| US8510042B2 (en) | Navigation device and data update system | |
| CN106323301B (en) | Method and device for acquiring road information | |
| CN101210825B (en) | Map information generating systems | |
| JP5064870B2 (en) | Digital road map generation method and map generation system | |
| CN103149577B (en) | The Combinated navigation method that " Big Dipper " navigation, GPS navigation and historical data merge | |
| CN102968900B (en) | Method for processing RFID (Radio Frequency Identification) traffic data | |
| CN103403496B (en) | Utilize detection data to determine and verify the method that navigation right of priority is arranged | |
| CN101218486A (en) | Method, device and system for modeling a road network graph | |
| US11062063B2 (en) | System and method for generating vehicle travel data | |
| CN104050817A (en) | Speed limiting information base generation and speed limiting information detection method and system | |
| CN101726309A (en) | Navigation electronic map dynamic topology rebuilding system method based on road data increment updating | |
| TW202146852A (en) | Route deviation quantification and vehicular route learning based thereon | |
| CN106705976A (en) | Road network matching method and road network matching device | |
| CN104422451A (en) | Road recognition method and road recognition apparatus | |
| Zhang et al. | Vehicle positioning system with multi‐hypothesis map matching and robust feedback<? show [AQ ID= Q1]?> | |
| CN105890599A (en) | Filter algorithm based on geographical location footprint noisy points | |
| TW201700956A (en) | A method for processing navigation and a mobile smart terminal | |
| CN114356951B (en) | Method and device for updating associated information of guide point | |
| CN103218406B (en) | The processing method and equipment of the address information of point of interest | |
| CN114117261B (en) | Track detection method and device, electronic equipment and storage medium | |
| CN106294384B (en) | It was found that the method and device of new road name | |
| CN114758493B (en) | Expressway traffic flow monitoring method and system based on data fusion | |
| CN116842123B (en) | Method for predicting relocation position, method for updating map, device and equipment |
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 |