Cycling path planning method and system based on Beidou satellite navigation
Through the cycling path planning method based on Beidou satellite navigation, the geographic information database and path planning strategy are used to solve the problem of distance priority in the existing technology, provide more efficient cycling paths, and update them in real time when environmental changes are changed, improving Riding efficiency and experience.
Patent Information
- Application Number
- CN202410346387.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-03-25
- Publication Date
- 2024-12-03
- Estimated Expiration
- 2044-03-25
AI Technical Summary
The existing cycling path planning methods mainly consider distance, failing to fully pay attention to environmental quality and cyclist experience, and being unable to deal with road changes and weather changes in real time, resulting in low cycling efficiency.
Based on Beidou satellite navigation, a geographical information database is established, and the best cycling path is found through path planning strategies, and the path is updated in real time, considering factors such as road information and traffic lights, calculating the riding time and selection probability, and providing the best cycling route.
Improve cycling efficiency, simplify path planning process, reduce time costs, and adjust paths in time when environmental changes.
Smart Images

Figure CN118190004B_ABST
Abstract
Description
Technical Field
[0001] The present invention belongs to the technical field of cycling path optimization, and in particular to a cycling path planning method and system based on Beidou satellite navigation. Background Art
[0002] In the context of the new era, people are pursuing a green and healthy lifestyle and are increasingly inclined to choose cycling as a means of transportation for short-distance travel. However, as the level of urban motorization in my country continues to increase, urban construction oriented towards motor vehicles has gradually neglected the travel environment for non-motor vehicles, and has continuously compressed the space for slow-moving travel such as bicycles, which has put urban traffic planning and street construction under test. As an important part of modern low-carbon urban comprehensive transportation, bicycle transportation can effectively alleviate traffic congestion, reduce environmental pollution, and promote the physical and mental health of residents by improving cycling space and planning cycling routes, which is of great significance to the sustainable development of cities.
[0003] At present, the cycling routes recommended by online navigation maps such as Amap and Baidu are the shortest routes between the starting point and the end point. However, the public has a new understanding of travel needs. Traveling is no longer simply considering the distance, but more considering the environmental quality of the streets and their own experience. With the goal of improving the quality of cycling, it is of great significance to propose a method for urban cycling route planning based on different travel needs.
[0004] For example, a Chinese patent with the authorization announcement number CN111582580B discloses a travel route planning method that takes into account the exposure of crowd pollutants. The vehicle specific power (VSP) distribution is calculated to obtain the emission data of road section motor vehicles. On this basis, the Gaussian steady-state plume equation is used to establish a pollutant diffusion distribution model for urban roads motor vehicles, and the spatiotemporal variation characteristics of pollutant concentrations in each road section are estimated in real time. Finally, the pollutant concentration distribution parameters are gridded, and then the crowd pollutant exposure model is used to calculate the pollutant exposure parameters of the characteristic crowd in the grid, and the operations research method is used as the weight to establish a low pollutant exposure path optimization method, and the optimal path, alternative path, and corresponding travel time and pollutant exposure value are output. Starting from the perspective of travelers, this embodiment of the invention fully considers the coordination relationship between travel time and pollutant exposure, and can provide a travel route with low pollutant exposure for walking and cycling travelers, providing a reference basis for travelers' travel decisions.
[0005] For example, a Chinese patent with authorization announcement number CN113469610B discloses a shortest path optimization method based on the average waiting time for riders. The steps are as follows: design a time cost and penalty cost model; read order information; set constraints, pick up the food first and then deliver it; establish a path matrix that meets the constraints; read the historical data of the rider's waiting time at a certain merchant; establish the merchant's average waiting time matrix; query the riding time between riders, merchants and customers; establish a riding time matrix; use a depth-first traversal algorithm; and recommend the obtained shortest path planning to the rider. This invention optimizes the shortest path and reduces the penalty cost by considering the average waiting time for riders, and develops a path recommendation system with the lowest cost when the rider is riding. It shortens the time for riders to pick up and deliver meals, reduces the risk of order timeouts, and increases the rider's income. It meets the interests of customers, riders and platforms and saves social resources. Summary of the invention
[0006] In view of the shortcomings of the prior art, the present invention proposes a cycling path planning method and system based on Beidou satellite navigation, which utilizes Beidou satellite navigation to establish a geographic information database, and accurately locates the starting point and end point of cycling through the Beidou satellite navigation system. In the geographic information database, based on the existing road information, a path planning strategy is used to find an optimal path from the starting point to the end point, and the planned cycling path is converted into an actual executable cycling route. When the environment changes, including road construction and weather changes, the cycling path is updated in real time, which can reduce the time of cyclists during cycling and improve cycling efficiency.
[0007] To achieve the above object, the present invention provides the following technical solutions:
[0008] The cycling path planning method based on Beidou satellite navigation includes the following specific steps:
[0009] Step S1: Using Beidou satellite navigation to establish a geographic information database;
[0010] Step S2: Accurately locate the starting point and end point of the ride through the Beidou satellite navigation system;
[0011] Step S3: In the geographic information database, based on the existing road information, use the path planning strategy to find an optimal path from the starting point to the end point;
[0012] Step S4: converting the planned cycling path into an actually executable cycling route;
[0013] Step S5: When the environment changes, including road construction and weather changes, the cycling route is updated in real time.
[0014] Specifically, the geographic information database in step S1 includes: the name, location, direction, width, limit and height of the road.
[0015] Specifically, the specific steps in step S3 are:
[0016] Step S301: According to the data of the geographic information database, a bicycle riding network directed graph model G is established, G = (V, E, g, h, l), wherein V represents a set of nodes, i.e., the starting and ending points in the bicycle riding network directed graph model, E represents a set of edges, i.e., the road sections in the bicycle riding network directed graph model, for v∈V, g represents the latitude and longitude values of the node v, h represents the altitude of the node v, and l is the length corresponding to each edge;
[0017] Step S302: The bicycle starts from the starting point i and searches for a path to the end point j. i, j∈V uses a path generation algorithm to generate N paths in total, iterates and selects the best path, and calculates the selection probability of each path;
[0018] Step S303: Obtain the optimal bicycle riding path through gradual iterations.
[0019] Specifically, the specific steps of step S302 are:
[0020] Step S3021: The calculation formula for the next node selection probability of starting point i is:
[0021]
[0022] Among them, P ij represents the probability of selecting the next node at starting point i, τ ij (t) represents the amount of information on the path network point (i, j), α represents the path information heuristic factor, and η ij (t) represents the expectation of transferring from the current path network point i to the path network point j, β represents the expectation heuristic factor, CB represents the road condition influence factor, and ald represents the effective path from the starting point i to the end point j;
[0023] Step S3022: The calculation formula of the road condition impact factor CB is:
[0024]
[0025] Among them, d ij represents the path from starting point i to end point j, l represents the unit path length, k represents the traffic light node on the path from starting point i to end point j, light(k) represents the total waiting time of the traffic light from starting point i to end point j, and f v represents the average riding speed, and N represents the number of one-way lanes.
[0026] Specifically, the step S302 further includes:
[0027] Step S3023: Calculate and select the riding time of the path. The calculation formula of the riding time of the path is:
[0028]
[0029] Among them, T(i,j) represents the riding time of the path, l(i,j) represents the length of the flat road and downhill section in the path, λ(i,j) represents the length of the uphill section in the path, λ1 represents the uphill penalty coefficient, r1(i,j) represents the characteristic attribute coefficient of the section, and s d ((i,j),s max ) represents the speed influence coefficient. When the road section is uphill or flat, s d ((i,j),s max )=1, when going downhill or on a flat road,
[0030]
[0031] s max Indicates the preset upper limit of the downhill acceleration multiplier, jd c represents the vertical descent angle critical value, jd(i,j) represents the actual vertical descent angle of the road section. c When the acceleration multiplier takes the upper limit value s max This reflects that in actual riding, the acceleration caused by a steep slope is faster than that caused by a gentle slope. At the same time, due to the physical limitations of the bicycle, air resistance, safety and other factors, the acceleration caused can only be within a limited range;
[0032] Step S3024: Select the optimal cycling route according to the cycling route probability and the route time.
[0033] The cycling route planning system based on Beidou satellite navigation includes: information database establishment module, starting point and end point positioning module, optimal route selection module, cycling route conversion module and cycling route real-time update module;
[0034] The information database establishment module is used to establish a geographic information database using Beidou satellite navigation;
[0035] The starting point and end point positioning modules are used to accurately locate the starting point and end point of the ride through the Beidou satellite navigation system;
[0036] The optimal path selection module is used to find an optimal path from the starting point to the end point in the geographic information database based on the existing road information and using a path planning strategy;
[0037] The cycling path conversion module is used to convert the planned cycling path into an actually executable cycling route;
[0038] The cycling route real-time updating module is used to update the cycling route in real time when the environment changes, including road construction and weather changes.
[0039] Specifically, the optimal path selection module includes a path node selection unit and a path time calculation unit;
[0040] The path node selection unit is used to calculate the probability of selecting the next node;
[0041] The path time calculation unit is used to calculate the riding time of the path.
[0042] An electronic device includes a memory and a processor, wherein the memory stores a computer program, and the processor implements the steps of a cycling path planning method based on Beidou satellite navigation when executing the computer program.
[0043] A computer-readable storage medium stores computer instructions, which, when executed, execute the steps of a cycling route planning method based on Beidou satellite navigation.
[0044] Compared with the prior art, the present invention has the following beneficial effects:
[0045] 1. The present invention proposes a cycling path planning system based on Beidou satellite navigation, and optimizes and improves the architecture, operation steps and processes. The system has the advantages of simple process, low investment and operation costs, and low production work cost.
[0046] 2. The present invention proposes a cycling path planning method based on Beidou satellite navigation, calculates the selection probability of the next node, selects N paths, and calculates the riding time of each path by considering the waiting time for traffic lights, uphill and downhill sections, and section speed limit factors in the cycling path, and selects sections with high node probability and short riding time for each path, thereby effectively saving riding time. BRIEF DESCRIPTION OF THE DRAWINGS
[0047] Figure 1 This is a flow chart of a cycling route planning method based on Beidou satellite navigation according to the present invention;
[0048] Figure 2 This is a diagram of the architecture of a cycling route planning system based on Beidou satellite navigation according to the present invention;
[0049] Figure 3 This is a diagram of an electronic device for a cycling path planning method based on Beidou satellite navigation according to the present invention. DETAILED DESCRIPTION
[0050] In order to make the technical means, creative features, objectives and effects achieved by the present invention easy to understand, in the description of the present invention, it should be noted that the terms "center", "up", "down", "left", "right", "vertical", "horizontal", "inside", "outside" and the like indicate the orientation or position relationship based on the orientation or position relationship shown in the accompanying drawings, which is only for the convenience of describing the present invention and simplifying the description, and does not indicate or imply that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore cannot be understood as a limitation on the present invention. In addition, the terms "No. 1", "No. 2" and "No. 3" are only used for descriptive purposes and cannot be understood as indicating or implying relative importance. The present invention is further explained below in conjunction with specific embodiments.
[0051] Example 1
[0052] See also Figure 1 , an embodiment provided by the present invention: a cycling path planning method based on Beidou satellite navigation, comprising the following specific steps:
[0053] Step S1: Using Beidou satellite navigation to establish a geographic information database;
[0054] Step S2: Accurately locate the starting point and end point of the ride through the Beidou satellite navigation system;
[0055] Step S3: In the geographic information database, based on the existing road information, use the path planning strategy to find an optimal path from the starting point to the end point;
[0056] Step S4: converting the planned cycling path into an actually executable cycling route;
[0057] Step S5: When the environment changes, including road construction and weather changes, the cycling route is updated in real time.
[0058] The geographic information database in step S1 includes: the name, location, direction, width, limit and height of the road.
[0059] The specific steps in step S3 are:
[0060] Step S301: According to the data of the geographic information database, a bicycle riding network directed graph model G is established, G = (V, E, g, h, l), wherein V represents a set of nodes, i.e., the starting and ending points in the bicycle riding network directed graph model, E represents a set of edges, i.e., the road sections in the bicycle riding network directed graph model, for v∈V, g represents the latitude and longitude values of the node v, h represents the altitude of the node v, and l is the length corresponding to each edge;
[0061] Step S302: The bicycle starts from the starting point i and searches for a path to the end point j. i, j∈V uses a path generation algorithm to generate N paths in total, iterates and selects the best path, and calculates the selection probability of each path;
[0062] Step S303: Obtain the optimal bicycle riding path through gradual iterations.
[0063] The specific steps of step S302 are:
[0064] Step S3021: The calculation formula for the next node selection probability of starting point i is:
[0065]
[0066] Among them, P ij represents the probability of selecting the next node at starting point i, τ ij (t) represents the amount of information on the path network point (i, j), α represents the path information heuristic factor, and η ij (t) represents the expectation of transferring from the current path network point i to the path network point j, β represents the expectation heuristic factor, CB represents the road condition influence factor, and ald represents the effective path from the starting point i to the end point j;
[0067] Step S3022: The calculation formula of the road condition impact factor CB is:
[0068]
[0069] Among them, d ij represents the path from starting point i to end point j, l represents the unit path length, k represents the traffic light node on the path from starting point i to end point j, light(k) represents the total waiting time of the traffic light from starting point i to end point j, and f v represents the average riding speed, and N represents the number of one-way lanes.
[0070] The steps of step S302 also include:
[0071] Step S3023: Calculate and select the riding time of the path. The calculation formula of the riding time of the path is:
[0072]
[0073] Among them, T(i,j) represents the riding time of the path, l(i,j) represents the length of the flat road and downhill section in the path, λ(i,j) represents the length of the uphill section in the path, λ1 represents the uphill penalty coefficient, r1(i,j) represents the characteristic attribute coefficient of the section, and s d ((i,j),s max ) represents the speed influence coefficient. When the road section is uphill or flat, sd ((i,j),s max )=1, when going downhill or on a flat road,
[0074]
[0075] s max Indicates the preset upper limit of the downhill acceleration multiplier, jd c represents the vertical descent angle critical value, jd(i,j) represents the actual vertical descent angle of the road section. c When the acceleration multiplier takes the upper limit value s max This reflects that in actual riding, the acceleration caused by a steep slope is faster than that caused by a gentle slope. At the same time, due to the physical limitations of the bicycle, air resistance, safety and other factors, the acceleration caused can only be within a limited range;
[0076] r1(i,j) reflects the influence of the characteristic attributes of the road section on the cycling speed. The characteristic attributes of the road section include surface material, road type, etc.
[0077] Step S3024: Select the optimal cycling route according to the cycling route probability and the route time.
[0078] Example 2
[0079] See also Figure 2 , another embodiment provided by the present invention: a cycling path planning system based on Beidou satellite navigation, comprising: an information database establishment module, a starting point and end point positioning module, an optimal path selection module, a cycling path conversion module and a cycling path real-time update module;
[0080] The information database establishment module is used to establish a geographic information database using Beidou satellite navigation;
[0081] The starting point and end point positioning modules are used to accurately locate the starting point and end point of the ride through the Beidou satellite navigation system;
[0082] The optimal path selection module is used to find an optimal path from the starting point to the end point in the geographic information database based on the existing road information and using a path planning strategy;
[0083] The cycling path conversion module is used to convert the planned cycling path into an actually executable cycling route;
[0084] The cycling route real-time updating module is used to update the cycling route in real time when the environment changes, including road construction and weather changes.
[0085] The optimal path selection module includes a path node selection unit and a path time calculation unit;
[0086] The path node selection unit is used to calculate the probability of selecting the next node;
[0087] The path time calculation unit is used to calculate the riding time of the path.
[0088] Example 3
[0089] See also Figure 3 , an electronic device includes a memory and a processor, the memory stores a computer program, and the processor implements the steps of a cycling path planning method based on Beidou satellite navigation when executing the computer program.
[0090] A computer-readable storage medium stores computer instructions, which, when executed, execute the steps of a cycling route planning method based on Beidou satellite navigation.
[0091] Those skilled in the art will appreciate that embodiments of the present invention may be provided as methods, systems, or computer program products. Therefore, the present invention may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.
[0092] The present invention is described with reference to flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.
[0093] These computer program instructions may also be stored in a computer readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer readable memory produce an article of manufacture including an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.
[0094] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.
[0095] The embodiments of the present invention are described above in conjunction with the accompanying drawings, but the present invention is not limited to the above-mentioned specific implementation methods. The above-mentioned specific implementation methods are merely illustrative and not restrictive. Under the enlightenment of the present invention, ordinary technicians in this field can also make many forms without departing from the scope of protection of the purpose of the present invention and the claims, which all fall within the protection of the present invention.
[0096] Finally: The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present invention should be included in the protection scope of the present invention.
Claims
1. A cycling path planning method based on Beidou satellite navigation, characterized in that: The specific steps include: Step S1: Using Beidou satellite navigation to establish a geographic information database; Step S2: Accurately locate the starting point and end point of the ride through the Beidou satellite navigation system; Step S3: In the geographic information database, based on the existing road information, use the path planning strategy to find an optimal path from the starting point to the end point; Step S4: converting the planned cycling path into an actually executable cycling route; Step S5: When the environment changes, including road construction and weather changes, the cycling route is updated in real time; The specific steps in step S3 are: Step S301: According to the data of the geographic information database, a bicycle riding network directed graph model G is established, G = (V, E, g, h, l), wherein V represents a set of nodes, i.e., the starting and ending points in the bicycle riding network directed graph model, E represents a set of edges, i.e., the road sections in the bicycle riding network directed graph model, for v∈V, g represents the latitude and longitude values of the node v, h represents the altitude of the node v, and l is the length corresponding to each edge; Step S302: The bicycle starts from the starting point i and searches for a path to the end point j. i, j∈V uses a path generation algorithm to generate N paths in total, iterates and selects the best path, and calculates the selection probability of each path; Step S303: obtaining the optimal bicycle riding path through step-by-step iteration; The specific steps of step S302 are: Step S3021: The calculation formula for the next node selection probability of starting point i is: Among them, P ij represents the probability of selecting the next node at starting point i, τ ij (t) represents the amount of information on the path network point (i, j), α represents the path information heuristic factor, and η ij (t) represents the expectation of transferring from the current path network point i to the path network point j, β represents the expectation heuristic factor, CB represents the road condition influence factor, and ald represents the effective path from the starting point i to the end point j; Step S3022: The calculation formula of the road condition impact factor CB is: Among them, d ij represents the path from starting point i to end point j, l represents the unit path length, k represents the traffic light node on the path from starting point i to end point j, light(k) represents the total waiting time of the traffic light from starting point i to end point j, and f v represents the average speed of riding, and N represents the number of one-way lanes; The steps of step S302 also include: Step S3023: Calculate and select the riding time of the path. The riding time calculation formula of the path is: Among them, T(i,j) represents the riding time of the path, l(i,j) represents the length of the flat road and downhill section in the path, λ(i,j) represents the length of the uphill section in the path, λ1 represents the uphill penalty coefficient, r1(i,j) represents the characteristic attribute coefficient of the section, and s d ((i,j),s max ) represents the speed influence coefficient. When the road section is uphill or flat, s d ((i,j),s max )=1, when going downhill or on a flat road, s max Indicates the preset upper limit of the downhill acceleration multiplier, jd c represents the vertical descent angle critical value, jd(i,j) represents the actual vertical descent angle of the road section. c When the acceleration multiplier takes the upper limit value s max ; Step S3024: Select the optimal cycling route according to the cycling route probability and the route time.
2. The cycling path planning method based on Beidou satellite navigation as claimed in claim 1, characterized in that: The geographic information database in step S1 includes: the name, location, direction, width, limit and height of the road.
3. A cycling path planning system based on Beidou satellite navigation, which is implemented based on the cycling path planning method based on Beidou satellite navigation according to any one of claims 1-2, characterized in that: include: Information database establishment module, starting point and end point positioning module, optimal path selection module, cycling path conversion module and cycling path real-time update module; The information database establishment module is used to establish a geographic information database using Beidou satellite navigation; The starting point and end point positioning modules are used to accurately locate the starting point and end point of the ride through the Beidou satellite navigation system; The optimal path selection module is used to find an optimal path from the starting point to the end point in the geographic information database based on the existing road information and using a path planning strategy; The cycling path conversion module is used to convert the planned cycling path into an actually executable cycling route; The cycling route real-time updating module is used to update the cycling route in real time when the environment changes, including road construction and weather changes.
4. The cycling route planning system based on Beidou satellite navigation as claimed in claim 3, characterized in that: The optimal path selection module includes a path node selection unit and a path time calculation unit; The path node selection unit is used to calculate the probability of selecting the next node; The path time calculation unit is used to calculate the riding time of the path.
5. An electronic device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the cycling path planning method based on Beidou satellite navigation described in any one of claims 1-2 are implemented.
6. A computer-readable storage medium, characterized in that: Computer instructions are stored thereon, and when the computer instructions are executed, the steps of the cycling path planning method based on Beidou satellite navigation described in any one of claims 1-2 are executed.
