CN110768819A - Generation method, planning method, device, terminal and readable storage medium - Google Patents

Generation method, planning method, device, terminal and readable storage medium Download PDF

Info

Publication number
CN110768819A
CN110768819A CN201811468521.4A CN201811468521A CN110768819A CN 110768819 A CN110768819 A CN 110768819A CN 201811468521 A CN201811468521 A CN 201811468521A CN 110768819 A CN110768819 A CN 110768819A
Authority
CN
China
Prior art keywords
route
road
travel
information
traffic
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201811468521.4A
Other languages
Chinese (zh)
Other versions
CN110768819B (en
Inventor
李亚旭
王征
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Didi Infinity Technology and Development Co Ltd
Original Assignee
Beijing Didi Infinity Technology and Development Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Didi Infinity Technology and Development Co Ltd filed Critical Beijing Didi Infinity Technology and Development Co Ltd
Priority to CN201811468521.4A priority Critical patent/CN110768819B/en
Publication of CN110768819A publication Critical patent/CN110768819A/en
Application granted granted Critical
Publication of CN110768819B publication Critical patent/CN110768819B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/12—Discovery or management of network topologies
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/01—Detecting movement of traffic to be counted or controlled
    • G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14—Network analysis or design
    • H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network

Abstract

The invention provides a generation method, a planning device, a terminal and a readable storage medium, wherein the generation method of a road network topological graph comprises the following steps: extracting a plurality of travel road sections in the road network information according to the acquired road network information of the specified area; abstracting a travel road section into travel nodes to generate a node topological graph according to a plurality of route nodes; determining a traffic weight value between any two route nodes according to the acquired traffic rule information; and updating the node topological graph according to the traffic weight value to generate a road network topological graph. According to the technical scheme, on one hand, the processing efficiency of traffic data can be improved by adopting the route nodes to replace travel road sections for analysis and display, on the other hand, the expression of the trafficability of the road sections in the road network topological graph is more reasonable by increasing the consideration of traffic rule information, so that the travel condition can be improved under the guidance of the generated road network topological graph, and further the satisfaction degree of a user on travel navigation is improved.

Description

Generation method, planning method, device, terminal and readable storage medium
Technical Field
The invention relates to the technical field of navigation, in particular to a road network topological graph generating method, a road network topological graph generating device, a travel route planning method, a travel route planning device, a terminal and a computer readable storage medium.
Background
When planning a route for traveling according to an electronic map, when encountering a more complex intersection, such as a viaduct with a multilayer structure, an intersection with a main road and a sub road, and a roundabout, there are usually a plurality of traffic rule restrictions, and in the related art, the route planning can be realized through a road network topology graph, and the specific process includes: adding a weight value between the link and the link to indicate whether the link is available, if the link is available, setting a smaller weight on the link, and if the link is unavailable, setting the link to a larger weight, and in subsequent route planning, the link with the larger weight is not selected preferentially, so that the scheme has the following defects:
(1) the road network topology model adopted in the prior art has relatively low data processing efficiency;
(2) the barriers caused by the traffic regulation limitation in traveling are not considered, it is difficult for inexperienced drivers to reasonably pass through the intersection, and even traffic jam is caused, the updating of the traffic regulation by map manufacturers lags behind the traffic regulation of actual roads, and the factors influence the actual route planning, so that the normal traveling of users is influenced.
Disclosure of Invention
The present invention is directed to solving at least one of the problems of the prior art or the related art.
Therefore, the present invention aims to provide a road network topological graph generation method, a road network topological graph generation device, a travel route planning method, a travel route planning device, a terminal and a computer readable storage medium.
In order to achieve the above object, a technical solution of a first aspect of the present invention provides a method for generating a road network topological graph, including: extracting a plurality of travel road sections in the road network information according to the acquired road network information of the specified area; abstracting a travel road section into travel nodes to generate a node topological graph according to a plurality of route nodes; determining a traffic weight value between any two route nodes according to the acquired traffic rule information; and updating the node topological graph according to the traffic weight value to generate a road network topological graph.
In the technical scheme, a node topological graph is generated according to extracted route nodes, then a traffic weight value between two route nodes is determined according to currently executed traffic rule information, so as to determine whether two travel road sections can pass at present according to the pass weight value, update the node topological graph according to the pass weight value and generate a road network topological graph, compared with the way that the road network topological graph respectively comprises road sections and nodes at two ends of the road sections in the prior art, on one hand, by adopting the route nodes to replace the travel sections for analysis and display, the processing efficiency of the traffic data can be improved, and on the other hand, by increasing the consideration of traffic regulation information, the representation of the trafficability of the road sections in the road network topological graph is more reasonable, therefore, the travel condition can be improved under the guidance of the generated road network topological graph, and the satisfaction degree of a user on travel navigation is further promoted.
The node topological graph can be generated only according to the relative positions of the route nodes and the route nodes, the route nodes correspond to at least one road section, the route nodes can be extracted at positions such as whether traffic lights are arranged or not and whether direction change exists or not, so that whether the two adjacent route nodes can pass or not is determined according to the road attribute information of the route nodes, the route nodes at least have one direction attribute and one length attribute, and the expression of a road network topological model is simplified by generating the node topological graph, so that the data processing amount is reduced, and the data processing effect is improved.
Specifically, the road network information may be road layout of a plurality of roads in a region, and the road network geometric data obtained from the map database may be composed of geospatial data and traffic information, where the geospatial data includes longitude and latitude, road information, and the like, and the road network information is determined according to the road network geometric data, and in addition, the map information may also be directly obtained through other map product structure interfaces to serve as the road network information, such as Google Maps, hundred degree Maps, and high-resolution Maps.
In addition, determining a traffic weight value between any two route nodes according to the acquired traffic rule information may specifically include: whether the traffic can pass through among the route nodes in the node topological graph is judged according to the traffic rule information, for example, three route nodes can be respectively marked as N1, N2 and N3, and according to the traffic rule information, information that the route nodes from N1 to N2 can go straight, the route nodes from N1 to N3 cannot turn left, the route nodes from N2 to N3 cannot go straight and the like can be judged, so that the passing weight value of the travel road section corresponding to the route node is determined according to the information, and the simplest setting mode is that the passing weight value is 0 and the non-passing weight value is 1.
In the foregoing technical solution, preferably, the abstracting a travel section into travel nodes to generate a node topology map according to a plurality of route nodes, further includes: and determining the travel cost corresponding to the route node according to the road attribute information of the route node, wherein the road attribute information comprises at least one of road traffic time, road congestion degree, road grade, road width, road number and road pavement strength of the travel road section corresponding to the route node.
In the technical scheme, the travel cost corresponding to the route node is determined, and the travel cost is used as one of the bases for selecting the route node when traveling, so that on one hand, the travel road section is determined according to the travel cost of the route node, the total cost of traveling of a user is reduced, traffic pressure is relieved correspondingly, and on the other hand, traffic optimization can be performed according to the travel cost, such as modification of traffic rule information, and the like, so that the convenience of traveling is further improved.
The current real-time road condition can be represented by the road traffic time and the road congestion degree.
Specifically, a road section is abstracted into nodes (nodes) by adopting an establishing concept different from that of a road network topological model in the prior art, so that a node topological graph composed of a plurality of nodes can be obtained, the nodes in the node topological graph have spatial attributes (including direction attributes and length attributes) and weight attributes at the same time, so as to measure the passing cost of the road section corresponding to the nodes, wherein the passing cost of the road section can be determined based on parameters such as road passing time, road crowding degree, road grade, road width, road number, road pavement strength and the like.
In any of the above technical solutions, preferably, the method further includes: and adding a cost identifier corresponding to the travel cost to the node topological graph.
According to the technical scheme, the cost identifier corresponding to the travel cost is added to the node topological graph, so that the travel cost determined according to the road attribute information is visualized, and the travel condition analysis in the current designated area can be executed through the node topological graph.
The description of the cost identifier corresponding to the travel cost can be realized in a mode of gradual change of the icon color, the higher the travel cost is, the darker the corresponding node icon color is, and the lower the travel cost is, the lighter the corresponding node abrupt change color is.
In any of the above technical solutions, preferably, before determining the traffic weight value between any two route nodes according to the acquired traffic rule information, the method further includes: accessing a traffic database according to a preset access frequency so as to acquire currently executed traffic rule information in a specified area in real time; or analyzing the driving track in the historical network car booking order in the designated area to determine traffic regulation information according to the driving track, wherein the traffic regulation information comprises at least one of turn around limitation information, unidirectional driving limitation information, time interval driving limitation information, steering limitation information, single and double number limitation information, license plate limitation information and temporary control information.
In the technical scheme, the traffic regulation information can be obtained in various manners, for example, by accessing an open traffic database to obtain the current latest traffic regulation information, the traffic regulation information obtained in the manner is higher in timeliness, or the traffic regulation information is determined according to the driving track in the appointment order of the historical network, and the restriction of the environment required by the manner is lower.
The traffic regulation information may include turning limitation information, unidirectional driving limitation information, time-interval driving limitation information, steering limitation information, single-double number limitation information, license plate limitation information, temporary regulation information, and the like.
Specifically, the traffic rule information of each road section can be updated in real time according to a preset time interval, and the updating is performed every five minutes, so that a route which is more in line with real-time working conditions can be obtained in route planning, and the satisfaction degree of a user is further improved.
In addition, the traffic regulation information is determined according to the driving track in the historical network car booking order, whether head-off is forbidden or not can be determined, the traffic regulation (such as whether license plate is restricted or not) can be determined by combining the analysis of vehicle data (such as license plates of vehicles), and in addition, the report of the traffic information of users (drivers and passengers) can also be used as one of the data acquisition sources of the traffic information.
In any of the above technical solutions, preferably, the node topology map is updated according to the traffic weight value to generate the road network topology map, specifically including the following steps: generating a passing route identifier corresponding to the passing weight value; and adding the passing route identification between two corresponding route nodes in the node topological graph to form the road network topological graph.
In the technical scheme, the passing route identifier is generated and added between the two corresponding route nodes to determine whether the two route nodes can pass through and determine the quantitative value of the passing cost, so that on one hand, the node topological graph is perfected and updated, the reference value of the road network topological graph is improved, and on the other hand, the accuracy of route planning when a user goes out is further improved.
Specifically, the passing route identifier may be generated by adding a line segment (link) indicating whether passing is possible or not in the node topological graph, and the link may have a weight attribute, that is, a passing weight value, to further measure the travel cost, for example, the weight of the link between the passable nodes may be 0 or a minimum value, and the link between the impassable nodes may not be added or may be 1.
The route identifier may be added to the node topology map by a solid line, a dashed line, or in other ways, to form a road network topology map, for example, the node topology map has two road segments corresponding to N1 and N2, and if it is determined that N1 can turn to N2 according to the traffic rule information, a solid line may be added between N1 and N2 to indicate a passable identifier, if no turn is available between N1 and N2, no solid line may be added between L1 and L2, or a greater weight value may be identified between N1 and N2, so that the road segments will not be preferentially selected in the subsequent route planning.
A technical solution of a second aspect of the present invention provides a travel route planning method, including: after receiving the position information of the route starting point and the position information of the route ending point, determining a travel route from the route starting point to the route ending point according to the road network topological graph according to any embodiment of the first aspect of the present invention; the travel route is displayed on a display device.
According to the technical scheme, route planning operation is executed according to the road network topological graph, whether two road sections in a preset planned route can be normally switched or not is determined according to traffic rule information, route planning accuracy and timeliness are improved, and traffic jam probability is reduced while user experience is improved.
In the foregoing technical solution, preferably, the determining a travel route from a route starting point to a route ending point according to a road network topological graph specifically includes the following steps: determining a plurality of route nodes and a plurality of route nodes between a route starting point and a route ending point; respectively determining travel costs of a plurality of route nodes and a traffic weight value between any two route nodes; and determining a travel route according to the travel cost and the traffic weight value.
In the technical scheme, the travel cost can be generated according to road attribute information of the route node, the traffic weight value can be generated according to current traffic rule information, and by combining the road attribute information and the traffic rule information, compared with the scheme that the travel route is determined by only considering the road attribute information in the prior art, the rationality of travel planning is improved, and the probability of wrong route generation caused by traffic rules is reduced.
Specifically, an optional route is determined according to a route starting point and a route ending point, the optional route comprises a node and a link (passable road section) connecting the starting point and the ending point, and the passing cost (comprising the travel cost and the passing weight value) of the optional route is calculated so as to preferentially select the route with lower passing cost.
The third aspect of the present invention provides a road network topological graph generating device, including: the extraction unit is used for extracting a plurality of travel road sections in the road network information according to the acquired road network information of the specified area; the abstraction unit is used for abstracting the travel road section into travel nodes so as to generate a node topological graph according to the route nodes; the determining unit is used for determining a traffic weight value between any two route nodes according to the acquired traffic rule information; and the updating unit is used for updating the node topological graph according to the traffic weight value so as to generate a road network topological graph.
In the technical scheme, a node topological graph is generated according to extracted route nodes, then a traffic weight value between two route nodes is determined according to currently executed traffic rule information, so as to determine whether two travel road sections can pass at present according to the pass weight value, update the node topological graph according to the pass weight value and generate a road network topological graph, compared with the way that the road network topological graph respectively comprises road sections and nodes at two ends of the road sections in the prior art, on one hand, by adopting the route nodes to replace the travel sections for analysis and display, the processing efficiency of the traffic data can be improved, and on the other hand, by increasing the consideration of traffic regulation information, the representation of the trafficability of the road sections in the road network topological graph is more reasonable, therefore, the travel condition can be improved under the guidance of the generated road network topological graph, and the satisfaction degree of a user on travel navigation is further promoted.
The node topological graph can be generated only according to the relative positions of the route nodes and the route nodes, the route nodes correspond to at least one road section, the route nodes can be extracted at positions such as whether traffic lights are arranged or not and whether direction change exists or not, so that whether the two adjacent route nodes can pass or not is determined according to the road attribute information of the route nodes, the route nodes at least have one direction attribute and one length attribute, and the expression of a road network topological model is simplified by generating the node topological graph, so that the data processing amount is reduced, and the data processing effect is improved.
Specifically, the road network information may be road layout of a plurality of roads in a region, and the road network geometric data obtained from the map database may be composed of geospatial data and traffic information, where the geospatial data includes longitude and latitude, road information, and the like, and the road network information is determined according to the road network geometric data, and in addition, the map information may also be directly obtained through other map product structure interfaces to serve as the road network information, such as Google Maps, hundred degree Maps, and high-resolution Maps.
In addition, determining a traffic weight value between any two route nodes according to the acquired traffic rule information may specifically include: whether the traffic can pass through among the route nodes in the node topological graph is judged according to the traffic rule information, for example, three route nodes can be respectively marked as N1, N2 and N3, and according to the traffic rule information, information that the route nodes from N1 to N2 can go straight, the route nodes from N1 to N3 cannot turn left, the route nodes from N2 to N3 cannot go straight and the like can be judged, so that the passing weight value of the travel road section corresponding to the route node is determined according to the information, and the simplest setting mode is that the passing weight value is 0 and the non-passing weight value is 1.
In the foregoing technical solution, preferably, the determining unit is further configured to: and determining the travel cost corresponding to the route node according to the road attribute information of the route node, wherein the road attribute information comprises at least one of road traffic time, road congestion degree, road grade, road width, road number and road pavement strength of the travel road section corresponding to the route node.
In the technical scheme, the travel cost corresponding to the route node is determined, and the travel cost is used as one of the bases for selecting the route node when traveling, so that on one hand, the travel road section is determined according to the travel cost of the route node, the total cost of traveling of a user is reduced, traffic pressure is relieved correspondingly, and on the other hand, traffic optimization can be performed according to the travel cost, such as modification of traffic rule information, and the like, so that the convenience of traveling is further improved.
The current real-time road condition can be represented by the road traffic time and the road congestion degree.
Specifically, a road section is abstracted into nodes (nodes) by adopting an establishing concept different from that of a road network topological model in the prior art, so that a node topological graph composed of a plurality of nodes can be obtained, the nodes in the node topological graph have spatial attributes (including direction attributes and length attributes) and weight attributes at the same time, so as to measure the passing cost of the road section corresponding to the nodes, wherein the passing cost of the road section can be determined based on parameters such as road passing time, road crowding degree, road grade, road width, road number, road pavement strength and the like.
In any of the above technical solutions, preferably, the method further includes: and the adding unit is used for adding the cost identifier corresponding to the travel cost to the node topological graph.
According to the technical scheme, the cost identifier corresponding to the travel cost is added to the node topological graph, so that the travel cost determined according to the road attribute information is visualized, and the travel condition analysis in the current designated area can be executed through the node topological graph.
The description of the cost identifier corresponding to the travel cost can be realized in a mode of gradual change of the icon color, the higher the travel cost is, the darker the corresponding node icon color is, and the lower the travel cost is, the lighter the corresponding node abrupt change color is.
In any of the above technical solutions, preferably, the method further includes: the access unit is used for accessing the traffic database according to the preset access frequency so as to acquire the currently executed traffic rule information in the designated area in real time; the analysis unit is used for analyzing the driving track in the historical network car booking order in the designated area so as to determine traffic regulation information according to the driving track, wherein the traffic regulation information comprises at least one item of turn-around limitation information, unidirectional driving limitation information, time interval driving limitation information, steering limitation information, single-double number limitation information, license plate limitation information and temporary control information.
In the technical scheme, the traffic regulation information can be obtained in various manners, for example, by accessing an open traffic database to obtain the current latest traffic regulation information, the traffic regulation information obtained in the manner is higher in timeliness, or the traffic regulation information is determined according to the driving track in the appointment order of the historical network, and the restriction of the environment required by the manner is lower.
The traffic regulation information may include turning limitation information, unidirectional driving limitation information, time-interval driving limitation information, steering limitation information, single-double number limitation information, license plate limitation information, temporary regulation information, and the like.
Specifically, the traffic rule information of each road section can be updated in real time according to a preset time interval, and the updating is performed every five minutes, so that a route which is more in line with real-time working conditions can be obtained in route planning, and the satisfaction degree of a user is further improved.
In addition, the traffic regulation information is determined according to the driving track in the historical network car booking order, whether head-off is forbidden or not can be determined, the traffic regulation (such as whether license plate is restricted or not) can be determined by combining the analysis of vehicle data (such as license plates of vehicles), and in addition, the report of the traffic information of users (drivers and passengers) can also be used as one of the data acquisition sources of the traffic information.
In any of the above technical solutions, preferably, the method further includes: the generating unit is used for generating a passing route identifier corresponding to the passing weight value; the adding unit is further configured to add a transit route identifier between two corresponding route nodes in the node topological graph to form a road network topological graph.
In the technical scheme, the passing route identifier is generated and added between the two corresponding route nodes to determine whether the two route nodes can pass through and determine the quantitative value of the passing cost, so that on one hand, the node topological graph is perfected and updated, the reference value of the road network topological graph is improved, and on the other hand, the accuracy of route planning when a user goes out is further improved.
Specifically, the passing route identifier may be generated by adding a line segment (link) indicating whether passing is possible or not in the node topological graph, and the link may have a weight attribute, that is, a passing weight value, to further measure the travel cost, for example, the weight of the link between the passable nodes may be 0 or a minimum value, and the link between the impassable nodes may not be added or may be 1.
The route identifier may be added to the node topology map by a solid line, a dashed line, or in other ways, to form a road network topology map, for example, the node topology map has two road segments corresponding to N1 and N2, and if it is determined that N1 can turn to N2 according to the traffic rule information, a solid line may be added between N1 and N2 to indicate a passable identifier, if no turn is available between N1 and N2, no solid line may be added between L1 and L2, or a greater weight value may be identified between N1 and N2, so that the road segments will not be preferentially selected in the subsequent route planning.
A fourth aspect of the present invention provides a travel route planning apparatus, including: a determining unit, configured to determine, after receiving location information of a route starting point and location information of a route ending point, a travel route from the route starting point to the route ending point according to the road network topology map according to any embodiment of the first aspect of the present invention; and the display unit is used for displaying the travel route on the display equipment.
According to the technical scheme, route planning operation is executed according to the road network topological graph, whether two road sections in a preset planned route can be normally switched or not is determined according to traffic rule information, route planning accuracy and timeliness are improved, and traffic jam probability is reduced while user experience is improved.
In the foregoing technical solution, preferably, the determining unit is further configured to: determining a plurality of route nodes between a route starting point and a route ending point; the determination unit is further configured to: respectively determining travel costs of a plurality of route nodes and a traffic weight value between any two route nodes; the determination unit is further configured to: and determining a travel route according to the travel cost and the traffic weight value.
In the technical scheme, the travel cost can be generated according to road attribute information of the route node, the traffic weight value can be generated according to current traffic rule information, and by combining the road attribute information and the traffic rule information, compared with the scheme that the travel route is determined by only considering the road attribute information in the prior art, the rationality of travel planning is improved, and the probability of wrong route generation caused by traffic rules is reduced.
Specifically, an optional route is determined according to a route starting point and a route ending point, the optional route comprises a node and a link (passable road section) connecting the starting point and the ending point, and the passing cost (comprising the travel cost and the passing weight value) of the optional route is calculated so as to preferentially select the route with lower passing cost.
An aspect of the fifth aspect of the present invention provides a terminal, including a memory, a processor, and a computer program stored in the memory and operable on the processor, where the processor implements the steps of the road network topology map generation method according to any one of the aspects of the first aspect of the present invention when executing the computer program, and/or includes the travel route planning method according to any one of the aspects of the second aspect of the present invention.
In this technical solution, when the processor of the terminal executes the computer program, the steps of the method for generating a road network topology according to any one of the technical solutions of the first aspect of the present invention are implemented, and/or the method for planning a travel route includes any one of the technical solutions of the second aspect of the present invention, so that all the advantages of the method for generating a road network topology according to any one of the technical solutions of the first aspect of the present invention and/or all the advantages of the method for planning a travel route according to the technical solution of the second aspect of the present invention are achieved, and details are not repeated herein.
An aspect of the sixth aspect of the present invention provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the steps of the road network topology map generation method according to any one of the aspects of the first aspect of the present invention, and/or includes the travel route planning method according to any one of the aspects of the second aspect of the present invention.
Additional aspects and advantages of the invention will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the invention.
Drawings
The above and/or additional aspects and advantages of the present invention will become apparent and readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings of which:
FIG. 1 shows a schematic flow diagram of a method for generating a road network topology graph according to an embodiment of the invention;
fig. 2 shows a schematic flow diagram of a method of planning a travel route according to one embodiment of the invention;
FIG. 3 shows a schematic block diagram of a generating apparatus of a routing topology according to an embodiment of the present invention;
fig. 4 shows a schematic block diagram of a device for planning a travel route according to an embodiment of the invention;
fig. 5 is a schematic flow chart of a method of planning a travel route according to another embodiment of the present invention;
FIG. 6 is a schematic structural diagram of a road network topology graph according to an embodiment of the present invention;
fig. 7 shows a schematic block diagram of a terminal according to an embodiment of the invention.
Detailed Description
In order that the above objects, features and advantages of the present invention can be more clearly understood, a more particular description of the invention will be rendered by reference to the appended drawings. It should be noted that the embodiments and features of the embodiments of the present application may be combined with each other without conflict.
In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present invention, however, the present invention may be practiced in other ways than those specifically described herein, and therefore the scope of the present invention is not limited by the specific embodiments disclosed below.
Example 1
Fig. 1 shows a schematic flow diagram of a road network topology graph generation method according to an embodiment of the present invention.
As shown in fig. 1, a method for generating a road network topological graph according to an embodiment of the present invention includes: step 102, extracting a plurality of travel road sections in road network information according to the acquired road network information of the specified area; step 104, abstracting a travel road section into travel nodes to generate a node topological graph according to a plurality of route nodes; step 106, determining a traffic weight value between any two route nodes according to the acquired traffic rule information; and 108, updating the node topological graph according to the traffic weight value to generate a road network topological graph.
In the technical scheme, a node topological graph is generated according to extracted route nodes, then a traffic weight value between two route nodes is determined according to currently executed traffic rule information, so as to determine whether two travel road sections can pass at present according to the pass weight value, update the node topological graph according to the pass weight value and generate a road network topological graph, compared with the way that the road network topological graph respectively comprises road sections and nodes at two ends of the road sections in the prior art, on one hand, by adopting the route nodes to replace the travel sections for analysis and display, the processing efficiency of the traffic data can be improved, and on the other hand, by increasing the consideration of traffic regulation information, the representation of the trafficability of the road sections in the road network topological graph is more reasonable, therefore, the travel condition can be improved under the guidance of the generated road network topological graph, and the satisfaction degree of a user on travel navigation is further promoted.
The node topological graph can be generated only according to the relative positions of the route nodes and the route nodes, the route nodes correspond to at least one road section, the route nodes can be extracted at positions such as whether traffic lights are arranged or not and whether direction change exists or not, so that whether the two adjacent route nodes can pass or not is determined according to the road attribute information of the route nodes, the route nodes at least have one direction attribute and one length attribute, and the expression of a road network topological model is simplified by generating the node topological graph, so that the data processing amount is reduced, and the data processing effect is improved.
Specifically, the road network information may be road layout of a plurality of roads in a region, and the road network geometric data obtained from the map database may be composed of geospatial data and traffic information, where the geospatial data includes longitude and latitude, road information, and the like, and the road network information is determined according to the road network geometric data, and in addition, the map information may also be directly obtained through other map product structure interfaces to serve as the road network information, such as Google Maps, hundred degree Maps, and high-resolution Maps.
In addition, determining a traffic weight value between any two route nodes according to the acquired traffic rule information may specifically include: whether the traffic can pass through among the route nodes in the node topological graph is judged according to the traffic rule information, for example, three route nodes can be respectively marked as N1, N2 and N3, and according to the traffic rule information, information that the route nodes from N1 to N2 can go straight, the route nodes from N1 to N3 cannot turn left, the route nodes from N2 to N3 cannot go straight and the like can be judged, so that the passing weight value of the travel road section corresponding to the route node is determined according to the information, and the simplest setting mode is that the passing weight value is 0 and the non-passing weight value is 1.
In the foregoing technical solution, preferably, the abstracting a travel section into travel nodes to generate a node topology map according to a plurality of route nodes, further includes: and determining the travel cost corresponding to the route node according to the road attribute information of the route node, wherein the road attribute information comprises at least one of road traffic time, road congestion degree, road grade, road width, road number and road pavement strength of the travel road section corresponding to the route node.
In the technical scheme, the travel cost corresponding to the route node is determined, and the travel cost is used as one of the bases for selecting the route node when traveling, so that on one hand, the travel road section is determined according to the travel cost of the route node, the total cost of traveling of a user is reduced, traffic pressure is relieved correspondingly, and on the other hand, traffic optimization can be performed according to the travel cost, such as modification of traffic rule information, and the like, so that the convenience of traveling is further improved.
The current real-time road condition can be represented by the road traffic time and the road congestion degree.
Specifically, a road section is abstracted into nodes (nodes) by adopting an establishing concept different from that of a road network topological model in the prior art, so that a node topological graph composed of a plurality of nodes can be obtained, the nodes in the node topological graph have spatial attributes (including direction attributes and length attributes) and weight attributes at the same time, so as to measure the passing cost of the road section corresponding to the nodes, wherein the passing cost of the road section can be determined based on parameters such as road passing time, road crowding degree, road grade, road width, road number, road pavement strength and the like.
In any of the above technical solutions, preferably, the method further includes: and adding a cost identifier corresponding to the travel cost to the node topological graph.
According to the technical scheme, the cost identifier corresponding to the travel cost is added to the node topological graph, so that the travel cost determined according to the road attribute information is visualized, and the travel condition analysis in the current designated area can be executed through the node topological graph.
The description of the cost identifier corresponding to the travel cost can be realized in a mode of gradual change of the icon color, the higher the travel cost is, the darker the corresponding node icon color is, and the lower the travel cost is, the lighter the corresponding node abrupt change color is.
In any of the above technical solutions, preferably, before determining the traffic weight value between any two route nodes according to the acquired traffic rule information, the method further includes: accessing a traffic database according to a preset access frequency so as to acquire currently executed traffic rule information in a specified area in real time; or analyzing the driving track in the historical network car booking order in the designated area to determine traffic regulation information according to the driving track, wherein the traffic regulation information comprises at least one of turn around limitation information, unidirectional driving limitation information, time interval driving limitation information, steering limitation information, single and double number limitation information, license plate limitation information and temporary control information.
In the technical scheme, the traffic regulation information can be obtained in various manners, for example, by accessing an open traffic database to obtain the current latest traffic regulation information, the traffic regulation information obtained in the manner is higher in timeliness, or the traffic regulation information is determined according to the driving track in the appointment order of the historical network, and the restriction of the environment required by the manner is lower.
The traffic regulation information may include turning limitation information, unidirectional driving limitation information, time-interval driving limitation information, steering limitation information, single-double number limitation information, license plate limitation information, temporary regulation information, and the like.
Specifically, the traffic rule information of each road section can be updated in real time according to a preset time interval, and the updating is performed every five minutes, so that a route which is more in line with real-time working conditions can be obtained in route planning, and the satisfaction degree of a user is further improved.
In addition, the traffic regulation information is determined according to the driving track in the historical network car booking order, whether head-off is forbidden or not can be determined, the traffic regulation (such as whether license plate is restricted or not) can be determined by combining the analysis of vehicle data (such as license plates of vehicles), and in addition, the report of the traffic information of users (drivers and passengers) can also be used as one of the data acquisition sources of the traffic information.
In any of the above technical solutions, preferably, the node topology map is updated according to the traffic weight value to generate the road network topology map, specifically including the following steps: generating a passing route identifier corresponding to the passing weight value; and adding the passing route identification between two corresponding route nodes in the node topological graph to form the road network topological graph.
In the technical scheme, the passing route identifier is generated and added between the two corresponding route nodes to determine whether the two route nodes can pass through and determine the quantitative value of the passing cost, so that on one hand, the node topological graph is perfected and updated, the reference value of the road network topological graph is improved, and on the other hand, the accuracy of route planning when a user goes out is further improved.
Specifically, the passing route identifier may be generated by adding a line segment (link) indicating whether passing is possible or not in the node topological graph, and the link may have a weight attribute, that is, a passing weight value, to further measure the travel cost, for example, the weight of the link between the passable nodes may be 0 or a minimum value, and the link between the impassable nodes may not be added or may be 1.
The route identifier may be added to the node topology map by a solid line, a dashed line, or in other ways, to form a road network topology map, for example, the node topology map has two road segments corresponding to N1 and N2, and if it is determined that N1 can turn to N2 according to the traffic rule information, a solid line may be added between N1 and N2 to indicate a passable identifier, if no turn is available between N1 and N2, no solid line may be added between L1 and L2, or a greater weight value may be identified between N1 and N2, so that the road segments will not be preferentially selected in the subsequent route planning.
Example 2
Fig. 2 shows a schematic flow diagram of a method of planning a travel route according to an embodiment of the invention.
The method for planning the travel route according to one embodiment of the invention comprises the following steps: step 202, after receiving the position information of the route starting point and the position information of the route ending point, determining a travel route from the route starting point to the route ending point according to the road network topological graph according to any embodiment of the first aspect of the present invention; and step 204, displaying the travel route on a display device.
According to the technical scheme, route planning operation is executed according to the road network topological graph, whether two road sections in a preset planned route can be normally switched or not is determined according to traffic rule information, route planning accuracy and timeliness are improved, and traffic jam probability is reduced while user experience is improved.
In the foregoing technical solution, preferably, the determining a travel route from a route starting point to a route ending point according to a road network topological graph specifically includes the following steps: determining a plurality of route nodes and a plurality of route nodes between a route starting point and a route ending point; respectively determining travel costs of a plurality of route nodes and a traffic weight value between any two route nodes; and determining a travel route according to the travel cost and the traffic weight value.
In the technical scheme, the travel cost can be generated according to road attribute information of the route node, the traffic weight value can be generated according to current traffic rule information, and by combining the road attribute information and the traffic rule information, compared with the scheme that the travel route is determined by only considering the road attribute information in the prior art, the rationality of travel planning is improved, and the probability of wrong route generation caused by traffic rules is reduced.
Specifically, an optional route is determined according to a route starting point and a route ending point, the optional route comprises a node and a link (passable road section) connecting the starting point and the ending point, and the passing cost (comprising the travel cost and the passing weight value) of the optional route is calculated so as to preferentially select the route with lower passing cost.
Fig. 3 shows a schematic block diagram of a generation apparatus of a routing topology according to an embodiment of the present invention.
As shown in fig. 3, an apparatus 300 for generating a road network topology map according to an embodiment of the present invention includes: an extracting unit 302, configured to extract a plurality of travel links from road network information according to the acquired road network information of the specified area; an abstraction unit 304, configured to abstract the travel road segment into travel nodes, so as to generate a node topology map according to the plurality of route nodes; a determining unit 306, configured to determine a traffic weight value between any two route nodes according to the acquired traffic rule information; and the updating unit 308 is configured to update the node topological graph according to the traffic weight value to generate a road network topological graph.
In the technical scheme, a node topological graph is generated according to extracted route nodes, then a traffic weight value between two route nodes is determined according to currently executed traffic rule information, so as to determine whether two travel road sections can pass at present according to the pass weight value, update the node topological graph according to the pass weight value and generate a road network topological graph, compared with the way that the road network topological graph respectively comprises road sections and nodes at two ends of the road sections in the prior art, on one hand, by adopting the route nodes to replace the travel sections for analysis and display, the processing efficiency of the traffic data can be improved, and on the other hand, by increasing the consideration of traffic regulation information, the representation of the trafficability of the road sections in the road network topological graph is more reasonable, therefore, the travel condition can be improved under the guidance of the generated road network topological graph, and the satisfaction degree of a user on travel navigation is further promoted.
The node topological graph can be generated only according to the relative positions of the route nodes and the route nodes, the route nodes correspond to at least one road section, the route nodes can be extracted at positions such as whether traffic lights are arranged or not and whether direction change exists or not, so that whether the two adjacent route nodes can pass or not is determined according to the road attribute information of the route nodes, the route nodes at least have one direction attribute and one length attribute, and the expression of a road network topological model is simplified by generating the node topological graph, so that the data processing amount is reduced, and the data processing effect is improved.
Specifically, the road network information may be road layout of a plurality of roads in a region, and the road network geometric data obtained from the map database may be composed of geospatial data and traffic information, where the geospatial data includes longitude and latitude, road information, and the like, and the road network information is determined according to the road network geometric data, and in addition, the map information may also be directly obtained through other map product structure interfaces to serve as the road network information, such as Google Maps, hundred degree Maps, and high-resolution Maps.
In addition, determining a traffic weight value between any two route nodes according to the acquired traffic rule information may specifically include: whether the traffic can pass through among the route nodes in the node topological graph is judged according to the traffic rule information, for example, three route nodes can be respectively marked as N1, N2 and N3, and according to the traffic rule information, information that the route nodes from N1 to N2 can go straight, the route nodes from N1 to N3 cannot turn left, the route nodes from N2 to N3 cannot go straight and the like can be judged, so that the passing weight value of the travel road section corresponding to the route node is determined according to the information, and the simplest setting mode is that the passing weight value is 0 and the non-passing weight value is 1.
In the foregoing technical solution, preferably, the determining unit 306 is further configured to: and determining the travel cost corresponding to the route node according to the road attribute information of the route node, wherein the road attribute information comprises at least one of road traffic time, road congestion degree, road grade, road width, road number and road pavement strength of the travel road section corresponding to the route node.
In the technical scheme, the travel cost corresponding to the route node is determined, and the travel cost is used as one of the bases for selecting the route node when traveling, so that on one hand, the travel road section is determined according to the travel cost of the route node, the total cost of traveling of a user is reduced, traffic pressure is relieved correspondingly, and on the other hand, traffic optimization can be performed according to the travel cost, such as modification of traffic rule information, and the like, so that the convenience of traveling is further improved.
The current real-time road condition can be represented by the road traffic time and the road congestion degree.
Specifically, a road section is abstracted into nodes (nodes) by adopting an establishing concept different from that of a road network topological model in the prior art, so that a node topological graph composed of a plurality of nodes can be obtained, the nodes in the node topological graph have spatial attributes (including direction attributes and length attributes) and weight attributes at the same time, so as to measure the passing cost of the road section corresponding to the nodes, wherein the passing cost of the road section can be determined based on parameters such as road passing time, road crowding degree, road grade, road width, road number, road pavement strength and the like.
In any of the above technical solutions, preferably, the method further includes: an adding unit 316, configured to add a cost identifier corresponding to the travel cost to the node topology.
According to the technical scheme, the cost identifier corresponding to the travel cost is added to the node topological graph, so that the travel cost determined according to the road attribute information is visualized, and the travel condition analysis in the current designated area can be executed through the node topological graph.
The description of the cost identifier corresponding to the travel cost can be realized in a mode of gradual change of the icon color, the higher the travel cost is, the darker the corresponding node icon color is, and the lower the travel cost is, the lighter the corresponding node abrupt change color is.
In any of the above technical solutions, preferably, the method further includes: the access unit 310 is configured to access a traffic database according to a preset access frequency to obtain currently executed traffic rule information in a specified area in real time; the analysis unit 312 is configured to analyze a driving track in the historical online car booking order in the designated area to determine traffic regulation information according to the driving track, where the traffic regulation information includes at least one of u-turn restriction information, unidirectional driving restriction information, time-interval driving restriction information, steering restriction information, single-double number restriction information, license plate restriction information, and temporary restriction information.
In the technical scheme, the traffic regulation information can be obtained in various manners, for example, by accessing an open traffic database to obtain the current latest traffic regulation information, the traffic regulation information obtained in the manner is higher in timeliness, or the traffic regulation information is determined according to the driving track in the appointment order of the historical network, and the restriction of the environment required by the manner is lower.
The traffic regulation information may include turning limitation information, unidirectional driving limitation information, time-interval driving limitation information, steering limitation information, single-double number limitation information, license plate limitation information, temporary regulation information, and the like.
Specifically, the traffic rule information of each road section can be updated in real time according to a preset time interval, and the updating is performed every five minutes, so that a route which is more in line with real-time working conditions can be obtained in route planning, and the satisfaction degree of a user is further improved.
In addition, the traffic regulation information is determined according to the driving track in the historical network car booking order, whether head-off is forbidden or not can be determined, the traffic regulation (such as whether license plate is restricted or not) can be determined by combining the analysis of vehicle data (such as license plates of vehicles), and in addition, the report of the traffic information of users (drivers and passengers) can also be used as one of the data acquisition sources of the traffic information.
In any of the above technical solutions, preferably, the method further includes: the generating unit 314 is used for generating a passing route identifier corresponding to the passing weight value; the adding unit 316 is further configured to add a transit route identifier between two corresponding route nodes in the node topology map to form a road network topology map.
In the technical scheme, the passing route identifier is generated and added between the two corresponding route nodes to determine whether the two route nodes can pass through and determine the quantitative value of the passing cost, so that on one hand, the node topological graph is perfected and updated, the reference value of the road network topological graph is improved, and on the other hand, the accuracy of route planning when a user goes out is further improved.
Specifically, the passing route identifier may be generated by adding a line segment (link) indicating whether passing is possible or not in the node topological graph, and the link may have a weight attribute, that is, a passing weight value, to further measure the travel cost, for example, the weight of the link between the passable nodes may be 0 or a minimum value, and the link between the impassable nodes may not be added or may be 1.
The route identifier may be added to the node topology map by a solid line, a dashed line, or in other ways, to form a road network topology map, for example, the node topology map has two road segments corresponding to N1 and N2, and if it is determined that N1 can turn to N2 according to the traffic rule information, a solid line may be added between N1 and N2 to indicate a passable identifier, if no turn is available between N1 and N2, no solid line may be added between L1 and L2, or a greater weight value may be identified between N1 and N2, so that the road segments will not be preferentially selected in the subsequent route planning.
As shown in fig. 3, according to the apparatus 300 for generating a road network topology diagram of the embodiment of the present invention, the extracting unit 302, the abstracting unit 304, the determining unit 306, the updating unit 308, the accessing unit 310, the parsing unit 312, the generating unit 314, and the adding unit may be integrated into a processing chip.
Fig. 4 shows a schematic block diagram of a device for planning a travel route according to an embodiment of the invention.
As shown in fig. 4, a travel route planning apparatus 400 according to an embodiment of the present invention includes: a determining unit 402, configured to determine a travel route from a route starting point to a route ending point according to the road network topology map according to any embodiment of the first aspect of the present invention after receiving the position information of the route starting point and the position information of the route ending point; a display unit 404 for displaying the travel route on a display device.
According to the technical scheme, route planning operation is executed according to the road network topological graph, whether two road sections in a preset planned route can be normally switched or not is determined according to traffic rule information, route planning accuracy and timeliness are improved, and traffic jam probability is reduced while user experience is improved.
In the foregoing technical solution, preferably, the determining unit 402 is further configured to: determining a plurality of route nodes between a route starting point and a route ending point; the determining unit 402 is further configured to: respectively determining travel costs of a plurality of route nodes and a traffic weight value between any two route nodes; the determining unit 404 is further configured to: and determining a travel route according to the travel cost and the traffic weight value.
In the technical scheme, the travel cost can be generated according to road attribute information of the route node, the traffic weight value can be generated according to current traffic rule information, and by combining the road attribute information and the traffic rule information, compared with the scheme that the travel route is determined by only considering the road attribute information in the prior art, the rationality of travel planning is improved, and the probability of wrong route generation caused by traffic rules is reduced.
Specifically, an optional route is determined according to a route starting point and a route ending point, the optional route comprises a node and a link (passable road section) connecting the starting point and the ending point, and the passing cost (comprising the travel cost and the passing weight value) of the optional route is calculated so as to preferentially select the route with lower passing cost.
As shown in fig. 4, according to the travel route planning apparatus 400 of the embodiment of the present invention, the determining device 402 may be integrated in the processing chip, and the display device 404 may be a display screen.
Example 3
The planning scheme of the travel route according to the present invention is further described with reference to fig. 5 and 6.
As shown in fig. 5, a method for planning a travel route according to another embodiment of the present invention includes: step 502, obtaining road network information of an actual road; step 504, generating a node topological graph according to the road network information; a ratio 506, obtaining traffic regulation information; step 508, judging whether the nodes in the node topological graph can pass through according to the traffic rule information; step 510, updating the node topological graph according to the judgment structure to generate a road network topological graph; and step 512, executing route planning operation according to the road network topological graph.
As shown in fig. 6, in performing the route planning operation, three route nodes are respectively labeled as N1, N2, and N3, and according to the traffic regulation information, it may be determined that N1 to N2 may go straight, as indicated by solid lines, N1 to N3 may not turn left due to temporary road regulation or due to traffic accident restriction, as indicated by broken lines, between N3 and N2 may not go straight due to N3 being a one-way road, and in addition, as the link corresponding to the route node N1 is crowded, as indicated by a solid circle.
Fig. 7 shows a schematic block diagram of a terminal 50 according to an embodiment of the invention.
As shown in fig. 7, the terminal 50 according to an embodiment of the present invention includes a memory, a processor and a computer program stored in the memory and operable on the processor, and the processor executes the computer program to implement the steps of the method for generating a road network topology map proposed in embodiment 1 of the present invention, the steps of the method for planning a travel route proposed in embodiment 2 of the present invention, or the terminal includes the device 300 for generating a road network topology map proposed in embodiment 3 of the present invention, and the device 400 for planning a travel route according to any one of embodiment 4 of the present invention.
A computer-readable storage medium according to an embodiment of the invention, on which a computer program is stored which, when executed by a processor, performs the steps of: extracting a plurality of travel road sections in the road network information according to the acquired road network information of the specified area; abstracting a travel road section into travel nodes to generate a node topological graph according to a plurality of route nodes; determining a traffic weight value between any two route nodes according to the acquired traffic rule information; and updating the node topological graph according to the traffic weight value to generate a road network topological graph.
In the technical scheme, a node topological graph is generated according to extracted route nodes, then a traffic weight value between two route nodes is determined according to currently executed traffic rule information, so as to determine whether two travel road sections can pass at present according to the pass weight value, update the node topological graph according to the pass weight value and generate a road network topological graph, compared with the way that the road network topological graph respectively comprises road sections and nodes at two ends of the road sections in the prior art, on one hand, by adopting the route nodes to replace the travel sections for analysis and display, the processing efficiency of the traffic data can be improved, and on the other hand, by increasing the consideration of traffic regulation information, the representation of the trafficability of the road sections in the road network topological graph is more reasonable, therefore, the travel condition can be improved under the guidance of the generated road network topological graph, and the satisfaction degree of a user on travel navigation is further promoted.
The node topological graph can be generated only according to the relative positions of the route nodes and the route nodes, the route nodes correspond to at least one road section, the route nodes can be extracted at positions such as whether traffic lights are arranged or not and whether direction change exists or not, so that whether the two adjacent route nodes can pass or not is determined according to the road attribute information of the route nodes, the route nodes at least have one direction attribute and one length attribute, and the expression of a road network topological model is simplified by generating the node topological graph, so that the data processing amount is reduced, and the data processing effect is improved.
Specifically, the road network information may be road layout of a plurality of roads in a region, and the road network geometric data obtained from the map database may be composed of geospatial data and traffic information, where the geospatial data includes longitude and latitude, road information, and the like, and the road network information is determined according to the road network geometric data, and in addition, the map information may also be directly obtained through other map product structure interfaces to serve as the road network information, such as Google Maps, hundred degree Maps, and high-resolution Maps.
In addition, determining a traffic weight value between any two route nodes according to the acquired traffic rule information may specifically include: whether the traffic can pass through among the route nodes in the node topological graph is judged according to the traffic rule information, for example, three route nodes can be respectively marked as N1, N2 and N3, and according to the traffic rule information, information that the route nodes from N1 to N2 can go straight, the route nodes from N1 to N3 cannot turn left, the route nodes from N2 to N3 cannot go straight and the like can be judged, so that the passing weight value of the travel road section corresponding to the route node is determined according to the information, and the simplest setting mode is that the passing weight value is 0 and the non-passing weight value is 1.
In the foregoing technical solution, preferably, the abstracting a travel section into travel nodes to generate a node topology map according to a plurality of route nodes, further includes: and determining the travel cost corresponding to the route node according to the road attribute information of the route node, wherein the road attribute information comprises at least one of road traffic time, road congestion degree, road grade, road width, road number and road pavement strength of the travel road section corresponding to the route node.
In the technical scheme, the travel cost corresponding to the route node is determined, and the travel cost is used as one of the bases for selecting the route node when traveling, so that on one hand, the travel road section is determined according to the travel cost of the route node, the total cost of traveling of a user is reduced, traffic pressure is relieved correspondingly, and on the other hand, traffic optimization can be performed according to the travel cost, such as modification of traffic rule information, and the like, so that the convenience of traveling is further improved.
The current real-time road condition can be represented by the road traffic time and the road congestion degree.
Specifically, a road section is abstracted into nodes (nodes) by adopting an establishing concept different from that of a road network topological model in the prior art, so that a node topological graph composed of a plurality of nodes can be obtained, the nodes in the node topological graph have spatial attributes (including direction attributes and length attributes) and weight attributes at the same time, so as to measure the passing cost of the road section corresponding to the nodes, wherein the passing cost of the road section can be determined based on parameters such as road passing time, road crowding degree, road grade, road width, road number, road pavement strength and the like.
In any of the above technical solutions, preferably, the method further includes: and adding a cost identifier corresponding to the travel cost to the node topological graph.
According to the technical scheme, the cost identifier corresponding to the travel cost is added to the node topological graph, so that the travel cost determined according to the road attribute information is visualized, and the travel condition analysis in the current designated area can be executed through the node topological graph.
The description of the cost identifier corresponding to the travel cost can be realized in a mode of gradual change of the icon color, the higher the travel cost is, the darker the corresponding node icon color is, and the lower the travel cost is, the lighter the corresponding node abrupt change color is.
In any of the above technical solutions, preferably, before determining the traffic weight value between any two route nodes according to the acquired traffic rule information, the method further includes: accessing a traffic database according to a preset access frequency so as to acquire currently executed traffic rule information in a specified area in real time; or analyzing the driving track in the historical network car booking order in the designated area to determine traffic regulation information according to the driving track, wherein the traffic regulation information comprises at least one of turn around limitation information, unidirectional driving limitation information, time interval driving limitation information, steering limitation information, single and double number limitation information, license plate limitation information and temporary control information.
In the technical scheme, the traffic regulation information can be obtained in various manners, for example, by accessing an open traffic database to obtain the current latest traffic regulation information, the traffic regulation information obtained in the manner is higher in timeliness, or the traffic regulation information is determined according to the driving track in the appointment order of the historical network, and the restriction of the environment required by the manner is lower.
The traffic regulation information may include turning limitation information, unidirectional driving limitation information, time-interval driving limitation information, steering limitation information, single-double number limitation information, license plate limitation information, temporary regulation information, and the like.
Specifically, the traffic rule information of each road section can be updated in real time according to a preset time interval, and the updating is performed every five minutes, so that a route which is more in line with real-time working conditions can be obtained in route planning, and the satisfaction degree of a user is further improved.
In addition, the traffic regulation information is determined according to the driving track in the historical network car booking order, whether head-off is forbidden or not can be determined, the traffic regulation (such as whether license plate is restricted or not) can be determined by combining the analysis of vehicle data (such as license plates of vehicles), and in addition, the report of the traffic information of users (drivers and passengers) can also be used as one of the data acquisition sources of the traffic information.
In any of the above technical solutions, preferably, the node topology map is updated according to the traffic weight value to generate the road network topology map, specifically including the following steps: generating a passing route identifier corresponding to the passing weight value; and adding the passing route identification between two corresponding route nodes in the node topological graph to form the road network topological graph.
In the technical scheme, the passing route identifier is generated and added between the two corresponding route nodes to determine whether the two route nodes can pass through and determine the quantitative value of the passing cost, so that on one hand, the node topological graph is perfected and updated, the reference value of the road network topological graph is improved, and on the other hand, the accuracy of route planning when a user goes out is further improved.
Specifically, the passing route identifier may be generated by adding a line segment (link) indicating whether passing is possible or not in the node topological graph, and the link may have a weight attribute, that is, a passing weight value, to further measure the travel cost, for example, the weight of the link between the passable nodes may be 0 or a minimum value, and the link between the impassable nodes may not be added or may be 1.
The route identifier may be added to the node topology map by a solid line, a dashed line, or in other ways, to form a road network topology map, for example, the node topology map has two road segments corresponding to N1 and N2, and if it is determined that N1 can turn to N2 according to the traffic rule information, a solid line may be added between N1 and N2 to indicate a passable identifier, if no turn is available between N1 and N2, no solid line may be added between L1 and L2, or a greater weight value may be identified between N1 and N2, so that the road segments will not be preferentially selected in the subsequent route planning.
The computer program when executed by the processor further realizes the steps of: after receiving the position information of the route starting point and the position information of the route ending point, determining a travel route from the route starting point to the route ending point according to the road network topological graph according to any embodiment of the first aspect of the present invention; the travel route is displayed on a display device.
According to the technical scheme, route planning operation is executed according to the road network topological graph, whether two road sections in a preset planned route can be normally switched or not is determined according to traffic rule information, route planning accuracy and timeliness are improved, and traffic jam probability is reduced while user experience is improved.
In the foregoing technical solution, preferably, the determining a travel route from a route starting point to a route ending point according to a road network topological graph specifically includes the following steps: determining a plurality of route nodes and a plurality of route nodes between a route starting point and a route ending point; respectively determining travel costs of a plurality of route nodes and a traffic weight value between any two route nodes; and determining a travel route according to the travel cost and the traffic weight value.
In the technical scheme, the travel cost can be generated according to road attribute information of the route node, the traffic weight value can be generated according to current traffic rule information, and by combining the road attribute information and the traffic rule information, compared with the scheme that the travel route is determined by only considering the road attribute information in the prior art, the rationality of travel planning is improved, and the probability of wrong route generation caused by traffic rules is reduced.
Specifically, an optional route is determined according to a route starting point and a route ending point, the optional route comprises a node and a link (passable road section) connecting the starting point and the ending point, and the passing cost (comprising the travel cost and the passing weight value) of the optional route is calculated so as to preferentially select the route with lower passing cost.
The technical solution of the present invention is described in detail above with reference to the accompanying drawings, and the present invention provides a method for generating a road network topological graph, a device for generating a road network topological graph, a method for planning a trip route, a device for planning a trip route, a terminal and a computer-readable storage medium, wherein a node topological graph is generated according to extracted route nodes, and then a traffic weight value between two route nodes is determined according to currently executed traffic regulation information, so as to determine whether a current traffic between two trip road segments can pass according to the traffic weight value, and update the node topological graph according to the traffic weight value, and generate a road network topological graph, compared with a mode in which a road network topological graph respectively includes road segments and nodes at two ends of road segments in the prior art, on one hand, the processing efficiency of traffic data can be improved by adopting route nodes to replace trip road segments for analysis and display, on the other hand, by increasing the consideration of traffic rule information, the representation of the trafficability of the road sections in the road network topological graph is more reasonable, so that the travel condition can be improved under the guidance of the generated road network topological graph, and the satisfaction degree of the user on travel navigation is further improved.
The steps in the method of the invention can be sequentially adjusted, combined and deleted according to actual needs.
The units in the device of the invention can be merged, divided and deleted according to actual needs.
It will be understood by those skilled in the art that all or part of the steps in the methods of the embodiments described above may be implemented by instructions associated with a program, which may be stored in a computer-readable storage medium, where the storage medium includes Read-Only Memory (ROM), Random Access Memory (RAM), Programmable Read-Only Memory (PROM), Erasable Programmable Read-Only Memory (EPROM), One-time Programmable Read-Only Memory (OTPROM), Electrically Erasable Programmable Read-Only Memory (EEPROM), compact disc-Read-Only Memory (CD-ROM), or other Memory, magnetic disk, magnetic tape, or magnetic tape, Or any other medium which can be used to carry or store data and which can be read by a computer.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims (16)

1. A road network topological graph generation method is characterized by comprising the following steps:
extracting a plurality of travel road sections in the road network information according to the acquired road network information of the specified area;
abstracting the travel road section into travel nodes to generate a node topological graph according to the plurality of route nodes;
determining a traffic weight value between any two route nodes according to the acquired traffic rule information;
and updating the node topological graph according to the traffic weight value to generate a road network topological graph.
2. The method for generating a road network topological graph according to claim 1, wherein said abstracting said travel section into travel nodes to generate a node topological graph according to said plurality of route nodes further comprises:
determining travel cost corresponding to the route node according to the road attribute information of the route node,
the road attribute information includes at least one of road traffic time, road congestion degree, road grade, road width, road lane number and road pavement strength of the travel road section corresponding to the route node.
3. The method for generating a road network topology graph according to claim 2, further comprising:
and adding a cost identifier corresponding to the travel cost to the node topological graph.
4. The method for generating a road network topological graph according to claim 1, wherein before determining a traffic weight value between any two route nodes according to the acquired traffic regulation information, the method further comprises:
accessing a traffic database according to a preset access frequency so as to acquire the currently executed traffic rule information in the designated area in real time; or
Analyzing a driving track in the historical network car booking order in the designated area to determine the traffic regulation information according to the driving track,
the traffic regulation information comprises at least one of turning limitation information, unidirectional driving limitation information, time-interval driving limitation information, steering limitation information, single-double number limitation information, license plate limitation information and temporary control information.
5. The method for generating a road network topological graph according to any one of claims 1 to 4, wherein said updating said node topological graph according to said traffic weight value to generate a road network topological graph specifically comprises the following steps:
generating a passing route identifier corresponding to the passing weight value;
and adding the passing route identification between two corresponding route nodes in the node topological graph to form the road network topological graph.
6. A method for planning a travel route, comprising:
after receiving the position information of a route starting point and the position information of a route end point, determining a travel route from the route starting point to the route end point according to the road network topological graph of any one of claims 1 to 5;
displaying the travel route on a display device.
7. The method for planning a travel route according to claim 6, wherein the step of determining the travel route from the route starting point to the route ending point according to the road network topology map specifically includes the following steps:
determining a plurality of route nodes between the route starting point and the route ending point;
respectively determining travel costs of the plurality of route nodes and a traffic weight value between any two route nodes;
and determining the travel route according to the travel cost and the traffic weight value.
8. A road network topological graph generation device is characterized by comprising:
the system comprises an extraction unit, a route selection unit and a route selection unit, wherein the extraction unit is used for extracting a plurality of travel road sections in road network information according to the acquired road network information of a specified area;
the abstraction unit is used for abstracting the travel road section into travel nodes so as to generate a node topological graph according to the plurality of route nodes;
the determining unit is used for determining a traffic weight value of any one trip road section according to the acquired traffic rule information;
and the updating unit is used for updating the node topological graph according to the traffic weight value so as to generate a road network topological graph.
9. The road network topology map generation apparatus of claim 8,
the determination unit is further configured to: determining travel cost corresponding to the route node according to the road attribute information of the route node,
the road attribute information includes at least one of road traffic time, road congestion degree, road grade, road width, road lane number and road pavement strength of the travel road section corresponding to the route node.
10. The road network topology map generation device according to claim 9, further comprising:
an adding unit, configured to add a cost identifier corresponding to the travel cost to the node topology map.
11. The road network topology map generation device according to claim 8, further comprising:
the access unit is used for accessing a traffic database according to a preset access frequency so as to acquire the currently executed traffic rule information in the specified area in real time;
the analysis unit is used for analyzing the driving track in the historical network car booking order in the designated area so as to determine the traffic rule information according to the driving track,
the traffic regulation information comprises at least one of turning limitation information, unidirectional driving limitation information, time-interval driving limitation information, steering limitation information, single-double number limitation information, license plate limitation information and temporary control information.
12. The device for generating a road network topology map according to any one of claims 8 to 11, further comprising:
the generating unit is used for generating a passing route identifier corresponding to the passing weight value;
the adding unit is further configured to: and adding the passing route identification between two corresponding route nodes in the node topological graph to form the road network topological graph.
13. A device for planning a travel route, comprising:
a determining unit, configured to determine a travel route from a route starting point to a route ending point according to the road network topology map according to any one of claims 1 to 5 after receiving the position information of the route starting point and the position information of the route ending point;
and the display unit is used for displaying the travel route on display equipment.
14. A device for planning a travel route according to claim 13,
the determination unit is further configured to: determining a plurality of route nodes between the route starting point and the route ending point;
the determination unit is further configured to: respectively determining travel costs of the plurality of route nodes and a traffic weight value between any two route nodes;
the determination unit is further configured to: and determining the travel route according to the travel cost and the traffic weight value.
15. A terminal characterized in that it comprises a processor for implementing the steps of the road network topology graph generation method according to any of claims 1 to 5 and/or the travel route planning method according to claim 6 or 7 when executing a computer program stored in a memory.
16. A computer readable storage medium, having stored thereon a computer program, wherein the computer program, when being executed by a processor, implements the steps of the method for generating a road network topology map according to any one of claims 1 to 5 and/or the steps of the method for planning travel routes according to claim 6 or 7.
CN201811468521.4A 2018-12-03 2018-12-03 Generation method, planning method, device, terminal and readable storage medium Active CN110768819B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811468521.4A CN110768819B (en) 2018-12-03 2018-12-03 Generation method, planning method, device, terminal and readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811468521.4A CN110768819B (en) 2018-12-03 2018-12-03 Generation method, planning method, device, terminal and readable storage medium

Publications (2)

Publication Number Publication Date
CN110768819A true CN110768819A (en) 2020-02-07
CN110768819B CN110768819B (en) 2023-03-24

Family

ID=69328435

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811468521.4A Active CN110768819B (en) 2018-12-03 2018-12-03 Generation method, planning method, device, terminal and readable storage medium

Country Status (1)

Country Link
CN (1) CN110768819B (en)

Cited By (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111367275A (en) * 2020-02-18 2020-07-03 吉利汽车研究院（宁波）有限公司 Intelligent driving control method, device and system and storage medium
CN111489553A (en) * 2020-04-26 2020-08-04 百度在线网络技术（北京）有限公司 Route planning method, device, equipment and computer storage medium
CN111652434A (en) * 2020-06-02 2020-09-11 百度在线网络技术（北京）有限公司 Road network data processing method and device, electronic equipment and computer storage medium
CN111814605A (en) * 2020-06-23 2020-10-23 浙江大华技术股份有限公司 Main road identification method, main road identification device and main road storage device based on topological map
CN111862590A (en) * 2020-05-13 2020-10-30 北京嘀嘀无限科技发展有限公司 Road condition prediction method, road condition prediction device and storage medium
CN112699202A (en) * 2021-01-14 2021-04-23 腾讯科技（深圳）有限公司 Forbidden road identification method and device, electronic equipment and storage medium
CN112750219A (en) * 2020-12-29 2021-05-04 深圳市跨越新科技有限公司 Vehicle travel expense calculation method and system
CN112801399A (en) * 2021-02-08 2021-05-14 腾讯科技（深圳）有限公司 Path generation method and device, terminal equipment and storage medium
CN113177046A (en) * 2021-04-15 2021-07-27 北京世纪高通科技有限公司 Road network topological graph generation method, device, equipment and storage medium
CN113532449A (en) * 2021-06-21 2021-10-22 阿波罗智联(北京)科技有限公司 Intelligent traffic network acquisition method and device, electronic equipment and storage medium
CN113554044A (en) * 2020-04-23 2021-10-26 百度在线网络技术（北京）有限公司 Method, device, equipment and storage medium for acquiring walking road width
CN113721599A (en) * 2020-05-25 2021-11-30 华为技术有限公司 Positioning method and positioning device
CN113821550A (en) * 2021-11-22 2021-12-21 腾讯科技（深圳）有限公司 Road network topological graph dividing method, device, equipment and computer program product
CN114399124A (en) * 2022-03-24 2022-04-26 腾讯科技（深圳）有限公司 Path data processing method, path planning method, path data processing device, path planning device and computer equipment

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120044835A1 (en) * 2009-05-06 2012-02-23 Zte Corporation Method and Apparatus for Implementing K-Shortest Paths Algorithm in the Case of Existing Multiple Edges Between Adjacent Nodes
CN103440780A (en) * 2013-08-19 2013-12-11 中国航天系统工程有限公司 City complex traffic environment path guide system and method based on locating labels
CN103824450A (en) * 2014-03-20 2014-05-28 福州市规划设计研究院 Special vehicle route planning method based on traffic state rule for large-scale activities
CN104914866A (en) * 2015-05-29 2015-09-16 国网山东省电力公司电力科学研究院 Tour inspection robot global path planning method based on topological point classification and system
CN108303106A (en) * 2017-11-22 2018-07-20 东莞产权交易中心 The method that realizing route is planned in navigation equipment
CN111044058A (en) * 2018-10-11 2020-04-21 北京嘀嘀无限科技发展有限公司 Route planning method, route planning device, computer device, and storage medium

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120044835A1 (en) * 2009-05-06 2012-02-23 Zte Corporation Method and Apparatus for Implementing K-Shortest Paths Algorithm in the Case of Existing Multiple Edges Between Adjacent Nodes
CN103440780A (en) * 2013-08-19 2013-12-11 中国航天系统工程有限公司 City complex traffic environment path guide system and method based on locating labels
CN103824450A (en) * 2014-03-20 2014-05-28 福州市规划设计研究院 Special vehicle route planning method based on traffic state rule for large-scale activities
CN104914866A (en) * 2015-05-29 2015-09-16 国网山东省电力公司电力科学研究院 Tour inspection robot global path planning method based on topological point classification and system
CN108303106A (en) * 2017-11-22 2018-07-20 东莞产权交易中心 The method that realizing route is planned in navigation equipment
CN111044058A (en) * 2018-10-11 2020-04-21 北京嘀嘀无限科技发展有限公司 Route planning method, route planning device, computer device, and storage medium

Cited By (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111367275A (en) * 2020-02-18 2020-07-03 吉利汽车研究院（宁波）有限公司 Intelligent driving control method, device and system and storage medium
CN113554044B (en) * 2020-04-23 2023-08-08 百度在线网络技术（北京）有限公司 Walking road width acquisition method, device, equipment and storage medium
CN113554044A (en) * 2020-04-23 2021-10-26 百度在线网络技术（北京）有限公司 Method, device, equipment and storage medium for acquiring walking road width
CN111489553A (en) * 2020-04-26 2020-08-04 百度在线网络技术（北京）有限公司 Route planning method, device, equipment and computer storage medium
CN111489553B (en) * 2020-04-26 2022-02-25 百度在线网络技术（北京）有限公司 Route planning method, device, equipment and computer storage medium
CN111862590A (en) * 2020-05-13 2020-10-30 北京嘀嘀无限科技发展有限公司 Road condition prediction method, road condition prediction device and storage medium
CN113721599A (en) * 2020-05-25 2021-11-30 华为技术有限公司 Positioning method and positioning device
CN111652434A (en) * 2020-06-02 2020-09-11 百度在线网络技术（北京）有限公司 Road network data processing method and device, electronic equipment and computer storage medium
CN111652434B (en) * 2020-06-02 2023-09-29 百度在线网络技术（北京）有限公司 Road network data processing method and device, electronic equipment and computer storage medium
CN111814605A (en) * 2020-06-23 2020-10-23 浙江大华技术股份有限公司 Main road identification method, main road identification device and main road storage device based on topological map
CN111814605B (en) * 2020-06-23 2024-01-19 浙江华睿科技股份有限公司 Main road identification method, main road identification device and storage device based on topological map
CN112750219B (en) * 2020-12-29 2023-02-03 深圳市跨越新科技有限公司 Vehicle travel expense calculation method and system
CN112750219A (en) * 2020-12-29 2021-05-04 深圳市跨越新科技有限公司 Vehicle travel expense calculation method and system
CN112699202B (en) * 2021-01-14 2022-02-08 腾讯科技（深圳）有限公司 Forbidden road identification method and device, electronic equipment and storage medium
CN112699202A (en) * 2021-01-14 2021-04-23 腾讯科技（深圳）有限公司 Forbidden road identification method and device, electronic equipment and storage medium
CN112801399B (en) * 2021-02-08 2022-08-12 腾讯科技（深圳）有限公司 Path generation method and device, terminal equipment and storage medium
CN112801399A (en) * 2021-02-08 2021-05-14 腾讯科技（深圳）有限公司 Path generation method and device, terminal equipment and storage medium
CN113177046A (en) * 2021-04-15 2021-07-27 北京世纪高通科技有限公司 Road network topological graph generation method, device, equipment and storage medium
CN113532449A (en) * 2021-06-21 2021-10-22 阿波罗智联(北京)科技有限公司 Intelligent traffic network acquisition method and device, electronic equipment and storage medium
CN113532449B (en) * 2021-06-21 2023-11-21 阿波罗智联(北京)科技有限公司 Intelligent traffic network acquisition method and device, electronic equipment and storage medium
US11835356B2 (en) 2021-06-21 2023-12-05 Apollo Intelligent Connectivity (Beijing) Technology Co., Ltd. Intelligent transportation road network acquisition method and apparatus, electronic device and storage medium
CN113821550A (en) * 2021-11-22 2021-12-21 腾讯科技（深圳）有限公司 Road network topological graph dividing method, device, equipment and computer program product
CN113821550B (en) * 2021-11-22 2022-02-08 腾讯科技（深圳）有限公司 Road network topological graph dividing method, device, equipment and computer program product
CN114399124A (en) * 2022-03-24 2022-04-26 腾讯科技（深圳）有限公司 Path data processing method, path planning method, path data processing device, path planning device and computer equipment

Also Published As

Publication number Publication date
CN110768819B (en) 2023-03-24

Similar Documents

Publication Publication Date Title
CN110768819B (en) Generation method, planning method, device, terminal and readable storage medium
KR101994496B1 (en) Providing routes through information collection and retrieval
CN111044058A (en) Route planning method, route planning device, computer device, and storage medium
CN101676689B (en) Driving evaluation system and driving evaluation method
US20090125229A1 (en) Corridor mapping with alternative routes
JP6138934B2 (en) Traffic demand control device
US10054452B2 (en) Personalized optimal travel route planning
US9002633B2 (en) Method of determining and validating navigational priority settings utilizing probe data
JP2021524018A (en) How and system to generate parking routes
JP2014527617A5 (en)
CN105210119A (en) Determining an amount for a toll based on location data points provided by a computing device
US20080294337A1 (en) Travel-related information processing system
US20080120022A1 (en) Method and Device for Determining a Route with Points of Interest
CN109840632A (en) A kind of traffic route assessment method and device for planning
JP5670078B2 (en) Route guidance system
JP6914323B2 (en) Parking lot information management system, parking lot guidance system, parking lot information management program and parking lot guidance program
JP2019028526A (en) Congestion prediction device
JP4736590B2 (en) Candidate route creation device, method, program, traffic simulation device, method and program, route search device, method, and program
JP6633372B2 (en) Route search device and route search method
JP2015021836A (en) Navigation apparatus and route calculation device
JP2011174753A (en) Navigation apparatus
JP6912859B2 (en) Map update device, map update method, computer program, and recording medium on which the computer program is recorded.
CN116194935B (en) Method and apparatus for determining a navigation profile of a vehicle in a geographic area
JP2010038860A (en) Navigator and facility search method
JP4455188B2 (en) In-vehicle information provision system

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