CN115103331B - Method and related device for determining working efficiency of road side unit - Google Patents
Method and related device for determining working efficiency of road side unit Download PDFInfo
- Publication number
- CN115103331B CN115103331B CN202210565601.1A CN202210565601A CN115103331B CN 115103331 B CN115103331 B CN 115103331B CN 202210565601 A CN202210565601 A CN 202210565601A CN 115103331 B CN115103331 B CN 115103331B
- Authority
- CN
- China
- Prior art keywords
- road side
- side unit
- communication
- traffic
- flow
- 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
- 238000000034 method Methods 0.000 title claims abstract description 89
- 238000004891 communication Methods 0.000 claims abstract description 588
- 238000005265 energy consumption Methods 0.000 claims abstract description 70
- 230000007774 longterm Effects 0.000 claims description 52
- 230000008569 process Effects 0.000 claims description 16
- 238000004590 computer program Methods 0.000 claims description 9
- 230000002441 reversible effect Effects 0.000 description 46
- 238000010586 diagram Methods 0.000 description 13
- 238000004364 calculation method Methods 0.000 description 10
- 230000006870 function Effects 0.000 description 10
- 230000009471 action Effects 0.000 description 8
- 238000005315 distribution function Methods 0.000 description 8
- 238000012360 testing method Methods 0.000 description 8
- 230000008859 change Effects 0.000 description 7
- 230000001186 cumulative effect Effects 0.000 description 5
- 238000005457 optimization Methods 0.000 description 5
- 238000004088 simulation Methods 0.000 description 5
- 238000002474 experimental method Methods 0.000 description 4
- 230000004044 response Effects 0.000 description 4
- 230000007423 decrease Effects 0.000 description 3
- 238000001514 detection method Methods 0.000 description 3
- 101000636109 Homo sapiens Ras suppressor protein 1 Proteins 0.000 description 2
- 102100030800 Ras suppressor protein 1 Human genes 0.000 description 2
- 239000003795 chemical substances by application Substances 0.000 description 2
- 238000013136 deep learning model Methods 0.000 description 2
- 230000033001 locomotion Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000002787 reinforcement Effects 0.000 description 2
- 238000012549 training Methods 0.000 description 2
- 241000135164 Timea Species 0.000 description 1
- 230000004913 activation Effects 0.000 description 1
- 238000013528 artificial neural network Methods 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000000052 comparative effect Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000007620 mathematical function Methods 0.000 description 1
- 210000002569 neuron Anatomy 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000005070 sampling Methods 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 238000007619 statistical method Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/30—Services specially adapted for particular environments, situations or purposes
- H04W4/40—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P]
- H04W4/44—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P] for communication between vehicles and infrastructures, e.g. vehicle-to-cloud [V2C] or vehicle-to-home [V2H]
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/0215—Traffic management, e.g. flow control or congestion control based on user or device properties, e.g. MTC-capable devices
- H04W28/0221—Traffic management, e.g. flow control or congestion control based on user or device properties, e.g. MTC-capable devices power availability or consumption
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/02—Power saving arrangements
- H04W52/0203—Power saving arrangements in the radio access network or backbone network of wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Health & Medical Sciences (AREA)
- Computing Systems (AREA)
- General Health & Medical Sciences (AREA)
- Medical Informatics (AREA)
- Traffic Control Systems (AREA)
Abstract
The application provides a method and a related device for determining the working efficiency of a road side unit, wherein the method comprises the following steps: acquiring the working state of a first road side unit; when the working state of the first road side unit is an on state, distributing all or part of communication demand flow in the target communication demand flow to the first road side unit, wherein the communication flow distributed to the first road side unit is smaller than or equal to a first threshold value; determining a first combination according to the working state of the first road side unit, wherein the first combination is used for representing a value arrangement of the working state of each road side unit in the N road side units in a first time period; and determining a first numerical value corresponding to the first combination according to the product of the distribution completion degree of the total communication demand flow and the communication flow transmitted by each unit energy consumption of the N road side units, wherein the first numerical value is in direct proportion to the working efficiency of the N road side units. And the working efficiency of the road side unit is represented by the first numerical value.
Description
Technical Field
The application relates to the field of computers, in particular to a method for determining the working efficiency of a road side unit and a related product.
Background
The Vehicle-mounted unit and the road side unit (V2I) serve as the core of the future intelligent transportation system, and cooperation is realized through information exchange between the Vehicle and the road Infrastructure, so that the traffic safety and the traffic efficiency are remarkably improved.
Because of the non-uniformity of the space-time distribution of the V2I communication service, a large number of road side units may be in a low-load or no-load state for a long time, but still consume basic energy to maintain normal operation, and the basic power of the road side units accounts for more than 60% of the total power, thereby causing huge energy waste. And when the road side unit is in a sleep state, the average power consumption can be reduced by more than 75 percent.
In one implementation method, part of idle road side units are closed under the scene of sparse traffic flow such as late night or suburb, and only part of road side units are left for on-duty communication. For example every other roadside unit is turned on. However, in the multi-path side unit scheduling schemes, no judgment standard is available for judging which scheduling scheme can enable the working efficiency of the road side units to be better, so that most of the road side unit on-duty scheduling schemes are too simple and fixed, and corresponding changes cannot be made by considering specific characteristics of traffic flows.
Therefore, how to determine the working efficiency of the roadside unit under the roadside unit scheduling scheme becomes an important research topic in the technical field.
Disclosure of Invention
In a first aspect, the present application provides a method for determining the working efficiency of a roadside unit, the method comprising: acquiring the working state of a first road side unit, wherein the first road side unit is any one of N road side units distributed in sequence in a first driving direction, the first driving direction is the passing direction of a first lane, and the working state of the first road side unit is an on state or an off state; when the working state of the first road side unit is the on state, distributing all or part of communication demand traffic in target communication demand traffic to the first road side unit, wherein the communication traffic distributed to the first road side unit is smaller than or equal to a first threshold value, the target communication demand traffic is the sum of first accumulated unassigned traffic and first communication demand traffic of traffic flow in the communication coverage area of the first road side unit in a first time period, the first accumulated unassigned traffic is communication demand traffic which is unassigned in the communication demand traffic of traffic flow in the communication coverage area of one or more road side units before the first road side unit in the opposite direction of the first driving direction, and the first threshold value is communication traffic which can be completed maximally in the communication coverage area of the first road side unit; under the condition that the working state of the first road side unit is the closed state, communication demand flow is not distributed for the first road side unit; determining a first combination according to the working state of the first road side unit, wherein the first combination is used for representing a value arrangement of the working state of each road side unit in the N road side units in the first time period; and determining a first numerical value corresponding to the first combination according to the product of the distribution completion degree of the total communication demand flow and the communication flow transmitted by the N road side units per unit energy consumption, wherein the first numerical value is in direct proportion to the working efficiency of the N road side units, and the total communication demand flow is the sum of the communication demand flows of the traffic flow in the communication coverage area of each road side unit in the N road side units.
It can be understood that, by adopting the preset allocation manner provided by the present application (that is, when the working state of the first road side unit is the on state, all or part of the communication demand traffic in the target communication demand traffic is allocated to the first road side unit, and the communication demand traffic allocated to the first road side unit is smaller than or equal to the first threshold value), on one hand, it is determined that the communication demand traffic allocated to the first road side unit is smaller than or equal to the communication demand traffic that can be completed maximally by the traffic flow in the first road side unit; on the one hand, the vehicle always passes through the first road side unit before passing through the road side unit in front of the first running direction of the first road side unit in the running process, so that the communication flow generated by the vehicle in the first road side unit needs to be distributed to the first road side unit or the road side unit in front of the first road side unit to finish; that is, by adopting the allocation method of the application, the communication demand flow of the first road side unit can be allocated to the first road side unit or the road side unit in front of the first road side unit in the first driving direction, and the traffic flow driving rule is met.
It can be understood that the product of the distribution completion degree of the total communication demand flow and the communication flow transmitted by each unit energy consumption of the N road side units is adopted as an index for measuring the working efficiency, on one hand, the fact that the communication demand flow generated by the traffic flow in the communication coverage area of the road side units is considered to be completed as much as possible is considered, and on the other hand, the energy consumption is saved while the communication demand is met, therefore, the first numerical index realizes the energy consumption optimization on the premise of ensuring the V2I communication quality, and realizes the balance between the V2I communication quality and the road side unit energy consumption, thereby adopting the first numerical value as the index of the working efficiency to have objectivity and accuracy.
Therefore, the method provided by the embodiment of the application can be used for representing the working efficiency of the road side unit through the first value (namely the product of the distribution completion degree of the total communication demand flow and the communication flow transmitted by each unit energy consumption of the N road side units), and even if the existing scheduling scheme is simple and fixed, the method for determining the working efficiency of the road side unit can be used for selecting one scheduling scheme with better working efficiency from a plurality of simple and fixed scheduling schemes to carry out the operation.
In one possible implementation manner, the determining a first value corresponding to the first combination according to a product of the allocation completion degree of the total communication demand traffic and the communication traffic transmitted by the N roadside units per unit energy consumption includes: determining the first value corresponding to a target time, wherein the target time is any preset time in the process of distributing all or part of target communication demand flows to the first road side unit to determine the first combination; determining a first loss value corresponding to the target time, wherein the first loss value is 0 when the first accumulated unassigned flow is 0 at the target time, and the first loss value is a preset loss value when the first accumulated unassigned flow is greater than 0 at the target time; determining a corresponding rewarding value under the target time according to a difference value between a third value and a fourth value, wherein the third value is a product of a first weight and the first value, and the fourth value is a product of a second weight and the first loss value; calculating a first long-term rewards value corresponding to the first combination according to a preset discount factor and the rewards value corresponding to each of at least two target moments corresponding to the first combination; the first long-term prize value is proportional to the operating efficiency of the N roadside units.
Therefore, the first long-term rewarding value is used for representing the working efficiency of the road side unit, so that the index for evaluating the working efficiency of the road side unit under the dispatching scheme of the road side unit is more accurate.
In one possible implementation manner, the acquiring the working state of the first roadside unit includes: and determining to set the working state of the first road side unit to one of the opening state and the closing state according to the first communication demand flow and/or the first accumulated unassigned flow.
For example, the first road side unit may be started if the first communication demand flow and/or the first cumulative unallocated flow are/is greater than a preset threshold value for indicating that the traffic flow is greater than the communication demand flow in the communication coverage area of the first road side unit. If not, or if not, both open and not are attempted. The first road side unit may be turned on if a traffic light is installed in the communication coverage area of the first road side unit.
Generally, a common energy optimization strategy is to turn off part of idle road side units in the scene of sparse traffic flows such as late night or suburbs, and only leave part of road side units for on-duty communication. Obviously, the road side unit scheduling scheme is too simple and rigid to consider the specific characteristics of the traffic flow, and cannot adapt to the real-time change of the traffic flow.
By adopting the method provided by the embodiment of the application, whether the first road side unit is started or not is determined according to the specific communication requirement of the traffic flow on the first road side unit, after the same operation of determining whether the first road side unit is started or not is executed on each of the N road side units, each value of the first combination can be completely determined, and the working efficiency corresponding to the first combination is determined according to the method for determining the working efficiency of the road side unit provided by the application. Therefore, according to the corresponding working efficiency, whether the scheduling scheme corresponding to the first combination needs to be used or not can be determined, so that the scheduling scheme with better working efficiency can be implemented in a manner of adapting to the real-time change of traffic flow.
In one possible implementation manner, the determining to set the working state of the first road side unit to one of the on state and the off state according to the first communication demand flow and/or the first accumulated unallocated flow includes: determining whether the target communication demand flow is greater than a second threshold, the second threshold being determined according to one half of the first threshold; setting the working state of the first road side unit to be the opening state under the condition that the target communication demand flow is determined to be greater than a second threshold value; under the condition that the target communication demand flow is determined to be greater than a second threshold value, respectively attempting to set the working state of the first road side unit as the value combination of the opening state or the closing state, and respectively obtaining two or more corresponding first combinations; the calculating a first long-term prize value corresponding to the first combination according to a preset discount factor and the prize value corresponding to each of at least two target moments corresponding to the first combination, including: determining the first long-term prize value corresponding to each of the two or more first combinations; determining a maximum value of the first long-term prize values corresponding to each of the two or more first combinations as a target long-term prize value; and determining the working states of the N road side units in the first time period based on the first combination corresponding to the long-term rewards value.
Alternatively, the value of the second threshold may be one half of the first threshold, or may be another suitable value, which is exemplified by four fifths of the first threshold, which is not limited herein.
Therefore, according to the method for determining the working efficiency of the road side unit provided by the embodiment of the application, on one hand, by presetting an opening mode (when the target communication demand flow is determined to be greater than the second threshold value, the working state of the first road side unit is set to be the opening state; when the target communication demand flow is determined to be greater than the second threshold value, the working state of the first road side unit is respectively tried to be the opening state or the value combination of the closing states), whether the first road side unit is opened is determined according to the specific communication demand of the traffic flow to the first road side unit, and the problem that the road side unit scheduling scheme is too simple and rigid and cannot adapt to the real-time change of the traffic flow is avoided. On the other hand, the optimal working efficiency of the working efficiencies corresponding to the multiple scheduling schemes (i.e., two or more first combinations) is determined by the corresponding preset opening mode, the preset allocation mode and the index (i.e., the first numerical value) for evaluating the working efficiency of the road side unit under the scheduling scheme, and the scheduling scheme of the road side unit is determined by the optimal working efficiency, so that the problem that the working efficiency of the road side unit scheduling scheme is poor is further solved.
In one possible implementation manner, the first communication demand traffic is an average communication demand traffic in communication demand traffic data of traffic flows in a communication coverage area of the first roadside unit in at least two historical time periods corresponding to the first time period, and the method further includes: determining that the stay time of traffic flows in at least two historical time periods corresponding to the first time period in the communication coverage area of the first road side unit meets first expected stay time of normal distribution, determining that the communication request times of traffic flows in at least two historical time periods corresponding to the first time period in the communication coverage area of the first road side unit meet first expected request times of poisson distribution, and determining that the communication demand flow of traffic flows in at least two historical time periods corresponding to the first time period in the communication coverage area of the first road side unit meets first expected communication demand flow of normal distribution; the first communication demand traffic is determined based on a product of the first desired residence time, the first desired number of requests, and the first desired communication demand traffic.
Therefore, according to the method for determining the working efficiency of the road side unit, on one hand, the traffic flow characteristics of the traffic flow in the first time period can be represented by the traffic flow characteristics reflected by the traffic flow in two or more historical time periods corresponding to the first time period, the change characteristics of the traffic flow are comprehensively considered, and a scheduling scheme which is corresponding to the traffic flow conditions in the first time period and enables the working efficiency of the road side unit to be maximized is determined, so that the problems that the scheduling scheme of the road side unit is too simple and rigid and cannot adapt to the real-time change of the traffic flow are further solved. In another aspect, a data statistics mode is adopted, and the traffic flow characteristics of the traffic flow in the first time period are obtained through statistics of traffic flow characteristics and mathematical functions of the historical time period with the coincidence relation with the first time period, so that the working efficiency of the calculated road side unit scheduling scheme is more accurate.
In one possible implementation manner, before the acquiring the working state of the first roadside unit, the method further includes: any element in a combination set is obtained as the first combination, wherein the combination set comprises at least one element for indicating the working state of each of the N road side units; the step of obtaining the working state of the first road side unit includes: determining the working state of the first road side unit according to the first combination; the calculating a first long-term prize value corresponding to the first combination according to a preset discount factor and the prize value corresponding to each of at least two target moments corresponding to the first combination, including: determining the first long-term prize value corresponding to each of the first combinations in the set of combinations; determining the maximum value of the first long-term rewards corresponding to each first combination in the combination set as a target long-term rewards; the operating states of the N roadside units are determined based on the first combination corresponding to the target long-term prize value.
In one possible implementation, the allocation completion degree of the total communication demand is a ratio of a sum of communication demand flows allocated to each of the N roadside units to the total communication demand flow; the communication flow transmitted by each unit energy consumption of the N road side units is the ratio of the total communication demand flow to the sum of the energy consumption of each of the N road side units.
In one possible implementation manner, the allocating all or part of the target communication demand traffic to the first roadside unit, and the communication traffic allocated to the first roadside unit is less than or equal to a first threshold value includes: determining whether the target communication demand flow is less than or equal to the first threshold; under the condition that the target communication demand flow is less than or equal to the first threshold value, distributing the target communication demand flow to the first road side unit; and if the target communication demand traffic is determined to be greater than the first threshold, distributing all or part of the target communication demand traffic to the first road side unit according to a strategy that the distributed priority of the first accumulated unassigned traffic is higher than that of the first communication demand traffic, wherein the communication traffic distributed to the first road side unit is equal to the first threshold.
In one possible implementation, the method further includes: determining the first threshold; the determining the first threshold includes: when the product of the first residence time length and the communication rate of the first road side unit is smaller than or equal to the maximum bandwidth of the first road side unit, the first threshold value is the product of the first residence time length and the communication rate of the first road side unit; the first stay time is the stay time of the traffic flow in the communication coverage area of the first road side unit; and under the condition that the product of the first stay time length and the communication rate of the first road side unit is larger than the maximum bandwidth of the first road side unit, the first threshold value is the maximum bandwidth of the first road side unit.
In one possible implementation, the first lane belongs to a first road, and the first road further comprises at least one second lane, and the passing direction of the second lane is opposite to the passing direction of the first lane; the target communication demand flow is a sum of the first accumulated unallocated flow, the first communication demand flow, and a second accumulated unallocated flow, the second accumulated unallocated flow being a communication demand flow that is not allocated to completion among communication demand flows of traffic flows in a communication range of one or more preceding roadside units of the first roadside unit in an opposite direction of a second traveling direction, the second traveling direction being a traveling direction of the second lane.
In one possible implementation, the energy consumption of each of the N roadside units is calculated by: for an ith road side unit in the N road side units, when the working state of the ith road side unit is the closed state, the energy consumption of the ith road side unit is preset sleep energy consumption, and i is a positive integer greater than or equal to 1 and less than or equal to N; when the working state of the ith road side unit is the opening state, the energy consumption of the ith road side unit is the sum of the product of the preset communication energy consumption and the use degree of the bandwidth resource of the ith road side unit and the preset basic energy consumption; the using degree of the bandwidth resource of the ith road side unit is the ratio of all communication demand flows distributed to the ith road side unit to the maximum communication flow corresponding to the ith road side unit, the maximum communication flow is determined according to the product of the average stay time of the traffic flow in the first direction in the communication coverage area of the ith road side unit and the communication speed of the ith road side unit, and the maximum communication flow is used for representing the maximum communication flow which can be completed by the traffic flow in the communication coverage area of the ith road side unit.
In a second aspect, the present application provides an apparatus for determining the working efficiency of a road side unit, the apparatus comprising: the system comprises an acquisition unit, a first road side unit and a second road side unit, wherein the acquisition unit is used for acquiring the working state of the first road side unit, the first road side unit is any one of N road side units which are sequentially distributed in a first driving direction, the first driving direction is the passing direction of a first lane, and the working state of the first road side unit is an opening state or a closing state;
An allocation unit, configured to allocate all or part of communication demand traffic in a target communication demand traffic to the first road side unit when the working state of the first road side unit is the on state, where the communication demand traffic allocated to the first road side unit is less than or equal to a first threshold, where the target communication demand traffic is a sum of a first accumulated unallocated traffic and a first communication demand traffic of traffic flows in a first time period within a communication coverage area of the first road side unit, and the first accumulated unallocated traffic is a communication demand traffic of traffic flows in a communication demand traffic of one or more road side units preceding the first road side unit in a direction opposite to the first driving direction, and the first threshold is a communication traffic of traffic flows that can be completed maximally within the communication coverage area of the first road side unit; and under the condition that the working state of the first road side unit is the closed state, not distributing communication demand flow for the first road side unit;
The first determining unit is used for determining a first combination according to the working state of the first road side unit, and the first combination is used for representing a value arrangement of the working state of each road side unit in the N road side units in the first time period;
And the second determining unit is used for determining a first numerical value corresponding to the first combination according to the product of the distribution completion degree of the total communication demand flow and the communication flow transmitted by the N road side units per unit energy consumption, wherein the first numerical value is in direct proportion to the working efficiency of the N road side units, and the total communication demand flow is the sum of the communication demand flows of the traffic flow in the communication coverage area of each road side unit in the N road side units.
In a third aspect, the present application provides an electronic device comprising: a memory, a processor, wherein the memory stores program instructions; the program instructions, when executed by the processor, cause the processor to perform the method as described in the first aspect and any possible implementation of the first aspect.
In a fourth aspect, embodiments of the present application provide a chip system for application to an electronic device, the chip system comprising one or more processors configured to invoke computer instructions to cause the electronic device to perform the method of the first aspect or any possible implementation of the first aspect.
In a fifth aspect, the present application provides a computer-readable storage medium having a computer program stored therein; the computer program, when run on one or more processors, causes the terminal device to perform the method as described in the first aspect and any possible implementation of the first aspect.
In a sixth aspect, the application provides a computer program product comprising instructions which, when run on a terminal device, cause the terminal device to perform a method as described in the first aspect and any possible implementation of the first aspect.
It will be appreciated that the apparatus for determining the working efficiency of a roadside unit provided in the second aspect, the electronic device provided in the third aspect, the chip system provided in the fourth aspect, the computer storage medium provided in the fifth aspect and the computer program product provided in the sixth aspect are all configured to perform the method shown in the first aspect or any implementation manner of the first aspect of the embodiments of the present application. Therefore, the advantages achieved by the method can be referred to as the advantages of the corresponding method, and will not be described herein.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings that are required to be used in the embodiments will be briefly described below.
Fig. 1 is a schematic diagram of an application environment of a method for determining a working efficiency of a road side unit according to an embodiment of the present application;
fig. 2 is a flowchart of a method for determining working efficiency of a road side unit according to an embodiment of the present application;
FIG. 3A is a schematic diagram related to traffic flow according to an embodiment of the present application;
FIG. 3B is a schematic view of an opposite direction with respect to a first driving direction according to an embodiment of the present application;
FIG. 3C is a schematic view of yet another embodiment of the present application, showing the opposite direction relative to the first direction of travel;
FIG. 3D is a schematic diagram of an opposite direction with respect to a first traveling direction and an opposite direction with respect to a second traveling direction according to an embodiment of the present application;
FIG. 4 is a flowchart illustrating a method for determining the working efficiency of a road side unit according to an embodiment of the present application;
FIG. 5 is a flowchart illustrating a method for determining the working efficiency of a road side unit according to an embodiment of the present application;
FIG. 6 is a schematic diagram of model solution provided by an embodiment of the present application;
FIG. 7 is a schematic diagram of an experimental environment provided in an embodiment of the present application;
Fig. 8 is a schematic diagram of a residence time of a traffic flow in coverage of each road side unit according to an embodiment of the present application;
Fig. 9 is a schematic diagram of a traffic flow communication demand flow in coverage of each road side unit according to an embodiment of the present application;
FIG. 10 is a schematic diagram of working efficiency of a road side unit scheduling scheme determined by using different models according to an embodiment of the present application;
FIG. 11 is a schematic structural diagram of a device for determining the working efficiency of a road side unit according to an embodiment of the present application;
fig. 12 is a schematic structural diagram of another apparatus for determining working efficiency of a road side unit according to an embodiment of the present application
Fig. 13 is a schematic structural diagram of another apparatus for determining working efficiency of a road side unit according to an embodiment of the present application.
Detailed Description
The application is described in further detail below with reference to the accompanying drawings.
The terminology used in the following embodiments of the application is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. As used in the specification of the present application and the appended claims, the singular forms "a," "an," "the," and "the" are intended to include the plural forms as well, unless the context clearly indicates to the contrary.
In the present application, "at least one (item)" means one or more, "a plurality" means two or more, "at least two (items)" means two or three and more, "and/or" for describing an association relationship of an association object, and three kinds of relationships may exist, for example, "a and/or B" may represent: only a, only B and both a and B are present, wherein a, B may be singular or plural. The character "/" generally indicates that the context-dependent object is an "or" relationship. "at least one of (a) or a similar expression thereof means any combination of these items. For example, at least one (one) of a, b or c may represent: a, b, c, "a and b", "a and c", "b and c", or "a and b and c".
Fig. 1 is a schematic view of an application environment of a method for determining a working efficiency of a road side unit according to the present application.
As shown in fig. 1, a Road Side Unit (RSU) is installed on a Road Side of a highway, an expressway, or a yard management, and a common Road Side Unit is a base station type Road Side Unit. The main work task of the road side unit is to communicate with the road side sensing equipment (such as a speed sensor and the like), traffic lights, electronic signs and other terminals through a communication network, collect the current road condition, traffic condition and other information, and timely process the communication request of the vehicle-mounted unit when the vehicle-mounted unit in the vehicle sends the communication request to the road side unit, so that the functions of vehicle-road interconnection and intercommunication, real-time traffic signal interaction and the like are realized, the driver is assisted to drive, and the personnel and vehicle safety in the whole traffic field are ensured.
The method for determining the working efficiency of the road side unit provided by the application is applicable to both the 4G road side unit and the 5G road side unit, and is not limited in this document.
Example 1:
the following describes in detail the method for determining the working efficiency of the road side unit according to the embodiment of the present application with reference to fig. 2.
In the embodiment of the present application, the method for determining the working efficiency of the road side unit provided in the embodiment of the present application may be performed by a device for determining the working efficiency of the road side unit, and for convenience of description, the device for determining the working efficiency of the road side unit by the main subject of the execution of the steps will be omitted.
As shown in fig. 2, the method for determining the working efficiency of the road side unit includes the following steps:
S201, acquiring the working state of a first road side unit, wherein the first road side unit is any road side unit in N road side units distributed in sequence in a first driving direction.
It can be appreciated that in different regions, the first driving direction may be that the vehicle is driving on the left side of the road or that the vehicle is driving on the right side of the road, and the specific definition of the first driving direction is not limited herein according to the specific region environment.
In the embodiment of the application, the first driving direction is the passing direction of the first lane. The first lane belongs to a first road, and the first road comprises at least one first lane, one first lane has a traffic direction, and the traffic direction of each first lane may be the same or opposite.
The operating state of the first road side unit may be an on state or an off state. The on state may be understood as an on duty state, and the off state may be understood as a sleep state. When the working state of the road side unit is the on duty state, the energy consumption of the road side unit comprises basic energy consumption and communication energy consumption, wherein the basic energy consumption is generally constant, and the communication energy consumption is positively related to the working load. When the operation state of the road side unit is the sleep state, the energy consumption of the road side unit is sleep power consumption, and the sleep power consumption is generally constant.
In the embodiment of the application, the working state of the first road side unit is obtained in the following three modes:
Mode 1, the working state of a first road side unit is obtained according to the combination of the working states of the N road side units input by a user.
For example, a road side unit is started every other road side unit, and for this user-defined starting mode, the working state of the first road side unit may be determined according to the input of the user.
And 2, traversing different value combinations of the N road side units by the device for determining the working efficiency of the road side units, and determining the working state of the first road side unit according to the combination traversed currently.
The different value combinations of the N roadside units form a combination set, and any element in the combination set is used for indicating the working state of each roadside unit in the N roadside units, and the combination set can include at most 2 elements to the power of N and at least one element.
And 3, determining the working state of the first road side unit according to the opening rule.
The opening rule is, for example, a determination that the working state of the first road side unit is set to one of an open state and a closed state according to whether a sum of a first communication demand flow and a first accumulated unallocated flow (collectively referred to as a target communication demand flow) of the traffic flow within a communication coverage area of the first road side unit is greater than or equal to a second threshold.
For example, the first cumulative unallocated traffic is unallocated completed communication demand traffic among communication demand traffic within a communication range of one or more roadside units in a direction opposite to the first traveling direction of the first roadside unit, and the second threshold is determined according to one half of a first threshold, which is a communication traffic that is maximally completed by the traffic flow within the communication coverage of the first roadside unit.
And if the target communication demand flow is smaller than the second threshold, respectively attempting to set the working state of the first road side unit as a value combination of the opening state or the closing state to respectively obtain two or more corresponding first combinations.
S202, when the working state of the first road side unit is an on state, distributing all or part of the target communication demand flow to the first road side unit.
In the embodiment of the application, the communication requirement flow allocated to the first road side unit is required to be smaller than or equal to the communication flow (noted as a first threshold) that can be completed by the traffic flow in the communication coverage area of the first road side unit.
In the embodiment of the application, under the condition that the working state of the first road side unit is the closed state, the communication demand flow is not distributed for the first road side unit.
In an embodiment of the present application, the traffic flow includes one or more vehicles, and the first stay period characterizes a required period of time for the one or more vehicles included in the communication coverage distance of the first road side unit in the first traveling direction to pass through the first road side unit. For example, as shown in fig. 3A, if the communication distance of the first road side unit in the corresponding first traveling direction is taken to be L, the length of the traffic flow is L. It can be understood that at most, the first road side unit can only provide communication service for the traffic flow with the length equal to L at the same time, that is, at most, the first road side unit only needs to meet the communication demand flow of one traffic flow at the same time.
The first vehicle (first vehicle) entering the first road side unit is taken as the starting point of L, and the end point of L is taken as the point at a distance L from the first road side unit. The number of vehicles from the starting point of the L to the ending point of the L is the number of vehicles included in the traffic flow. The time length that the traffic flow includes the vehicle passing through the first road side unit is the time length that the traffic flow needs to pass through the road side unit. It can be understood that, the average value of the stay time of two or more traffic flows in the first road side unit in the first period is recorded as the average stay time, the average value of the communication request times when the two or more traffic flows stay in the first road side unit in the first period is recorded as the average communication request times, and the average value of the communication demand flow of each communication request when the two or more traffic flows stay in the first road side unit in the first period is recorded as the average communication demand flow. The product of the average residence time, the average traffic demand flow, and the average number of communication requests may then characterize the average traffic demand flow for the first roadside unit for each traffic flow during the first time period. And obtaining the communication demand flow of the traffic flow to the first road side unit at each moment in the first time period, namely the communication demand flow of the traffic flow in the communication coverage area of the first road side unit.
In the embodiment of the present application, the first threshold is a communication flow that can be completed by the traffic flow in the communication coverage area of the first road side unit. In some implementations, the first threshold is determined by a maximum bandwidth of the first road side unit, and in other implementations, the first threshold is determined by a communication demand traffic flow that is at most achievable by the traffic flow through the first road side unit.
Illustratively, the residence time of the traffic flow in the communication coverage area of the first road side unit is recorded as a first residence time. If the product of the first residence time length and the communication rate of the first road side unit (which represents the communication demand flow that can be completed by the traffic flow through the first road side unit at most) is smaller than or equal to the maximum bandwidth of the first road side unit, the first threshold value is the product of the first residence time length and the communication rate of the first road side unit. And if the product of the first stay time and the communication rate of the first road side unit is larger than the maximum bandwidth of the first road side unit, the first threshold value is the maximum bandwidth of the first road side unit.
In the embodiment of the present application, the target communication demand flow includes a first communication demand flow of traffic flow in a first traffic direction within a communication coverage area of a first road side unit in a first period of time and a first cumulative unallocated flow, where the first cumulative unallocated flow is a communication demand flow which is not allocated to be completed among communication demand flows of traffic flow corresponding to the first traffic direction within a communication coverage area of one or more road side units in a direction opposite to the first traffic direction of the first road side unit.
For example, if the traffic direction of the first lane is from left to right, the first traffic direction is from left to right. For ease of description, the traffic flow passing from left to right will also be referred to herein in some descriptions as forward traffic flow. Illustratively, as shown in FIG. 3B, the first travel direction is from left to right; the RSU3 is the first road side unit, and the first accumulated unallocated traffic is an unallocated traffic demand among traffic demand traffic of traffic flows in a communication coverage area of road side units (i.e., RSU1 and RSU 2) before the RSU3 in the first driving direction.
If the driving direction of the first lane is from right to left, the first driving direction is from right to left. For ease of description, the right-to-left traffic flow will also be referred to herein in some descriptions as reverse traffic flow. Illustratively, as shown in fig. 3C, the first travel direction is from right to left; the RSU3 is the first road side unit, and the first accumulated unallocated traffic is an unallocated traffic demand among traffic demand traffic of traffic flows in a communication coverage area of road side units (i.e., RSUs 4 and 5) before the RSU3 in the first driving direction.
In one possible implementation, the first lane belongs to a first road, and the first road further comprises at least one second lane, and the passing direction of the second lane is opposite to the passing direction of the first lane; the target communication demand flow is a sum of the first accumulated unallocated flow, the first communication demand flow, and a second accumulated unallocated flow, the second accumulated unallocated flow being a communication demand flow that is not allocated to completion among communication demand flows of traffic flows in a communication range of one or more preceding roadside units of the first roadside unit in an opposite direction of a second traveling direction, the second traveling direction being a traveling direction of the second lane.
That is, if the first road further includes a second lane, and the traffic direction of the second lane is opposite to the traffic direction of the first lane, the target communication demand flow further includes the second accumulated unallocated flow. Illustratively, as shown in fig. 3D, the first travel direction is left to right and the second travel direction is right to left; wherein, the RSU3 is the first road side unit, the first accumulated unallocated traffic includes unallocated traffic demand traffic among traffic demand traffic of traffic flows in communication coverage areas of road side units (i.e., RSU1 and RSU 2) before the RSU3 in the first driving direction, and the second accumulated unallocated traffic includes unallocated traffic demand traffic among traffic demand traffic of traffic flows in communication coverage areas of road side units (i.e., RSU4 and RSU 5) before the RSU3 in the second driving direction.
The first time period may be any time period, for example, the user wants to determine the working efficiency corresponding to the first combination from 9:00 to 10:00 on the same day by using the method for determining the working efficiency of the roadside unit provided by the embodiment of the present application, and the first time period is from 9:00 to 10:00 on the same day. In the embodiment of the application, the communication demand flow of the traffic flow to the first road side unit in the first time period can be represented by the communication demand flow of the traffic flow to the first road side unit in some historical time before the first time period.
For example, the first time period is 9:00 to 10:00 of the day, and the communication requirement flow of the traffic flow to the first road side unit in the 8:00 to 9:00 of the day can be used for representing the communication requirement flow of the traffic flow to the first road side unit in the 9:00 to 10:00 of the day.
For example, the first time period is 9:00 to 10:00 of the day (the current time), and the average traffic demand flow of the traffic flow to the first road side unit in the time period (for example, in the time period of 9:00 to 10:00 of the day of 15 days) in which the traffic flow has an coincidence relationship with the first time period (9:00 to 10:00) in the first 15 days of the current time can be used to characterize the traffic demand flow of the traffic flow to the first road side unit in the first time period.
In one possible implementation manner, the allocating all or part of the target communication demand traffic to the first roadside unit, where the communication traffic allocated to the first roadside unit is less than or equal to a first threshold value specifically includes: determining whether the target communication demand flow is less than or equal to the first threshold; if yes, distributing the target communication demand flow to the first road side unit; if not, distributing all or part of the target communication demand traffic to the first road side unit according to the fact that the first accumulated unallocated traffic is distributed with higher priority than the first communication demand traffic.
For example, if the target communication demand flow is greater than the first threshold, a magnitude relationship between the first accumulated unallocated flow and the first threshold is determined. If the first accumulated unallocated traffic is equal to the first threshold, allocating the first accumulated unallocated traffic to the first roadside unit; and taking the first communication demand traffic as communication demand traffic which is not distributed and completed in the communication coverage area of the road side unit (including the first road side unit) up to the first road side unit. If the first accumulated unallocated traffic is smaller than the first threshold, allocating the first accumulated unallocated traffic to the first road side unit, and making a difference between the first threshold and the first accumulated unallocated traffic to obtain a first allocated traffic, allocating a communication demand traffic, which is consistent with the first allocated traffic in the first communication demand traffic, to the first road side unit, and making a difference between the first communication demand traffic and the first allocated traffic to obtain a remaining unallocated traffic, wherein the remaining unallocated traffic is used as the communication demand traffic which is not allocated to the first road side unit. And if the first accumulated unallocated traffic is greater than the first threshold, allocating the communication demand traffic, which is consistent with the first threshold in the first accumulated unallocated traffic, to a first road side unit, and taking the sum of the difference value between the first accumulated allocated traffic and the first threshold and the first communication demand traffic as the communication demand traffic which is not allocated to the first road side unit.
It may be appreciated that, in another possible implementation manner, if the target communication demand traffic is greater than the first threshold, all or part of the target communication demand traffic may be allocated to the first roadside unit according to a manner that the first communication demand traffic is allocated with a higher priority than the first accumulated unassigned traffic is allocated.
S203, determining a first combination according to the working state of the first road side unit.
In the embodiment of the present application, the first combination is used to represent a value arrangement of the working state of each of the N roadside units in the first period.
It is understood that, if the manner of acquiring the operation state of the first road side unit in the step S201 is the manner 1 or the manner 2, the first combination may be determined in the step S201, that is, the first combination may not need to be determined in the step S203. If the mode of acquiring the operation state of the first road side unit in the step S201 is the mode 3, the first combination needs to be determined after the target communication demand flow of each first road side unit is allocated to the corresponding first road side unit, and the step S203 needs to be executed.
In the embodiment of the application, the communication demand flow in the first time period can be represented by the communication demand flow of the traffic flow in the communication coverage area of the road side unit in some historical time before the first time period, and the first combination corresponding to the first time period is determined according to the communication demand flow of the traffic flow in the communication coverage area of the road side unit in the historical time.
S204, determining a first numerical value corresponding to the first combination according to the product of the distribution completion degree of the total communication demand flow and the communication flow transmitted by the N road side units per unit energy consumption, wherein the first numerical value is in direct proportion to the working efficiency of the N road side units.
In the embodiment of the present application, the total communication demand flow is a sum of communication demand flows of traffic flows in a communication coverage area of each of the N roadside units.
In the embodiment of the present application, the first value is proportional to the working efficiency of the N roadside units. And determining whether the working states of the N road side units in the first time period are determined according to the first combination according to the working efficiencies corresponding to the first combination.
In one possible implementation, the allocation completion degree of the total communication demand is a ratio of a sum of communication demand flows allocated to each of the N roadside units to the total communication demand flow; the communication flow transmitted by each unit energy consumption of the N road side units is the ratio of the total communication demand flow to the sum of the energy consumption of each of the N road side units.
Therefore, the method for determining the working efficiency of the road side unit provided by the embodiment of the application can determine which combination mode of the road side unit can enable the working efficiency of the road side unit to be better, so that the road side unit can be opened according to the working efficiency corresponding to different combinations in different time periods, and the problem that the communication requirement cannot be met or the energy consumption of the road side unit is increased due to the fact that the road side unit is opened in the same opening mode in a blind and fixed manner is avoided.
Example 2:
In one possible implementation manner, the determining the first value corresponding to the first combination according to the product of the allocation completion degree of the total communication demand traffic and the communication traffic transmitted by the N roadside units per unit energy consumption includes: determining the first value corresponding to a target time, wherein the target time is any preset time in the process of distributing all or part of target communication demand flows to the first road side unit to determine the first combination; determining a first loss value corresponding to the target time, wherein the first loss value is 0 when the first accumulated unassigned flow is 0 at the target time, and the first loss value is a preset loss value when the first accumulated unassigned flow is greater than 0 at the target time; determining a corresponding rewarding value under the target time according to a difference value between a third value and a fourth value, wherein the third value is a product of a first weight and the first value, and the fourth value is a product of a second weight and the first loss value; calculating a first long-term rewards value corresponding to the first combination according to a preset discount factor and the rewards value corresponding to each of at least two target moments corresponding to the first combination; the first long-term prize value is proportional to the operating efficiency of the N roadside units.
In one possible implementation manner, the acquiring the working state of the first roadside unit includes: and determining to set the working state of the first road side unit to one of the opening state and the closing state according to the first communication demand flow and/or the first accumulated unassigned flow.
Specifically, it is assumed that the first road includes the first lane, and N roadside units whose communication coverage areas are uniformly arranged without repetition and interval exist on the first road (or surrounding area of the first road), and the method for determining the working efficiency of the roadside units provided by the present application is performed. In the embodiment of the application, the device for determining the working efficiency of the road side units determines the optimal combination A of the working states of N road side units based on the statistical data of traffic flows in the same time period from the 1 st day to the D th day, and takes the optimal combination A as the working states of the N road side units in the same time period from the D+1th day. Similarly, based on the statistical data of traffic flow in the same time period from the 2 nd day to the D+1 th day, an optimal combination B of N road side units is determined, and the optimal combination B is used as the working state of the N road side units in the same time period from the D+2 th day.
For example, based on traffic flow characteristics of the same time period (for example, 7:00 to 8:00) from day 1 to day 15, traffic flow statistics is performed on traffic flow generated by driving in a communication coverage area of each road side unit in the time period of 7:00 to 8:00, a distribution flow is simulated according to a preset opening rule of the road side unit and a distribution rule for distributing the traffic flow to the road side unit, a plurality of first combinations of N corresponding road side unit working states and distribution results corresponding to the first combinations one by one are obtained, a first rewarding value after each first combination corresponds to the first value of the distribution result is calculated, and the working states of N road side units are determined according to a maximum first value or a target first combination corresponding to the first rewarding value. And taking the target first combination as a combination of the working states of the N road side units in the time period of 7:00 to 8:00 on the 16 th day.
In a possible implementation manner, before the acquiring the working state of the first roadside unit, the method further includes: any element in a combination set is obtained as the first combination, wherein the combination set comprises at least one element for indicating the working state of each of the N road side units; the step of obtaining the working state of the first road side unit includes: determining the working state of the first road side unit according to the first combination; the calculating a first long-term prize value corresponding to the first combination according to a preset discount factor and the prize value corresponding to each of at least two target moments corresponding to the first combination, including: determining the first long-term prize value corresponding to each of the first combinations in the set of combinations; determining the maximum value of the first long-term rewards corresponding to each first combination in the combination set as a target long-term rewards; the operating states of the N roadside units are determined based on the first combination corresponding to the target long-term prize value.
The method for determining the working efficiency of the road side unit according to the embodiment of the present application is described in detail with reference to the flowchart of the method shown in fig. 4.
As shown in fig. 4 below, the method comprises the steps of:
Stage 1: and counting traffic flow characteristic data according to the historical data.
S401, determining the stay time of the traffic flow in each road side unit and the communication demand flow in the current time period according to the sample data.
It can be understood that the sample data is historical data, the application adopts the historical data of the same target time period as the current time period to count the traffic flow characteristics, and takes the average value of the traffic flow characteristics in the historical data as the traffic flow characteristics of the current time period.
Illustratively, the current date is 2022, 5, 20, and the current time period is 2022, 5, 20, 7:00-9:00; the target time period may be the same time period within 15 days, that is, 7:00 to 9:00 per day within 15 days from 2022, 5, 4, to 2022, 5, 19.
For one of the i-th roadside units, the expected residence time of the normal distribution function f (RSU i,μi,δi) is satisfied by counting the residence time of 7:00-9:00 traffic flows within 15 days each day within the communication coverage of the i-th roadside unit. For example, the expected residence time period of 7:00-9:00 each day in 15 days of the ith roadside unit includes 15 expected residence time periods μi1、μi2、μi3、μi4、μi5、μi6、μi7、μi8、μi9、μi10、μi11、μi12、μi13、μi14 and mu i15, and the average value of the 15 expected residence time periods is [ ]Mu ij represents a desired stay period corresponding to the j-th day within 15 days) of the i-th road side unit as an average stay period mu i(μi of the traffic flow within the communication coverage of the i-th road side unit in the above-described target period of time may be a unit of time, for example, an hour, a minute, or a second), and the average stay period mu i is taken as a stay period of the traffic flow within the communication coverage of the i-th road side unit in the above-described current period of time.
Thus, the residence time length mu of the traffic flow in the communication coverage area of each of the N road side units in the current time period can be obtained. Exemplary, as shown in table 1 below:
TABLE 1
In the embodiment of the present application, in order to count the average communication demand flow of traffic flow at each roadside unit in the target time period, for one of the i-th roadside units, it is also necessary to count the expected communication request times of poisson distribution (P (RSU i,λi)) that the communication request times per minute of 7:00-9:00 traffic flow per day within 15 days within the communication coverage of the i-th roadside unit are satisfied. The expected number of communication requests per minute corresponding to 7:00-9:00 of each day in 15 days comprises λi1、λi2、λi3、λi4、λi5、λi6、λi7、λi8、λi9、λi10、λi11、λi12、λi13、λi14 and lambda i15, and the average value of the 15 expected communication requests per minute is calculatedLambada ij represents the expected number of requests per minute communications corresponding to the j-th day within 15 days) as the average number of requests per minute of traffic flow within the communication coverage of the i-th road side unit within the target time period lambada i.
And counting the expected communication demand traffic per request of 7:00-9:00 traffic flows per day within 15 days in the communication coverage of the i-th roadside unit to meet the communication demand traffic per request of a normal distribution (g (RSU i,ρi,σi)). The expected communication demand traffic per request corresponding to 7:00-9:00 each day, for example, within 15 days includes the 15 expected communication demand traffic per request of ρi1、ρi2、ρi3、ρi4、ρi5、ρi6、ρi7、ρi8、ρi9、ρi10、ρi11、ρi12、ρi13、ρi14 and ρ i15, and the average value of the 15 expected communication demand traffic per request is calculatedΡ ij represents the expected communication demand flow per request corresponding to the j-th day of the 15 th day) as the average communication demand flow per request ρ i of the traffic flow within the communication coverage of the i-th road side unit during the target period.
And calculating the average communication demand flow k i of the traffic flow at the ith road side unit in the target time period according to the product (k i=μi*λi*ρi) of the average residence time length mu i and the average request times lambda i per minute and the average communication demand flow per request rho i. And taking the average communication demand flow k i as the communication demand flow k i of the traffic flow in the communication range of the ith road side unit in the current time period.
Thus, the communication demand flow k of the traffic flow in the communication coverage area of each of the N road side units in the current time period can be obtained. Exemplary, as shown in table 2 below:
TABLE 2
RSU | k |
RSU1 | k1 |
RSU2 | k2 |
RSU3 | k3 |
RSU4 | k4 |
... | ... |
RSUi | ki |
... | ... |
RSUN | kN |
Stage 2: and simulating to distribute the communication demand flow to the corresponding road side unit according to the traffic flow characteristic data, the opening rule of the working state of the road side unit and the distribution rule of the communication demand flow.
S402, determining the working state of each road side unit according to the stay time and the communication demand flow of the traffic flow in each road side unit in the current time period, a first opening rule and a first allocation rule, and allocating the communication demand flow simulation of the traffic flow in the communication range of each road side unit in the current time period to the road side unit in the working state as the on-duty state to obtain one or more first combinations and allocation results corresponding to each first combination.
For convenience of description, the i-th road side unit will be abbreviated as RSU i, and the communication demand flow of traffic flow in the communication range of the i-th road side unit in the current period will be abbreviated as k i. The i-1 th cumulative unallocated traffic is abbreviated as D i-1. The D i-1 is a traffic flow that is not allocated among traffic demand flows in a traffic range of the road side unit in a direction opposite to the first traveling direction of the i road side unit. The maximum achievable communication demand flow of the traffic flow in the ith road side unit is simply referred to as the ith maximum achievable communication demand flow or simply referred to as mu i x omega, where mu i is the average residence time length mu i of the traffic flow in the communication coverage area of the ith road side unit in the current time period (the target time period), and omega is the communication rate of the ith road side unit.
For example, the working state of the ith road side unit is first determined according to the first opening rule. For example:
It is determined whether the sum of k i and D i-1 is greater than a second threshold. For example, the second threshold is half the maximum traffic flow that can be accomplished at RSU i (μ i ω/2); if yes, the working state of the RSU i is set to be an on-duty state; if not, an attempt is made to set the operation state of the RSU i to be both the on-duty state and the sleep state, and for both cases, it is correspondingly determined whether to allocate a corresponding communication demand traffic for the RSU i according to the operation state of the RSU i and the first allocation rule.
It is understood that the first opening rule may also include other rules. The method can further comprise determining whether to set the working state of the road side unit to be an on-duty state according to whether a signal lamp is deployed in the communication coverage area of the road side unit. For example, for a traffic light deployed on a road within the communication coverage of the RSU i, the duration of traffic flow stay within the coverage of the RSU i and the communication requirements are relatively greater than those of other road side units, and the operation state of the RSU i is determined to be an on state.
And determining whether to distribute communication demand flow for the RSU i according to the working state of the ith road side unit and the first distribution rule. For example:
In the case where the operation state of the RSU i is determined to be the sleep state, the RSU i is not allocated with the communication-required traffic. Under the condition that the working state of the RSU i is determined to be the duty state, determining whether the sum of k i and D i-1 is smaller than or equal to the ith maximum achievable communication demand flow (mu i. Omega.);
If yes, the k i and the D i-1 are distributed to the RSU i in equal parts;
If not, and D i-1 is equal to μ i ω, then D i-1 is assigned to RSU i and k i is taken as D i;
Or if no, D i-1 is less than μ i ×ω, determining a first allocation flow according to a difference between μ i ×ω and D i-1, allocating a communication demand flow of D i-1 and k i, which is the same as the first allocation flow, to RSU i, and taking a difference between k i and the first allocation flow as D i;
Or if not, and D i-1 is greater than the ith maximum achievable communication demand flow, allocating the communication demand flow in D i-1, which is consistent with the ith maximum achievable communication demand flow, to RSU i, and taking the sum of the difference between D i-1 and μ i and k i as the ith accumulated unassigned communication demand flow D i.
Thus, the working state of each RSU i is determined according to the first opening rule, and whether to allocate the communication demand traffic to the RSU i is determined according to the working state of the RSU i and the first allocation rule, so as to obtain a first combination and a first allocation result, wherein the first combination includes the value of the working state of each RSU i, the first allocation result corresponds to the first combination one by one, and the first allocation result includes an allocation record of the communication demand traffic allocated to the RSU i with each working state in duty.
It can be appreciated that if the above "try to put the operation state of the RSU i to the on duty state (or the sleep state)", put the operation state of the RSU i to the on duty state, put the operation state of the RSU i to the sleep state when trying next time, and determine whether to allocate the communication demand traffic to the RSU i according to the operation state of the RSU i and the first allocation rule, respectively. This is true for each of the N roadside units (e.g., RSUs 1、RSU2、RSU3、RSUi, etc.). Thus, from the first opening rule and the first allocation rule, one or more first combinations described above and an allocation result corresponding to each first combination may be correspondingly obtained.
Stage 3: and evaluating the working efficiency of the road side unit according to each opening combination and the distribution result corresponding to each opening combination.
S403, when the number of the one or more first combinations is not 1, calculating a long-term rewarding value corresponding to each of the plurality of first combinations.
The first performance index WEPE corresponding to the first combination is determined according to the product of the allocation completion degree β of the total communication demand and the communication traffic TPE transmitted by each of the N roadside units per unit energy consumption, wherein the total communication demand traffic is the sum of the communication demand traffic of the traffic flow within the communication coverage of each of the N roadside units at the current time (i.e.)。
For example, the above calculation formula of β is shown in the following formula 1:
Where M is the sum of the communication demand streams already allocated to each of the N roadside units.
For example, the calculation formula of the TPE is shown in the following formula 2:
Where P i represents the power consumption of RSU i. Specifically, the power consumption of the RSU i is calculated by:
When the working state of the RSU i is the off state, the energy consumption of the RSU i is the preset sleep energy consumption P sleep, i is a positive integer greater than or equal to 1 and less than or equal to N; when the working state of the i-th road side unit is an on state, the energy consumption of the i-th road side unit is the sum of the product of the preset communication energy consumption P com and the using degree C i of the RSU i bandwidth resource and the preset basic energy consumption P 0 (namely P 0+Ci*Pcom); the C i is the ratio of the total communication demand traffic allocated to the RSU i to the maximum achievable communication traffic (μ i x ω) corresponding to the RSU i. The calculation formula of this P i is shown in the following formula 3, for example.
It can be understood that, according to the first opening rule and the first allocation rule, the simulation of the traffic demand flow in the communication range of each of the N roadside units to the roadside unit in the on-duty state is a progressive process, that is, a period of time is required to elapse before the first combination is obtained.
For example, an allocation status corresponding to a preset time may be determined, including but not limited to: the allocation process is performed to which road side unit, the communication demand flow allocated to each road side unit, and the completion degree of the total communication demand flow, and the preset time is the preset time for acquiring the allocation state.
For example, at time t, the current analog allocation flow proceeds to RSU i (e.g., RSU 5), at time t+1, the current analog allocation flow proceeds to RSU i+3, at time t+2, the current analog allocation flow proceeds to RSU i+8, and so on, and a preset time is designated before the analog allocation is completed, so that the corresponding allocation status can be obtained.
It will be appreciated that if the sum of k i and D i-1 corresponding to RSU i is less than or equal to the second threshold, the means for determining the operation efficiency of the road side unit may attempt to place the operation state of RSU i in the on-duty state or the sleep state. At least two first combinations are thus available, including combination a (for the first combination corresponding to putting the operational state of RSU i to the on duty state) and combination B (for the first combination corresponding to putting the operational state of RSU i to the sleep state), the assignment procedure by RSU 1 to RSU i in generating the combination a and combination B being identical. If the time when the allocation procedure is performed to RSU 1 is t1=0 and the time when the allocation procedure is performed to RSU i is t2=100 ms, and one or more preset times exist between t1 and t2, the allocation states of combination a and combination B corresponding to each preset time between t1 and t2 are consistent.
In the embodiment of the present application, according to a plurality of allocation states corresponding to a plurality of preset moments, WEPE t corresponding to a first combination at different preset moments are correspondingly calculated, and a prize value r (t) of the first combination associated with WEPE t at different preset moments is calculated.
Illustratively, at a preset time (time t), the calculation formula of the prize value r (t) corresponding to the first combination is shown in the following formula 4:
r (t) =λ 1WEPEt-λ2G(DN) equation 4
Here, λ 1 represents the weight of the first performance index, λ 2 represents the loss of the incomplete communication demand traffic portion, and WEPE t is the performance index corresponding to time t (for the calculation of the performance index, please refer to the above, which is not described in detail).
Alternatively, during the allocation of the simulated allocation for determining the first combination, if it is detected that the current time t reaches the preset time t, the corresponding WEPE t may be calculated. That is, a plurality WEPE t of the first combinations to be determined may be calculated in determining the combination arrangement of the first combinations.
Or alternatively, after the first combination is determined after the simulation allocation is completed, the allocation process is traced back, and the corresponding WEPE t at the corresponding preset time t is calculated. That is, after the permutation of the first combination is completely determined, a corresponding plurality WEPE t of the first combination may be calculated.
And calculating the long-term rewards Q corresponding to the first combination according to the r (t) corresponding to each preset moment and a preset discount factor gamma. Illustratively, the calculation formula is shown in equation 5 below, where E represents the average of the values in brackets.
Q=e [ r t+γrt+1+γ2rt+2+γ3rt+3 + ] formula 5
Thus, the long-term prize value Q corresponding to each first combination can be obtained.
S404, determining a maximum long-term rewarding value in long-term rewarding values corresponding to each of the plurality of first combinations as a target long-term rewarding value, and determining the working states of N road side units according to the first combination corresponding to the target long-term rewarding value.
By way of example, it can be expressed as the following equation 6:
Wherein s t is used to represent the allocation status at time t, including the communication demand traffic generated in the coverage area of the current RSU i corresponding to t, the accumulated communication demand traffic D i that has not been allocated in the communication demand traffic of the roadside unit including the RSU i before the RSU i, and the communication demand traffic allocated to the RSU i. a t is used to represent the first combination described above corresponding to time t. Pi (pi=arg maxQ (s, a)) represents a scheduling method for finding a highest (best working efficiency) long-term prize value for a road side unit.
It can be understood that the first opening rule is a combination of working states of traversing road side units. Specifically, in one possible implementation manner, the determining, according to the first communication demand flow and/or the first accumulated unallocated flow, to set the working state of the first roadside unit to one of the on state and the off state includes: determining whether a sum of the first communication demand flow and the first accumulated unallocated flow is greater than a second threshold, the second threshold being determined from one-half of the first threshold; if yes, setting the working state of the first road side unit to be the opening state; if not, respectively attempting to set the working state of the first road side unit as the value combination of the opening state or the closing state to respectively obtain two or more corresponding first combinations; the calculating a first long-term prize value corresponding to the first combination according to a preset discount factor and the prize value corresponding to each of at least two target moments corresponding to the first combination, including: determining the first long-term prize value corresponding to each of the two or more first combinations; determining a maximum value of the first long-term prize values corresponding to each of the two or more first combinations as a target long-term prize value; and determining the working states of the N road side units in the first time period based on the first combination corresponding to the long-term rewards value.
For ease of description, the manner in which the states of operation of the roadside units are combined is referred to herein as a roadside unit scheduling scheme.
Generally, a common energy optimization strategy is to turn off part of idle road side units in the scene of sparse traffic flows such as late night or suburbs, and only leave part of road side units for on-duty communication. As in the simple "α -RSU duty" model, α represents the proportion of road side units that are turned on at the same interval (α=50% i.e. every other road side unit is turned on). This simple and fixed roadside unit duty scheduling scheme, while viable, has a general effect. Because it is too simple and stiff to take specific characteristics of traffic flow into account, it cannot adapt to real-time changes in traffic flow, nor adaptively trade off between quality of vehicle-to-road communication and energy consumption of road-side units.
However, by the method for determining the working efficiency of the road side unit provided by the embodiment of the application, the working efficiency of the road side unit scheduling scheme can be judged, meanwhile, according to the method provided by the embodiment of the application, the change characteristics of traffic flow are comprehensively considered, and an opening combination which maximizes the working efficiency of the road side unit under the traffic flow condition of the corresponding time period is determined, so that the problem that the road side unit scheduling scheme is too simple and rigid and cannot adapt to the real-time change of traffic flow is solved.
Example 3:
The method for determining the working efficiency of the road side unit provided by the application is implemented by taking the example that the first road comprises the first lane and the second lane, and N road side units with communication coverage areas which are uniformly arranged without repetition and interval exist on the first road as an example.
As shown in fig. 5, the method comprises the steps of:
Stage 1: and counting traffic flow characteristic data according to the historical data.
S501, obtaining traffic flow characteristic data of traffic flow reflected by each road side unit in the forward traffic flow and the reverse traffic flow corresponding to the first time period.
In the embodiment of the application, traffic flow characteristic data which is correspondingly reflected in the forward traffic flow and the reverse traffic flow by each road side unit in the historical time period corresponding to the first time period is adopted to represent the traffic flow characteristic data which is correspondingly reflected in the forward traffic flow and the reverse traffic flow by each road side unit in the first time period. For example, the date of the history period and the first period are different, but the history period and the first period are the same period in one day.
The traffic flow characteristic data comprises the stay time of the traffic flow in the communication coverage area of each road side unit in the forward traffic flow and the reverse traffic flow respectively in the first time period, the communication request times of V2I communication of the traffic flow in the communication coverage area of each road side unit in the forward traffic flow and the reverse traffic flow respectively, and the V2I communication demand flow of each request communication of the traffic flow in the communication coverage area of each road side unit in the forward traffic flow and the reverse traffic flow respectively.
For example, the traffic flow characteristic data in two or more historical time periods corresponding to the first time period may be determined through road track information corresponding to the road side unit and/or a travel track record (the travel track record includes a current time and a current position) reported to the vehicle control center by a T-BOX in the vehicle.
Specifically, the step of obtaining traffic flow characteristic data, which is reflected by each road side unit in the forward traffic flow and the reverse traffic flow, of the traffic flow corresponding to the first time period includes the following steps:
S5011, acquiring the stay time of traffic flow in the forward traffic flow in the coverage area of each road side unit corresponding to the first time period, and acquiring the stay time of traffic flow in the reverse traffic flow in the coverage area of each road side unit.
And calculating the normal distribution condition of the residence time of the traffic flow in the coverage area of the road side unit in the forward traffic flow (for convenience of description, in some functions, F is used for representing the forward traffic flow) according to the residence time of each road side unit in the coverage area of the acquired forward traffic flow corresponding to the first time period, and respectively obtaining normal distribution functions F (RSU i,μiF,δiF) for representing the residence time of the traffic flow in the coverage area of the i road side unit one by one. Wherein i represents an i-th target road side unit, the value of i is a positive integer greater than or equal to 1 and less than or equal to N, N is used to represent the total number of road side units included in the test road, μ iF is used to represent the expected (average) residence time of traffic flow in forward traffic flow in the coverage area of the i-th target road side unit, and δ iF is the standard deviation of residence time of traffic flow in forward traffic flow in the coverage area of the i-th target road side unit. And
According to the obtained residence time of the traffic flow in the reverse traffic flow corresponding to the first time period in the coverage area of each road side unit, calculating the normal distribution situation of the residence time of the traffic flow in the coverage area of the road side unit in the reverse traffic flow (for convenience of description, in some functions, the reverse traffic flow is represented by R), and obtaining normal distribution functions f (RSU i,μiR,δiR) for representing the residence time of the traffic flow in the coverage area of the i-th road side unit one by one. Wherein i represents an i-th road side unit, the value of i is a positive integer greater than or equal to 1 and less than or equal to N, N is used to represent the total number of road side units included in the test road, μ iR is used to represent the expectation (average) of the residence time of the traffic flow in the reverse traffic flow in the coverage area of the i-th road side unit, that is, the average residence time of the traffic flow in the communication coverage area of the i-th road side unit, and δ iR is the standard deviation of the residence time of the traffic flow in the reverse traffic flow in the coverage area of the i-th road side unit.
How to find μ iF or μ iR from the historical time period corresponding to the first time period is referred to the relevant description of other embodiments herein (for example, the relevant description in S401 in embodiment 2), and will not be described in detail here.
S5012, obtaining the number of V2I communication requests of traffic flow in the coverage area of each road side unit in the forward traffic flow corresponding to the first time period, and obtaining the number of V2I communication requests of traffic flow in the coverage area of each road side unit in the reverse traffic flow corresponding to the first time period.
According to the obtained number of V2I communication requests of traffic flow in the coverage area of each road side unit in the forward traffic flow, calculating poisson distribution request conditions of the V2I communication requests of traffic flow in the coverage area of the road side unit in the forward traffic flow, and obtaining poisson distribution functions P (RSU i,λiF) used for representing the number of V2I communication requests of traffic flow in the coverage area of the ith road side unit one by one. The parameter I represents an I-th road side unit, the value of I is a positive integer greater than or equal to 1 and less than or equal to N, N is used for representing the total number of road side units included in the test road, and λ iF is used for representing the expected (average) number and standard deviation of V2I communication request times of traffic flow in forward traffic flow within the coverage area of the I-th road side unit. And
According to the obtained V2I communication request times of the traffic flow in the coverage area of each road side unit in the reverse traffic flow, calculating poisson distribution request conditions of the V2I communication request times of the traffic flow in the coverage area of the road side unit in the reverse traffic flow, and respectively obtaining poisson distribution functions P (RSU i,λiR) for representing the V2I communication request times of the traffic flow in the coverage area of the ith road side unit one by one. The parameter I represents an I-th road side unit, the value of I is a positive integer greater than or equal to 1 and less than or equal to N, N is used for representing the total number of road side units included in the test road, and λ iR is used for representing the expected (average) number and standard deviation of V2I communication request times of traffic flows in reverse traffic flows in the coverage area of the I-th road side unit.
How to find λ iF or λ iR from the historical time period corresponding to the first time period can refer to the related description of other embodiments herein (for example, the related description in S401 in embodiment 2), and will not be described in detail here.
S5013, obtaining the V2I communication demand flow of each request of the traffic flow in the coverage area of each road side unit in the forward traffic flow corresponding to the first time period, and obtaining the V2I communication demand flow of each request of the traffic flow in the coverage area of each road side unit in the reverse traffic flow corresponding to the first time period.
And calculating the normal distribution situation of the V2I communication demand flow of each request of the traffic flow in the coverage area of the road side unit in the forward traffic flow according to the obtained V2I communication demand flow of each request of the traffic flow in the coverage area of each road side unit in the forward traffic flow, and respectively obtaining a normal distribution function g (RSU i,ρiF,σiF) for representing the V2I communication demand flow of each request of the traffic flow in the coverage area of the I road side unit one by one. The parameter I represents an I-th road side unit, the value of I is a positive integer greater than or equal to 1 and less than or equal to N, N is used for representing the total number of road side units included in the test road, ρ iF is used for representing the expected (average) V2I communication demand flow of each request of traffic flow in forward traffic flow within the coverage area of the I-th road side unit, and σ iF is used for representing the standard deviation of V2I communication demand flow of each request of traffic flow in forward traffic flow within the coverage area of the I-th road side unit. And
And calculating the normal distribution condition of the V2I communication demand flow of each request of the traffic flow in the coverage area of the road side unit in the reverse traffic flow according to the obtained V2I communication demand flow in the coverage area of each road side unit in the reverse traffic flow, and respectively obtaining a normal distribution function g (RSU i,ρiR,σiR) for representing the V2I communication demand flow of each request of the traffic flow in the coverage area of the ith road side unit one by one. The parameter I represents an I-th road side unit, the value of I is a positive integer greater than or equal to 1 and less than or equal to N, N is used for representing the total number of road side units included in the test road, ρ iR is used for representing the expected (average) V2I communication demand flow of each request of traffic flow in the reverse traffic flow in the coverage area of the I-th road side unit, and σ iR is used for representing the standard deviation of V2I communication demand flow of each request of traffic flow in the reverse traffic flow in the coverage area of the I-th road side unit.
How ρ iR or σ iF is obtained from the historical time period corresponding to the first time period is referred to in the related description of other embodiments herein (for example, the related description in S401 in embodiment 2), and will not be described in detail herein.
Combining the above-described distribution functions regarding residence time, number of V2I communication requests, and V2I communication demand flow per request of traffic flow, it is possible to obtain:
Communication demand flow generated by forward traffic flow in coverage area of ith road side unit in first time period at average every moment Can be expressed as the following equation 7, namely: the product of the expected stay time of traffic flow in forward traffic flow in the coverage of the I-th road side unit (mu iF), the expected number of V2I communication requests with traffic flow in forward traffic flow in the coverage of the I-th road side unit (lambda iF), and the expected V2I communication demand flow per request with traffic flow in forward traffic flow in the coverage of the I-th road side unit (rho iF) (specifically as in equation 7Representation).
Communication demand flow generated by reverse traffic flow in coverage area of ith road side unit in first time period at average every momentCan be expressed as the following equation 8: the product of the expectation of the stay time of the traffic flow in the reverse traffic flow in the coverage of the I-th road side unit (mu iR), the expectation of the V2I communication request times of the traffic flow in the reverse traffic flow in the coverage of the I-th road side unit (lambda iR), and the expectation of the V2I communication demand flow per request of the traffic flow in the reverse traffic flow in the coverage of the I-th road side unit (rho iR).
S502, determining a communication demand flow set of a forward traffic flow and a communication demand flow set of a reverse traffic flow according to traffic flow characteristic data.
It can be appreciated that the communication demand flow generated by the forward traffic flow in the coverage area of the ith road side unit in the first time period at each moment in averageA set of traffic demand flows to the forward traffic flow can be determined and the average traffic demand flow per moment generated based on the reverse traffic flow in the coverage of the i-th road side unit in the first period of timeA total set of communication demands for the reverse traffic flow may be determined.
Exemplary, the communication aggregate demand set Q F for forward traffic flow may be represented asThe set of communication requirements Q R for reverse traffic flow may be represented as
Stage 2: and simulating to distribute the communication demand flow to the corresponding road side unit according to the traffic flow characteristic data, the opening rule of the working state of the road side unit and the distribution rule of the communication demand flow.
S503, determining the working state of each road side unit based on a first opening rule and a first allocation rule, decomposing the communication requirement set of the forward traffic flow and the communication requirement set of the reverse traffic flow into subtasks and allocating the subtasks to the road side units in the on-duty state, and obtaining one or more first combinations and allocation results corresponding to each first combination.
Understandably, if the working state of the road side unit is the duty state, the road side unit can execute the V2I communication task; if the working state of the road side unit is a sleep state, the road side unit is not in the working state (such as power failure, shutdown and the like) and cannot process the V2I communication task.
The description of the first opening rule and the first allocation rule may refer to the related description of other embodiments herein (e.g., the related description in S402 in embodiment 2).
Exemplary, in note Q F Is decomposed into a plurality ofAnd, will Q R inIs decomposed intoAnd assigned to a plurality of disjoint subsetsSo thatWherein i represents the corresponding subtask @Or (b)) Belonging to the communication task of the original i-th road side unit, j is used for representing the j-th road side unit,Or (b)Indicating that the communication task belonging to the original i-th roadside unit is allocated to the j-th roadside unit. It can be understood that j can be any positive integer from 1 to N, and the working state of the jth roadside unit can be a sleep state or an on-duty state, but the communication demand traffic can only be distributed to the jth roadside unit in the on-duty state.
It will be appreciated that the aboveAndIs used for representing an allocation result obtained after corresponding communication demand flow simulation is allocated to the road side unit in the on-duty state based on the first opening rule and the first allocation rule, but is not used for representing that the corresponding communication demand flow simulation is firstly allocatedAndDecomposing to obtainAndAnd distributing the decomposed communication demand flow to the corresponding road side unit based on the first opening rule and the first distribution rule.
Illustratively, as shown in equation 9 below, a value of 1 for y j indicates that the jth roadside unit is scheduled to be on duty and a value of 0 for y j indicates that the jth roadside unit is scheduled to be in sleep.
In one possible implementation manner, in the allocation process, in order to ensure that the V2I communication demand traffic generated in the coverage area of each roadside unit is allocated as completely as possible, it is required to satisfy the sum of the V2I communication demand traffic generated in the original I-th roadside unit and the V2I communication demand traffic distributed to one or more j-th roadside units, and the sum is as close as possible to the V2I communication demand traffic generated in the original I-th roadside unit.
Exemplary, as shown in the following equation 10, usingA value of 1 indicatesDecomposing partial communication tasksAssigned to RSU j for use ofA value of 0 indicatesDecomposing partial communication tasksIs not assigned to RSU j. Reverse traffic flow allocation communication task allocation resultAnd the same is true. Meanwhile, due to the movement characteristics of traffic flow, the communication requirement generated in the coverage area of one road side unit can only be distributed to the road side units behind the road side unit (including the road side unit), so that j is greater than or equal to i in the forward traffic flow; the reverse traffic flow then needs to satisfy j less than or equal to i.
Illustratively, the sum of the V2I communication demand flows generated in the original I-th roadside unit and the V2I communication demand flows distributed to one or more j-th roadside units should be as close as possible to the V2I communication demand flows generated in the original I-th roadside unit, which can be expressed as shown in the following formula 11.
In one possible implementation, in the allocation process, the roadside units may complete in order for the communication tasks allocated to the corresponding roadside units, and then it is required that the total communication tasks allocated to each roadside unit should be less than its maximum bandwidth (e.g., the maximum bandwidth of the roadside units is denoted by c).
Illustratively, the sum of the communication tasks of the assigned forward traffic flow and the assigned reverse traffic flow of any jth road side unit is less than the maximum bandwidth of that jth road side unit, which may be expressed as shown in the following equation 12.
In one possible implementation manner, in order to enable the roadside unit to complete the communication task allocated to the corresponding roadside unit, it is also required to satisfy that the communication duration corresponding to the communication task (communication task, i.e., communication demand flow) allocated to the roadside unit is smaller than the residence time of the traffic flow in the coverage area of the roadside unit, otherwise, if the communication duration is longer than the residence time of the traffic flow in the traffic flow, it may happen that the traffic flow has traveled out of the coverage area of the roadside unit, but the communication task is not completed.
Exemplary, forward traffic flow traffic for any one of the assigned to the jth roadside unit, as shown in equation 13 belowThe ratio of the communication flow constant transmitted by each second of the road side unit is smaller than or equal to the expected (average) time of the traffic flow in the coverage area of the j road side unit, and the reverse traffic flow is the same.
For a specific description of one or more first combinations obtained after the communication demand traffic is allocated to the corresponding roadside units according to the first opening rule and the first allocation rule and the allocation result corresponding to each first combination, reference may be made to the related description of other embodiments herein, for example, the related description in S402 in embodiment 2, which is not described in detail herein.
Stage 3: and evaluating the working efficiency of the road side unit according to each opening combination and the distribution result corresponding to each opening combination.
S504, calculating the performance index corresponding to each of the first combinations when the number of the one or more first combinations is not 1.
In the embodiment of the application, the working efficiency of the roadside unit per unit energy consumption can be described by taking the product of the energy efficiency (index 1) of different roadside unit scheduling schemes and the completion degree (index 2) of the total V2I communication requirement as a comprehensive index (WEPE), wherein the comprehensive index is in direct proportion to the working efficiency of the roadside unit.
For example, as shown in the following equation 14, the index 1 may be represented by V2I communication Traffic (TPE) transmitted per unit energy consumption. The larger the TPE value, the better the performance of the index 1.
Wherein P j is the power consumption of the jth roadside unit (which may be in an on-duty state or a sleep state).I.e. the total energy consumption generated by all the road side units. M is the sum of the communication demand flows already allocated to each of the N roadside units.
In another possible implementation, M may also be a value that is the maximum V2I traffic volume that all on-duty roadside units can theoretically transmit. It can be appreciated that, in practical applications, as long as the roadside unit is in the on state, the roadside unit is utilized to perform the communication task to the greatest extent, that is, the communication demand traffic allocated to the roadside unit is generally as close to the maximum V2I communication demand traffic that the roadside unit can theoretically transmit. Illustratively, the method of calculating M is shown in equation 15 below.
Where ω is the traffic flow constant of the roadside unit average transmission per second. (mu jF+μjR) ω (i.e., the product of the average duration of traffic flow in the j-th road side unit and the average traffic flow transmitted per second by the road side unit in the forward traffic flow and the reverse traffic flow) is then used to represent the transmitted V2I traffic flow in the traffic flow by the j-th road side unit. y j*(μjF+μjR) ×ω, when the value of y j is 1, y j*(μjF+μjR) ×ω represents V2I traffic that needs to be transmitted when the jth roadside unit is scheduled to be in the on-duty state, and when the value of y j is 0, y j*(μjF+μjR) ×ω represents that the jth roadside unit is scheduled to be in the sleep state, and no V2I traffic needs to be transmitted. Thus, the total V2I traffic volume that can be theoretically transmitted by all on-duty roadside units can be represented by the sum of j taken from 1 to y j*(μjF+μjR under N).
It can be understood that the working states of the road side units are different, and the calculation modes of the energy consumption P j are different. When the roadside unit is on duty, P j typically includes a base power consumption P 0 and a communication power consumption P com. When the road side unit is in the on-duty state, the basic energy consumption is P 0 constant, and the communication energy consumption P com corresponds to the working load of the road side unit. And when the road side unit is not scheduled to be in the on-duty state, the road side unit immediately enters sleep, and in the sleep state, the function of the road side unit is constant P sleep.
The energy consumption P i is calculated by the following formula 16, for example. In equation 16, the communication task k ij of the RSU j is composed of a subtask of the RSU j in the forward traffic flow and a subtask of the RSU j in the reverse traffic flow. Specifically, the calculation method of k ij is as follows: I.e. in equation 16 For representing the traffic demand flows allocated to the RSUs j in the forward traffic flow and the reverse traffic flow. Mu j ω characterizes the maximum traffic tasks that the forward traffic flow and the reverse traffic flow can accomplish in the RSU j.
In the embodiment of the present application, the index 2 (the completion degree of the total V2I communication requirement) may be represented by the performance index β. The calculation mode of the beta is shown in the following formula 17, and the beta is equal to the ratio of the communication required flow rate which can be completed by the N road side units to the communication required flow rate generated by the traffic flow at the N road side units. The closer the value of β is to 1 (the larger the value is), the better the index 2 is expressed.
Thus, the above-described calculation method of the operation efficiency integrated index (WEPE) of the lower road side unit per unit energy consumption is shown in the following formula 18. The larger the WEPE value is, the better the working efficiency is.
S505, determining the maximum performance index of the performance indexes corresponding to the first combinations as a target performance index, and determining the working states of the N road side units according to the first combinations corresponding to the target performance index.
In one possible implementation, the optimization objective for optimizing the roadside unit is maximize WEPE. It can also be understood how to find a target combination of multiple value combinations of the duty state or the sleep state of each road side unit, where the target combination is a combination that maximizes the value of WEPE in the multiple combinations, so that the working efficiency of the road side unit is maximized on the premise of meeting V2I communication.
In another implementation manner, the long-term prize value corresponding to the first combination may be calculated according to the performance index WEPE corresponding to the first combination, and the maximum value of the long-term prize value is taken as the optimization target of the optimized roadside unit. In particular, reference may be made to the description related to other embodiments herein (e.g. the description related to S403 in embodiment 2) for calculating the long-term prize value, which will not be described in detail herein.
Example 4:
The following describes a specific implementation manner of the method for determining the working efficiency of the road side unit provided by the application in combination with a deep learning model.
In the deep learning model system, the average residence time of the traffic flow in the forward traffic flow or the reverse traffic flow in the communication coverage area of each road side unit, which corresponds to the first time period, and the average generated communication demand flow of the traffic flow in the forward traffic flow or the reverse traffic flow in the communication coverage area of each road side unit, which corresponds to the first time period, can be taken as inputs. For the average residence time and how the average communication demand flow is obtained, reference may be made to the relevant description of stage 1 (counting traffic flow characteristic data from historical data) in other embodiments herein, which will not be described in detail.
And then realizing the technical contents of the stage 2 (according to the traffic flow characteristic data, the opening rule of the working state of the road side unit and the distribution rule of the communication demand flow, simulating the distribution of the communication demand flow to the corresponding road side unit) and the stage 3 (according to each opening combination and the distribution result corresponding to each opening combination, respectively, evaluating the working efficiency of the road side unit), and finally determining a combination with optimal working efficiency as output.
Specifically, it is assumed that a central proxy cloud node is responsible for acquiring stay time learning of traffic flow and V2I communication demand flow generated by traffic flow in coverage area of each road side unit, and converting information into system state of a model, and sending the system state to a deep Q network. The optimal action policy pi= argmaxQ (x, a) is the feedback at the current time t, where x is the system state, a is the action performed and pi is the policy. When the system takes different actions to schedule the working states of the road side units according to the input of the model, the V2I communication requirements are continuously divided into a plurality of communication tasks which are distributed to different road side units which are scheduled to be on duty. Meanwhile, the reward of the system is set to be a long-term reward value corresponding to the first combination, so that different reward values can be obtained according to different scheduling actions. The system will continually try to pursue as output the scheduling scheme with the greatest prize value. A specific schematic diagram of the model solution is shown in fig. 6.
In deep reinforcement learning, the system mainly comprises main elements of agents, states, actions, rewards and the like: pi= argmaxQ (s t;at; θ), wherein,
① Agent: each of the N roadside units.
② Status: V2I communication requirement k i generated within the coverage of the road side unit RSU i; the traffic demand traffic generated by the roadside unit prior to the RSU j and up to the V2I traffic demand D j that the RSU j has not yet allocated; the roadside unit RSU j has assigned a communication task C j.
The initial value of V2I communication requirement k i generated within the coverage of the road side unit RSU i is made available by the input of the model, and then decreases with the allocation; when the analog allocation proceeds to an RSU j, all accumulated V2I communication requirements D j that have not yet been allocated are first added to the V2I communication requirement k j within the coverage area of the roadside unit, indicating that k j is not allocated, then determining whether to allocate a communication task to the roadside unit according to whether the roadside unit is on, and if the roadside unit is allocated a communication task, subtracting the corresponding allocation task from D j.
The initial value of the allocated communication task C j of the roadside unit RSU j is 0 and the maximum value is its bandwidth C.
③ The actions are as follows: the system sequentially executes actions on each road side unit according to the input of the model: a= [0,1]. Where 1 is on and 0 is off.
When the analog allocation proceeds to an RSU j, all accumulated as yet unassigned V2I communication requirements D j are first added to the V2I communication requirement k j in the coverage area of the roadside unit, indicating that k j is unassigned, and then a decision is made as to whether to assign a communication task to the roadside unit based on whether the roadside unit is on. If the roadside unit RSU j is on, the system can assign up to μ j ω communication tasks to the roadside unit RSU j, and if the roadside unit RSU j is in the sleep state, C j =0. As the system continues to schedule, each k n will be split into multiple k nj. And different scheduling strategies can also obtain different road side unit working efficiencies, so as to obtain different rewards.
④ Rewarding: the invention aims to ensure the V2I communication quality and simultaneously furthest improve the working efficiency of a road side unit. The bonus function consists of two parts, the first part intended to maximize the efficiency WEPE of the operation of the roadside unit and the second part representing the loss of the incomplete V2I communication demand part. Lambda 1 and lambda 2 are weights for each part to balance revenue and penalty.
In one possible implementation, the aboveG (D 1)+G(DN) is also to be understood. Wherein G (D 1) is a communication task that the reverse traffic flow has not yet completed to its last road side unit (the last road side unit is the first road side unit RSU j=1),G(DN of the road segment) is a communication task that the forward traffic flow has not yet completed to its last road side unit (the last road side unit is the last road side unit RSU j=N of the road segment).
Wherein G (x) is a piecewise function, and W is set to a positive number with a larger value to represent penalty.
The goal of the training process is to maximize the desired long-term rewards through an optimal strategy, which can be achieved by the Q value:
The following shows some experimental data in practical application, corresponding to the optimal working efficiency in a combination mode of determining the working efficiency of the road side unit by using the method for determining the working efficiency of the road side unit provided by the embodiment of the application.
In the embodiment of the application, a Shenzhen smart city technology development group limited mountain test field is selected as an experimental scene for experiments. Each road in the field is uniformly paved by road side units at intervals of 200 meters. And V2I communication is carried out by adopting R14LTE-V2X in the test park, and the maximum accessible user number is 500. The application selects a section from the intersection of the clear road and the adjacent junction to the intersection of the clear road and the Dan road as an experimental road, and takes the traffic flow from the starting point to the end point as the forward traffic flow. The total length L of the experimental road section is 2210m (meters), and 11 road side units are distributed along the way. The specific experimental environment is shown in fig. 7, other main experimental parameters are shown in the following table 1,
TABLE 1
Parameters (parameters) | Value taking |
Omega (communication rate of roadside units) | 30Mbps |
P 0 (basic energy consumption) | 2300W |
P com (communication energy consumption) | 1600W |
P sleep (sleep energy consumption) | 460W |
W (punishment value) | 40 |
The acquisition time of the track information and the V2I communication flow of each road in the experimental park is 15 days, and the sampling interval is 5 minutes. The distribution of the stay time f (RSU i,μi,δi) and the V2I communication requirement (RSU i,ki) of the traffic flow in the coverage area of each road side unit is obtained through statistical analysis, and as shown in the bar chart of fig. 8, the embodiment of the application takes the expected value of the distribution to describe the motion state of the traffic flow. Similarly, the V2I communication requirements within the coverage area of each roadside unit are shown in fig. 9 (wherein forwardtraffic flow represents forward traffic flow and REVERSE TRAFFIC flow represents reverse traffic flow). Wherein the time taken for the forward traffic flow to pass through the entire road segment is 270s and the reverse traffic flow is 223s. At this time, the total amount of communication demand on the entire road section is 200MB.
On the basis of the deep reinforcement learning framework, the invention designs a model structure of a five-layer neural network, which comprises an input layer, an output layer and three hidden layers. The neuron numbers of the three hidden layers were set to 400, 200 and 100, respectively, and relu was used as an activation function and RMSprop was used as an optimizer. The learning rate is set to 0.001. After training, we can get a on-duty roadside unit scheduling scheme as output. The output of the model includes the minimum number of road side units required, the location of the selected road side unit. As shown in table 2 below, the roadside units RSU 2,RSU4,RSU6 and RSU 10 are scheduled to be active during this period, with 1 on and 0 off. At this time, the V2I traffic transmitted by the scheduling scheme is 193MB, the total energy consumption of all road side units is 15.844KW, and the working efficiency index WEPE is 11.75MB/KW. And the comparative "α -RSU duty" model (α=1) indicates that all road side units on the road are all on to satisfy the service. At this time, the V2I communication requirement can be definitely completely completed, and the total energy consumption of all the road side units is 28.884KW, so that the working efficiency index WEPE is 6.92MB/KW. Compared with an alpha-RSU duty model (alpha=1), the scheduling scheme ensures 96.5% of V2I quality, saves 45.15% of energy consumption, and improves the work efficiency index WEPE by about 1.7 times.
Table 2 model input and output
And further analyzing the output of the scheduling scheme by combining road conditions. Since the signal lights are deployed on roads within the coverage of the RSUs 4,RSU6 and 8 to regulate traffic flow. Therefore, the residence time and V2I communication requirements in the coverage area of these road side units are relatively greater than those of other road side units, and the system can evaluate and consider these when performing actions, and in combination with other road conditions, finally determine that the road side units RSU 2,RSU4,RSU6 and RSU 10 are scheduled to be in an operating state during this period.
The invention further carries out a plurality of groups of experiments to study the adaptability of the model in different time periods and compares the model with an alpha-RSU duty model. And carrying out a plurality of groups of experiments by taking traffic flow information of the road collecting and clearing 17:00-2:00 as input. The operation efficiency index WEPE of each scheme is shown in fig. 10.
Further experiments show that the working efficiency index WEPE of the model provided by the invention is always higher than that of other models. During the period 17:00-19:00, traffic on the road is denser, and all road side units need to be fully turned on to provide communication services for the vehicle. Therefore, the work efficiency index WEPE of our model is substantially identical to the α -RSU duty model (α=1) and higher than the other models. Over time, traffic flow becomes increasingly sparse. In this case, our model can adapt the scheduling policy by flexibly selecting the best-positioned roadside unit and shutting down the idle part. Thus, the total energy consumption of the road side unit can be greatly reduced while the V2I communication service quality is ensured. The main reason why the working efficiency index WEPE is reduced when the model is 20:00-22:00 is that the V2I communication requirement is lost by a small part, so that the utility index beta is smaller than 1. After that, the work efficiency index WEPE will continue to increase as the total energy consumption of the roadside unit decreases significantly. For the α -RSU duty model, under the condition of dense traffic flow, due to insufficient open road side units, a part of models (α=1/2, 1/3, 1/4) cannot meet all V2I communication requirements, so that the transmitted V2I communication flow is too low, and the working efficiency index is not high. In contrast, when the traffic flow is sparse, even if some models (α=1, 1/2, 1/3) can complete all V2I communication tasks, a lot of unnecessary energy is consumed, resulting in a low work efficiency index. Therefore, as traffic flow becomes more sparse, the work efficiency index WEPE also decreases.
The device for determining the working efficiency of the road side unit provided by the embodiment of the invention is described below.
Referring to fig. 11, a schematic structural diagram of an apparatus for determining a working efficiency of a road side unit is provided in an embodiment of the present invention. As shown in fig. 11, the apparatus for determining the working efficiency of a roadside unit according to an embodiment of the present invention may include:
An obtaining unit 1101, configured to obtain a working state of a first road side unit, where the first road side unit is any one of N road side units sequentially distributed in a first driving direction, and the working state of the first road side unit is an on state or an off state;
An allocating unit 1102, configured to allocate all or part of communication demand flows in a target communication demand flow to the first road side unit when the working state of the first road side unit is the on state, where the communication demand flow allocated to the first road side unit is less than or equal to a first threshold, and the target communication demand flow is a sum of a first accumulated unallocated flow and a first communication demand flow of traffic flows in a first period of time within a communication coverage area of the first road side unit, and the first accumulated unallocated flow is a communication demand flow that is unallocated in a communication demand flow in a communication coverage area of one or more road side units in a direction opposite to the first driving direction of the first road side unit, and the first threshold is a communication flow that can be maximally completed by traffic flows in the communication coverage area of the first road side unit;
a first determining unit 1103, configured to determine a first combination according to the working states of the first roadside units, where the first combination is used to represent a value arrangement of the working states of each of the N roadside units in the first period;
A second determining unit 1104, configured to determine a first value corresponding to the first combination according to a product of a distribution completion degree of a total communication demand flow and a communication flow transmitted by each of the N roadside units per unit energy consumption, where the first value is proportional to a working efficiency of the N roadside units, and the total communication demand flow is a sum of communication demand flows of traffic flows within a communication coverage area of each of the N roadside units.
In a possible implementation manner, the second determining unit 1104 is specifically configured to determine the first value corresponding to a target time, where the target time is any preset time in a process of allocating all or part of target communication demand traffic to the first roadside unit to determine the first combination; determining a first loss value corresponding to the target time, wherein the first loss value is 0 when the first accumulated unassigned flow is 0 at the target time, and the first loss value is a preset loss value when the first accumulated unassigned flow is greater than 0 at the target time; determining a corresponding rewarding value under the target time according to a difference value between a third value and a fourth value, wherein the third value is a product of a first weight and the first value, and the fourth value is a product of a second weight and the first loss value; calculating a first long-term rewards value corresponding to the first combination according to a preset discount factor and the rewards value corresponding to each of at least two target moments corresponding to the first combination; the first long-term prize value is proportional to the operating efficiency of the N roadside units.
In a possible implementation manner, the obtaining unit 1101 is specifically configured to determine to set the working state of the first roadside unit to one of the on state and the off state according to the first communication demand traffic and/or the first accumulated unallocated traffic.
In a possible implementation manner, the obtaining unit 1101 is specifically configured to determine whether the target communication demand flow is greater than a second threshold, where the second threshold is determined according to one half of the first threshold; setting the working state of the first road side unit to be the opening state under the condition that the target communication demand flow is determined to be greater than a second threshold value; under the condition that the target communication demand flow is determined to be greater than a second threshold value, respectively attempting to set the working state of the first road side unit as the value combination of the opening state or the closing state, and respectively obtaining two or more corresponding first combinations; the calculating a first long-term prize value corresponding to the first combination according to a preset discount factor and the prize value corresponding to each of at least two target moments corresponding to the first combination, including: determining the first long-term prize value corresponding to each of the two or more first combinations; determining a maximum value of the first long-term prize values corresponding to each of the two or more first combinations as a target long-term prize value; and determining the working states of the N road side units in the first time period based on the first combination corresponding to the long-term rewards value.
In a possible implementation manner, the allocation unit 1102 is specifically configured to determine whether the target communication demand traffic is less than or equal to the first threshold; under the condition that the target communication demand flow is less than or equal to the first threshold value, distributing the target communication demand flow to the first road side unit; and if the target communication demand traffic is determined to be greater than the first threshold, distributing all or part of the target communication demand traffic to the first road side unit according to a strategy that the distributed priority of the first accumulated unassigned traffic is higher than that of the first communication demand traffic, wherein the communication traffic distributed to the first road side unit is equal to the first threshold.
In one possible implementation manner, as shown in fig. 12, the apparatus for determining the working efficiency of a roadside unit may further include:
A third determining unit 1105, configured to determine the first threshold value; the third determining unit 1105 is specifically configured to, when a product of a first residence time duration and a communication rate of the first roadside unit is less than or equal to a maximum bandwidth of the first roadside unit, take a value of the first threshold value that is a product of the first residence time duration and the communication rate of the first roadside unit; the first stay time is the stay time of the traffic flow in the communication coverage area of the first road side unit; and under the condition that the product of the first stay time length and the communication rate of the first road side unit is larger than the maximum bandwidth of the first road side unit, the first threshold value is the maximum bandwidth of the first road side unit.
In one possible implementation manner, as shown in fig. 12, the apparatus for determining the working efficiency of a roadside unit may further include:
a calculating unit 1106, configured to calculate the energy consumption of each of the N roadside units by: for an ith road side unit in the N road side units, when the working state of the ith road side unit is the closed state, the energy consumption of the ith road side unit is preset sleep energy consumption, and i is a positive integer greater than or equal to 1 and less than or equal to N; when the working state of the ith road side unit is the opening state, the energy consumption of the ith road side unit is the sum of the product of the preset communication energy consumption and the use degree of the bandwidth resource of the ith road side unit and the preset basic energy consumption; the using degree of the bandwidth resource of the ith road side unit is the ratio of all communication demand flows distributed to the ith road side unit to the maximum communication flow corresponding to the ith road side unit, the maximum communication flow is determined according to the product of the average stay time of the traffic flow in the first direction in the communication coverage area of the ith road side unit and the communication speed of the ith road side unit, and the maximum communication flow is used for representing the maximum communication flow which can be completed by the traffic flow in the communication coverage area of the ith road side unit.
In one possible implementation manner, as shown in fig. 12, the apparatus for determining the working efficiency of a roadside unit may further include:
a fourth determining unit 1107, configured to determine that a residence time length of traffic flows in at least two historical time periods corresponding to the first time period in the communication coverage area of the first road side unit meets a first expected residence time length of a normal distribution, determine that a number of communication requests per minute of traffic flows in at least two historical time periods corresponding to the first time period in the communication coverage area of the first road side unit meets a first expected number of requests of poisson distribution, and determine that a communication demand traffic of traffic flows in at least two historical time periods corresponding to the first time period in the communication coverage area of the first road side unit meets a first expected communication demand traffic of a normal distribution; the first communication demand traffic is determined based on a product of the first desired residence time, the first desired number of requests, and the first desired communication demand traffic.
It should be noted that, the specific implementation process may refer to the specific description of the method embodiment shown in fig. 2, fig. 4 or fig. 5, and will not be described herein.
It will be appreciated that the apparatus for determining the efficiency of a roadside unit shown in fig. 11 or 12 described above may have a variety of product configurations. The means for determining the operation efficiency of the roadside unit may also be means for determining the operation efficiency of the roadside unit such as the processor, the communication interface, the memory, and the communication bus shown in fig. 13. Specifically, as shown in fig. 13, the apparatus 130 for determining the working efficiency of the roadside unit may include:
At least one processor 1301, such as a CPU, at least one communication interface 1303, a memory 1304, at least one communication bus 1302. Wherein a communication bus 1302 is used to enable connected communications between these components. Communication interface 1303 may optionally include a standard wired interface, a wireless interface (e.g., WI-FI interface, bluetooth interface, etc.). The memory 1304 may be a high-speed RAM memory or a non-volatile memory (non-volatile memory), such as at least one disk memory. The memory 1304 may also optionally be at least one storage device located remotely from the processor 1301. As shown in fig. 13, an operating system and program instructions may be included in memory 1304, which is a type of computer storage medium.
By way of example, the communication interface 1303 may be used to implement the steps or functions performed by the acquisition unit 1101 in fig. 11 described above, and the like. The processor 1301 may be configured to implement the steps or functions performed by the allocation unit 1102, the first determination unit 1103, the second determination unit 1104, and the like. The communication interface 1303 may be a pin of a chip or a transceiver.
In the apparatus 130 for determining the operation efficiency of a roadside unit shown in fig. 13, a processor 1301 may be configured to load program instructions stored in a memory 1304 and specifically perform the following operations:
acquiring the working state of a first road side unit, wherein the first road side unit is any one of N road side units distributed in sequence in a first driving direction, and the working state of the first road side unit is an opening state or a closing state;
When the working state of the first road side unit is the on state, distributing all or part of communication demand traffic in target communication demand traffic to the first road side unit, wherein the communication traffic distributed to the first road side unit is smaller than or equal to a first threshold value, the target communication demand traffic is the sum of first accumulated unassigned traffic and first communication demand traffic of traffic flow in a first time period within a communication coverage range of the first road side unit, the first accumulated unassigned traffic is communication demand traffic which is unassigned in communication demand traffic in a communication range of one or more road side units in a direction opposite to the first driving direction of the first road side unit, and the first threshold value is communication traffic of traffic flow which can be maximally completed within the communication coverage range of the first road side unit;
Determining a first combination according to the working state of the first road side unit, wherein the first combination is used for representing a value arrangement of the working state of each road side unit in the N road side units in the first time period;
And determining a first numerical value corresponding to the first combination according to the product of the distribution completion degree of the total communication demand flow and the communication flow transmitted by the N road side units per unit energy consumption, wherein the first numerical value is in direct proportion to the working efficiency of the N road side units, and the total communication demand flow is the sum of the communication demand flows of the traffic flow in the communication coverage area of each road side unit in the N road side units.
It should be noted that, the specific implementation process may refer to the specific description of the embodiment shown in fig. 2, fig. 4 or fig. 5, which is not described herein.
The embodiment of the present invention further provides a computer storage medium, where the computer storage medium may store a plurality of instructions, where the instructions are adapted to be loaded by a processor and execute the steps of the method of the embodiment shown in fig. 2, fig. 4, or fig. 5, and the specific execution process may refer to the specific description of the embodiment shown in fig. 2, fig. 4, or fig. 5, which is not repeated herein.
As used in the above embodiments, the term "when …" may be interpreted to mean "if …" or "after …" or "in response to determination …" or "in response to detection …" depending on the context. Similarly, the phrase "at the time of determination …" or "if detected (a stated condition or event)" may be interpreted to mean "if determined …" or "in response to determination …" or "at the time of detection (a stated condition or event)" or "in response to detection (a stated condition or event)" depending on the context.
In the above embodiments, it may be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, produces a flow or function in accordance with embodiments of the application, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a computer network, or other programmable apparatus. The computer instructions may be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center by a wired (e.g., coaxial cable, fiber optic, digital subscriber line), or wireless (e.g., infrared, wireless, microwave, etc.). The computer readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server, data center, etc. that contains an integration of one or more available media. The usable medium may be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., solid state disk), etc.
Those of ordinary skill in the art will appreciate that implementing all or part of the above-described method embodiments may be accomplished by a computer program to instruct related hardware, the program may be stored in a computer readable storage medium, and the program may include the above-described method embodiments when executed. And the aforementioned storage medium includes: ROM or random access memory RAM, magnetic or optical disk, etc.
Claims (13)
1. A method of determining the efficiency of a roadside unit, the method comprising:
Acquiring the working state of a first road side unit, wherein the first road side unit is any one of N road side units distributed in sequence in a first driving direction, the first driving direction is the passing direction of a first lane, and the working state of the first road side unit is an on state or an off state;
When the working state of the first road side unit is the on state, distributing all or part of communication demand traffic in target communication demand traffic to the first road side unit, wherein the communication traffic distributed to the first road side unit is smaller than or equal to a first threshold value, the target communication demand traffic is the sum of first accumulated unassigned traffic and first communication demand traffic of traffic flow in the communication coverage area of the first road side unit in a first time period, the first accumulated unassigned traffic is communication demand traffic which is unassigned in the communication demand traffic of traffic flow in the communication coverage area of one or more road side units before the first road side unit in the opposite direction of the first driving direction, and the first threshold value is communication traffic which can be completed maximally in the communication coverage area of the first road side unit;
under the condition that the working state of the first road side unit is the closed state, communication demand flow is not distributed for the first road side unit;
Determining a first combination according to the working state of the first road side unit, wherein the first combination is used for representing a value arrangement of the working state of each road side unit in the N road side units in the first time period;
And determining a first numerical value corresponding to the first combination according to the product of the distribution completion degree of the total communication demand flow and the communication flow transmitted by the N road side units per unit energy consumption, wherein the first numerical value is in direct proportion to the working efficiency of the N road side units, and the total communication demand flow is the sum of the communication demand flows of the traffic flow in the communication coverage area of each road side unit in the N road side units.
2. The method according to claim 1, wherein determining the first value corresponding to the first combination according to a product of a degree of allocation completion of the total communication demand traffic and the communication traffic transmitted by the N roadside units per unit energy consumption includes:
Determining the first value corresponding to a target time, wherein the target time is any preset time in the process of distributing all or part of target communication demand flows to the first road side unit to determine the first combination;
Determining a first loss value corresponding to the target time, wherein the first loss value is 0 when the first accumulated unassigned flow is 0 at the target time, and the first loss value is a preset loss value when the first accumulated unassigned flow is greater than 0 at the target time; and
Determining a corresponding reward value at the target time according to a difference value between a third value and a fourth value, wherein the third value is a product of a first weight and the first value, and the fourth value is a product of a second weight and the first loss value;
Calculating a first long-term rewards value corresponding to the first combination according to a preset discount factor and the rewards value corresponding to each of at least two target moments corresponding to the first combination; the first long-term prize value is proportional to the operating efficiency of the N roadside units.
3. The method of claim 2, wherein the obtaining the operating state of the first roadside unit comprises:
and determining to set the working state of the first road side unit to one of the opening state and the closing state according to the first communication demand flow and/or the first accumulated unassigned flow.
4. A method according to claim 3, wherein said determining to set the operating state of the first road side unit to one of the on state and the off state based on the first communication demand traffic and/or the first accumulated unallocated traffic comprises:
Determining whether the target communication demand flow is greater than a second threshold, the second threshold being determined according to one half of the first threshold;
setting the working state of the first road side unit to be the opening state under the condition that the target communication demand flow is determined to be greater than a second threshold value;
Under the condition that the target communication demand flow is determined to be greater than a second threshold value, respectively attempting to set the working state of the first road side unit as the value combination of the opening state or the closing state, and respectively obtaining two or more corresponding first combinations;
The calculating a first long-term prize value corresponding to the first combination according to a preset discount factor and the prize value corresponding to each of at least two target moments corresponding to the first combination, including:
Determining the first long-term prize value corresponding to each of the two or more first combinations;
determining a maximum value of the first long-term prize values corresponding to each of the two or more first combinations as a target long-term prize value;
and determining the working states of the N road side units in the first time period based on the first combination corresponding to the long-term rewards value.
5. The method according to any one of claims 1 to 4, wherein the allocation completion degree of the total communication demand is a ratio of a sum of communication demand flows allocated to each of the N roadside units to the total communication demand flow rate; the communication flow transmitted by each unit energy consumption of the N road side units is the ratio of the total communication demand flow to the sum of the energy consumption of each of the N road side units.
6. The method according to any one of claims 1 to 4, wherein the first lane belongs to a first road, the first road further comprising at least one second lane, the second lane having a direction of traffic opposite to the direction of traffic of the first lane; the target communication demand flow is a sum of the first accumulated unallocated flow, the first communication demand flow, and a second accumulated unallocated flow, the second accumulated unallocated flow being a communication demand flow that is not allocated to completion among communication demand flows of traffic flows in a communication range of one or more preceding roadside units of the first roadside unit in an opposite direction of a second traveling direction, the second traveling direction being a traveling direction of the second lane.
7. The method of claim 6, wherein the allocating all or a portion of the target communication demand traffic to the first roadside unit and the communication traffic allocated to the first roadside unit is less than or equal to a first threshold comprises:
determining whether the target communication demand flow is less than or equal to the first threshold;
under the condition that the target communication demand flow is less than or equal to the first threshold value, distributing the target communication demand flow to the first road side unit;
And if the target communication demand traffic is determined to be greater than the first threshold, distributing all or part of the target communication demand traffic to the first road side unit according to a strategy that the distributed priority of the first accumulated unassigned traffic is higher than that of the first communication demand traffic, wherein the communication traffic distributed to the first road side unit is equal to the first threshold.
8. The method according to claim 4 or 7, characterized in that the method further comprises:
Determining the first threshold;
the determining the first threshold includes:
When the product of the first residence time length and the communication rate of the first road side unit is smaller than or equal to the maximum bandwidth of the first road side unit, the first threshold value is the product of the first residence time length and the communication rate of the first road side unit; the first stay time is the stay time of the traffic flow in the communication coverage area of the first road side unit;
And under the condition that the product of the first stay time length and the communication rate of the first road side unit is larger than the maximum bandwidth of the first road side unit, the first threshold value is the maximum bandwidth of the first road side unit.
9. The method of claim 8, wherein the method further comprises:
The energy consumption of each of the N roadside units is calculated by:
for an ith road side unit in the N road side units, when the working state of the ith road side unit is the closed state, the energy consumption of the ith road side unit is preset sleep energy consumption, and i is a positive integer greater than or equal to 1 and less than or equal to N;
When the working state of the ith road side unit is the opening state, the energy consumption of the ith road side unit is the sum of the product of the preset communication energy consumption and the use degree of the bandwidth resource of the ith road side unit and the preset basic energy consumption; the using degree of the bandwidth resource of the ith road side unit is the ratio of all communication demand flows distributed to the ith road side unit to the maximum communication flow corresponding to the ith road side unit, the maximum communication flow is determined according to the product of the average stay time of the traffic flow in the first direction in the communication coverage area of the ith road side unit and the communication speed of the ith road side unit, and the maximum communication flow is used for representing the maximum communication flow which can be completed by the traffic flow in the communication coverage area of the ith road side unit.
10. The method of claim 1 or 2, wherein the first communication demand traffic is an average communication demand traffic in communication demand traffic data within a communication coverage area of the first roadside unit for at least two historical time periods corresponding to the first time period, the method further comprising:
Determining that the stay time of traffic flows in at least two historical time periods corresponding to the first time period in the communication coverage area of the first road side unit meets first expected stay time of normal distribution, determining that the communication request times of traffic flows in at least two historical time periods corresponding to the first time period in the communication coverage area of the first road side unit meet first expected request times of poisson distribution, and determining that the communication demand flow of traffic flows in at least two historical time periods corresponding to the first time period in the communication coverage area of the first road side unit meets first expected communication demand flow of normal distribution;
The first communication demand traffic is determined based on a product of the first desired residence time, the first desired number of requests, and the first desired communication demand traffic.
11. An apparatus for determining the efficiency of a roadside unit, the apparatus comprising:
the system comprises an acquisition unit, a first road side unit and a second road side unit, wherein the acquisition unit is used for acquiring the working state of the first road side unit, the first road side unit is any one of N road side units which are sequentially distributed in a first driving direction, the first driving direction is the passing direction of a first lane, and the working state of the first road side unit is an opening state or a closing state;
An allocation unit, configured to allocate all or part of communication demand traffic in a target communication demand traffic to the first road side unit when the working state of the first road side unit is the on state, where the communication demand traffic allocated to the first road side unit is less than or equal to a first threshold, where the target communication demand traffic is a sum of a first accumulated unallocated traffic and a first communication demand traffic of traffic flows in a first time period within a communication coverage area of the first road side unit, and the first accumulated unallocated traffic is a communication demand traffic of traffic flows in a communication demand traffic of one or more road side units preceding the first road side unit in a direction opposite to the first driving direction, and the first threshold is a communication traffic of traffic flows that can be completed maximally within the communication coverage area of the first road side unit; and under the condition that the working state of the first road side unit is the closed state, not distributing communication demand flow for the first road side unit;
The first determining unit is used for determining a first combination according to the working state of the first road side unit, and the first combination is used for representing a value arrangement of the working state of each road side unit in the N road side units in the first time period;
And the second determining unit is used for determining a first numerical value corresponding to the first combination according to the product of the distribution completion degree of the total communication demand flow and the communication flow transmitted by the N road side units per unit energy consumption, wherein the first numerical value is in direct proportion to the working efficiency of the N road side units, and the total communication demand flow is the sum of the communication demand flows of the traffic flow in the communication coverage area of each road side unit in the N road side units.
12. An electronic device, comprising: a memory, a processor, wherein the memory stores program instructions; the program instructions, when executed by the processor, cause the processor to perform the method of any of claims 1 to 10.
13. A computer-readable storage medium, wherein the computer-readable storage medium has a computer program stored therein; the method of any one of claims 1 to 10 being performed when the computer program is run on one or more processors.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202210565601.1A CN115103331B (en) | 2022-05-23 | 2022-05-23 | Method and related device for determining working efficiency of road side unit |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202210565601.1A CN115103331B (en) | 2022-05-23 | 2022-05-23 | Method and related device for determining working efficiency of road side unit |
Publications (2)
Publication Number | Publication Date |
---|---|
CN115103331A CN115103331A (en) | 2022-09-23 |
CN115103331B true CN115103331B (en) | 2024-08-06 |
Family
ID=83289402
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202210565601.1A Active CN115103331B (en) | 2022-05-23 | 2022-05-23 | Method and related device for determining working efficiency of road side unit |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN115103331B (en) |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105809953A (en) * | 2014-12-27 | 2016-07-27 | 吉林大学 | City traffic flow vehicle and road cooperative control method based on M2M |
CN110160804A (en) * | 2019-05-31 | 2019-08-23 | 中国科学院深圳先进技术研究院 | A kind of test method of automatic driving vehicle, apparatus and system |
Family Cites Families (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2017133769A1 (en) * | 2016-02-04 | 2017-08-10 | Nokia Solutions And Networks Oy | Vehicular communication of road traffic status |
CA3049019A1 (en) * | 2017-01-10 | 2018-07-19 | Cavh Llc | Connected automated vehicle highway systems and methods |
CN113744546A (en) * | 2021-09-24 | 2021-12-03 | 安徽达尔智能控制系统股份有限公司 | Signal lamp control method and system of drive test unit based on V2X |
-
2022
- 2022-05-23 CN CN202210565601.1A patent/CN115103331B/en active Active
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105809953A (en) * | 2014-12-27 | 2016-07-27 | 吉林大学 | City traffic flow vehicle and road cooperative control method based on M2M |
CN110160804A (en) * | 2019-05-31 | 2019-08-23 | 中国科学院深圳先进技术研究院 | A kind of test method of automatic driving vehicle, apparatus and system |
Also Published As
Publication number | Publication date |
---|---|
CN115103331A (en) | 2022-09-23 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Iglesias et al. | Data-driven model predictive control of autonomous mobility-on-demand systems | |
Hua et al. | Joint infrastructure planning and fleet management for one-way electric car sharing under time-varying uncertain demand | |
Gusrialdi et al. | Distributed scheduling and cooperative control for charging of electric vehicles at highway service stations | |
Amirgholy et al. | Optimal design of sustainable transit systems in congested urban networks: A macroscopic approach | |
Chen et al. | Managing truck arrivals with time windows to alleviate gate congestion at container terminals | |
CN108346010B (en) | Shared automobile scheduling method based on user demand analysis | |
Tajalli et al. | Distributed optimization and coordination algorithms for dynamic speed optimization of connected and autonomous vehicles in urban street networks | |
CN110555990A (en) | effective parking space-time resource prediction method based on LSTM neural network | |
CN102044149A (en) | City bus operation coordinating method and device based on time variant passenger flows | |
CN114282821B (en) | Scheduling method, system and equipment for shared electric automobile | |
CN115713130B (en) | Vehicle scheduling method based on super-parameter network weight distribution deep reinforcement learning | |
CN113672846A (en) | Network appointment scheduling method and device, electronic equipment and storage medium | |
CN112417753A (en) | Urban public transport resource joint scheduling method | |
CN111882171A (en) | Intelligent scheduling system and method for scenic spot sightseeing vehicle based on demand prediction | |
Guo et al. | Rebalancing and charging scheduling with price incentives for car sharing systems | |
Wirasinghe | Initial planning for urban transit systems | |
CN116090646A (en) | Optimal berth solving method and parking guiding system for indoor parking lot | |
CN115359659A (en) | Lane opening and closing configuration method and system | |
Wang et al. | Towards accessible shared autonomous electric mobility with dynamic deadlines | |
Xu et al. | Research on parking service optimization based on permit reservation and allocation | |
Lai et al. | A rolling-horizon decision framework for integrating relocation and user flexibility in one-way electric carsharing systems | |
CN112750298B (en) | Truck formation dynamic resource allocation method based on SMDP and DRL | |
CN115103331B (en) | Method and related device for determining working efficiency of road side unit | |
Sayarshad | Designing intelligent public parking locations for autonomous vehicles | |
CN114418271A (en) | Shared bicycle scheduling system and method based on incentive users |
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 |