CN112907986B - Dynamic time window crossing scheduling method based on digital twin scene and edge cloud - Google Patents
Dynamic time window crossing scheduling method based on digital twin scene and edge cloud Download PDFInfo
- Publication number
- CN112907986B CN112907986B CN202110037047.5A CN202110037047A CN112907986B CN 112907986 B CN112907986 B CN 112907986B CN 202110037047 A CN202110037047 A CN 202110037047A CN 112907986 B CN112907986 B CN 112907986B
- Authority
- CN
- China
- Prior art keywords
- vehicle
- time
- intersection
- time window
- conflict point
- 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
Images
Classifications
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/07—Controlling traffic signals
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/01—Detecting movement of traffic to be counted or controlled
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/01—Detecting movement of traffic to be counted or controlled
- G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
- G08G1/0108—Measuring and analyzing of parameters relative to traffic conditions based on the source of data
- G08G1/0116—Measuring and analyzing of parameters relative to traffic conditions based on the source of data from roadside infrastructure, e.g. beacons
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/01—Detecting movement of traffic to be counted or controlled
- G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
- G08G1/0125—Traffic data processing
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/01—Detecting movement of traffic to be counted or controlled
- G08G1/04—Detecting movement of traffic to be counted or controlled using optical or ultrasonic detectors
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/07—Controlling traffic signals
- G08G1/08—Controlling traffic signals according to detected number or speed of vehicles
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Chemical & Material Sciences (AREA)
- Analytical Chemistry (AREA)
- Engineering & Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Computing Systems (AREA)
- General Health & Medical Sciences (AREA)
- Medical Informatics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention discloses a dynamic time window crossing scheduling method based on a digital twin scene and edge clouds.
Description
Technical Field
The invention belongs to the technical field of traffic management, and particularly relates to a dynamic time window crossing scheduling method based on a digital twin scene.
Background
At present, traffic jam is a common problem in each big city in China. 28 days 2 and 28 months 2020, the national statistics bureau publishes a national economy and social development statistics bulletin of 2019, and by the end of 2019, the quantity of retained automobiles for the whole country is 26150 thousands (including three-wheeled automobiles and 762 thousands of low-speed trucks), and 2122 thousands are added compared with the last year, wherein the quantity of retained automobiles for the private countries is 22635 thousands and 1905 thousands are added. The quantity of the civilian cars is 14644 thousands, 1193 thousands are added, wherein the quantity of the private cars is 13701 thousands, and 1112 thousands are added. The automobile holding capacity of China is continuously increased, and the bearing capacity of the traffic roads of China can be further tested.
The problem of traffic jam brings much trouble to people in urban life, and greatly increases the time and cost of people going out. In Beijing, if the peak period is selected to travel for 1 hour, roughly half an hour of time may be spent in congestion waiting. The time cost of a commuter group lost due to traffic congestion every month is 808 yuan. And in other cities such as Hangzhou, guangzhou, jinnan, dalian, harbin, shenzhen, shanghai, chongqing and Qingdao with the ten highest congestion rank, the travel time can be increased by 0.88-1.00 times due to traffic congestion, and the minimum extra cost loss is at least 551 yuan per person per month. Secondly, traffic jam increases energy consumption, greatly increases atmospheric pollution emission of urban traffic, and brings great threat to public health.
The intersection scene is a scene in which vehicles intersect, such as a road intersection, a fast road and a fast ramp. The intersection region is connected with roads in different directions, becomes an important junction node of a road traffic network, and has great influence on traffic safety and traffic efficiency of the traffic network. Statistically, over 50% of serious traffic accidents occur at or near intersections in the united states each year. Unreasonable intersection design and unreasonable intersection scheduling rules directly affect the safety and the efficiency of intersection traffic, and further directly affect the overall operation condition of the whole traffic network.
In order to relieve the traffic pressure of cities, a single-number and double-number restriction system is issued by some major cities in China, and vehicle restriction measures are implemented according to the tail numbers of vehicles, so that the vehicles of the vehicles are greatly reduced, and the traffic pressure is reduced to a certain extent. However, the existing traffic control measures take the license plate number as the traffic control standard, so that the humanized consideration is lacked, and in addition, the distribution condition of the vehicles is not considered from the time and space dimensions, so that the problem of urban traffic jam cannot be fundamentally solved. In addition, most of the existing intelligent signal lamps monitor the traffic flow of each intersection through sensing equipment such as a camera and an induction line, and adjust the signal lamps according to the traffic flow, the length of a waiting queue and the like, so that the intersection passing efficiency is improved, and the passing time is reduced. The method has high deployment cost, lacks information communication between the vehicle and the regulation and control system, has limited acquired information types, cannot adapt to complicated and variable traffic environments, and has limited promotion effect on traffic efficiency.
Disclosure of Invention
In view of the above, the invention provides a dynamic time window crossing scheduling method based on a digital twin scene and a marginal cloud, which is characterized in that the method schedules and controls crossing passing vehicles based on a dynamic time window algorithm by establishing the digital twin scene in a crossing region and predefining the running track and potential conflict points of automatically-driven vehicles at the crossing, thereby effectively improving the crossing traffic rate and greatly reducing the average waiting time of the vehicles at the crossing.
The technical scheme of the invention is as follows:
the invention firstly provides a dynamic time window crossing scheduling method based on a digital twin scene and an edge cloud, which comprises the following steps:
establishing a digital twin body of the scene based on real-time information data transmitted by the three-dimensional point cloud map, the scene high-precision map, the road side sensing equipment and the intelligent driving vehicle;
monitoring traffic operation in the area, monitoring physical state information of a scene, and updating high-precision map and three-dimensional point cloud map data;
maintaining a time window sequence based on standard UTC time for each intersection conflict point, monitoring the traffic state of an intersection area in real time, adding the conflict point time window sequences of all passable vehicles into an intersection conflict point time window set, enabling all occupied time windows of the same conflict point to be mutually non-intersected on the basis of an intersection scheduling strategy of a dynamic time window, and providing a planned path and track data carrying timestamp information for all vehicles to guide the running of a single vehicle; and updating the intersection conflict point time window sequence set along with time, and scheduling vehicles to pass through the intersection.
According to the priority scheme of the invention, the digital twin body consists of a basic information layer, a physical characteristic layer, a semantic information layer and a real-time mapping layer;
the basic information layer stores a three-dimensional point cloud map and scene high-precision map information of the intersection area;
the physical characteristic layer records the subordination relation between roads and lanes, the geometric information of the lanes, the geometric information of intersection areas and the positions of intersection stop lines;
the semantic information layer records lane speed limit, lane weight, road junction topological relation and conflict point) geometric information;
the real-time mapping layer maintains the information of a vehicle total set, a vehicle waiting queue on a Lane Lane and an intersection passing queue, and updates the state of the vehicle in real time according to the information transmitted by the vehicle.
According to a preferred embodiment of the invention, a set of time windows is maintained for each conflict point, all time windows being composed of two parts, each occupying a start time T for a time window start And the sum time window occupies the end time T end ，T start And T end UTC time, precision in milliseconds, all of which are standard, is denoted as [ T ] start ,T end ](ii) a The time window is indicated in the slave T start To T end During the time, the collision point will be occupied by a certain vehicle, and thus become unavailable.
According to the priority scheme of the invention, the current time of the target vehicle is set to be T bow The current speed of the vehicle is V current Acceleration of vehicle is a, crossing traffic speed is set as V cross ；
The collision area is a circular space area, and if the specific time T when the vehicle just reaches the conflict point is assumed, and the time that the vehicle passes from the edge of the collision area to the conflict point is Δ T, then:
T start ＝T-ΔT
T end ＝T+ΔT
Vehicle length vehicle length, vehicle, set for passing vehicles at intersections width The vehicle width is set for passing the vehicle according to the intersection.
In order to solve for the specific time T at which the vehicle reaches the conflict point, the time at which the vehicle takes to travel from the current position to the conflict point under dispatch control needs to be solved,
T＝T now +Δt
the vehicle state information including the position, speed and acceleration of the vehicle is synchronized in real time, the distance L from the current vehicle to the conflict point is obtained, the vehicle acceleration state and the vehicle speed stable state are set to be passed when the vehicle runs from the current state of the current position to the conflict point position, namely, in the vehicle acceleration state, the vehicle speed is from the initial speed V current Increasing to crossing traffic speed V with constant acceleration a cross (ii) a In the vehicle speed stable state, the vehicle speed is kept at V cross And the vehicle runs to the conflict point at a constant speed, so that a time window occupied by the vehicle in the conflict point area is obtained.
According to the priority scheme of the invention, the time when the vehicles at the current intersection arrive at each conflict point according to the driving track of the vehicles and the time window sequence of each conflict point occupied by each vehicle are obtained and compared with the existing intersection conflict point time window sequence set; when detecting that a time window sequence of a certain conflict point occupied by a certain vehicle in the existing state conflicts with the existing conflict point time window sequence set, decelerating the vehicle, stopping in an intersection waiting area for waiting, calculating the time of reaching each conflict point for the vehicle again, when detecting that the time sequence does not conflict, namely the vehicle can pass through, sending an intersection passing schedule to the vehicle, updating the time window of the vehicle at the conflict point, and tracking the running of the vehicle until the vehicle exits the intersection.
The invention also provides a dynamic time window crossing scheduling system based on the digital twin scene and the edge cloud, which comprises the following steps: the system comprises an edge cloud platform, roadside sensing equipment and an intelligent driving vehicle;
the edge cloud platform establishes a digital twin body of a scene based on real-time information transmitted by a three-dimensional point cloud map, a scene high-precision map, roadside sensing equipment and an intelligent driving vehicle; the method comprises the following steps that a time window sequence based on standard UTC time is maintained for each intersection conflict point by an edge cloud platform, path planning service is provided for all intelligent driving vehicles in an area in real time based on scene digital twin bodies, multiple vehicles are scheduled in a conflict area, and the safety and the order of the multiple vehicles running in the area are maintained; the edge cloud platform guides the running of the single vehicle by transferring the driving right and the track data with the timestamp information, and the transferred track data comprises spatial position information and specified time for reaching the point; the edge cloud platform is directly connected with the road side sensing equipment, actively monitors traffic operation in the responsible area, monitors the physical state information of a scene, and updates high-precision map and three-dimensional point cloud map data in time;
the roadside sensing equipment comprises a camera, a laser radar and a millimeter wave radar; the system comprises an edge cloud platform, a road information acquisition module and a road information transmission module, wherein the edge cloud platform is used for acquiring road information and transmitting the road information to the edge cloud platform;
the intelligent driving vehicle transmits vehicle information to the edge cloud platform in real time, and passes through the intersection according to the track data which is provided by the edge cloud platform and carries the timestamp information.
Compared with the prior art, the invention provides a dynamic time window crossing scheduling method based on a digital twin scene and edge clouds, the method is used for scheduling and controlling crossing passing vehicles based on a dynamic time window algorithm by establishing the digital twin scene in a crossing region and predefining the running track and potential conflict points of automatically-driven vehicles at the crossing, thereby effectively improving the crossing traffic rate and greatly reducing the average waiting time of the vehicles at the crossing.
Drawings
FIG. 1 is a layered structure of a digital twin;
FIG. 2 is a digital twin at a road intersection;
FIG. 3 is a schematic diagram of a dynamic time window calculation;
fig. 4 is a schematic diagram of a dynamic time window crossing scheduling method based on a digital twin scene and an edge cloud according to the present invention, wherein a-D respectively illustrate four different times.
Detailed Description
In order to describe the present invention more specifically, the following detailed description of the present invention is made with reference to the accompanying drawings and the detailed description thereof.
Dynamic time window crossing scheduling system based on digital twin scene and marginal cloud, its characterized in that includes: the intelligent driving system comprises an edge cloud platform, roadside sensing equipment and an intelligent driving vehicle;
the edge cloud platform establishes a digital twin body of a scene based on real-time information transmitted by a three-dimensional point cloud map, a scene high-precision map, roadside sensing equipment and an intelligent driving vehicle; the edge cloud platform maintains a time window sequence based on standard UTC time for each intersection conflict point, provides path planning service for all intelligent driving vehicles in the region in real time based on scene digital twin, schedules multiple vehicles in the conflict region, and maintains the safety and order of multiple vehicle driving in the region; the edge cloud platform guides the running of the single vehicle by transferring the driving right and the track data with the timestamp information, and the transferred track data comprises spatial position information and specified time for reaching the point; the edge cloud platform is directly connected with the road side sensing equipment, actively monitors traffic operation in the responsible area, monitors the physical state information of a scene, and updates high-precision map and three-dimensional point cloud map data in time;
the roadside sensing equipment comprises a camera, a laser radar and a millimeter wave radar; the system comprises an edge cloud platform, a road information acquisition module and a road information transmission module, wherein the edge cloud platform is used for acquiring road information and transmitting the road information to the edge cloud platform;
the intelligent driving vehicle transmits vehicle information to the edge cloud platform in real time, and passes through the intersection according to the track data which is provided by the edge cloud platform and carries the timestamp information.
The invention discloses a dynamic time window crossing scheduling method based on a digital twin scene and an edge cloud, which comprises the following steps:
establishing a digital twin body of a scene based on real-time information data transmitted by a three-dimensional point cloud map, a scene high-precision map, roadside sensing equipment and an intelligent driving vehicle;
monitoring traffic operation in the area, monitoring physical state information of a scene, and updating high-precision map and three-dimensional point cloud map data;
maintaining a time window sequence based on standard UTC time for each intersection conflict point, monitoring the traffic state of an intersection area in real time, adding the conflict point time window sequences of all passable vehicles into an intersection conflict point time window set, enabling all occupied time windows of the same conflict point to be mutually non-intersected on the basis of an intersection scheduling strategy of a dynamic time window, and providing a planned path and track data carrying timestamp information for all vehicles to guide the running of a single vehicle; and updating the intersection conflict point time window sequence set along with time, and scheduling vehicles to pass through the intersection.
As shown in fig. 1, the element scene digital twin is a hierarchical structure, and the mapping from the real scene to the virtual scene is realized from four dimensions. The edge cloud platform realizes perception and control of a real scene based on four-dimensional information provided by the scene digital twin.
The basic information layer stores point cloud maps and high-precision map information of intersection areas. The point cloud map is key information for realizing self-vehicle positioning of the vehicle, the high-precision map is used as an important perception container for assisting vehicle positioning and extracting path tracks, and map data of a vehicle end is updated by means of high bandwidth characteristics of short-distance direct communication in an intersection area.
In the physical characteristic layer, the dependency relationship between Road and Lane Lane, the geometric information such as the width and orientation of Lane Lane, the geometric information of intersection area, the position of intersection stop line and the like are recorded.
In the semantic information layer, information such as lane speed limit, lane weight, intersection road connection topological relation, conflict point (shown as a track line intersection in an intersection region in fig. 2) geometry and the like is recorded, wherein the lane weight is an important reference of an intersection scheduling strategy.
And maintaining information such as a vehicle total set, a vehicle waiting queue on a Lane Lane, an intersection passing queue and the like on a real-time mapping layer, and updating the state of the vehicle in real time according to the information transmitted by the vehicle.
Taking a bidirectional six-lane crossroad as an example, a digital twin body of a crossing scene is established, and as shown in fig. 2, a visual display of the crossing model is shown.
The edge cloud platform is located at the bottommost layer of all the cloud platforms, is the cloud platform closest to the vehicle end and the road end in all the cloud platforms, is communicated with the regional cloud upwards, and is connected with the intelligent networking automobile downwards. The real-time performance is the biggest characteristic of the edge cloud platform, and the edge cloud platform is usually arranged near a responsible scene, especially in a scene with high conflict performance such as an intersection. The main services provided by the edge cloud platform include:
(1) Scene digital twinning
The edge cloud platform establishes a digital twin body of a scene based on data such as a scene high-precision map, road side sensing equipment and real-time information transmitted by an intelligent driving vehicle, and is a basis for the edge cloud platform to realize all functions related to intelligent driving.
(2) Planning and scheduling
The edge cloud platform provides path planning service for all intelligent driving vehicles in the region in real time based on element scene digital twin bodies, multiple vehicles are scheduled in a conflict region in a manner of putting down driving rights, and safety and order of driving of the multiple vehicles in the region are maintained.
(3) Driving guide
The edge cloud platform guides the running of the single vehicle by transferring the right of exercise and the track data with the timestamp information, and the issued track point comprises the spatial position information and the specified time for reaching the point.
(4) Active monitoring
The edge cloud platform is directly connected with road side infrastructure, comprises a camera, a laser radar, a millimeter wave radar and other sensors, actively monitors traffic operation in a responsible area, and monitors physical state information of a scene so as to update high-precision map and three-dimensional point cloud data in time.
Because the driving track of the vehicle at the intersection is fixed, and the vehicle is completely controlled by the dispatching instruction of the edge cloud in the intersection area, the vehicles on the same track line can not generate conflict, and therefore all potential conflicts at the intersection can come from the vehicles in different directions and occur at the fixed conflict point position. The crossing scheduling strategy based on the dynamic time window takes the conflict problem of the conflict points as a starting point, a time window sequence based on standard UTC time is maintained for each conflict point, all occupied time windows of the same conflict point are not intersected with each other, and therefore the problem that the same conflict point is occupied by a plurality of vehicles at the same time at a certain moment to cause vehicle collision is avoided.
a. Conflict point and conflict time window definitions
A conflict point is the intersection of multiple pass lines, essentially a single dot. However, since the vehicles have length and width dimensions in space, it is not possible to simply treat the vehicles and the conflict points as particles.
As shown in FIG. 3, for simplicity of the algorithm description, it is assumed that the vehicles have the same length Vehicle length And width of Vehicle width The center point of the vehicle is located at the geometric center of the vehicle. For a certain conflict point, in order to enable two vehicles with potential conflict relation to safely pass through the conflict point, a circle with the radius of R is established by taking the actual coordinate of the point as the center of the circle.
In the limit, as shown in fig. 3, the vehicle Car3 is leaving the conflict point area, and the vehicle Car4 is entering the conflict point area, and the two vehicles can just avoid the collision. The radius of the conflict area can be obtained according to the geometrical relationship as follows:
the area with the radius of R is a conflict area, and at most one vehicle can be located in the conflict area at a certain moment. The time window occupied by the conflict point is a sequence pair formed by the time when the vehicle enters the conflict area and the time when the vehicle exits the conflict area.
b. Computation of conflict time windows
A conflict-free intersection scheduling system based on dynamic time windows maintains a time window sequence set for each conflict point, and all the time windows consist of two parts which respectively occupy a starting time T for the time windows start And the sum time window occupies the end time T end ，T start And T end UTC time, precision in milliseconds, is all standard and is denoted as [ T ] start ,T end ]. The time window is indicated at the slave T start To T end During the time, the collision point will be occupied by a certain vehicle, and thus become unavailable.
The current time is T now The current speed of the vehicle is V current Acceleration of vehicle is a, crossing traffic speed is set as V cross . Because the vehicle can actively decelerate before entering the intersection to ensure safety, and in the intersection passing stage, the edge cloud platform ensures the driving safety of the intersection in a software-defined mode, the vehicle can pass through the intersection at a higher speed so as to improve the passing time of the vehicle at the intersection and further improve the passing rate of the intersection, and therefore V is a V current <V corss 。
The collision area is a circular space area, and if the specific time T when the vehicle just reaches the conflict point is assumed, and the time elapsed from the edge of the collision area to the conflict point is Δ T, then:
T start ＝T-ΔT (2)
T end ＝T+ΔT (3)
by the formula (1, 2, 3) and the crossing traffic speed V cross The following can be obtained:
in order to solve the specific time T when the vehicle reaches the conflict point, we need to solve the time Δ T consumed by the vehicle to travel to the conflict point from the current position under the scheduling control of the cloud platform,
T＝T now +Δt (5)
after the vehicle is registered to the edge cloud platform, the state information of the vehicle, such as position, speed, acceleration and the like, is synchronized to the edge cloud platform in real time, so that the distance L from the conflict point of the current vehicle can be acquired in real time.
The vehicle runs to the position of the collision point from the current position in the current state and needs to pass through the vehicle acceleration state and the vehicle speed stable state.
(1) Acceleration state of vehicle
In this state, the vehicle speed is from the initial speed V current Increasing to crossing traffic speed V with constant acceleration a cross 。
Assume that the distance traveled in this state is L 1 For a duration of Δ t1 Then:
a*Δ t1 ＝V cross -V current (6)
the general formula (6, 7) can be obtained:
(2) Steady state of vehicle speed
In this state, the vehicle speed is kept at V cross And the vehicle runs to the conflict point at a constant speed.
Assume that the distance traveled in this state is L 2 Duration of Δ t2 Then:
L 2 ＝V cross *Δ t2 (10)
because of the fact that
L＝L 1 +L 2 (11)
Combining equations (9) and (11) yields:
combining equations (10) and (12) yields:
by combining the above formulas, the following results are obtained:
the specific time of the vehicle center point road intersection conflict point is as follows:
thus, it is possible to obtain:
in the actual implementation process, a certain time or space margin is required to compensate for control errors caused by vehicle actuators, network delays and the like. In a practical implementation we use a time margin of η seconds.
Finally, the time window occupied by the vehicle in the conflict point area can be obtained as follows:
in a first vehicle V 1 Before entering the intersection, the edge cloud platform calculates the time of the vehicle reaching each conflict point and the length of the time occupied on the conflict point according to the state of the vehicle. E.g. T start1 ，T end2 Respectively represent a first vehicle V 1 Entry and exit conflict point P 1 Together, they form a conflict point P 1 Occupied time window [ T ] start1 ,T end2 ]. Suppose there is another second vehicle V at this time 2 When the vehicle is about to enter the intersection, the edge cloud platform calculates a second vehicle V 2 Time to reach each conflict pointAnd occupying the time window sequence of each conflict point, and comparing with the existing intersection conflict point time window sequence set. It is now detected that the second vehicle V is in the existing state 2 Will occupy the conflict point P 1 [ T ] of start3 ,T end4 ]Time window, and the time window and the first vehicle V 1 At the conflict point P 1 Time window of [ T ] start1 ,T end2 ]Producing a conflict, the conflict is [ T ] start3 ,T end2 ]Wherein T is start1 <T start3 <T end2 。
To avoid potential collision problems, in the present round of scheduling, the second vehicle V 2 Will not be allowed to pass through the intersection and thus the second vehicle V 2 Will slow down and stop waiting in the intersection waiting area.
The edge cloud platform monitors the traffic state of the intersection area in real time and updates the intersection conflict point time window sequence set along with time. As time passes, vehicles in traffic at the intersection will gradually exit the intersection and cause a change in the set of intersection conflict point time windows. The dispatcher performs detection at a high frequency according to the above calculation procedure, when the second vehicle V is detected 2 When passing, the vehicle can go to the second vehicle V in real time 2 Sending the intersection passage scheduling execution to update the second vehicle V 2 At the conflict point P 1 And tracking the second vehicle V 2 Until the second vehicle V 2 And (5) exiting the intersection.
When more vehicles are added, the dispatching strategy can sequentially calculate the maximum number of vehicles which can pass through each Lane Lane, select the Lane Lane which can pass through the maximum number of vehicles, add the conflict point time window sequences of all the vehicles which can pass through into the intersection conflict point time window set, and dispatch the vehicles to pass through the intersection.
An embodiment of the present invention will be described in detail with reference to fig. 4.
As shown in FIG. 4 (A), the non-conflict intersection scheduling system based on dynamic time window maintains a time window sequence set for each conflict point (note: when only part of the conflict points are listed here)A window show), all time windows are composed of two parts, respectively occupying a start time T for the time window start And the sum time window occupies the end time T end ，T start And T end UTC time, precision in milliseconds, all of which are standard, is denoted as [ T ] start ,T end ]. The time window is indicated at the slave T start To T end During the time, the collision point will be occupied by a certain vehicle, and thus become unavailable.
The following description will take an example of calculating the time window occupied by Car1 at the conflict point id = 15.
As shown at FIG. 4 (A), car1 is driven from the lane land id Lane land for road traffic of =1 id The road with the speed of = L1 passes through the conflict points 8-15-14-5 in sequence in the crossing passing process. Before the vehicle enters the intersection, the edge cloud platform calculates the time for the vehicle to reach each conflict point and the length of the time occupied at the conflict point according to the state of the vehicle, as shown in fig. 4 (B). t is t 1 ，t 2 Denotes the time at which Car1 enters and leaves the conflict point area id =15, respectively, which together constitute a time window [ t ] in which the conflict point is occupied 1 ,t 2 ]。
Assuming that another vehicle is about to enter the intersection at this time, as shown at FIG. 4 (B), the Car2 vehicle is entering the intersection, and the trajectory line traveled by the Car2 is the lane land id =4 to lane land id = L4, the conflict point passed is 10-16-15-7. At this time, the edge cloud platform calculates the time for the Car2 to reach each conflict point and the time window sequence occupying each conflict point, and compares the time window sequence with the existing intersection conflict point time window sequence set, as shown in fig. 4 (B). Now it is detected that in the present state, car2 will occupy [ t ] of the conflict point 15 3 ,t 4 ]A time window which will be compared with the time window t existing at the conflict point 15 1 ,t 2 ]The collision occurs, the impact protrusion is divided into [ t ] 3 ,t 2 ]As shown at the intersection of the conflict point time window No. 15 in fig. 4 (B).
To avoid a potential collision problem, in the present round of scheduling, car2 will not be allowed to pass through the intersection, and therefore Car2 will decelerate and stop waiting in the intersection waiting area.
The edge cloud platform monitors the traffic state of the intersection area in real time and updates the intersection conflict point time window sequence set along with time. As time passes, vehicles in traffic at the intersection will gradually exit the intersection and cause a change in the set of intersection conflict point time windows. And the scheduling program detects at a high frequency according to the calculation flow, and when detecting that the Car2 can pass through, the scheduling program sends intersection passing scheduling execution to the Car2 in real time, updates the intersection conflict point time window and tracks the operation of the Car2 until the Car2 exits the intersection.
As shown in FIGS. 4 (C), (D), by controlling the driving state of Car2 so that the time window for which Car2 is expected to occupy the conflict points 10-16-15-7 is delayed, all conflict points will not exist at this time, and Car1 and Car2 can pass normally.
The embodiments described above are presented to enable a person having ordinary skill in the art to make and use the invention. It will be readily apparent to those skilled in the art that various modifications to the above-described embodiments may be made, and the generic principles defined herein may be applied to other embodiments without the use of inventive faculty. Therefore, the present invention is not limited to the above embodiments, and those skilled in the art should make improvements and modifications to the present invention based on the disclosure of the present invention within the protection scope of the present invention.
Claims (3)
1. A dynamic time window crossing scheduling method based on a digital twin scene and an edge cloud is characterized by comprising the following steps:
establishing a digital twin body of the scene based on real-time information data transmitted by the three-dimensional point cloud map, the scene high-precision map, the road side sensing equipment and the intelligent driving vehicle;
the digital twin body consists of a basic information layer, a physical characteristic layer, a semantic information layer and a real-time mapping layer; the basic information layer stores a three-dimensional point cloud map and scene high-precision map information of the intersection area; the physical characteristic layer records the subordinate relation between a road and a lane, the geometric information of the lane, the geometric information of an intersection area and the position of an intersection stop line; the semantic information layer records lane speed limit, lane weight, road connection topological relation of intersections and geometric information of conflict points; the real-time mapping layer maintains the information of a vehicle total set, a vehicle waiting queue on a Lane Lane and an intersection passing queue, and updates the state of the vehicle in real time according to the information transmitted by the vehicle;
monitoring traffic operation in the area, monitoring physical state information of a scene, and updating high-precision map and three-dimensional point cloud map data;
maintaining a time window sequence based on standard UTC time for each crossing conflict point, wherein all time windows are composed of two parts and respectively occupy a starting time T for the time windows start And the sum time window occupies the end time T end ，T start And T end UTC time, precision in milliseconds, all of which are standard, is denoted as [ T ] start ,T end ](ii) a The time window is indicated at the slave T start To T end In time, the conflict point will be occupied by a certain vehicle, thus becoming unavailable;
setting the current time of the target vehicle as T now The current speed of the vehicle is V current The acceleration of the vehicle is a, the crossing traffic speed is set as V cross ；
The collision area is a circular space area, and if the specific time T when the vehicle just reaches the conflict point is assumed, and the time elapsed from the edge of the collision area to the conflict point is Δ T, then:
T start ＝T-ΔT
T end ＝T+ΔT
Vehicle length vehicle length, vehicle, set for passing vehicles at the crossing width A vehicle width set for passing vehicles according to the intersection;
in order to solve for the specific time T at which the vehicle reaches the conflict point, the time at which the vehicle takes to travel from the current position to the conflict point under dispatch control needs to be solved,
T＝T now +Δt
the vehicle state information including the position, speed and acceleration of the vehicle is synchronized in real time, the distance L from the current vehicle to the conflict point is obtained, and the condition that the vehicle needs to pass through the vehicle acceleration state and the vehicle speed stable state from the current position to the conflict point position is set, namely, in the vehicle acceleration state, the vehicle speed is from the initial speed V current Increasing to crossing traffic speed V with constant acceleration a cross (ii) a In the vehicle speed stable state, the vehicle speed is kept at V cross Driving to the conflict point at a constant speed, thereby obtaining a time window occupied by the vehicle in the conflict point area;
monitoring the passing state of an intersection area in real time, adding conflict point time window sequences of all vehicles capable of passing into an intersection conflict point time window set, enabling all occupied time windows of the same conflict point to be mutually disjoint based on an intersection scheduling strategy of a dynamic time window, and providing a planned path and track data carrying timestamp information for all vehicles to guide the running of a single vehicle; updating the intersection conflict point time window sequence set along with time, and scheduling vehicles to pass through the intersection;
the crossing scheduling strategy based on the dynamic time window specifically comprises the following steps: acquiring the time when the vehicles at the current intersection reach each conflict point according to the running track of the vehicles and the time window sequence of each conflict point occupied by each vehicle, and comparing the time window sequence with the existing intersection conflict point time window sequence set; when detecting that a time window sequence of a certain conflict point occupied by a certain vehicle conflicts with the existing conflict point time window sequence set in the existing state, decelerating the vehicle, stopping in an intersection waiting area for waiting, calculating the time of reaching each conflict point for the vehicle again, when detecting that the time sequence does not conflict, namely the vehicle can pass, sending intersection passing scheduling to the vehicle, updating the time window of the vehicle at the conflict point, and tracking the running of the vehicle until the vehicle passes through the intersection;
when the vehicles to be passed are ready to drive into the intersection, the maximum number of the vehicles capable of passing on each Lane Lane at present is calculated in sequence, the Lane Lane meeting the vehicle passing requirement and capable of passing the most vehicles is selected from the maximum number of the vehicles to be passed for the vehicles to pass, the conflict point time window sequence of the vehicles is added into the intersection conflict point time window set, and the vehicles are scheduled to pass through the intersection.
2. The dynamic time window intersection scheduling method based on the digital twin scene and the edge cloud as claimed in claim 1, wherein the intersection conflict point is an intersection point on at least two vehicle driving trajectory lines in the intersection.
3. The dynamic time window crossing scheduling method based on digital twin scene and edge cloud according to claim 1 or 2, wherein the crossing conflict point is set to a circle with radius R,
Vehicle length vehicle length, vehicle, set for passing vehicles at the crossing width The vehicle width is set for passing the vehicle according to the intersection.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110037047.5A CN112907986B (en) | 2021-01-12 | 2021-01-12 | Dynamic time window crossing scheduling method based on digital twin scene and edge cloud |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110037047.5A CN112907986B (en) | 2021-01-12 | 2021-01-12 | Dynamic time window crossing scheduling method based on digital twin scene and edge cloud |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112907986A CN112907986A (en) | 2021-06-04 |
| CN112907986B true CN112907986B (en) | 2022-10-21 |
Family
ID=76112456
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110037047.5A Active CN112907986B (en) | 2021-01-12 | 2021-01-12 | Dynamic time window crossing scheduling method based on digital twin scene and edge cloud |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112907986B (en) |
Families Citing this family (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113470348B (en) * | 2021-06-07 | 2022-07-05 | 北京三快在线科技有限公司 | Method, apparatus, medium, and device for constructing intersection road surface of road |
| CN113442929A (en) * | 2021-06-21 | 2021-09-28 | 国汽智控(北京)科技有限公司 | Vehicle control method, device, equipment and computer readable storage medium |
| CN113256961B (en) * | 2021-06-25 | 2022-05-24 | 上海交通大学 | Crossing autonomous vehicle scheduling and control method based on vehicle formation |
| CN113777952A (en) * | 2021-08-19 | 2021-12-10 | 北京航空航天大学 | Automatic driving simulation test method for interactive mapping of real vehicle and virtual vehicle |
| CN113626155A (en) * | 2021-10-11 | 2021-11-09 | 国汽智控(北京)科技有限公司 | Control method, equipment and storage medium for computing resources in edge cloud server |
| CN114120639B (en) * | 2021-11-09 | 2023-04-11 | 广州文远知行科技有限公司 | Vehicle traffic control method, device and storage medium |
| CN114067310A (en) * | 2021-11-16 | 2022-02-18 | 国网福建省电力有限公司 | Site mapping method and device based on feature matching and electronic equipment |
| CN116455764A (en) * | 2022-01-10 | 2023-07-18 | 中国移动通信有限公司研究院 | Digital twin network arranging method, digital twin network and medium |
| CN114419896B (en) * | 2022-03-29 | 2022-07-12 | 海尔数字科技(青岛)有限公司 | Traffic signal lamp control method, device, equipment and medium based on digital twins |
| CN114966695B (en) * | 2022-05-11 | 2023-11-14 | 南京慧尔视软件科技有限公司 | Digital twin image processing method, device, equipment and medium for radar |
| CN115063591B (en) * | 2022-07-26 | 2022-11-29 | 之江实验室 | RGB image semantic segmentation method and device based on edge measurement relation |
| CN115294797B (en) * | 2022-07-26 | 2023-05-05 | 内蒙古大学 | Intelligent safety control method for road level crossing |
| CN115391477B (en) * | 2022-10-31 | 2023-03-21 | 智道网联科技(北京)有限公司 | Data processing method and device, electronic equipment and storage medium |
| CN115840404B (en) * | 2022-12-21 | 2023-11-03 | 浙江大学 | Cloud control automatic driving system based on automatic driving special road network and digital twin map |
| CN116129066A (en) * | 2022-12-21 | 2023-05-16 | 浙江大学 | Automatic driving high-precision map model based on digital twin and high-precision static map manufacturing method |
| CN117172398B (en) * | 2023-10-31 | 2024-01-26 | 民航机场成都电子工程设计有限责任公司 | Map node calculation method based on digital twin simulation platform |
| CN117275241B (en) * | 2023-11-21 | 2024-02-09 | 湖南希赛网络科技有限公司 | Traffic situation awareness and flow prediction visualization system based on digital twinning |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2008299758A (en) * | 2007-06-01 | 2008-12-11 | Sumitomo Electric Ind Ltd | Vehicle driving support system, driving support device, vehicle and vehicle driving support method |
| CN106529703A (en) * | 2016-10-31 | 2017-03-22 | 浙江大学 | Executive right distribution-based urban traffic peak shifting method |
| CN108597251A (en) * | 2018-04-02 | 2018-09-28 | 昆明理工大学 | A kind of traffic intersection distribution vehicle collision prewarning method based on car networking |
| CN108710719A (en) * | 2018-04-02 | 2018-10-26 | 中山大学 | Intersection intramural conflict based on battleground degree of occupying clears up simulation method |
| CN110992695A (en) * | 2019-12-13 | 2020-04-10 | 北京理工大学 | Intelligent vehicle urban intersection traffic decision multi-objective optimization model based on conflict resolution |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109102696B (en) * | 2018-07-06 | 2020-11-06 | 北京工业大学 | Cross frequency-dense road section conflict early warning method based on active safety |
| CN109658700A (en) * | 2019-03-05 | 2019-04-19 | 上汽大众汽车有限公司 | Intersection anti-collision prewarning apparatus and method for early warning |
| CN112017440B (en) * | 2020-10-26 | 2021-01-12 | 长沙理工大学 | Iterative algorithm for intersection traffic control in automatic driving environment |
-
2021
- 2021-01-12 CN CN202110037047.5A patent/CN112907986B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2008299758A (en) * | 2007-06-01 | 2008-12-11 | Sumitomo Electric Ind Ltd | Vehicle driving support system, driving support device, vehicle and vehicle driving support method |
| CN106529703A (en) * | 2016-10-31 | 2017-03-22 | 浙江大学 | Executive right distribution-based urban traffic peak shifting method |
| CN108597251A (en) * | 2018-04-02 | 2018-09-28 | 昆明理工大学 | A kind of traffic intersection distribution vehicle collision prewarning method based on car networking |
| CN108710719A (en) * | 2018-04-02 | 2018-10-26 | 中山大学 | Intersection intramural conflict based on battleground degree of occupying clears up simulation method |
| CN110992695A (en) * | 2019-12-13 | 2020-04-10 | 北京理工大学 | Intelligent vehicle urban intersection traffic decision multi-objective optimization model based on conflict resolution |
Non-Patent Citations (1)
| Title |
|---|
| 一种交叉路口处的车辆冲突微观模型;陆续等;《江南大学学报(自然科学版)》;20080815(第04期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112907986A (en) | 2021-06-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112907986B (en) | Dynamic time window crossing scheduling method based on digital twin scene and edge cloud | |
| CN107798861B (en) | Vehicle cooperative formation driving method and system | |
| CN109285373B (en) | Intelligent network traffic system for whole road network | |
| CN108364494B (en) | Intelligent road traffic management method, system and platform | |
| CN108011947B (en) | Vehicle cooperative formation driving system | |
| Dion et al. | Evaluation of potential transit signal priority benefits along a fixed-time signalized arterial | |
| CN103136933B (en) | Transferring coordination control method of conventional buses and subway stations | |
| Feng et al. | An augmented reality environment for connected and automated vehicle testing and evaluation | |
| CN106485931A (en) | A kind of intersection vehicle fast passing DAS (Driver Assistant System) and method | |
| CN107490384B (en) | Optimal static path selection method based on urban road network | |
| CN112396834B (en) | Foggy-day expressway coordination control method based on cellular automaton model | |
| CN105679030A (en) | Existing-road-vehicle-based central-control unmanned traffic system | |
| CN112581747B (en) | Vehicle-road cooperative cargo vehicle fleet organization method, device and system | |
| JP7505046B2 (en) | Diagram generating method, diagram generating device, electronic device, and computer-readable storage medium | |
| CN103208180A (en) | System and method for intelligent transportation scheduling on basis of multi-agent interaction technology | |
| CN115565390B (en) | Intelligent network-connected automobile multi-lane queue traffic control method, system and computer readable storage medium | |
| KR20180050973A (en) | Apparatus and method for controlling signal of intersections | |
| Cvijovic et al. | Multi-level conditional transit signal priority in connected vehicle environments | |
| CN110751848B (en) | Active intervention system for intelligent traffic management | |
| WO2023142295A1 (en) | Non-supersaturated state-based appointed travel management and control method and apparatus, and storage medium | |
| Aoki et al. | CSIP: A synchronous protocol for automated vehicles at road intersections | |
| JP2024517167A (en) | Vehicle Guidance with Systematic Optimization | |
| Humagain et al. | Dynamic prioritization of emergency vehicles for self-organizing traffic using VTL+ EV | |
| CN108470455B (en) | Bus priority system and control method | |
| CN117315962A (en) | Emergency vehicle priority passing method, intelligent traffic system and cloud platform |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |