CN118243132B - Dynamic path planning method based on Astar algorithm and non-zero and game - Google Patents
Dynamic path planning method based on Astar algorithm and non-zero and game Download PDFInfo
- Publication number
- CN118243132B CN118243132B CN202410666244.7A CN202410666244A CN118243132B CN 118243132 B CN118243132 B CN 118243132B CN 202410666244 A CN202410666244 A CN 202410666244A CN 118243132 B CN118243132 B CN 118243132B
- Authority
- CN
- China
- Prior art keywords
- road
- vehicle
- accident
- construction
- vehicles
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000013439 planning Methods 0.000 title claims abstract description 86
- 238000000034 method Methods 0.000 title claims abstract description 62
- 238000004422 calculation algorithm Methods 0.000 title claims abstract description 32
- 230000008901 benefit Effects 0.000 claims abstract description 7
- 238000010276 construction Methods 0.000 claims description 88
- 230000008569 process Effects 0.000 claims description 27
- 230000008439 repair process Effects 0.000 claims description 21
- 238000004364 calculation method Methods 0.000 claims description 7
- 241000287196 Asthenes Species 0.000 claims description 3
- 230000000977 initiatory effect Effects 0.000 claims description 3
- 230000006870 function Effects 0.000 description 10
- 238000012546 transfer Methods 0.000 description 6
- 230000005540 biological transmission Effects 0.000 description 5
- 206010039203 Road traffic accident Diseases 0.000 description 4
- 238000007726 management method Methods 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 230000007547 defect Effects 0.000 description 2
- 238000012544 monitoring process Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 230000003111 delayed effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 230000008447 perception Effects 0.000 description 1
- 238000010223 real-time analysis Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000007619 statistical method Methods 0.000 description 1
- 238000012384 transportation and delivery Methods 0.000 description 1
Landscapes
- Traffic Control Systems (AREA)
Abstract
The invention belongs to the technical field of path planning, and particularly relates to a dynamic path planning method based on an Astar algorithm and non-zero and game, which comprises the following steps: constructing a path planning framework comprising an unmanned plane, a vehicle, an intelligent road side terminal RSU and a core controller; the method comprises the steps that a core controller receives a path planning request from a vehicle; performing path planning by using an Astar algorithm based on the planning factor; the core controller transmits the roads with the occurrence condition to all vehicles, and after the vehicles receive the information, the vehicles detect own driving paths, and if the roads with the occurrence condition are included, a re-path planning request is returned to the core controller; forming a game model by all vehicles returning to the re-path planning request, and returning a new recommended driving path to the vehicles according to non-zero and games; and (5) finishing path planning. The invention can realize reasonable utilization of accident road sections, realize vehicle diversion, maximize vehicle group benefit, reasonably drive, ensure driving safety and reduce the congestion of travel vehicles.
Description
Technical Field
The invention belongs to the technical field of path planning, and particularly relates to a dynamic path planning method based on an Astar algorithm and non-zero and game.
Background
In recent years, as road vehicles continue to increase, traffic congestion is frequently occurring, and many researchers have begun to study solutions to cope with the increased traffic congestion. The partial road planning algorithm at the present stage is quite excellent, can show better performance, for example, the method of acquiring the residual duration of the traffic light, synchronizing the road congestion situation and the like through networking is adopted, a more reasonable driving path is planned, the travel time is estimated, and the perception and avoidance of the road emergency are lacking.
The path planning algorithm is an algorithm for finding an optimal path from a start point to an end point, and is widely used in various fields such as transportation, logistics, robot navigation, and the like. The optimal path is determined by considering the cost or weight of the different paths in order to maximize efficiency or minimize cost under certain conditions.
In the application process of path planning, the intelligent road side terminal RSU (Road Side Unit) is a device deployed on the road edge or traffic facilities, and can collect and process traffic data, including information such as road flow, congestion, traffic accidents, vehicle speed, etc., and perform real-time analysis and processing to generate traffic reports and statistical analysis results, thereby providing decision support for traffic management and planning. In the event of a traffic accident or emergency, the RSU may send emergency service information to the vehicle. Unmanned UAVs (Unmanned AERIAL VEHICLE) are diverse in functions and high in creativity, can perform flight tasks without being controlled by people, and can complete various tasks such as monitoring, reconnaissance, cargo transportation and the like through preset airlines, remote controllers or autonomous flight. The present stage is also used in road safety, traffic monitoring and highway infrastructure management.
The defects and shortcomings of the existing path planning algorithm are mainly: the path planning algorithm at the present stage is mostly static, namely, the optimal running path is returned only once by designating the shortest time or the shortest path; the road planning algorithm is based on the shortest time or the shortest path, and can lead the vehicle to intensively drive to the optimal road section, so that the road of the optimal road section is jammed; the information transmission of the vehicle is delayed in the running process, so that potential safety hazards exist; in the downtown area where traffic flow and people flow are geometrically multiplied, if traffic accidents occur, the path planning system cannot synchronize information in real time, and the information delay can lead vehicles to drive to the accident road section according to the original plan, so that the accident road section and the nearby road sections are jammed.
Disclosure of Invention
According to the defects in the prior art, the invention aims to provide the dynamic path planning method based on the Astar algorithm and the non-zero and game, so that reasonable utilization of an accident road section can be realized, vehicle diversion is realized, the benefit of a vehicle group is maximized, vehicles can reasonably run, driving safety is ensured, and the congestion of the traveling vehicles is reduced.
In order to achieve the above object, the present invention provides a dynamic path planning method based on Astar algorithm and non-zero and game, comprising the following steps:
S1, constructing a path planning framework comprising an unmanned plane, a vehicle, an intelligent road side terminal (RSU) and a core controller (a well-known core controller is adopted), wherein:
the unmanned aerial vehicle is used for supervising road conditions, and when the unmanned aerial vehicle is used for observing the road conditions, the unmanned aerial vehicle immediately returns road information to the core controller;
when the road where the vehicle is located changes in the running process, the vehicle returns the information to the core controller;
The RSU is deployed on each road and used for calculating the planning factor of the road;
Dividing the received position information corresponding to each piece of information into each piece of road by the core controller, calculating and summarizing the accident scale, construction scale and vehicle area of each piece of road, issuing the accident scale, construction scale and vehicle area to the RSU of the corresponding road, and calculating the planning factor of each piece of road by the RSU;
Establishing a Cartesian coordinate system for the region where all roads are located, wherein i represents a horizontal axis and j represents a vertical axis;
s2, the core controller receives a path planning request from a vehicle, wherein the request comprises a starting position and an ending position;
S3, using an Astar algorithm, planning a path by using the Astar algorithm based on a planning factor, and returning a recommended driving path to the vehicle; here, a well-known Astar algorithm (a commonly used path searching and graph traversing algorithm) is adopted for path planning;
S4, the core controller receives the road condition from the unmanned aerial vehicle in real time, the road with the condition is issued to all vehicles, after the vehicles receive the information, the vehicles detect own driving paths, and if the road with the condition is included, a re-path planning request including the current position and the end position is returned to the core controller; otherwise, continuing running according to the original recommended running path is ignored;
S5, after waiting for a unit time, forming a game model by all vehicles returning to the re-path planning request, wherein in the game model, game participants are n vehicles requesting re-path planning, a strategy set is a set of recommended driving paths returned to each participant by a core controller, and a new recommended driving path is returned to the vehicles according to non-zero and games;
S6, the vehicle reaches the end position, and the path planning is finished.
In the step S1, the road condition includes accident and road repair, wherein:
When the unmanned aerial vehicle finds an accident, the unmanned aerial vehicle returns to the accident position to the core controller And accident-related vehicle quantityThen focusing on the position point of the accident, returning information to the core controller after the accident handling is finished, and deleting the accident information by the core controller;
When the unmanned aerial vehicle finds the road repair condition, the unmanned aerial vehicle returns to the core controller to construct signals and returns to the construction starting point by observing the construction fence Construction end pointRoad width occupied by constructionAnd after receiving the construction information, the core controller judges the construction influence.
When the unmanned plane discovers the accident, the accident scale is returned to the core controllerIt is defined as:
（1）；
Wherein S is the projection area of the accident vehicle;
When the unmanned aerial vehicle finds the road repair condition, the mode for judging the construction influence is as follows:
Setting up To construct the width of the road,Is a small vehicle width,Is the width of a medium-sized vehicle,For large vehicle width, ifMarking the road as non-walkable for the full-size vehicle; if it isMarking the road as non-walkable for medium and large vehicles; if it isMarking the road as non-walkable for large vehicles; if it isCalculating the construction scaleConstruction scale of construction initiation road sectionAnd the construction scale of the construction ending road sectionThe calculation formulas are respectively as follows:
（2）；
（3）；
（4）；
wherein k is the number of inflection points in the construction range, To construct the 1 st inflection point coordinates from the start point of construction in the range,To the last inflection point coordinates from the construction start point within the construction range,To construct the range of coordinates of the u-th inflection point from the construction start point,The u+1st inflection point coordinates from the construction start point in the construction range.
In the step S1, the step C,、、The values are respectively 1.75, 1.9 and 2.5, wherein, for vehicles with the width of more than or equal to 1.6 meters and less than or equal to 1.75 meters, the vehicles are set as small-sized vehicles; for a vehicle having a width of more than 1.75 meters and less than 2.5 meters, it is set as a medium-sized vehicle; for vehicles having a width of 2.5 meters or more and 3 meters or less, a large vehicle is set. The section is a width range set based on GB1589-2016 automobile, trailer and train overall size, axle load and mass limit values, and is set for simplifying calculation、、Is a value of (a).
In the step S1, the self information includes the self position of the vehicleArea of projection of itself。
In the step S1, the accident scale of each road is set asThe construction scale isThe projection area of the running vehicle isExpressed as:
（5）；
（6）；
（7）；
In the method, in the process of the invention, Is the road center point (here representing the center point of a certain road),To take the following measuresA set of all points on the road that is the center point,To take the following measuresIs an accident point on the road at the center point,Representing the accident scale of each accident point on the road; To take the following measures A repair point on the road that is the center point,Representing the construction scale of each road repairing point on the road; To take the following measures Is the vehicle position on the road at the center point,Representing the projected area of each traveling vehicle on the road; n 1、n2、n3 are respectivelyThe number of accident points, the number of repair points and the number of running vehicles on the road which is the center point.
In the step S1, the calculation mode of the planning factor is as follows:
For the road where the accident occurs:
（8）；
for the road being constructed:
（9）；
for roads where accidents occur and are being constructed:
（10）；
In the method, in the process of the invention, To take the following measuresIs the planning factor for the road at the center point,To take the following measuresThe total area of the road being the center point,Is a coefficient and the sum is 1.
In S1, for the whole construction section, accident points and traveling vehicles (mainly for construction vehicles and the like) are also involved, and the planning factor is expressed as follows:
（11）；
Wherein:
（12）；
（13）；
（14）；
In the method, in the process of the invention, To take the following measuresIs the planning factor for the road at the center point,Is the total area of the construction section; In order to construct the center point of the road section, To take the following measuresA set of all points on the road that is a center point; To take the following measures An accident point on the construction section which is the center point,Representing the accident scale of each accident point on the road; To take the following measures A repair point on the construction section that is the center point,Representing the construction scale of each road repairing point on the road; To take the following measures Is the vehicle location on the construction section of the center point,Representing the projected area of each traveling vehicle on the road; n 4、n5、n6 are respectivelyThe number of accident points, the number of repair points and the number of running vehicles on the road which is the center point.
In the step S5, the process of returning the new recommended driving path to the vehicle according to the non-zero game is as follows:
s51, regarding the strategy set, the strategy set of the 1 st vehicle is expressed as The policy set for the d-th vehicle is expressed asThe total policy set is expressed as；
S52, the overall benefit function of the game model is expressed as:
（15）；
In the method, in the process of the invention, Representing the travel time of each vehicle;
S53, expressing a congestion model of the game model as:
（16）；
In the method, in the process of the invention, Is the congestion index at time t,Is the traffic speed at the time t,Is the traffic speed at time t-1,Is the maximum allowable speed at which the vehicle will be traveling,Is the traffic density at the time t,Is the traffic density at time t-1,Is the maximum allowable density of the material to be processed,Is the occurrence of an accident at the time t,Other influencing factors at time t (e.g., weather conditions, peaks early and late, traffic management conditions, etc.),Is the weight coefficient of the traffic speed at the moment t,Is the weight coefficient of the traffic speed at the time t-1,Is the weight coefficient of the traffic density at the time t,Is the weight coefficient of the traffic density at the time t-1,The weight coefficient of the influence function of the traffic density at the time t,The weight coefficient of the influence function of the traffic density at the time t-1,Is the weight coefficient of the accident situation at the moment t,The weight coefficient of other influencing factors at the moment t;
in the game model, the decision of each vehicle can be represented by minimizing the own travel time, assuming that the travel path selected by the vehicle y is While the travel paths selected by other vehicles are gathered asThen the optimal decision for vehicle y is expressed as:
（17）；
In the method, in the process of the invention, Representing a given other vehicle travel path selectionIn the case of (2), the travel time of the vehicle y is calculated by the congestion model; argmin is expressed such thatMinimized travel path selection.
The algorithm according to the present invention may be executed by an electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the algorithm being implemented by the processor executing software.
The invention has the beneficial effects that:
the invention carries out global planning control through the core controller, transmits traffic accident information through the deployment RSU, collects and transmits road information, and simultaneously utilizes the computing capacity to allocate and calculate to calculate planning factors; the design of the planning factors can enable vehicles to be scattered on the road, reasonable shunting of the vehicles is achieved, and centralized selection of the optimal road sections is avoided.
According to the invention, the UAVs are selected to monitor and synchronize accident information and road conditions, and the UAVs are used to monitor roads, so that the time for synchronizing the accident information is shortened, and the traffic jam caused by accident information delay is further shortened.
According to the invention, the non-zero and game models are designed when the vehicle group re-plans the paths, so that the path combination benefits of the vehicles are optimal, mutually coordinated and stable, each vehicle is ensured to obtain a reasonable path, the loss is reduced, and the efficiency is improved. Reasonable utilization of accident road sections is realized through a game model, vehicle diversion is realized, and vehicle group benefits are maximized; through integral cooperative operation, reasonable running of the vehicle is realized, running safety is guaranteed, and congestion of the traveling vehicle is reduced.
Drawings
FIG. 1 is a flow schematic of the present invention;
Fig. 2 is a schematic diagram of a path planning framework according to an embodiment of the present invention.
Detailed Description
Embodiments of the invention are further described below with reference to the accompanying drawings:
as shown in fig. 1, the dynamic path planning method based on the Astar algorithm and the non-zero and game comprises the following steps:
s1, constructing a path planning framework comprising an unmanned plane, a vehicle, an intelligent road side terminal RSU and a core controller, wherein:
the unmanned aerial vehicle is used for supervising road conditions, and when the unmanned aerial vehicle is used for observing the road conditions, the unmanned aerial vehicle immediately returns road information to the core controller;
when the road where the vehicle is located changes in the running process, the vehicle returns the information to the core controller;
The RSU is deployed on each road and used for calculating the planning factor of the road;
Dividing the received position information corresponding to each piece of information into each piece of road by the core controller, calculating and summarizing the accident scale, construction scale and vehicle area of each piece of road, issuing the accident scale, construction scale and vehicle area to the RSU of the corresponding road, and calculating the planning factor of each piece of road by the RSU;
Establishing a Cartesian coordinate system for the region where all roads are located, wherein i represents a horizontal axis and j represents a vertical axis;
s2, the core controller receives a path planning request from a vehicle, wherein the request comprises a starting position and an ending position;
S3, using an Astar algorithm, planning a path by using the Astar algorithm based on a planning factor, and returning a recommended driving path to the vehicle;
S4, the core controller receives the road condition from the unmanned aerial vehicle in real time, the road with the condition is issued to all vehicles, after the vehicles receive the information, the vehicles detect own driving paths, and if the road with the condition is included, a re-path planning request including the current position and the end position is returned to the core controller; otherwise, continuing running according to the original recommended running path is ignored;
S5, after waiting for a unit time, forming a game model by all vehicles returning to the re-path planning request, wherein in the game model, game participants are n vehicles requesting re-path planning, a strategy set is a set of recommended driving paths returned to each participant by a core controller, and a new recommended driving path is returned to the vehicles according to non-zero and games;
S6, the vehicle reaches the end position, and the path planning is finished.
In the embodiment, the core controller is used as a processing center of the whole path planning framework to macroscopically regulate and control the whole scene, so that the normal running of the vehicle is ensured, and the trip safety is ensured.
The information transmission modes in the path planning framework are divided into:
Class I: information transfer between the RSU and the core controller;
class II: information transfer between UAV (unmanned aerial vehicle) and RSU;
Class III: information transfer between the RSU and the vehicle;
class IV: information transfer between the UAV and the vehicle;
class V: information transfer from vehicle to vehicle.
Information from the UAV is passed to the core controller through the RSU. The information generated by the vehicle is preferentially selected to be transmitted by the RSU; when the distance between the UAV and the RSU is far and does not meet the transmission condition, the information is transmitted to the UAV, and then transmitted to the RSU and then transmitted to the core controller; when the distance between the vehicle and the RSU and the UAV is far, the information can be transmitted among the vehicle groups until the intermediate transmission vehicle meets the two transmission modes, and the information is transmitted to the core controller.
The core controller functions include: is responsible for maintaining road topology information, including the positions of RSUs, UAVs and vehicles and the transfer relationship between them; receiving various information from the RSU, the UAV and the vehicle, and processing accident information; and responding and processing the path planning request, including initial path planning and building a game model during path planning again.
Fig. 2 shows a simplified path planning framework, with different linearities indicating the way of information delivery, and a simplified road model, comprising a UAV and an RSU, the core controller implementing, in addition to the main path planning functions, the functions of maintaining road topology information and ensuring road safety.
In S1, the road condition includes an accident and a road repair situation, where:
When the unmanned aerial vehicle finds an accident, the unmanned aerial vehicle returns to the accident position to the core controller And accident-related vehicle quantityThen focusing on the position point of the accident, returning information to the core controller after the accident handling is finished, and deleting the accident information by the core controller;
When the unmanned aerial vehicle finds the road repair condition, the unmanned aerial vehicle returns to the core controller to construct signals and returns to the construction starting point by observing the construction fence Construction end pointRoad width occupied by constructionAnd after receiving the construction information, the core controller judges the construction influence.
When the unmanned plane discovers the accident, the accident scale is returned to the core controllerIt is defined as:
（1）；
Wherein S is the projection area of the accident vehicle;
When the unmanned aerial vehicle finds the road repair condition, the mode for judging the construction influence is as follows:
Setting up To construct the width of the road,Is a small vehicle width,Is the width of a medium-sized vehicle,For large vehicle width, ifMarking the road as non-walkable for the full-size vehicle; if it isMarking the road as non-walkable for medium and large vehicles; if it isMarking the road as non-walkable for large vehicles; if it isCalculating the construction scaleConstruction scale of construction initiation road sectionAnd the construction scale of the construction ending road sectionThe calculation formulas are respectively as follows:
（2）；
（3）；
（4）；
wherein k is the number of inflection points in the construction range, To construct the 1 st inflection point coordinates from the start point of construction in the range,To the last inflection point coordinates from the construction start point within the construction range,To construct the range of coordinates of the u-th inflection point from the construction start point,The u+1st inflection point coordinates from the construction start point in the construction range.
In the step S1, the step of,、、The values are respectively 1.75, 1.9 and 2.5, wherein, for vehicles with the width of more than or equal to 1.6 meters and less than or equal to 1.75 meters, the vehicles are set as small-sized vehicles; for a vehicle having a width of more than 1.75 meters and less than 2.5 meters, it is set as a medium-sized vehicle; for vehicles having a width of 2.5 meters or more and 3 meters or less, a large vehicle is set.
In S1, the self information includes the self position of the vehicleArea of projection of itself。
S1, setting the accident scale of each road asThe construction scale isThe projection area of the running vehicle isExpressed as:
（5）；
（6）；
（7）；
In the method, in the process of the invention, As the center point of the road, the road is provided with a plurality of points,To take the following measuresA set of all points on the road that is the center point,To take the following measuresIs an accident point on the road at the center point,Representing the accident scale of each accident point on the road; To take the following measures A repair point on the road that is the center point,Representing the construction scale of each road repairing point on the road; To take the following measures Is the vehicle position on the road at the center point,Representing the projected area of each traveling vehicle on the road; n 1、n2、n3 are respectivelyThe number of accident points, the number of repair points and the number of running vehicles on the road which is the center point.
In S1, the calculation mode of the planning factor is as follows:
For the road where the accident occurs:
（8）；
for the road being constructed:
（9）；
for roads where accidents occur and are being constructed:
（10）；
In the method, in the process of the invention, To take the following measuresIs the planning factor for the road at the center point,To take the following measuresThe total area of the road being the center point,Is a coefficient and the sum is 1.
In S1, for the whole construction section, accident points and running vehicles are also involved, and the planning factor is expressed as follows:
（11）；
Wherein:
（12）；
（13）；
（14）；
In the method, in the process of the invention, To take the following measuresIs the planning factor for the road at the center point,Is the total area of the construction section; In order to construct the center point of the road section, To take the following measuresA set of all points on the road that is a center point; To take the following measures An accident point on the construction section which is the center point,Representing the accident scale of each accident point on the road; To take the following measures A repair point on the construction section that is the center point,Representing the construction scale of each road repairing point on the road; To take the following measures Is the vehicle location on the construction section of the center point,Representing the projected area of each traveling vehicle on the road; n 4、n5、n6 are respectivelyThe number of accident points, the number of repair points and the number of running vehicles on the road which is the center point.
In S5, according to the non-zero game and the game, the process of returning a new recommended driving path to the vehicle is as follows:
s51, regarding the strategy set, the strategy set of the 1 st vehicle is expressed as The policy set for the d-th vehicle is expressed asThe total policy set is expressed as；
S52, the overall benefit function of the game model is expressed as:
（15）；
In the method, in the process of the invention, Representing the travel time of each vehicle;
S53, expressing a congestion model of the game model as:
（16）；
In the method, in the process of the invention, Is the congestion index at time t,Is the traffic speed at the time t,Is the traffic speed at time t-1,Is the maximum allowable speed at which the vehicle will be traveling,Is the traffic density at the time t,Is the traffic density at time t-1,Is the maximum allowable density of the material to be processed,Is the occurrence of an accident at the time t,Is a further influencing factor at the instant t,Is the weight coefficient of the traffic speed at the moment t,Is the weight coefficient of the traffic speed at the time t-1,Is the weight coefficient of the traffic density at the time t,Is the weight coefficient of the traffic density at the time t-1,The weight coefficient of the influence function of the traffic density at the time t,The weight coefficient of the influence function of the traffic density at the time t-1,Is the weight coefficient of the accident situation at the moment t,The weight coefficient of other influencing factors at the moment t;
in the game model, the decision of each vehicle can be represented by minimizing the own travel time, assuming that the travel path selected by the vehicle y is While the travel paths selected by other vehicles are gathered asThen the optimal decision for vehicle y is expressed as:
（17）；
In the method, in the process of the invention, Representing a given other vehicle travel path selectionIn the case of (2), the travel time of the vehicle y is calculated by the congestion model; argmin is expressed such thatMinimized travel path selection.
Claims (8)
1. The dynamic path planning method based on the Astar algorithm and the non-zero and game is characterized by comprising the following steps:
s1, constructing a path planning framework comprising an unmanned plane, a vehicle, an intelligent road side terminal RSU and a core controller, wherein:
the unmanned aerial vehicle is used for supervising road conditions, and when the unmanned aerial vehicle is used for observing the road conditions, the unmanned aerial vehicle immediately returns road information to the core controller;
when the road where the vehicle is located changes in the running process, the vehicle returns the information to the core controller;
The RSU is deployed on each road and used for calculating the planning factor of the road;
Dividing the received position information corresponding to each piece of information into each piece of road by the core controller, calculating and summarizing the accident scale, construction scale and vehicle area of each piece of road, issuing the accident scale, construction scale and vehicle area to the RSU of the corresponding road, and calculating the planning factor of each piece of road by the RSU;
Establishing a Cartesian coordinate system for the region where all roads are located, wherein i represents a horizontal axis and j represents a vertical axis;
s2, the core controller receives a path planning request from a vehicle, wherein the request comprises a starting position and an ending position;
S3, using an Astar algorithm, planning a path by using the Astar algorithm based on a planning factor, and returning a recommended driving path to the vehicle;
S4, the core controller receives the road condition from the unmanned aerial vehicle in real time, the road with the condition is issued to all vehicles, after the vehicles receive the information, the vehicles detect own driving paths, and if the road with the condition is included, a re-path planning request including the current position and the end position is returned to the core controller; otherwise, continuing running according to the original recommended running path is ignored;
S5, after waiting for a unit time, forming a game model by all vehicles returning to the re-path planning request, wherein in the game model, game participants are n vehicles requesting re-path planning, a strategy set is a set of recommended driving paths returned to each participant by a core controller, and a new recommended driving path is returned to the vehicles according to non-zero and games;
s6, the vehicle reaches the end position, and path planning is finished;
In the step S5, the process of returning the new recommended driving path to the vehicle according to the non-zero game is as follows:
s51, regarding the strategy set, the strategy set of the 1 st vehicle is expressed as The policy set for the d-th vehicle is expressed asThe total policy set is expressed as；
S52, the overall benefit function of the game model is expressed as:
（15）；
In the method, in the process of the invention, Representing the travel time of each vehicle;
S53, expressing a congestion model of the game model as:
（16）；
In the method, in the process of the invention, Is the congestion index at time t,Is the traffic speed at the time t,Is the traffic speed at time t-1,Is the maximum allowable speed at which the vehicle will be traveling,Is the traffic density at the time t,Is the traffic density at time t-1,Is the maximum allowable density of the material to be processed,Is the occurrence of an accident at the time t,Is a further influencing factor at the instant t,Is the weight coefficient of the traffic speed at the moment t,Is the weight coefficient of the traffic speed at the time t-1,Is the weight coefficient of the traffic density at the time t,Is the weight coefficient of the traffic density at the time t-1,The weight coefficient of the influence function of the traffic density at the time t,The weight coefficient of the influence function of the traffic density at the time t-1,Is the weight coefficient of the accident situation at the moment t,The weight coefficient of other influencing factors at the moment t;
in the game model, the decision of each vehicle can be represented by minimizing the own travel time, assuming that the travel path selected by the vehicle y is While the travel paths selected by other vehicles are gathered asThen the optimal decision for vehicle y is expressed as:
（17）；
In the method, in the process of the invention, Representing a given other vehicle travel path selectionIn the case of (2), the travel time of the vehicle y is calculated by the congestion model; argmin is expressed such thatMinimized travel path selection.
2. The Astar algorithm and non-zero and game based dynamic path planning method according to claim 1, characterized in that: in the step S1, the road condition includes accident and road repair, wherein:
When the unmanned aerial vehicle finds an accident, the unmanned aerial vehicle returns to the accident position to the core controller And accident-related vehicle quantityThen focusing on the position point of the accident, returning information to the core controller after the accident handling is finished, and deleting the accident information by the core controller;
When the unmanned aerial vehicle finds the road repair condition, the unmanned aerial vehicle returns to the core controller to construct signals and returns to the construction starting point by observing the construction fence Construction end pointRoad width occupied by constructionAnd after receiving the construction information, the core controller judges the construction influence.
3. The Astar algorithm and non-zero and game based dynamic path planning method according to claim 2, characterized in that: when the unmanned plane discovers the accident, the accident scale is returned to the core controllerIt is defined as:
（1）；
Wherein S is the projection area of the accident vehicle;
When the unmanned aerial vehicle finds the road repair condition, the mode for judging the construction influence is as follows:
Setting up To construct the width of the road,Is a small vehicle width,Is the width of a medium-sized vehicle,For large vehicle width, ifMarking the road as non-walkable for the full-size vehicle; if it isMarking the road as non-walkable for medium and large vehicles; if it isMarking the road as non-walkable for large vehicles; if it isCalculating the construction scaleConstruction scale of construction initiation road sectionAnd the construction scale of the construction ending road sectionThe calculation formulas are respectively as follows:
（2）；
（3）；
（4）；
wherein k is the number of inflection points in the construction range, To construct the 1 st inflection point coordinates from the start point of construction in the range,To the last inflection point coordinates from the construction start point within the construction range,To construct the range of coordinates of the u-th inflection point from the construction start point,The u+1st inflection point coordinates from the construction start point in the construction range.
4. A dynamic path planning method based on the Astar algorithm and the non-zero and game according to claim 3, characterized in that: in the step S1, the step C,、、The values are respectively 1.75, 1.9 and 2.5, wherein, for vehicles with the width of more than or equal to 1.6 meters and less than or equal to 1.75 meters, the vehicles are set as small-sized vehicles; for a vehicle having a width of more than 1.75 meters and less than 2.5 meters, it is set as a medium-sized vehicle; for vehicles having a width of 2.5 meters or more and 3 meters or less, a large vehicle is set.
5. A dynamic path planning method based on the Astar algorithm and the non-zero and game according to claim 3, characterized in that: in the step S1, the self information includes the self position of the vehicleArea of projection of itself。
6. The Astar algorithm and non-zero and game based dynamic path planning method according to claim 5, characterized in that: in the step S1, the accident scale of each road is set asThe construction scale isThe projection area of the running vehicle isExpressed as:
（5）；
（6）；
（7）；
In the method, in the process of the invention, As the center point of the road, the road is provided with a plurality of points,To take the following measuresA set of all points on the road that is the center point,To take the following measuresIs an accident point on the road at the center point,Representing the accident scale of each accident point on the road; To take the following measures A repair point on the road that is the center point,Representing the construction scale of each road repairing point on the road; To take the following measures Is the vehicle position on the road at the center point,Representing the projected area of each traveling vehicle on the road; n 1、n2、n3 are respectivelyThe number of accident points, the number of repair points and the number of running vehicles on the road which is the center point.
7. The Astar algorithm and non-zero and game based dynamic path planning method according to claim 6, characterized in that: in the step S1, the calculation mode of the planning factor is as follows:
For the road where the accident occurs:
（8）；
for the road being constructed:
（9）；
for roads where accidents occur and are being constructed:
（10）；
In the method, in the process of the invention, To take the following measuresIs the planning factor for the road at the center point,To take the following measuresThe total area of the road being the center point,Is a coefficient and the sum is 1.
8. The Astar algorithm and non-zero and game based dynamic path planning method of claim 7, wherein: in the step S1, for the whole construction section, accident points and running vehicles are also involved, and the planning factors are expressed as follows:
（11）；
Wherein:
（12）；
（13）；
（14）；
In the method, in the process of the invention, To take the following measuresIs the planning factor for the road at the center point,Is the total area of the construction section; In order to construct the center point of the road section, To take the following measuresA set of all points on the road that is a center point; To take the following measures An accident point on the construction section which is the center point,Representing the accident scale of each accident point on the road; To take the following measures A repair point on the construction section that is the center point,Representing the construction scale of each road repairing point on the road; To take the following measures Is the vehicle location on the construction section of the center point,Representing the projected area of each traveling vehicle on the road; n 4、n5、n6 are respectivelyThe number of accident points, the number of repair points and the number of running vehicles on the road which is the center point.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410666244.7A CN118243132B (en) | 2024-05-28 | 2024-05-28 | Dynamic path planning method based on Astar algorithm and non-zero and game |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410666244.7A CN118243132B (en) | 2024-05-28 | 2024-05-28 | Dynamic path planning method based on Astar algorithm and non-zero and game |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN118243132A CN118243132A (en) | 2024-06-25 |
| CN118243132B true CN118243132B (en) | 2024-07-19 |
Family
ID=91556797
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410666244.7A Active CN118243132B (en) | 2024-05-28 | 2024-05-28 | Dynamic path planning method based on Astar algorithm and non-zero and game |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN118243132B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115877871A (en) * | 2023-03-03 | 2023-03-31 | 北京航空航天大学 | Non-zero and game unmanned aerial vehicle formation control method based on reinforcement learning |
| CN116736885A (en) * | 2023-06-15 | 2023-09-12 | 西北工业大学 | Spacecraft guard control method based on zero and differential countermeasures |
Family Cites Families (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7942731B2 (en) * | 2000-05-04 | 2011-05-17 | Igt | Method and apparatus for facilitating game play with a mortgaging option |
| US11372416B2 (en) * | 2017-03-01 | 2022-06-28 | Mobileye Vision Technologies Ltd. | Systems and methods for navigating with sensing uncertainty |
| US11077845B2 (en) * | 2018-03-20 | 2021-08-03 | Mobileye Vision Technologies Ltd. | Systems and methods for navigating a vehicle |
| CN110826192B (en) * | 2019-10-15 | 2024-02-13 | 南京航空航天大学 | Nash negotiation criterion-based man-car cooperation game control method |
| EP3938961A1 (en) * | 2020-06-04 | 2022-01-19 | Huawei Technologies Co., Ltd. | A non-zero-sum game system framework with tractable nash equilibrium solution |
| CN113094857B (en) * | 2021-04-14 | 2024-04-05 | 沈阳航空航天大学 | Controller layout method of energy-saving software-defined vehicle network |
| CN113973362B (en) * | 2021-10-08 | 2024-03-22 | 天津大学 | Reinforced learning non-zero and non-cooperative multi-agent safety communication power control method |
| CN115309047A (en) * | 2022-07-29 | 2022-11-08 | 天津大学 | Event trigger-based multi-controller system stable control method |
| CN115285147A (en) * | 2022-08-31 | 2022-11-04 | 北京百度网讯科技有限公司 | Unmanned vehicle driving decision method and device and unmanned vehicle |
| CN117235957A (en) * | 2023-04-28 | 2023-12-15 | 中国人民解放军军事科学院战争研究院 | Strategic game stage network diagram construction method, strategic game stage network diagram construction device and storage medium |
-
2024
- 2024-05-28 CN CN202410666244.7A patent/CN118243132B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115877871A (en) * | 2023-03-03 | 2023-03-31 | 北京航空航天大学 | Non-zero and game unmanned aerial vehicle formation control method based on reinforcement learning |
| CN116736885A (en) * | 2023-06-15 | 2023-09-12 | 西北工业大学 | Spacecraft guard control method based on zero and differential countermeasures |
Also Published As
| Publication number | Publication date |
|---|---|
| CN118243132A (en) | 2024-06-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2021136130A1 (en) | Trajectory planning method and apparatus | |
| US20210262808A1 (en) | Obstacle avoidance method and apparatus | |
| CN107507430B (en) | Urban intersection traffic control method and system | |
| EP3646304B1 (en) | Method and system for distributing the costs among platooning vehicles based on collected sensor data | |
| WO2021008605A1 (en) | Method and device for determining vehicle speed | |
| CN112700639B (en) | Intelligent traffic path planning method based on federal learning and digital twins | |
| WO2021147748A1 (en) | Self-driving method and related device | |
| CN108292474A (en) | Send and safeguard the coordination of the fleet of autonomous vehicle | |
| CN110379193A (en) | The conduct programming method and conduct programming device of automatic driving vehicle | |
| US20220080972A1 (en) | Autonomous lane change method and apparatus, and storage medium | |
| US20210350046A1 (en) | Systems and Methods for Simulating Aircraft Systems | |
| US20220215639A1 (en) | Data Presentation Method and Terminal Device | |
| WO2022142839A1 (en) | Image processing method and apparatus, and intelligent vehicle | |
| EP3933439A1 (en) | Localization method and localization device | |
| WO2022156309A1 (en) | Trajectory prediction method and apparatus, and map | |
| CN114326608B (en) | AGV group system based on multiple agents | |
| CN109816978B (en) | Regional group traffic guidance system and method considering dynamic response behaviors of drivers | |
| WO2022062825A1 (en) | Vehicle control method, device, and vehicle | |
| EP4134769A1 (en) | Method and apparatus for vehicle to pass through boom barrier | |
| US20240092385A1 (en) | Driving Policy Determining Method and Apparatus, Device, and Vehicle | |
| US20240132109A1 (en) | Vehicle Control Method, Apparatus, and System | |
| CN117649785B (en) | Unmanned aerial vehicle multi-operator distributed cooperative conflict resolving method and system | |
| CN118243132B (en) | Dynamic path planning method based on Astar algorithm and non-zero and game | |
| WO2021254000A1 (en) | Method and device for planning vehicle longitudinal motion parameters | |
| CN112214037A (en) | Unmanned aerial vehicle remote sensing networking flight path planning method based on field station |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant |