CN110345964A - Route matching method, apparatus, system and storage medium - Google Patents

Abstract

The present invention provides a kind of route matching method, apparatus, system and storage medium, this method, comprising: receives the planning path that terminal is sent；And from the planning path, latitude and longitude information is parsed；According to the latitude and longitude information, the section for meeting preset condition in R tree is searched for, and local road network, the section spatial index that the R tree is established for the road net data previously according to load are constructed according to the section found；In the local road network, according to the beginning and end of planning path, the ID sequence of target road section is determined；The additional information that the ID sequence of the target road section and the target road section are included is fed back into terminal；Additional information is for supplementing the road section information lacked in terminal planning path.The present invention improves the accuracy of route matching, ensure that the authenticity and accuracy of data, the additional information that the target road section provided is included have enriched terminal data, terminal is supported to provide better Product Experience for user.

Description

Path matching method, device, system and storage medium

technical field

The present invention relates to the technical field of path planning, in particular to a path matching method, device, system and storage medium.

Background technique

With the rapid development of science and technology, the appearance of navigation products has greatly facilitated people's travel. Navigation products are one of the most frequently used auxiliary tools for users to go out. After the user plans a route using the navigation terminal, he also expects to obtain some additional information on the Link (road section) of the current driving road. For example, whether the route passes through toll stations and information on the toll amount, whether it passes through bridges and tunnels, whether there are major warning messages, whether the route passes through construction sites or temporary traffic restriction information, etc.

At present, most navigation terminals directly request various information of the road sections included in the back-end route through the road section ID or the ID of other road information. That is, the navigation terminal can transmit information such as road section ID to the backend, and the backend calculates and extracts the above information according to the road section ID, and sends the information to the navigation terminal.

However, this method requires that the version of the map data on the navigation terminal and the backend be completely consistent, otherwise it will cause inconsistencies in the IDs of the road sections, resulting in incorrect or missing information, resulting in inconvenience for users and poor user experience.

Contents of the invention

The present invention provides a path matching method, device, system and storage medium, which solves the problem of incorrect information caused by inconsistent data versions between the terminal and the server, improves the accuracy of path matching, and ensures the authenticity and accuracy of data , the additional information contained in the target road section provided by it enriches the terminal data and supports the terminal to provide users with a better product experience.

In the first aspect, a path matching method is provided, including:

receiving the planned path sent by the terminal; and parsing the latitude and longitude information from the planned path;

According to the longitude and latitude information, search for road sections satisfying the preset conditions in the R tree, and construct a local road network according to the found road sections, the R tree is a road section space index established in advance according to the loaded road network data;

In the local road network, determine the ID sequence of the target road section according to the starting point and the end point of the planned path;

The ID sequence of the target road section and the additional information contained in the target road section are fed back to the terminal; the additional information is used to supplement missing road section information on the route planned by the terminal.

In the second aspect, a path matching method is provided, including:

Generate a planned route based on the current location information and the terminal location information;

Sending the planned path to a background server; wherein the background server is configured to execute the method according to any one of the first aspect;

receiving the ID sequence of the target road section sent by the background server, and the additional information contained in the target road section;

Display the ID sequence of the target road section, and the additional information contained in the target road section; the additional information is used to supplement the missing road section information on the planned route of the terminal.

In a third aspect, a path matching device is provided, including:

The transceiver module is used to receive the planned path sent by the terminal; and analyze the latitude and longitude information from the planned path;

A processing module, configured to search for road sections satisfying preset conditions in the R tree according to the latitude and longitude information, and construct a local road network according to the found road sections, the R tree is a road section spatial index established in advance according to the loaded road network data ; and for determining the ID sequence of the target road section according to the starting point and the end point of the planned path in the local road network;

The transceiver module is further configured to feed back the ID sequence of the target road section and the additional information contained in the target road section to the terminal; the additional information is used to supplement missing road section information on the terminal's planned route.

In a fourth aspect, a path matching device is provided, including:

A processing module, configured to generate a planned path according to the current location information and the terminal location information;

Sending the planned path to a background server; wherein the background server is configured to execute the method according to any one of the first aspect;

A receiving module, configured to receive the ID sequence of the target road segment sent by the background server, and the additional information contained in the target road segment;

Display the ID sequence of the target road section, and the additional information contained in the target road section; the additional information is used to supplement the missing road section information on the planned route of the terminal.

In the fifth aspect, a path matching system is provided, including:

terminals and servers;

The terminal is configured to generate a planned path according to the current location information and the terminal location information, and send the planned path to a server; and receive the ID sequence of the target road section sent by the server, and the target road section contained in the Additional information: display the ID sequence of the target road segment, and the additional information contained in the target road segment;

The server is configured to receive the planned path sent by the terminal; and analyze the latitude and longitude information from the planned path; search for road sections in the R tree that meet preset conditions according to the latitude and longitude information, and construct a local road section according to the found road section In the road network, the R tree is a road segment spatial index established in advance according to the loaded road network data; and is used to determine the ID sequence of the target road segment according to the starting point and the end point of the planned path in the partial road network; and The ID sequence of the target road section and the additional information contained in the target road section are fed back to the terminal; the additional information is used to supplement missing road section information on the route planned by the terminal.

In a sixth aspect, an embodiment of the present invention provides a computer-readable storage medium, on which a computer program is stored, and when the program is executed by a processor, the path matching method described in any one of the first aspect is implemented.

The present invention provides a path matching method, device, system and storage medium, by receiving the planned path sent by the terminal; and analyzing the longitude and latitude information from the planned path; according to the longitude and latitude information, searching the R tree to satisfy the preset conditions, and build a local road network according to the found road sections, the R-tree is a road section space index established in advance according to the loaded road network data; in the local road network, according to the starting point and end point of the planned path, determine The ID sequence of the target road segment; feeding back the ID sequence of the target road segment and the additional information contained in the target road segment to the terminal; the additional information is used to supplement missing road segment information on the terminal's planned route. From the space, the path data of the terminal and the path data of the back end are matched, which solves the problem of incorrect information caused by the inconsistent data versions of the terminal and the server, improves the accuracy of path matching, and ensures the authenticity and accuracy of the data. The additional information contained in the provided target section enriches the terminal data and supports the terminal to provide users with a better product experience.

Description of drawings

Fig. 1 is a principle schematic diagram of an application scenario of the present invention;

FIG. 2 is a flow chart of a path matching method provided in Embodiment 1 of the present invention;

Fig. 3 is a schematic diagram of the original road network provided by the embodiment of the present invention;

FIG. 4 is a schematic diagram of construction of a local road network provided by an embodiment of the present invention;

FIG. 5 is a schematic diagram of determining a target road section provided by an embodiment of the present invention;

FIG. 6 is a flow chart of a path matching method provided in Embodiment 2 of the present invention;

FIG. 7 is a schematic structural diagram of a path matching device provided in Embodiment 3 of the present invention;

FIG. 8 is a schematic structural diagram of a path matching device provided in Embodiment 4 of the present invention;

FIG. 9 is a schematic structural diagram of a path matching system provided in Embodiment 5 of the present invention;

FIG. 10 is a schematic structural diagram of a path matching system provided by Embodiment 6 of the present invention.

Detailed ways

In order to make the purpose, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments It is a part of embodiments of the present invention, but not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without making creative efforts belong to the protection scope of the present invention.

The terms "first", "second", "third", "fourth", etc. (if any) in the description and claims of the present invention and the above drawings are used to distinguish similar objects and not necessarily Describe a specific order or sequence. It is to be understood that the data so used are interchangeable under appropriate circumstances such that the embodiments of the invention described herein are, for example, capable of practice in sequences other than those illustrated or described herein. Furthermore, the terms "comprising" and "having", as well as any variations thereof, are intended to cover a non-exclusive inclusion, for example, a process, method, system, product or device comprising a sequence of steps or elements is not necessarily limited to the expressly listed instead, may include other steps or elements not explicitly listed or inherent to the process, method, product or apparatus.

In the prior art, most terminals directly request various information of the road section from the backend through the road section ID or the ID of other road information. After the terminal plans a path, it expects to obtain some additional information from the backend. For example, whether the path passes through toll stations and information on the toll amount, whether it passes through bridges and tunnels, whether there are major warning messages, whether the path passes through construction sites or temporary traffic restrictions, etc. After the terminal transmits information such as the section ID to the backend, the backend extracts the above-mentioned various information according to the section ID. However, a very big problem in the prior art is that the map data versions of the terminal and the backend must be completely consistent. If the two map versions are inconsistent, the link IDs will be inconsistent, and the link information extracted by the backend will be incorrect or missing.

Aiming at the problems in the prior art, the present invention aims to propose a path matching method, which does not depend on the map version of the terminal, as long as the terminal and the backend are consistent in spatial data, so that the authenticity and accuracy of the data can be guaranteed. accuracy. Through the additional information contained in the target road section provided by the backend, the map data of the terminal can be used to support the terminal to provide users with a better product experience.

The technical solution of the present invention will be described in detail below with specific embodiments. The following specific embodiments may be combined with each other, and the same or similar concepts or processes may not be repeated in some embodiments.

FIG. 1 is a schematic diagram of the principle of an application scenario of the present invention. As shown in FIG. 1 , a user inputs starting point and ending point information on a navigation terminal 10, and the navigation service of the terminal 10 performs route planning according to the starting point and ending point information input by the user. If the terminal 10 wishes to acquire additional information on the planned route (such as charge amount information, passing point information, warning information, traffic road condition information, etc.), it will send the route planned by the navigation service to the server 20 . The server 20 receives the planned path sent by the terminal 10, and analyzes the latitude and longitude information from the planned path; the server 20 searches the road section in the R tree that meets the preset conditions according to the latitude and longitude information, and constructs a local road network according to the found road section; the server 20 In the local road network, the ID sequence of the target road section is determined according to the starting point and end point of the planned path; the server 20 feeds back the ID sequence of the target road section and the additional information contained in the target road section to the terminal 10 .

By applying the above method, the path data of the terminal can be matched spatially with the path data of the backend, which can solve the problem of incorrect information caused by the inconsistency of the data versions between the terminal and the server, improve the accuracy of path matching, and ensure the authenticity of the data The additional information contained in the provided target section enriches the terminal data and supports the terminal to provide users with a better product experience.

The technical solution of the present invention and how the technical solution of the present application solves the above technical problems will be described in detail below with specific embodiments. The following specific embodiments may be combined with each other, and the same or similar concepts or processes may not be repeated in some embodiments. Embodiments of the present invention will be described below with reference to the accompanying drawings.

FIG. 2 is a flow chart of the path matching method provided in Embodiment 1 of the present invention. As shown in FIG. 2, the method in this embodiment may include:

S101. Receive the planned route sent by the terminal; and analyze the latitude and longitude information from the planned route.

In this embodiment, the terminal properly thins out the latitude and longitude of the planned path and compiles it into a binary format to reduce network transmission, and stores data in little-endian mode to initiate a request to the server. The server receives the planned path sent by the terminal, and decodes the binary to obtain the latitude and longitude information.

S102. According to the longitude and latitude information, search for road sections satisfying preset conditions in the R tree, and construct a local road network according to the found road sections; the R tree is a road section spatial index established in advance according to the loaded road network data.

In this embodiment, after the latitude and longitude information is determined, the position of the latitude and longitude on the electronic map can be determined according to the latitude and longitude information, and then the search range can be determined centering on the position of the latitude and longitude on the electronic map. Within the search range, the R-tree is used to find the road segment IDs intersecting the range.

In an optional implementation, the server obtains the coordinate values of the latitude and longitude on the electronic map (generally referring to the latest version of the electronic map loaded on the background server), centering on the coordinate value, the preset first threshold is Radius, to determine the search area of the road segment; search all the road segments intersecting with the search area through the R tree as candidate road segments; wherein, the R tree refers to: the road segment spatial index established in advance according to the loaded road network data; the road segment spatial index contains There are road section ID, road section weight information, road section latitude and longitude information, and road section additional information; road section additional information includes: toll amount information, way point information, warning information, traffic road condition information; based on candidate road sections, build a local road network.

Specifically, since the R-tree contains the link spatial index established by the road network data, it has the latitude and longitude information of the link itself, so when the coordinate value of the latitude and longitude is obtained, it can find the corresponding position on the R-tree. When the search area is determined centered on the coordinate value, a search area with the same radius can be determined centered on the corresponding position on the R tree, and then all road segment IDs that have intersections with the search area can be recorded. It should be noted that after the road segment ID is determined, the road segment additional information corresponding to the road segment ID can be queried from the R tree through the road segment ID. For example, the toll amount information of a certain road section, the information of the way point, the warning information, the traffic condition information and so on.

Specifically, FIG. 3 is a schematic diagram of the original road network provided by the embodiment of the present invention. As shown in FIG. 3 , the dots in the figure represent road node nodes, the connected thin lines represent the connected roads in the road network, and the thick black lines represent the terminals sending Due to issues such as version issues and equivalent accuracy, the path planned by the terminal may not exactly match the original road network on the server. Fig. 4 is a schematic diagram of the local road network construction provided by the embodiment of the present invention. As shown in Fig. 4, this implementation takes the longitude and latitude of the planned path as the center, searches for the road segment information within the range of the first threshold as the radius, and finally obtains the information shown in Fig. 4 The local network shown. In the local road network, some road sections with low correlation with the planned path are eliminated.

If the road network data is large, it can be processed in layers, and each layer builds a different road network. For example, according to the level of different road sections, the planning is divided into expressways, national highways, and provincial highways. For each level of the road network in which the latitude and longitude falls, search for matching road section information in the road network. If the planned path has a long distance, the path with a long distance can also be divided into multiple road sections for segment matching. Finally, the results of hierarchical matching or segmental matching are summarized to construct a local road network. In this way, the efficiency of requests for large amounts of data will be improved to a certain extent.

It should be pointed out that the construction of the local road network is an important part in the present invention to ensure the connectivity of the matched target road sections. The planned path sent by the terminal does not have a link ID. To accurately match it to the road network, the connectivity of the matching path is critical. The accuracy can only be guaranteed if the matched road segment sequence is connected. And connectivity can only be achieved by passing through the chain, that is, the shortest path between two points. In this embodiment, longitude and latitude are used to perform accurate path matching, and a local road network must be constructed to achieve connectivity, thereby ensuring the accuracy of matching paths.

S103. In the local road network, determine the ID sequence of the target road section according to the start point and the end point of the planned path.

In this embodiment, according to the local road network, the weighted directed graph of all road sections is constructed, and the weighted directed graph contains the ID of the road section and the weight information of the road section; the position of the starting point and the end point of the planned path in the weighted directed graph is determined ;Use the shortest path algorithm and/or the least time-consuming algorithm to find all connected paths between the start point and the end point; determine the ID sequence of the target road section according to the connected paths.

In this embodiment, the link ID of the weighted directed graph is used to identify the link, and the weight information of the link is used to calculate the connected path. In the weighted directed graph of known link IDs, after the connected path is determined, the ID sequence of the target link can be obtained according to each link ID of the connected path. Specifically, the weight information of the road section can be the distance of the road section, the average time of the road section, etc., so that according to the weight information of the road section, the shortest path algorithm and/or the least time-consuming algorithm can be used to find all the distances between the starting point and the end point. connected path.

Specifically, FIG. 5 is a schematic diagram of the determination of the target road section provided by the embodiment of the present invention. As shown in FIG. 5, the server constructs a weighted directed graph of all road sections in the local road network, and then uses the shortest path algorithm, and/or the least Use the time algorithm to find all connected paths between the starting point and the ending point, and finally get the road sections from the starting point to the ending point as L2, L5, L7, L10, L12, L13, and L14.

In an optional implementation manner, before performing step S103, it is also possible to read the first latitude and longitude coordinate value and the last latitude and longitude coordinate value in the latitude and longitude information; centering on the first latitude and longitude coordinate value, preset The second threshold is the radius, which determines the search range of the starting point; the node within the search range and closest to the first latitude and longitude coordinate value is used as the starting point of the planned path; centered on the last latitude and longitude coordinate value, the preset third The threshold is the radius, which determines the search range of the end point; the node within the search range and closest to the last latitude and longitude coordinate value is used as the end point of the planned path.

It should be noted that the closest in this embodiment refers to the shortest straight-line distance between two points. That is, the straight-line distance between the node and the point corresponding to the coordinate value is the smallest. The latitude and longitude coordinate value of the path is a point string, select the first point of the point string and the last point of the point string. It should be noted here that after a path is determined, its corresponding longitude and latitude point strings are also determined, and the collection method can be collected on the line segment corresponding to the planned path according to the preset interval.

Further, if no satisfying node can be found within the current search range, the search range can be expanded until a node within the search range and closest to the first latitude and longitude coordinate value is found.

S104. Feed back the ID sequence of the target road section and the additional information contained in the target road section to the terminal; the additional information is used to supplement missing road section information on the route planned by the terminal.

In this embodiment, the ID sequence of the target road segment determined in step S103 and the additional information included in the target road segment are fed back to the terminal. Wherein, the additional information includes: toll amount information, way point information, warning information, traffic condition information, and the like.

In a possible application scenario, if the number of connected paths is greater than 1, the connected path with the highest degree of matching with the route shape of the planned path is used as the target path; and the ID sequence of the target section corresponding to the target path is obtained. Matching is performed based on the similarity of the path shape, the remaining connected paths are eliminated, and the only connected path with the highest similarity is returned to the terminal.

What needs to be said is that the route shape matching degree refers to the degree of similarity in the shape of two routes after they are scaled to the same size. Specifically, the planned path and the connected path can be stacked, and the higher the degree of overlap, the higher the corresponding degree of matching (similarity).

In another possible application scenario, if the number of connected paths is greater than 1, all connected paths whose distances between connected paths and planned paths are within a preset range are screened out; The target route; and obtain the ID sequence of the target road segment corresponding to the target route, and feed back the additional information contained in the target road segment to the terminal. In this implementation, screening is performed according to the difference between the distance of the connected path and the distance of the planned path, sorted according to the distance difference, and multiple connected paths are returned to the terminal for the user to choose.

In this embodiment, the road network data is first loaded into the memory, and an R tree is constructed. The terminal sends the planned path, and the longitude and latitude are appropriately thinned out and compiled into a binary format to reduce network transmission. The data is stored in little-endian mode to initiate a request to the backend, and the backend decodes the binary into longitude and latitude. The backend determines the start and end points according to the requested latitude and longitude. Specifically, the map frame or tile can be calculated according to the first latitude and longitude and the last latitude and longitude, and then the node point closest to the latitude and longitude within a certain distance (for example, within 10 meters) can be found within the frame or tile to be determined as the starting point or the end point . Find all candidate road segments in the R tree (spatial index) according to the latitude and longitude passed to the backend (for example, in an area with a radius of 30 meters, search for the road segment that intersects with this area as a candidate road segment), construct a local road network according to the candidate road segments, and generate A weighted directed graph, where the weight of a road segment can be set to the length of the road segment. Using the Dijkstra algorithm (or other shortest path algorithms such as A*, etc.), calculate the shortest distance from the start point to the end point in the local road network, and obtain the target road segment sequence that constitutes the shortest distance. Return the information required by the front end according to the target road segment sequence.

Specifically, taking the charging business as an example, when the driving end selects the starting point and the ending point, it can send a route calculation request to the map server, and the map server will plan the route. The server will return this part of the longitude and latitude coordinate string and vehicle related information to the four-dimensional high-speed toll service platform according to the pre-defined transmission protocol. After the four-dimensional high-speed toll service platform obtains the coordinate string, it performs path matching according to the above-mentioned path matching algorithm to obtain several road sections in the four-dimensional road network, and then calculates the high-speed fee required for the path according to the toll standards attached to the road sections and business principles, Return to the map server. Finally, the map server feeds back to the driving terminal together with the charging information and the planned route.

In the prior art, the terminal side plans the route according to the local version of the map, and sends the planned route to the server. Since the map on the server side may be the latest version of the map, while the map on the terminal side is an old version map, if the link information is fed back to the terminal directly according to the planned route sent by the terminal, it is easy to cause link matching errors, which will cause the terminal side to receive The segment information for is inaccurate.

In view of the above problems, in this embodiment, the server first parses the latitude and longitude information from the planned route sent by the terminal (this is because the road segment ID of the same road segment in different versions of the map may change, but the latitude and longitude information of the same road segment will not change. , so as to avoid road segment matching errors caused by inconsistent map versions), and then search for road segments in the R tree that meet the preset conditions according to the latitude and longitude information, and build a local road network based on the found road segments (since the R tree is preloaded with a basis The link space index established by the road network data, therefore, after the latitude and longitude information is known, the planned path of the terminal can be matched through the local road network constructed by the R tree. The link ID obtained at this time is the latest version map of the server ID of the road segment, which matches the planned route of the terminal, thereby preventing the server side from feeding back wrong road segment information to the terminal based on the wrong road segment ID).

It should be noted that since the road section information on the map on the terminal side is often not the latest version, or the road section information loaded by it is not comprehensive enough, the terminal side sends the planned path to the server side in order to obtain the road section corresponding to the planned path from the server side for more additional information. With the method in this embodiment, after the server determines the ID sequence of the target road section, it feeds back the ID sequence of the target road section and the additional information contained in the target road section to the terminal, so that accurate road section information can be obtained. The additional information fed back enriches the terminal data and can support the terminal to provide users with a better product experience.

In this embodiment, by receiving the planned path sent by the terminal; and analyzing the latitude and longitude information from the planned path; according to the latitude and longitude information, searching for road sections in the R tree that meet the preset conditions, and constructing a local road network based on the found road sections, the R tree It is the road segment spatial index established in advance according to the loaded road network data; in the local road network, according to the starting point and end point of the planned path, determine the ID sequence of the target road segment; combine the ID sequence of the target road segment and the additional The information is fed back to the terminal; the additional information is used to supplement the missing section information on the planned route of the terminal. From the space, the path data of the terminal and the path data of the back end are matched, which solves the problem of incorrect information caused by the inconsistent data versions of the terminal and the server, improves the accuracy of path matching, and ensures the authenticity and accuracy of the data. The additional information contained in the provided target section enriches the terminal data and supports the terminal to provide users with a better product experience.

FIG. 6 is a flow chart of the path matching method provided in Embodiment 2 of the present invention. As shown in FIG. 6, the method in this embodiment may include:

S201. Generate a planned route according to the current location information and the destination location information.

In this embodiment, the terminal can obtain current location information through a positioning sensor, and then generate a planned route through a map-type APP based on the destination location.

S202. Send the planned path to the background server.

In this embodiment, the terminal sends the planned route generated in step S201 to the background server, so that the background server executes the method shown in FIG. 2 .

S203. Receive the ID sequence of the target road segment and the additional information contained in the target road segment sent by the background server.

In this embodiment, the terminal receives the ID sequence of the target road segment and its corresponding attachment information fed back by the background server. The attachment information may include the toll amount information of the road segment, way point information, warning information, traffic condition information, and the like.

S204, displaying the ID sequence of the target road section and the additional information contained in the target road section; the additional information is used to supplement missing road section information on the planned route of the terminal.

In this embodiment, the terminal can display the ID sequence of the target road segment and the additional information contained in the target road segment on the current map display interface.

In this embodiment, the planned path is generated according to the current location information and the terminal location information; the planned path is sent to the background server; the ID sequence of the target road section sent by the background server and the additional information contained in the target road section are received; the target road section is displayed ID sequence, and the additional information contained in the target road segment; the additional information is used to supplement the missing road segment information on the terminal's planned route. From the space, the path data of the terminal and the path data of the back end are matched, which solves the problem of incorrect information caused by the inconsistent data versions of the terminal and the server, improves the accuracy of path matching, and ensures the authenticity and accuracy of the data. The additional information contained in the provided target section enriches the terminal data and supports the terminal to provide users with a better product experience.

FIG. 7 is a schematic structural diagram of a path matching device provided in Embodiment 3 of the present invention. As shown in FIG. 7, the path matching device in this embodiment may include:

The transceiver module 31 is used to receive the planned path sent by the terminal; and analyze the latitude and longitude information from the planned path;

The processing module 32 is used to search for road sections satisfying the preset conditions in the R tree according to the latitude and longitude information, and construct a local road network according to the found road sections. The R tree is a road section spatial index established in advance according to the loaded road network data; and In the local road network, according to the starting point and end point of the planned path, determine the ID sequence of the target road section;

The transceiver module 31 is also used to feed back the ID sequence of the target road segment and the additional information contained in the target road segment to the terminal; the additional information is used to supplement missing road segment information on the terminal's planned route.

Optionally, the processing module 32 is specifically used for:

Obtain the coordinate values of the latitude and longitude on the electronic map, center on the coordinate value, and the preset first threshold is the radius, and determine the search area of the road segment;

Search all road sections intersecting with the search area through the R tree as candidate road sections; wherein, the road section spatial index of the R tree contains road section ID information, road section weight information, road section latitude and longitude information, and road section additional information; road section additional information Including: charging amount information, way point information, warning information, traffic road condition information;

Based on the candidate road sections, a local road network is constructed. Optionally, the processing module 32 is also used to read the first latitude and longitude coordinate value in the latitude and longitude information, and the last Latitude and longitude coordinate value;

Taking the first latitude and longitude coordinate value as the center, and the preset second threshold as the radius, determine the search range of the starting point; use the node within the search range and closest to the first latitude and longitude coordinate value as the starting point of the planned path;

The last latitude and longitude coordinate value is the center, and the preset third threshold is the radius to determine the search range of the end point; the node within the search range and closest to the last latitude and longitude coordinate value is used as the end point of the planned path.

Optionally, the processing module 32 is also used for:

According to the local road network, a weighted directed graph of all road sections is constructed, and the weighted directed graph contains the ID of the road section and the weight information of the road section;

Determine the position of the starting point and end point of the planned path in the weighted directed graph;

Use the shortest path algorithm and/or the least time-consuming algorithm to find all connected paths between the starting point and the ending point;

According to the connected path, the ID sequence of the target link is determined.

Optionally, the processing module 32 is also used for:

If the number of connected paths is greater than 1, the connected path with the highest degree of matching with the route shape of the planned path is used as the target path; and the ID sequence of the target road section corresponding to the target path is obtained; or

If the number of connected paths is greater than 1, filter out all connected paths whose distance between the connected path and the distance of the planned path is within a preset range; use all the filtered connected paths as the target path; and obtain the target corresponding to the target path The ID sequence of the target segment of the segment.

In this embodiment, by receiving the planned path sent by the terminal; and analyzing the latitude and longitude information from the planned path; according to the latitude and longitude information, searching for road sections in the R tree that meet the preset conditions, and constructing a local road network based on the found road sections, the R tree It is the road segment spatial index established in advance according to the loaded road network data; in the local road network, according to the starting point and end point of the planned path, determine the ID sequence of the target road segment; combine the ID sequence of the target road segment and the additional The information is fed back to the terminal; the additional information is used to supplement the missing section information on the planned route of the terminal. From the space, the path data of the terminal and the path data of the back end are matched, which solves the problem of incorrect information caused by the inconsistent data versions of the terminal and the server, improves the accuracy of path matching, and ensures the authenticity and accuracy of the data. The additional information contained in the provided target section enriches the terminal data and supports the terminal to provide users with a better product experience.

The path matching device in this embodiment can implement the technical solution in the method shown in FIG. 2 . For the specific implementation process and technical principles, refer to the relevant description in the method shown in FIG. 2 , and details will not be repeated here.

FIG. 8 is a schematic structural diagram of a path matching device provided in Embodiment 4 of the present invention. As shown in FIG. 8, the path matching device in this embodiment may include:

A processing module 41, configured to generate a planned route according to the current location information and the terminal location information;

Send the planned path to the background server; wherein, the background server is used to execute the method as in any one of the first aspect;

The receiving module 42 is used to receive the ID sequence of the target road section sent by the background server, and the additional information contained in the target road section;

Display the ID sequence of the target road segment and the additional information contained in the target road segment; the additional information is used to supplement the missing road segment information on the terminal's planned route.

In this embodiment, the planned path is generated according to the current location information and the terminal location information; the planned path is sent to the background server; the ID sequence of the target road section sent by the background server and the additional information contained in the target road section are received; the target road section is displayed ID sequence, and the additional information contained in the target road segment; the additional information is used to supplement the missing road segment information on the terminal's planned route. From the space, the path data of the terminal and the path data of the back end are matched, which solves the problem of incorrect information caused by the inconsistent data versions of the terminal and the server, improves the accuracy of path matching, and ensures the authenticity and accuracy of the data. The additional information contained in the provided target section enriches the terminal data and supports the terminal to provide users with a better product experience.

The path matching device in this embodiment can implement the technical solution in the method shown in FIG. 6 . For the specific implementation process and technical principle, refer to the relevant description in the method shown in FIG. 6 , which will not be repeated here.

FIG. 9 is a schematic structural diagram of a path matching system provided in Embodiment 5 of the present invention. As shown in FIG. 9 , the path matching system 50 of this embodiment can be a terminal 51 and a server 52;

The terminal 51 is used to generate a planned route according to the current position information and the terminal position information, and send the planned route to the server; and receive the ID sequence of the target road section sent by the server, and the additional information contained in the target road section; display the target road section ID sequence, and additional information contained in the target road segment;

The server 52 is used to receive the planned path sent by the terminal; and analyze the latitude and longitude information from the planned path; search for road sections in the R tree that meet the preset conditions according to the latitude and longitude information, and construct a local road network based on the found road sections, the R tree It is the road segment spatial index established in advance according to the loaded road network data; and it is used to determine the ID sequence of the target road segment according to the starting point and end point of the planned path in the local road network; and the ID sequence of the target road segment, and the target road segment The contained additional information is fed back to the terminal; the additional information is used to supplement the missing section information on the terminal's planned route.

The path matching system of this embodiment can implement the technical solutions in the methods shown in FIG. 2 and FIG. 6 . For the specific implementation process and technical principles, refer to the relevant descriptions in the methods shown in FIG. 2 and FIG. 6 , and details will not be repeated here.

FIG. 10 is a schematic structural diagram of a path matching system provided by Embodiment 6 of the present invention. As shown in FIG. 10 , the path matching system 60 of this embodiment may include: a processor 61 and a memory 62 .

The memory 62 is used to store computer programs (such as application programs, functional modules, etc. for realizing the above-mentioned path matching method), computer instructions, etc.;

The above-mentioned computer programs, computer instructions, etc. may be stored in one or more memories 62 in partitions. And the above-mentioned computer programs, computer instructions, data, etc. can be invoked by the processor 61 .

The processor 61 is configured to execute the computer program stored in the memory 62, so as to implement various steps in the methods involved in the above-mentioned embodiments.

For details, refer to the related descriptions in the foregoing method embodiments.

The processor 61 and the memory 62 may be an independent structure, or an integrated structure integrated together. When the processor 61 and the memory 62 have independent structures, the memory 62 and the processor 61 may be coupled and connected through the bus 63 .

The server in this embodiment can implement the technical solutions in the methods shown in FIG. 2 and FIG. 6 . For the specific implementation process and technical principles, refer to the relevant descriptions in the methods shown in FIG. 2 and FIG. 6 , and details will not be repeated here.

In addition, an embodiment of the present application also provides a computer-readable storage medium, in which computer-executable instructions are stored. When at least one processor of the user equipment executes the computer-executable instructions, the user equipment executes the above-mentioned various possibilities. Methods.

Among other things, computer-readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A storage media may be any available media that can be accessed by a general purpose or special purpose computer. An exemplary storage medium is coupled to the processor such the processor can read information from, and write information to, the storage medium. Of course, the storage medium may also be a component of the processor. The processor and storage medium can be located in the ASIC. Additionally, the ASIC may be located in the user equipment. Of course, the processor and the storage medium can also exist in the communication device as discrete components.

The present application also provides a program product, the program product includes a computer program, the computer program is stored in a readable storage medium, at least one processor of the server can read the computer program from the readable storage medium, and at least one processor executes the computer program so that The server implements the method of any one of the above-mentioned embodiments of the present invention.

Those of ordinary skill in the art can understand that all or part of the steps for implementing the above method embodiments can be completed by program instructions and related hardware. The aforementioned program can be stored in a computer-readable storage medium. When the program is executed, it executes the steps including the above-mentioned method embodiments; and the aforementioned storage medium includes: ROM, RAM, magnetic disk or optical disk and other various media that can store program codes.

Finally, it should be noted that: the above embodiments are only used to illustrate the technical solutions of the present invention, rather than limiting them; although the present invention has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that: It is still possible to modify the technical solutions described in the foregoing embodiments, or perform equivalent replacements for some or all of the technical features; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the technical solutions of the various embodiments of the present invention. scope.

Claims (10)

1. a kind of route matching method characterized by comprising

Receive the planning path that terminal is sent；And from the planning path, latitude and longitude information is parsed；

According to the latitude and longitude information, the section for meeting preset condition in R tree is searched for, and local road is constructed according to the section found Net, the section spatial index that the R tree is established for the road net data previously according to load；

In the local road network, according to the beginning and end of planning path, the ID sequence of target road section is determined；

The additional information that the ID sequence of the target road section and the target road section are included is fed back into terminal；It is described attached Add information for supplementing the road section information lacked in terminal planning path.

2. the method according to claim 1, wherein searching for meet in R tree and preset according to the latitude and longitude information The section of condition, and local road network is constructed according to the section found；Include:

The coordinate value of longitude and latitude on the electronic map is obtained, centered on the coordinate value, preset first threshold is radius, really Determine the region of search in section；

All sections intersected with described search region are searched for by R tree, as candidate road section；Wherein, the section of the R tree is empty Between index in include road section ID, the value information in section, the latitude and longitude information in section and section additional information；The road Section additional information includes: charge amount information, approach point information, information warning, traffic information；

Based on the candidate road section, local road network is constructed.

3. method according to claim 1 or 2, which is characterized in that in the local road network, according to rising for planning path Point and terminal, before the ID sequence for determining target road section, further includes:

Read the first latitude and longitude coordinates value and the last one latitude and longitude coordinates value in the latitude and longitude information；

Centered on first latitude and longitude coordinates value, preset second threshold is radius, determines the search range of starting point；It will Within the scope of described search and starting point of the node nearest apart from first latitude and longitude coordinates value as planning path；

Centered on the last one described latitude and longitude coordinates value, preset third threshold value is radius, determines the search range of terminal； It will be located within the scope of described search and the node nearest apart from the last one latitude and longitude coordinates value be as the end of planning path Point.

4. method according to claim 1 or 2, which is characterized in that in the local road network, according to rising for planning path Point and terminal, determine the ID sequence of target road section, comprising:

According to the local road network, the weighted digraph in all sections is constructed；

Determine position of the beginning and end of planning path in the weighted digraph；

Using shortest path first, and/or minimum used time algorithm, find all communication paths between Origin And Destination；

According to the communication path, the ID sequence of target road section is determined.

5. according to the method described in claim 4, it is characterized in that, determining the ID sequence of target road section according to the communication path Column, comprising:

If the quantity of the communication path is greater than 1, by the highest access of route shape matching degree with the planning path Diameter is as destination path；And obtain the ID sequence of the corresponding target road section of the destination path；Or

If the quantity of the communication path is greater than 1, the difference at a distance from the distance and planning path of communication path is filtered out pre- If all communication paths in range；Using all communication paths filtered out as destination path；And obtain the destination path The ID sequence of the target road section of corresponding target road section.

6. a kind of route matching method characterized by comprising

According to current location information and end point location information, planning path is generated；

The planning path is sent to background server；Wherein, the background server is for executing as in claim 1-5 Described in any item methods；

The additional letter that the ID sequence and the target road section for receiving the target road section that the background server is sent are included Breath；

The additional information that the ID sequence and the target road section in displaying target section are included；The additional information is for mending Fill the road section information lacked in terminal planning path.

7. a kind of route matching device characterized by comprising

Transceiver module, for receiving the planning path of terminal transmission；And from the planning path, latitude and longitude information is parsed；

Processing module, for according to the latitude and longitude information, searching for the section for meeting preset condition in R tree, and according to finding Section constructs local road network, the section spatial index that the R tree is established for the road net data previously according to load；And it is used for In the local road network, according to the beginning and end of planning path, the ID sequence of target road section is determined；

The transceiver module is also used to the additional letter for being included by the ID sequence of the target road section and the target road section Breath feeds back to terminal；The additional information is for supplementing the road section information lacked in terminal planning path.

8. device according to claim 7, which is characterized in that the processing module is specifically used for:

The coordinate value of longitude and latitude on the electronic map is obtained, centered on the coordinate value, preset first threshold is radius, really Determine the region of search in section；

All sections intersected with described search region are searched for by R tree, as candidate road section；Wherein, the section Spatial Cable of R tree It include section id information, the value information in section, the latitude and longitude information in section and section additional information in drawing；The road Section additional information includes: charge amount information, approach point information, information warning, traffic information；

Based on the candidate road section, local road network is constructed.

9. a kind of route matching system characterized by comprising terminal and server；

The terminal, for according to current location information and end point location information, generating planning path, and by the planning road Diameter is sent to server；And receive the ID sequence for the target road section that the server is sent and the target road section is included Additional information；The additional information that the ID sequence and the target road section in displaying target section are included；

The server, for receiving the planning path of terminal transmission；And from the planning path, longitude and latitude letter is parsed Breath；According to the latitude and longitude information, the section for meeting preset condition in R tree is searched for, and local road is constructed according to the section found Net, the section spatial index that the R tree is established for the road net data previously according to load；And in the local road network In, according to the beginning and end of planning path, determine the ID sequence of target road section；And by the ID sequence of the target road section, with And the additional information that the target road section is included feeds back to the terminal；The additional information is for supplementing terminal planning path The road section information of upper missing.

10. a kind of computer readable storage medium, is stored thereon with computer program, which is characterized in that the program is by processor Route matching method of any of claims 1-6 is realized when execution.