CN111044058A - Route planning method, route planning device, computer device, and storage medium - Google Patents
Route planning method, route planning device, computer device, and storage medium Download PDFInfo
- Publication number
- CN111044058A CN111044058A CN201811182724.7A CN201811182724A CN111044058A CN 111044058 A CN111044058 A CN 111044058A CN 201811182724 A CN201811182724 A CN 201811182724A CN 111044058 A CN111044058 A CN 111044058A
- Authority
- CN
- China
- Prior art keywords
- road network
- target
- nodes
- node
- route
- 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.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3407—Route searching; Route guidance specially adapted for specific applications
- G01C21/3415—Dynamic re-routing, e.g. recalculating the route when the user deviates from calculated route or after detecting real-time traffic data or accidents
Landscapes
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Automation & Control Theory (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Traffic Control Systems (AREA)
- Navigation (AREA)
Abstract
The embodiment of the disclosure provides a route planning method based on traffic rules, which includes: acquiring a target road network graph; generating a road network topological graph according to the target road network graph, wherein the road network topological graph comprises a plurality of nodes, and each node represents one road section; acquiring preset traffic rule information corresponding to each node; judging whether every two nodes in the road network topological graph pass or not according to preset traffic rule information; updating the road network topological graph according to the judgment result of whether every two nodes pass or not to generate a target road network topological graph; and planning a route based on the target road network topological graph. Correspondingly, the embodiment of the disclosure also provides a route planning device, computer equipment and a computer readable storage medium based on the traffic rules. According to the embodiment of the disclosure, the traffic rules are applied to route planning, so that not only can accurate recommendation of routes be realized, and routes with lower passing cost can be recommended to users, but also the data processing efficiency can be effectively improved.
Description
Technical Field
The disclosed embodiments relate to the technical field of route planning, and in particular, to a route planning method based on traffic rules, a route planning device based on traffic rules, a computer device, and a computer-readable storage medium.
Background
At present, in the field of electronic maps and navigation, especially in the aspect of route planning, the design and implementation of traffic rule schemes in map search are always relatively difficult problems. The vehicle needs to be restricted by a plurality of traffic rules in the actual driving process, such as traffic rules of forbidding turning around, unidirectional driving, time-limited driving, steering limitation, single-double number driving, license plate driving and the like. If the intersection is a complex intersection, such as a viaduct with a multilayer structure, an intersection with a main road and a side road, a roundabout and the like, various traffic regulation limitations usually occur, and it becomes difficult for inexperienced drivers to reasonably pass through the intersection, and even traffic jam is caused, and the factors influence the actual route planning. Therefore, the influence factors such as traffic rules and the like are fully considered in map navigation, the traffic rules are reasonably designed in map search, route planning under dynamic traffic rules is realized, the traffic condition can be effectively improved, and the satisfaction degree of users is improved.
In addition, in the conventional road network model, a link may be understood as a link segment formed by abstracting a road in real life, and attribute information of the road itself is stored in the link. The connection point between the link and the link is called a node, which can be understood as a node formed by abstracting a road port or intersection, and these attribute information are stored on the node.
For implementing dynamic traffic rules in map search, the conventional solution is to add a certain weight between links to indicate whether the link is passable or not, if the link is passable, the link is set with a smaller weight, if the link is not passable, the link is set with a larger weight, and in subsequent route planning, the link with a larger weight is not selected preferentially. The data processing efficiency of the above scheme is relatively low, and how to improve the data processing efficiency while realizing the route planning under the dynamic traffic rules becomes a technical problem to be solved urgently.
Disclosure of Invention
The embodiment of the disclosure provides a new technical scheme based on the above problems, and by applying the traffic rules to route planning, not only can accurate recommendation of routes be realized, and routes with lower traffic cost can be recommended to users, but also data processing efficiency can be effectively improved, so that user experience is improved.
In view of this, according to a first aspect of the embodiments of the present disclosure, a route planning method based on traffic rules is provided, including: acquiring a target road network graph; generating a road network topological graph according to the target road network graph, wherein the road network topological graph comprises a plurality of nodes, and each node represents one road section; acquiring preset traffic rule information corresponding to each node; judging whether every two nodes in the road network topological graph pass or not according to preset traffic rule information; updating the road network topological graph according to the judgment result of whether every two nodes pass or not to generate a target road network topological graph; and planning a route based on the target road network topological graph.
In the technical scheme, firstly, a road network topological graph comprising a plurality of nodes (i.e. nodes) is generated based on a target road network graph, each node in the road network topological graph represents a road section, namely, the road sections are abstracted into the nodes, whether any two nodes in all the nodes in the initial road network topological graph pass through is further judged according to preset traffic rule information, and the initial road network topological graph is updated based on the judgment result to generate the target road network topological graph for route planning, so that not only can accurate recommendation of the route be realized, but also a route with lower passing cost can be recommended to a user and the data processing efficiency can be effectively improved by adopting the concept of abstracting line sections (i.e. links) into the road sections and abstracting end points or branches of the road sections into the nodes in the existing road network model and applying the traffic rules in the route planning, thereby improving the user experience.
In the above technical solution, the road network graph specifically refers to a plurality of road layouts in a region, and the target road network graph is used for a user to implement a plurality of road layouts in a specific region of a current route planning, on one hand, the target road network graph may obtain road network geometric data from a map database to determine the target road network graph, wherein the road network geometric data may be composed of geographic spatial data and traffic information, such as longitude and latitude, road information, and the like; on the other hand, the target road network map may also be a map that is already mature in the market and directly obtained through an interface, such as a *** map, a Baidu map, and the like.
Further, the preset traffic rule information corresponding to each node at least includes prohibition of turning around, unidirectional driving, limited-time driving, steering limitation, single-double-number limitation, license plate limitation and the like.
In any of the above technical solutions, preferably, each node has a corresponding node weight value, and the node weight value is used for identifying the passing cost of the road section represented by the corresponding node.
In the technical scheme, each node in the road network topological graph may have a corresponding weight attribute (i.e., a node weight value) for measuring the passing cost of the road segment corresponding to the node, which further facilitates efficient and reasonable route planning for a user to go out, and specifically, the passing cost of each road segment may be determined based on the segment length, the road congestion degree, the road grade, the road width, the number of lanes, the road passing direction, the segment laying condition, and the like.
In any of the above technical solutions, preferably, the step of updating the road network topology map according to the determination result of whether each two nodes pass through to generate the target road network topology map includes: generating a corresponding line segment according to the judgment result of whether every two nodes pass; and adding the line segments between two corresponding nodes in the road network topological graph to generate a target road network topological graph.
In the technical scheme, when the target road network topological graph is generated by updating the result of judging whether any two nodes in all nodes in the initial road network topological graph pass according to the preset traffic rule information, corresponding line segments can be respectively generated according to different judgment results, and the generated line segments are added between two corresponding nodes in the initial road network topological graph, namely whether the two nodes corresponding to the marks can pass or not is supplemented in the road network topological graph comprising a plurality of nodes, so that the processing efficiency of route planning is improved, and efficient and reasonable route planning is realized.
In any of the above technical solutions, preferably, in the step of adding the line segment between two corresponding nodes in the road network topological graph, a corresponding line type identification line segment is set according to a judgment result of whether the line segment passes between every two nodes, where each line segment has a corresponding line segment weight value, and the line segment weight value is used for identifying a passing cost between two nodes corresponding to the line segment.
In the technical scheme, different line types may be specifically used to identify a line segment representing a result of determining whether two different nodes pass through, for example, a straight line is used to identify a line segment that can pass through from one node to another node and a dotted line is used to identify that cannot pass through from one node to another node, and further, each line segment in the target road network topological graph may have a corresponding weight attribute (i.e., a line segment weight value) for measuring a passing cost between two corresponding nodes, so that the target road network topological graph clearly and definitely presents a passing cost of each node (i.e., each road segment) and a passing cost between every two nodes, so as to implement efficient and reasonable route planning for users to go out.
In any of the above technical solutions, preferably, the step of performing route planning based on the target road network topological graph includes: determining target selectable routes according to a starting point and an end point set by a user, wherein each target selectable route comprises a target node and a target line segment which are connected with the starting point and the end point and correspond to each other; calculating the passing cost of each corresponding target optional route according to the node weight value corresponding to the target node and the line segment weight value corresponding to the target line segment; and recommending the travel route to the user according to the passing cost of each target selectable route.
In the technical solution, when performing route planning based on an updated target road network topological graph, first, a target selectable route meeting a condition may be screened out from the target road network topological graph based on a starting point and an ending point of a route set by a user, where each selectable route includes a target node and a target line segment communicating the starting point and the ending point, and since each node in the target road network topological graph has a corresponding node weight value and each line segment has a corresponding line segment weight value, a transit cost of each target selectable route may be calculated according to the node weight value corresponding to the target node and the line segment weight value corresponding to the target line segment, and further, a travel route may be recommended to the user according to the transit cost corresponding to each target selectable route, for example, a target selectable route with a lower transit cost is recommended to the user for selection of the travel route, therefore, the influence factors such as traffic rules are fully considered in route planning, and the route with high travel efficiency is efficiently recommended to the user, so that the satisfaction degree of the user is improved.
In any of the above technical solutions, preferably, the route planning method further includes; and updating the preset traffic rule information corresponding to each road section at preset time intervals.
In the technical scheme, in order to ensure that the latest real-time traffic condition is maintained between nodes in a target road network topological graph for route planning, the preset traffic rule information corresponding to each road section can be updated at preset time intervals, so that the high accuracy of the route planning is ensured, the result of the route planning better conforms to the actual situation, the satisfaction degree of a user is improved, for example, the route planning is updated at intervals of 5-10 minutes, and preferably, the route planning can be updated at intervals of 5 minutes.
According to a second aspect of the embodiments of the present disclosure, a route planning device based on traffic rules is provided, including: the first acquisition module is used for acquiring a target road network graph; the system comprises a generating module, a judging module and a judging module, wherein the generating module is used for generating a road network topological graph according to a target road network graph, and the road network topological graph comprises a plurality of nodes, wherein each node represents a road section; the second acquisition module is used for acquiring preset traffic rule information corresponding to each node; the judging module is used for judging whether every two nodes in the road network topological graph pass or not according to the preset traffic rule information; the updating module is used for updating the road network topological graph according to the judgment result of whether every two nodes output by the judging module pass or not so as to generate a target road network topological graph; and the planning module is used for planning the route based on the target road network topological graph.
In the technical scheme, firstly, a road network topological graph comprising a plurality of nodes (i.e. nodes) is generated based on a target road network graph, each node in the road network topological graph represents a road section, namely, the road sections are abstracted into the nodes, whether any two nodes in all the nodes in the initial road network topological graph pass through is further judged according to preset traffic rule information, and the initial road network topological graph is updated based on the judgment result to generate the target road network topological graph for route planning, so that not only can accurate recommendation of the route be realized, but also a route with lower passing cost can be recommended to a user and the data processing efficiency can be effectively improved by adopting the concept of abstracting line sections (i.e. links) into the road sections and abstracting end points or branches of the road sections into the nodes in the existing road network model and applying the traffic rules in the route planning, thereby improving the user experience.
In the above technical solution, the road network graph specifically refers to a plurality of road layouts in a region, and the target road network graph is used for a user to implement a plurality of road layouts in a specific region of a current route planning, on one hand, the target road network graph may obtain road network geometric data from a map database to determine the target road network graph, wherein the road network geometric data may be composed of geographic spatial data and traffic information, such as longitude and latitude, road information, and the like; on the other hand, the target road network map may also be a map that is already mature in the market and directly obtained through an interface, such as a *** map, a Baidu map, and the like.
Further, the preset traffic rule information corresponding to each node at least includes prohibition of turning around, unidirectional driving, limited-time driving, steering limitation, single-double-number limitation, license plate limitation and the like.
In any of the above technical solutions, preferably, each node has a corresponding node weight value, and the node weight value is used for identifying the passing cost of the road section represented by the corresponding node.
In the technical scheme, each node in the road network topological graph may have a corresponding weight attribute (i.e., a node weight value) for measuring the passing cost of the road segment corresponding to the node, which further facilitates efficient and reasonable route planning for a user to go out, and specifically, the passing cost of each road segment may be determined based on the segment length, the road congestion degree, the road grade, the road width, the number of lanes, the road passing direction, the segment laying condition, and the like.
In any one of the above technical solutions, preferably, the update module includes: the generation submodule is used for generating a corresponding line segment according to the judgment result of whether every two nodes output by the judgment module pass or not; and the adding submodule is used for adding the line segments between two corresponding nodes in the road network topological graph to generate a target road network topological graph.
In the technical scheme, when the target road network topological graph is generated by updating the result of judging whether any two nodes in all nodes in the initial road network topological graph pass according to the preset traffic rule information, corresponding line segments can be respectively generated according to different judgment results, and the generated line segments are added between two corresponding nodes in the initial road network topological graph, namely whether the two nodes corresponding to the marks can pass or not is supplemented in the road network topological graph comprising a plurality of nodes, so that the processing efficiency of route planning is improved, and efficient and reasonable route planning is realized.
In any of the above technical solutions, preferably, the adding sub-module is further configured to: and setting a corresponding line type identification line segment according to a judgment result of whether the two nodes output by the judgment module pass or not, wherein each line segment has a corresponding line segment weight value, and the line segment weight value is used for identifying the passing cost between the two nodes corresponding to the line segment.
In the technical scheme, different line types may be specifically used to identify a line segment representing a result of determining whether two different nodes pass through, for example, a straight line is used to identify a line segment that can pass through from one node to another node and a dotted line is used to identify that cannot pass through from one node to another node, and further, each line segment in the target road network topological graph may have a corresponding weight attribute (i.e., a line segment weight value) for measuring a passing cost between two corresponding nodes, so that the target road network topological graph clearly and definitely presents a passing cost of each node (i.e., each road segment) and a passing cost between every two nodes, so as to implement efficient and reasonable route planning for users to go out.
In any of the above technical solutions, preferably, the planning module includes: the determining submodule is used for determining target selectable routes according to a starting point and an end point set by a user, and each target selectable route comprises a target node and a target line segment which are connected with the starting point and the end point and correspond to each other; the calculation submodule is used for calculating the passing cost of each corresponding target optional route according to the node weight value corresponding to the target node and the line segment weight value corresponding to the target line segment; and the recommending submodule is used for recommending the travel route to the user according to the passing cost of each target selectable route.
In the technical solution, when performing route planning based on an updated target road network topological graph, first, a target selectable route meeting a condition may be screened out from the target road network topological graph based on a starting point and an ending point of a route set by a user, where each selectable route includes a target node and a target line segment communicating the starting point and the ending point, and since each node in the target road network topological graph has a corresponding node weight value and each line segment has a corresponding line segment weight value, a transit cost of each target selectable route may be calculated according to the node weight value corresponding to the target node and the line segment weight value corresponding to the target line segment, and further, a travel route may be recommended to the user according to the transit cost corresponding to each target selectable route, for example, a target selectable route with a lower transit cost is recommended to the user for selection of the travel route, therefore, the influence factors such as traffic rules are fully considered in route planning, and the route with high travel efficiency is efficiently recommended to the user, so that the satisfaction degree of the user is improved.
In any of the above technical solutions, preferably, the second obtaining module is further configured to: and updating the preset traffic rule information corresponding to each road section at preset time intervals.
In the technical scheme, in order to ensure that the latest real-time traffic condition is maintained between nodes in a target road network topological graph for route planning, the preset traffic rule information corresponding to each road section can be updated at preset time intervals, so that the high accuracy of the route planning is ensured, the result of the route planning better conforms to the actual situation, the satisfaction degree of a user is improved, for example, the route planning is updated at intervals of 5-10 minutes, and preferably, the route planning can be updated at intervals of 5 minutes.
According to a third aspect of embodiments of the present disclosure, a computer device is proposed, the computer device comprising a processor for implementing the steps of the traffic rule based route planning method according to any one of the above-mentioned solutions of the first aspect when executing a computer program stored in a memory.
According to a fourth aspect of the embodiments of the present disclosure, a computer-readable storage medium is proposed, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the traffic rule based route planning method according to any one of the above-mentioned solutions of the first aspect.
According to the technical scheme, the traffic rules are applied to route planning, so that accurate recommendation of routes can be achieved, the routes with low passing cost are recommended to users, data processing efficiency can be effectively improved, and user experience is improved.
Drawings
Fig. 1 shows a flow diagram of a traffic rules based route planning method of an embodiment of the present disclosure;
FIG. 2 is a flowchart illustrating a method for generating a target road network topology graph according to an embodiment of the disclosure;
FIG. 3 is a flowchart illustrating a method for route planning based on a target road network topological graph according to an embodiment of the present disclosure;
FIG. 4 shows a schematic block diagram of a traffic rules based route planning apparatus of an embodiment of the present disclosure;
FIG. 5 shows a schematic block diagram of the update module shown in FIG. 4;
FIG. 6 shows a schematic block diagram of the planning module shown in FIG. 4;
FIG. 7 shows a schematic block diagram of a computer device of an embodiment of the present disclosure.
Detailed Description
In order that the above objects, features and advantages of the embodiments of the present disclosure may be more clearly understood, embodiments of the present disclosure are described in further detail below with reference to the accompanying drawings and detailed description. 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 embodiments of the disclosure, however, the embodiments of the disclosure may be practiced in other ways than those described herein, and therefore the scope of the embodiments of the disclosure is not limited by the specific embodiments disclosed below.
The method for route planning based on traffic rules according to the embodiment of the present disclosure is described in detail below with reference to fig. 1 to 3.
As shown in fig. 1, the route planning method based on traffic rules according to the embodiment of the present disclosure specifically includes the following steps:
step S10, a target road network map is acquired.
It can be understood that the road network graph specifically refers to a plurality of road layouts in a region, and the target road network graph is used for a user to implement a plurality of road layouts in a specific region of a current route planning, on one hand, the target road network graph can obtain road network geometric data from a map database to determine the target road network graph, wherein the road network geometric data can be composed of geographic spatial data and traffic information, such as longitude and latitude, road information and the like; on the other hand, the target road network map may also be a map that is already mature in the market and directly obtained through an interface, such as a *** map, a Baidu map, and the like.
Step S20, generating a road network topology map according to the target road network map, where the road network topology map includes a plurality of nodes, and each node represents a road segment.
And step S30, acquiring preset traffic rule information corresponding to each node.
It can be understood that the preset traffic regulation information corresponding to each node at least includes a u-turn prohibition, a one-way driving, a time-limited driving, a steering limitation, a single-double number limitation, a license plate limitation, and the like.
Further, in order to ensure that the latest real-time traffic conditions are kept between nodes in the target road network topological graph for route planning, the preset traffic rule information corresponding to each road section can be updated at preset time intervals, so that the high accuracy of route planning is ensured, the result of route planning better conforms to the actual situation, and the satisfaction of the user is improved, for example, the update is performed every 5-10 minutes, and preferably every 5 minutes.
And step S40, judging whether every two nodes in the road network topological graph pass according to the preset traffic rule information.
And step S50, updating the road network topological graph according to the judgment result of whether every two nodes pass or not to generate the target road network topological graph.
And step S60, planning the route based on the target road network topological graph.
In this embodiment, a road network topological graph including a plurality of nodes (i.e., nodes) is first generated based on a target road network graph, each node in the road network topological graph represents a road segment, i.e., the road segments are abstracted into nodes, whether any two nodes in all nodes in the initial road network topological graph pass through is further determined according to preset traffic rule information, and the initial road network topological graph is updated based on the determination result to generate the target road network topological graph for route planning, so that not only can accurate recommendation of routes be realized, but also a route with lower passing cost can be recommended to a user, and data processing efficiency can be effectively improved by adopting an idea opposite to abstracting line segments (i.e., links) into road segments and abstracting end points or branches of road segments into nodes in an existing road network model, and applying traffic rules in route planning, thereby improving the user experience.
For step S40 in the above embodiment, in an embodiment, for example, three different road segments, that is, three intersections, are defined as N1, N2, and N3 in the road network topological graph, then according to the preset traffic rule information, it may be determined that: the information that N1 to N2 can pass, N1 to N3 can not turn left, N2 to N3 can not pass and the like.
Further, in the above embodiment, each node has a corresponding node weight value, and the node weight value is used to identify the passing cost of the road section represented by the corresponding node.
In this embodiment, each node in the road network topological graph may have a corresponding weight attribute (i.e., a node weight value) for measuring the traffic cost of the road segment corresponding to the node, which further facilitates efficient and reasonable route planning for a user to go out, and specifically, the traffic cost of each road segment may be determined based on the segment length, the road congestion degree, the road grade, the road width, the number of lanes, the road traffic direction, the segment laying condition, and the like.
Further, as shown in fig. 2, the step S50 in the foregoing embodiment may be specifically executed as the following steps:
step S502, generating a corresponding line segment according to the judgment result of whether every two nodes pass through.
Step S504, adding the line segment between two corresponding nodes in the road network topological graph to generate the target road network topological graph.
In this embodiment, when the target road network topological graph is generated by updating the result of judging whether any two nodes in all nodes in the initial road network topological graph pass or not according to the preset traffic rule information, corresponding line segments may be respectively generated according to different judgment results, and the generated line segments are added between two corresponding nodes in the initial road network topological graph, that is, whether a line segment can pass or not between two corresponding nodes is supplemented and identified in the road network topological graph including a plurality of nodes, so as to improve the processing efficiency of route planning, thereby implementing efficient and reasonable route planning.
Further, in step S504 of the above embodiment, a corresponding line type identification line segment may also be set according to a determination result of whether each two nodes pass or not, where each line segment has a corresponding line segment weight value, and the line segment weight value is used to identify a passing cost between the two nodes corresponding to the line segment.
In this embodiment, different line types may be specifically used to identify line segments representing the determination result of whether to pass between two different nodes, for example, straight lines are used to identify that a route can pass from one node to another node and dashed lines are used to identify that a route cannot pass from one node to another node, and further, each line segment in the target road network topology graph may have a corresponding weight attribute (i.e., a weight value of the line segment) for measuring the passing cost between two corresponding nodes, so that the target road network topology graph clearly and definitely presents the passing cost of each node (i.e., each road segment) and the passing cost between two nodes, so as to implement efficient and reasonable route planning for facilitating users to travel.
Further, in an embodiment of the present invention, the weight value of the segment added between the nodes that are accessible may be 0 or a relatively small value, and the weight value of the segment added between the nodes that are not accessible may be a relatively large value or no segment may be added between the nodes that are not accessible. For example, there are two nodes M1 and M2 in the road network topological graph, and if it is determined that M1 can turn to enter M2 according to the preset traffic regulation information corresponding to each node, a solid line may be added between M1 and M2 to represent a passable line segment, and if it is determined that M1 and M2 cannot turn, a solid line may not be added between M1 and M2, or a line segment with a larger weight value may be added between M1 and M2, so that the road segment is not preferentially selected in the subsequent route planning.
Further, as shown in fig. 3, the step S60 in the foregoing embodiment may be specifically executed as the following steps:
step S602, determining target selectable routes according to the starting point and the end point set by the user, wherein each target selectable route comprises a target node and a target line segment which are corresponding to the starting point and the end point.
Step S604, calculating the passing cost of each corresponding target selectable route according to the node weight value corresponding to the target node and the line segment weight value corresponding to the target line segment.
And step S606, recommending a travel route to the user according to the passing cost of each target selectable route.
In this embodiment, when performing route planning based on the updated target road network topological graph, first, a target optional route meeting the condition may be screened out from the target road network topological graph based on a starting point and an ending point of a route set by a user, where each optional route includes a target node and a target line segment connecting the starting point and the ending point, and since each node in the target road network topological graph has a corresponding node weight value and each line segment has a corresponding line segment weight value, a transit cost of each target optional route may be calculated according to the node weight value corresponding to the target node and the line segment weight value corresponding to the target line segment, further, a travel route may be recommended to the user according to the transit cost corresponding to each target optional route, for example, a target optional route with a lower transit cost may be recommended to the user for selection of the travel route, therefore, the influence factors such as traffic rules are fully considered in route planning, and the route with high travel efficiency is efficiently recommended to the user, so that the satisfaction degree of the user is improved.
The following describes a route planning device based on traffic rules according to an embodiment of the present disclosure with reference to fig. 4 to 6.
As shown in fig. 4, a traffic rule based route planning apparatus 40 according to an embodiment of the present disclosure includes: a first acquisition module 402, a generation module 404, a second acquisition module 406, a determination module 408, an update module 410, and a planning module 412.
The first obtaining module 402 is configured to obtain a target road network map; the generating module 404 is configured to generate a road network topology map according to the target road network map, where the road network topology map includes a plurality of nodes, and each node represents a road segment; the second obtaining module 406 is configured to obtain preset traffic rule information corresponding to each node; the judging module 408 is configured to judge whether two nodes in the road network topological graph pass through according to preset traffic rule information; the updating module 410 is configured to update the road network topological graph according to the determination result of whether each two nodes output by the determining module 408 pass or not, so as to generate a target road network topological graph; the planning module 412 is used for route planning based on the target road network topological graph.
In this embodiment, a road network topological graph including a plurality of nodes (i.e., nodes) is first generated based on a target road network graph, each node in the road network topological graph represents a road segment, i.e., the road segments are abstracted into nodes, whether any two nodes in all nodes in the initial road network topological graph pass through is further determined according to preset traffic rule information, and the initial road network topological graph is updated based on the determination result to generate the target road network topological graph for route planning, so that not only can accurate recommendation of routes be realized, but also a route with lower passing cost can be recommended to a user, and data processing efficiency can be effectively improved by adopting an idea opposite to abstracting line segments (i.e., links) into road segments and abstracting end points or branches of road segments into nodes in an existing road network model, and applying traffic rules in route planning, thereby improving the user experience.
In the above embodiment, the road network graph specifically refers to a plurality of road layouts in a region, and the target road network graph is used by a user to implement a plurality of road layouts in a specific region of a current route planning, on one hand, the target road network graph may obtain road network geometric data from a map database to determine the target road network graph, wherein the road network geometric data may be composed of geographic spatial data and traffic information, such as longitude and latitude, road information, and the like; on the other hand, the target road network map may also be a map that is already mature in the market and directly obtained through an interface, such as a *** map, a Baidu map, and the like.
Further, the preset traffic rule information corresponding to each node at least includes prohibition of turning around, unidirectional driving, limited-time driving, steering limitation, single-double-number limitation, license plate limitation and the like.
In a further embodiment of the present invention, for example, three different road segments, that is, three intersections, defined as N1, N2, and N3 exist in the road network topological graph, and according to the preset traffic rule information, it can be determined that: the information that N1 to N2 can pass, N1 to N3 can not turn left, N2 to N3 can not pass and the like.
Further, in the above embodiment, each node has a corresponding node weight value, and the node weight value is used to identify the passing cost of the road section represented by the corresponding node.
In the above embodiment, each node in the road network topology map may have a corresponding weight attribute (i.e., a node weight value) for measuring the traffic cost of the road segment corresponding to the node, which further facilitates efficient and reasonable route planning for a user to travel, and specifically, the traffic cost of each road segment may be determined based on the segment length, the road congestion degree, the road grade, the road width, the number of lanes, the road traffic direction, the segment laying condition, and the like.
Further, as shown in fig. 5, the update module 410 in the above embodiment includes: a generate submodule 4102 and an add submodule 4104.
The generating submodule 4102 is configured to generate a corresponding line segment according to a determination result of whether each two nodes output by the determining module 408 pass through; the adding submodule 4104 is configured to add a line segment between two corresponding nodes in the road network topological graph to generate a target road network topological graph.
In this embodiment, when the target road network topological graph is generated by updating the result of judging whether any two nodes in all nodes in the initial road network topological graph pass or not according to the preset traffic rule information, corresponding line segments may be respectively generated according to different judgment results, and the generated line segments are added between two corresponding nodes in the initial road network topological graph, that is, whether a line segment can pass or not between two corresponding nodes is supplemented and identified in the road network topological graph including a plurality of nodes, so as to improve the processing efficiency of route planning, thereby implementing efficient and reasonable route planning.
Further, in the above embodiment, the adding sub-module 4104 is also used for: and setting a corresponding line type identification line segment according to the judgment result of whether the two nodes pass or not output by the judgment module 408, wherein each line segment has a corresponding line segment weight value, and the line segment weight value is used for identifying the passing cost between the two nodes corresponding to the line segment.
In this embodiment, different line types may be specifically used to identify line segments representing the determination result of whether to pass between two different nodes, for example, straight lines are used to identify that a route can pass from one node to another node and dashed lines are used to identify that a route cannot pass from one node to another node, and further, each line segment in the target road network topology graph may have a corresponding weight attribute (i.e., a weight value of the line segment) for measuring the passing cost between two corresponding nodes, so that the target road network topology graph clearly and definitely presents the passing cost of each node (i.e., each road segment) and the passing cost between two nodes, so as to implement efficient and reasonable route planning for facilitating users to travel.
Further, in an embodiment of the present invention, the weight value of the segment added between the nodes that are accessible may be 0 or a relatively small value, and the weight value of the segment added between the nodes that are not accessible may be a relatively large value or no segment may be added between the nodes that are not accessible. For example, there are two nodes M1 and M2 in the road network topological graph, and if it is determined that M1 can turn to enter M2 according to the preset traffic regulation information corresponding to each node, a solid line may be added between M1 and M2 to represent a passable line segment, and if it is determined that M1 and M2 cannot turn, a solid line may not be added between M1 and M2, or a line segment with a larger weight value may be added between M1 and M2, so that the road segment is not preferentially selected in the subsequent route planning.
Further, as shown in fig. 6, the planning module 412 in the above embodiment includes: a determination sub-module 4122, a calculation sub-module 4124 and a recommendation sub-module 4126.
The determining submodule 4122 is configured to determine target selectable routes according to a start point and an end point set by a user, where each target selectable route includes a target node and a target line segment corresponding to the start point and the end point; the calculating submodule 4124 is configured to calculate, according to the node weight value corresponding to the target node and the line segment weight value corresponding to the target line segment, a passing cost of each corresponding target selectable route; the recommendation sub-module 4126 is configured to recommend a travel route to the user according to the passage cost of each target alternative route.
In this embodiment, when performing route planning based on the updated target road network topological graph, first, a target optional route meeting the condition may be screened out from the target road network topological graph based on a starting point and an ending point of a route set by a user, where each optional route includes a target node and a target line segment connecting the starting point and the ending point, and since each node in the target road network topological graph has a corresponding node weight value and each line segment has a corresponding line segment weight value, a transit cost of each target optional route may be calculated according to the node weight value corresponding to the target node and the line segment weight value corresponding to the target line segment, further, a travel route may be recommended to the user according to the transit cost corresponding to each target optional route, for example, a target optional route with a lower transit cost may be recommended to the user for selection of the travel route, therefore, the influence factors such as traffic rules are fully considered in route planning, and the route with high travel efficiency is efficiently recommended to the user, so that the satisfaction degree of the user is improved.
Further, in the above embodiment, the second obtaining module 406 is further configured to: and updating the preset traffic rule information corresponding to each road section at preset time intervals.
In this embodiment, in order to ensure that the latest real-time traffic conditions are maintained between nodes in the target road network topological graph for route planning, the preset traffic rule information corresponding to each road segment may be updated at preset time intervals, so as to ensure high accuracy of route planning, make the result of route planning better conform to the actual situation, and improve the satisfaction of the user, for example, updating every 5 minutes to 10 minutes, and preferably updating every 5 minutes.
FIG. 7 shows a schematic block diagram of a computer device of an embodiment of the present disclosure.
As shown in fig. 7, the computer device 70 according to the embodiment of the present disclosure includes a memory 702, a processor 704 and a computer program stored on the memory 702 and executable on the processor 704, wherein the memory 702 and the processor 704 may be connected by a bus, and the processor 704 is configured to implement the steps of the route planning method based on traffic rules according to the above embodiment when executing the computer program stored in the memory 702.
The steps in the method of the embodiments of the present disclosure may be sequentially adjusted, combined, and deleted according to actual needs.
The units in the traffic rule-based route planning device and the computer device of the embodiments of the present disclosure can be merged, divided, and deleted according to actual needs.
According to an embodiment of the disclosure, a computer-readable storage medium is proposed, on which a computer program is stored which, when being executed by a processor, carries out the steps of the traffic rule based route planning method according to the above embodiment.
Further, it will be understood that any process or method descriptions in flow charts or otherwise described herein may be understood as representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps of the process, and that the scope of the preferred embodiments of the present invention includes additional implementations in which functions may be executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those reasonably skilled in the art of the embodiments of the present invention.
The logic and/or steps represented in the flowcharts or otherwise described herein, e.g., an ordered listing of executable instructions that can be considered to implement logical functions, can be embodied in any computer-readable medium for use by or in connection with an instruction execution system, apparatus, or device, such as a computer-based system, processor-containing system, or other system that can fetch the instructions from the instruction execution system, apparatus, or device and execute the instructions. For the purposes of this description, a "computer-readable medium" can be any means that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. More specific examples (a non-exhaustive list) of the computer-readable medium would include the following: an electrical connection (electronic device) having one or more wires, a portable computer diskette (magnetic device), a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disc read-only memory (CDROM). Additionally, the computer-readable medium could even be paper or another suitable medium upon which the program is printed, as the program can be electronically captured, via for instance optical scanning of the paper or other medium, then compiled, interpreted or otherwise processed in a suitable manner if necessary, and then stored in a computer memory.
It should be understood that portions of the present invention may be implemented in hardware, software, firmware, or a combination thereof. In the above embodiments, the various steps or methods may be implemented in software or firmware stored in memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, any one or combination of the following techniques, which are known in the art, may be used: a discrete logic circuit having a logic gate circuit for implementing a logic function on a data signal, an application specific integrated circuit having an appropriate combinational logic gate circuit, a Programmable Gate Array (PGA), a Field Programmable Gate Array (FPGA), or the like.
It will be understood by those skilled in the art that all or part of the steps carried by the method for implementing the above embodiments may be implemented by hardware related to instructions of a program, which may be stored in a computer readable storage medium, and when the program is executed, the program includes one or a combination of the steps of the method embodiments.
In addition, functional units in the embodiments of the present invention may be integrated into one processing module, or each unit may exist alone physically, or two or more units are integrated into one module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode. The integrated module, if implemented in the form of a software functional module and sold or used as a separate product, may also be stored in a computer readable storage medium.
The storage medium mentioned above may be a read-only memory, a magnetic or optical disk, etc.
Further, the computer device may be a server or the like.
The technical scheme of the embodiment of the disclosure is described in detail with reference to the drawings, and by applying the traffic rules to route planning, the technical scheme can not only realize accurate recommendation of routes and recommend the routes with lower traffic cost to users, but also effectively improve data processing efficiency, thereby improving user experience.
In the embodiments of the present disclosure, the terms "first" and "second" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance, and specific meanings of the above terms in the embodiments of the present disclosure may be understood according to specific situations by those of ordinary skill in the art.
The above description is only a preferred embodiment of the present disclosure and is not intended to limit the present disclosure, and various modifications and changes may be made to the present disclosure by those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the disclosed embodiments should be included in the scope of protection of the disclosed embodiments.
Claims (14)
1. A method for route planning based on traffic rules, comprising:
acquiring a target road network graph;
generating a road network topological graph according to the target road network graph, wherein the road network topological graph comprises a plurality of nodes, and each node represents one road section;
acquiring preset traffic rule information corresponding to each node;
judging whether every two nodes in the road network topological graph pass or not according to the preset traffic rule information;
updating the road network topological graph according to the judgment result of whether every two nodes pass through or not so as to generate a target road network topological graph;
and planning a route based on the target road network topological graph.
2. The route planning method according to claim 1, wherein each node has a corresponding node weight value for identifying a transit cost of the road segment represented by the corresponding node.
3. The route planning method according to claim 2, wherein the step of updating the road network topology map to generate the target road network topology map according to the determination result of whether each two nodes pass or not comprises:
generating a corresponding line segment according to the judgment result of whether every two nodes pass;
and adding the line segments between two corresponding nodes in the road network topological graph to generate the target road network topological graph.
4. The route planning method according to claim 3, wherein in said step of adding said line segments between two corresponding nodes in said road network topology map,
and setting corresponding line type identification line segments according to the judging result of whether the two nodes pass or not, wherein each line segment has a corresponding line segment weight value, and the line segment weight value is used for identifying the passing cost between the two nodes corresponding to the line segment.
5. The route planning method according to claim 4, wherein the step of performing route planning based on the target road network topological graph comprises:
determining target selectable routes according to a starting point and an end point set by a user, wherein each target selectable route comprises a target node and a target line segment which are connected with the starting point and the end point and correspond to each other;
calculating the passing cost of each corresponding target optional route according to the node weight value corresponding to the target node and the line segment weight value corresponding to the target line segment;
and recommending a travel route to the user according to the passing cost of each target selectable route.
6. The route planning method according to any one of claims 1 to 5, further comprising; and updating the preset traffic rule information corresponding to each road section at preset time intervals.
7. A route planning apparatus based on traffic rules, comprising:
the first acquisition module is used for acquiring a target road network graph;
a generating module, configured to generate a road network topological graph according to the target road network graph, where the road network topological graph includes a plurality of nodes, and each node represents a road segment;
the second acquisition module is used for acquiring preset traffic rule information corresponding to each node;
the judging module is used for judging whether every two nodes in the road network topological graph pass or not according to the preset traffic rule information;
the updating module is used for updating the road network topological graph according to the judgment result of whether every two nodes output by the judging module pass or not so as to generate a target road network topological graph;
and the planning module is used for planning the route based on the target road network topological graph.
8. The route planner as claimed in claim 7 wherein each node has a corresponding node weight value identifying a cost of passage of the road segment represented by the corresponding node.
9. The route planning device of claim 8 wherein the update module comprises:
the generation submodule is used for generating a corresponding line segment according to the judgment result of whether every two nodes output by the judgment module pass or not;
and the adding submodule is used for adding the line segments between two corresponding nodes in the road network topological graph to generate the target road network topological graph.
10. The route planning device of claim 9 wherein the add sub-module is further configured to:
and setting corresponding line type identification line segments according to the judgment result of whether the two nodes pass or not, which is output by the judgment module, wherein each line segment has a corresponding line segment weight value, and the line segment weight value is used for identifying the passing cost between the two nodes corresponding to the line segment.
11. The route planning device of claim 10 wherein the planning module comprises:
the determining submodule is used for determining target selectable routes according to a starting point and an end point set by a user, and each target selectable route comprises a target node and a target line segment which are connected with the starting point and the end point and correspond to each other;
the calculation submodule is used for calculating the passing cost of each corresponding target optional route according to the node weight value corresponding to the target node and the line segment weight value corresponding to the target line segment;
and the recommending submodule is used for recommending the travel route to the user according to the passing cost of each target selectable route.
12. The route planning device according to any one of claims 7 to 11, wherein the second obtaining module is further configured to: and updating the preset traffic rule information corresponding to each road section at preset time intervals.
13. A computer arrangement, characterized in that the computer arrangement comprises a processor for implementing the steps of the method according to any one of claims 1 to 6 when executing a computer program stored in a memory.
14. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811182724.7A CN111044058A (en) | 2018-10-11 | 2018-10-11 | Route planning method, route planning device, computer device, and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811182724.7A CN111044058A (en) | 2018-10-11 | 2018-10-11 | Route planning method, route planning device, computer device, and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111044058A true CN111044058A (en) | 2020-04-21 |
Family
ID=70229041
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811182724.7A Pending CN111044058A (en) | 2018-10-11 | 2018-10-11 | Route planning method, route planning device, computer device, and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111044058A (en) |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110768819A (en) * | 2018-12-03 | 2020-02-07 | 北京嘀嘀无限科技发展有限公司 | Generation method, planning method, device, terminal and readable storage medium |
| CN111652434A (en) * | 2020-06-02 | 2020-09-11 | 百度在线网络技术（北京）有限公司 | Road network data processing method and device, electronic equipment and computer storage medium |
| CN111912411A (en) * | 2020-08-26 | 2020-11-10 | 中国电力科学研究院有限公司 | Robot navigation positioning method, system and storage medium |
| CN112161636A (en) * | 2020-08-28 | 2021-01-01 | 深圳市跨越新科技有限公司 | Truck route planning method and system based on one-way simulation |
| CN112184931A (en) * | 2020-09-28 | 2021-01-05 | 广西信路威科技发展有限公司 | Vehicle charging path optimization system and analysis method based on highway network |
| CN112750219A (en) * | 2020-12-29 | 2021-05-04 | 深圳市跨越新科技有限公司 | Vehicle travel expense calculation method and system |
| CN112785735A (en) * | 2020-12-31 | 2021-05-11 | 北京掌行通信息技术有限公司 | Expressway road condition monitoring method and device based on charging data |
| CN112989229A (en) * | 2021-04-29 | 2021-06-18 | 腾讯科技（深圳）有限公司 | Travel route recommendation method and device, computer 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 |
| CN113721599A (en) * | 2020-05-25 | 2021-11-30 | 华为技术有限公司 | Positioning method and positioning device |
| CN114199264A (en) * | 2021-10-29 | 2022-03-18 | 沈阳美行科技有限公司 | Navigation route planning method, device and equipment |
| CN114267176A (en) * | 2021-12-24 | 2022-04-01 | 中电金信软件有限公司 | Navigation method, navigation device, electronic equipment and computer readable storage medium |
| 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 |
| CN114526753A (en) * | 2022-04-24 | 2022-05-24 | 深圳依时货拉拉科技有限公司 | Cross-road intersection rule association method and device, computer equipment and readable storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1708032A (en) * | 2004-05-28 | 2005-12-14 | 朗迅科技公司 | Efficient and robust routing independent of traffic pattern variability |
| CN1920483A (en) * | 2005-08-25 | 2007-02-28 | 厦门雅迅网络股份有限公司 | Device for displaying road navigation track |
| CN102128631A (en) * | 2010-01-14 | 2011-07-20 | 歌乐株式会社 | Path searching method, navigation server and navigator |
| CN105303839A (en) * | 2015-12-04 | 2016-02-03 | 中国科学院遥感与数字地球研究所 | Latent congested road intersection prediction method and device |
| WO2017189870A1 (en) * | 2016-04-27 | 2017-11-02 | Massachusetts Institute Of Technology | Stable nanoscale nucleic acid assemblies and methods thereof |
| CN108108854A (en) * | 2018-01-10 | 2018-06-01 | 中南大学 | City road network link prediction method, system and storage medium |
-
2018
- 2018-10-11 CN CN201811182724.7A patent/CN111044058A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1708032A (en) * | 2004-05-28 | 2005-12-14 | 朗迅科技公司 | Efficient and robust routing independent of traffic pattern variability |
| CN1920483A (en) * | 2005-08-25 | 2007-02-28 | 厦门雅迅网络股份有限公司 | Device for displaying road navigation track |
| CN102128631A (en) * | 2010-01-14 | 2011-07-20 | 歌乐株式会社 | Path searching method, navigation server and navigator |
| CN105303839A (en) * | 2015-12-04 | 2016-02-03 | 中国科学院遥感与数字地球研究所 | Latent congested road intersection prediction method and device |
| WO2017189870A1 (en) * | 2016-04-27 | 2017-11-02 | Massachusetts Institute Of Technology | Stable nanoscale nucleic acid assemblies and methods thereof |
| CN108108854A (en) * | 2018-01-10 | 2018-06-01 | 中南大学 | City road network link prediction method, system and storage medium |
Non-Patent Citations (3)
| Title |
|---|
| 刘 康等: "基于路网拓扑层次性表达的驾车路径规划方法", 《地球信息科学》 * |
| 宋 延等: "适用于路径规划***的动态路网描述模型", 《交通与计算机》 * |
| 马洪伟，周溪召: "《城市随机交通网络可靠性分析与拓展》", 30 November 2017, 东北大学出版社 * |
Cited By (24)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110768819A (en) * | 2018-12-03 | 2020-02-07 | 北京嘀嘀无限科技发展有限公司 | Generation method, planning method, device, terminal and readable 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 |
| CN111912411B (en) * | 2020-08-26 | 2022-06-14 | 中国电力科学研究院有限公司 | Robot navigation positioning method, system and storage medium |
| CN111912411A (en) * | 2020-08-26 | 2020-11-10 | 中国电力科学研究院有限公司 | Robot navigation positioning method, system and storage medium |
| CN112161636A (en) * | 2020-08-28 | 2021-01-01 | 深圳市跨越新科技有限公司 | Truck route planning method and system based on one-way simulation |
| CN112161636B (en) * | 2020-08-28 | 2022-07-29 | 深圳市跨越新科技有限公司 | Truck route planning method and system based on one-way simulation |
| CN112184931A (en) * | 2020-09-28 | 2021-01-05 | 广西信路威科技发展有限公司 | Vehicle charging path optimization system and analysis method based on highway network |
| CN112750219A (en) * | 2020-12-29 | 2021-05-04 | 深圳市跨越新科技有限公司 | Vehicle travel expense calculation method and system |
| CN112750219B (en) * | 2020-12-29 | 2023-02-03 | 深圳市跨越新科技有限公司 | Vehicle travel expense calculation method and system |
| CN112785735A (en) * | 2020-12-31 | 2021-05-11 | 北京掌行通信息技术有限公司 | Expressway road condition monitoring method and device based on charging data |
| CN112785735B (en) * | 2020-12-31 | 2022-02-18 | 北京千方科技股份有限公司 | Expressway road condition monitoring method and device based on charging data |
| WO2022143549A1 (en) * | 2020-12-31 | 2022-07-07 | 北京千方科技股份有限公司 | Expressway road condition monitoring method and apparatus based on toll collection data |
| CN113177046A (en) * | 2021-04-15 | 2021-07-27 | 北京世纪高通科技有限公司 | Road network topological graph generation method, device, equipment and storage medium |
| CN113177046B (en) * | 2021-04-15 | 2024-05-03 | 北京世纪高通科技有限公司 | Road network topological graph generation method, device, equipment and storage medium |
| CN112989229A (en) * | 2021-04-29 | 2021-06-18 | 腾讯科技（深圳）有限公司 | Travel route recommendation method and device, computer 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 |
| CN114199264A (en) * | 2021-10-29 | 2022-03-18 | 沈阳美行科技有限公司 | Navigation route planning method, device and equipment |
| CN114267176A (en) * | 2021-12-24 | 2022-04-01 | 中电金信软件有限公司 | Navigation method, navigation device, electronic equipment and computer readable storage medium |
| 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 |
| CN114526753A (en) * | 2022-04-24 | 2022-05-24 | 深圳依时货拉拉科技有限公司 | Cross-road intersection rule association method and device, computer equipment and readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111044058A (en) | Route planning method, route planning device, computer device, and storage medium | |
| CN110768819B (en) | Generation method, planning method, device, terminal and readable storage medium | |
| KR101332158B1 (en) | Optimum route determination employing an estimation function | |
| JP6332287B2 (en) | Route prediction apparatus and route prediction method | |
| KR101994496B1 (en) | Providing routes through information collection and retrieval | |
| JP5925070B2 (en) | Map update system, map update method and program | |
| US11281652B2 (en) | In-vehicle device and map updating system | |
| JP2020531843A (en) | How to create an alternative route plan | |
| US20140132608A1 (en) | Graph based topological map matching | |
| US20170138744A1 (en) | Personalized optimal travel route planning | |
| CN109459050B (en) | Navigation route recommendation method and device | |
| US8768011B2 (en) | Road estimation device and method for estimating road | |
| US20080120022A1 (en) | Method and Device for Determining a Route with Points of Interest | |
| CN108801289B (en) | Induced arrow planning method and device, navigation system and storage medium | |
| WO2015162915A1 (en) | Route generation device and route generation method | |
| CN111982145B (en) | Travel path recommendation method, device, equipment and storage medium | |
| CN111380554A (en) | Efficient searching through meaningful links within a defined topology | |
| Fonzone et al. | Link-based route choice considering risk aversion, disappointment, and regret | |
| CN113701774A (en) | Path planning method and device for recommending lane sudden change | |
| JP7135699B2 (en) | Pathfinding system and pathfinding program | |
| JP2020052301A (en) | Map data high detailed level performance system, server thereof, and method thereof | |
| JP5342291B2 (en) | Map data update system, map data update method | |
| CN111854768B (en) | Method and system for determining map route, terminal, and computer-readable storage medium | |
| Fuest et al. | A framework for automatically visualizing and recommending efficient routes | |
| CN113401140B (en) | Route routing method and device for bidirectional road section, computer equipment and storage medium |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200421 |
|
| RJ01 | Rejection of invention patent application after publication |