CN111429715B - Information processing method, device and computer readable storage medium - Google Patents

Information processing method, device and computer readable storage medium Download PDF

Info

Publication number
CN111429715B
CN111429715B CN201910023414.9A CN201910023414A CN111429715B CN 111429715 B CN111429715 B CN 111429715B CN 201910023414 A CN201910023414 A CN 201910023414A CN 111429715 B CN111429715 B CN 111429715B
Authority
CN
China
Prior art keywords
phase
intersection
time
green light
green
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
Application number
CN201910023414.9A
Other languages
Chinese (zh)
Other versions
CN111429715A (en
Inventor
张茂雷
吴田田
王磊
张辉
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Alibaba Group Holding Ltd
Original Assignee
Alibaba Group Holding Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Alibaba Group Holding Ltd filed Critical Alibaba Group Holding Ltd
Priority to CN201910023414.9A priority Critical patent/CN111429715B/en
Priority to PCT/CN2020/070056 priority patent/WO2020143519A1/en
Publication of CN111429715A publication Critical patent/CN111429715A/en
Application granted granted Critical
Publication of CN111429715B publication Critical patent/CN111429715B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G08SIGNALLING
    • G08GTRAFFIC CONTROL SYSTEMS
    • G08G1/00Traffic control systems for road vehicles
    • G08G1/01Detecting movement of traffic to be counted or controlled
    • G08G1/0104Measuring and analyzing of parameters relative to traffic conditions
    • G08G1/0137Measuring and analyzing of parameters relative to traffic conditions for specific applications
    • G08G1/0145Measuring and analyzing of parameters relative to traffic conditions for specific applications for active traffic flow control
    • GPHYSICS
    • G08SIGNALLING
    • G08GTRAFFIC CONTROL SYSTEMS
    • G08G1/00Traffic control systems for road vehicles
    • G08G1/01Detecting movement of traffic to be counted or controlled
    • GPHYSICS
    • G08SIGNALLING
    • G08GTRAFFIC CONTROL SYSTEMS
    • G08G1/00Traffic control systems for road vehicles
    • G08G1/07Controlling traffic signals

Landscapes

  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Chemical & Material Sciences (AREA)
  • Analytical Chemistry (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The embodiment of the invention provides an information processing method, an information processing device and a computer readable storage medium. The method comprises the following steps: determining total green light loss time of the intersection; determining the total traffic supply and demand intensity of the intersection according to the total green light loss time; and calculating the green time of each phase of the intersection according to the total traffic supply and demand intensity and the preset signal period of the intersection. According to the embodiment of the invention, the reasonable green time of the intersection can be calculated according to the actual traffic demand of the intersection.

Description

Information processing method, device and computer readable storage medium
Technical Field
The present invention relates to the field of traffic control technologies, and in particular, to an information processing method, an information processing apparatus, and a computer-readable storage medium.
Background
The effective control of signal lamps at intersections is an important direction in the field of traffic control, and especially at intersections with large traffic flow and complex traffic conditions, the effective control of signal lamps becomes more important. Therefore, the improvement of the control effectiveness of the intersection signal lamps is of great significance.
In the prior art, when controlling a traffic signal lamp at an intersection, the phase to-be-adjusted split time at the intersection is determined according to the acquired section flow in the green period of the intersection, that is, the number of vehicles passing through a stop line in the green period is acquired, and the phase to-be-adjusted split time at the intersection is fed back to the traffic signal lamp at the intersection, so that the feedback control of the traffic signal lamp at the intersection is realized.
However, when the road is heavily congested, the number of vehicles capable of passing through during the green light period of the intersection is small, the section flow obtained in the scheme cannot truly reflect the actual traffic demand of the intersection, and accordingly, the green ratio time of each phase calculated according to the section flow does not meet the actual demand. Accordingly, the inventors have recognized a need for improvement in relation to at least one of the problems with the prior art discussed above.
Disclosure of Invention
An object of the embodiments of the present invention is to provide a new technical solution for information processing.
According to a first aspect of embodiments of the present invention, there is provided an information processing method, the method including:
determining total green light loss time of the intersection;
determining the total traffic supply and demand intensity of the intersection according to the total green light loss time;
and calculating the green time of each phase of the intersection according to the total traffic supply and demand intensity and the preset signal period of the intersection.
Optionally, the determining the total green light loss time of the intersection includes:
acquiring green light loss time of each phase of the intersection;
and determining the sum of the green light loss time of each phase as the total green light loss time of the intersection.
Optionally, the determining the total traffic supply and demand intensity at the intersection according to the total green light loss time includes:
acquiring a historical signal period of the intersection, actual traffic demands of each phase of the intersection and saturation flow rates of each phase of the intersection;
respectively calculating the traffic supply and demand intensity of each phase of the intersection according to the historical signal period, the total green light loss time, the actual traffic demand of each phase of the intersection and the saturation flow rate of each phase of the intersection;
and determining the sum of the traffic supply and demand strength of each phase of the intersection as the total traffic supply and demand strength of the intersection.
Optionally, the step of calculating the traffic demand intensity of each phase of the intersection according to the historical signal period, the total green light loss time, the actual traffic demand of each phase of the intersection, and the saturation flow rate of each phase of the intersection includes:
according to the formula
Figure BDA0001941612880000021
Calculating to obtain the traffic supply and demand intensity of the phase j
Figure BDA0001941612880000022
Wherein the content of the first and second substances,
Figure BDA0001941612880000023
the actual traffic demand, S, representing phase jjSaid saturated flow rate, T, representing the phase jcycleIs representative of the period of the historical signal,
Figure BDA0001941612880000024
representing the total green light lost time.
Optionally, the step of calculating the green time of each phase at the intersection according to the total traffic supply and demand intensity and the preset signal period at the intersection includes:
according to the formula
Figure BDA0001941612880000025
Calculating the green time of phase j
Figure BDA0001941612880000026
Wherein the content of the first and second substances,
Figure BDA0001941612880000027
is representative of the period of the said pre-set signal,
Figure BDA0001941612880000028
the traffic supply and demand intensity representing phase j,
Figure BDA0001941612880000029
and representing the total traffic supply and demand intensity of m phases at the intersection.
Optionally, the method further includes:
determining the phase position of the green light time needing to be increased and the phase position of the green light time needing to be compressed;
and adjusting the green time of each phase according to a preset adjusting mode.
Optionally, the step of determining the phase of the green time to be increased and the phase of the green time to be compressed includes:
comparing the green light time of each phase with the corresponding minimum green light time respectively; wherein the minimum green light time is preset according to the intersection requirement;
determining the phase of the green light time smaller than the corresponding minimum green light time as the phase of the green light time needing to be increased;
and determining the phase of the green light time which is greater than or equal to the corresponding minimum green light time as the phase of the green light time needing to be compressed.
Optionally, the step of adjusting the green time of each phase according to a preset adjustment manner includes:
according to the formula
Figure BDA0001941612880000031
Calculating the total increase of the green time of the phase needing to increase the green time
Figure BDA0001941612880000032
Where n represents the number of phases that require an increase in green time,
Figure BDA0001941612880000033
represents the minimum green time for phase k,
Figure BDA0001941612880000034
which is representative of the period of the preset signal,
Figure BDA0001941612880000035
the traffic supply and demand strength of phase k is represented,
Figure BDA0001941612880000036
representing the total traffic supply and demand intensity of m phases of the intersection;
according to the formula
Figure BDA0001941612880000037
Calculating a green light time compression amount DeltaT of each phase of the green light time to be compressedj,adjust-(ii) a Wherein, the first and the second end of the pipe are connected with each other,
Figure BDA0001941612880000038
representing the minimum green time for phase j,
Figure BDA0001941612880000039
a total compression amount of the green light time representing m-n phases of the green light time that needs to be compressed,
Figure BDA00019416128800000310
indicating the total increase in green light time,
Figure BDA00019416128800000311
a green time representing phase j;
according to the formula
Figure BDA00019416128800000312
And calculating to obtain m-n new green light time corresponding to the phase of the green light time needing to be compressed.
Optionally, after the step of calculating the green time of each phase of the intersection, the method further includes:
and adjusting the green time of the corresponding phase in the traffic signal lamp according to the calculated green time of each phase at the intersection.
According to a second aspect of the embodiments of the present invention, there is provided an information processing apparatus including:
the first determining module is used for determining total green light loss time of the intersection;
the second determining module is used for determining the total traffic supply and demand intensity of the intersection according to the total green light loss time;
and the calculation module is used for calculating and obtaining the green light time of each phase of the intersection according to the total traffic supply and demand intensity and the preset signal period of the intersection.
According to a third aspect of embodiments of the present invention, there is provided an information processing apparatus including a memory for storing instructions and a processor; the instructions are configured to control the processor to operate so as to execute the information processing method according to any one of the first aspect of the embodiments of the present invention.
According to a fourth aspect of embodiments of the present invention, there is provided a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the information processing method according to any one of the first aspect of embodiments of the present invention.
According to one embodiment of the invention, the reasonable split can be calculated according to the actual traffic demand of the intersection.
Other features of the present invention and advantages thereof will become apparent from the following detailed description of exemplary embodiments thereof, which proceeds with reference to the accompanying drawings.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description, serve to explain the principles of the invention.
Fig. 1 shows a schematic flow chart of a first embodiment of an information processing method provided by the present invention.
Fig. 2 shows a schematic flow chart of a second embodiment of the information processing method provided by the present invention.
Fig. 3 shows a schematic flow chart of an example of embodiment of the invention.
Fig. 4 shows a schematic block diagram of an information processing apparatus according to a first embodiment of the present invention.
FIG. 5 is a schematic block diagram showing an information processing apparatus according to a second embodiment of the present invention
Detailed Description
Various exemplary embodiments of the present invention will now be described in detail with reference to the accompanying drawings. It should be noted that: the relative arrangement of the components and steps, the numerical expressions and numerical values set forth in these embodiments do not limit the scope of the present invention unless it is specifically stated otherwise.
The following description of at least one exemplary embodiment is merely illustrative in nature and is in no way intended to limit the invention, its application, or uses.
Techniques, methods, and apparatus known to one of ordinary skill in the relevant art may not be discussed in detail but are intended to be part of the specification where appropriate.
In all examples shown and discussed herein, any particular value should be construed as merely illustrative, and not limiting. Thus, other examples of the exemplary embodiments may have different values.
It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, further discussion thereof is not required in subsequent figures.
Various embodiments and examples according to embodiments of the present invention are described below with reference to the accompanying drawings.
< method >
Fig. 1 shows a schematic flow chart of a first embodiment of the information processing method of the present invention.
The information processing method provided in this embodiment may be specifically implemented by a server device, for example, a server.
As shown in FIG. 1, at step 1100, a total green light loss time for an intersection is determined.
The green light loss time refers to a time that cannot be used by traffic, that is, a time that any traffic cannot obtain right of way, in one signal period.
The signal timing of a set of green, yellow, and red light changes assigned to one or more individual traffic at an intersection in one signal cycle is called the phase of the intersection, and typically, an intersection has multiple phases. There may be green lamp lost time for each phase.
In the step, to determine the green light loss time of the intersection, the green light loss time of each phase of the intersection needs to be obtained first; and determining the sum of the green light loss time of each phase as the total green light loss time of the intersection.
In step 1200, the total traffic supply and demand intensity of the intersection is determined according to the total green light loss time.
Specifically, the total traffic supply and demand intensity of the intersection can be calculated according to the traffic engineering signal control principle. First, the historical signal period of the intersection, the actual traffic demand of each phase of the intersection, and the saturation flow rate of each phase of the intersection need to be obtained.
The saturation flow rate refers to the maximum flow a lane or group of lanes can pass during a green light. When the actual traffic demand and the saturation flow rate of each phase of the intersection are obtained, key lanes in each phase of the intersection are respectively determined, the saturation flow rate of the key lane is used as the saturation flow rate of the phase, and the actual traffic demand of the key lane is used as the actual traffic demand of the phase.
The key lane is the lane with the largest actual traffic demand in the phase. The actual traffic demand of a lane is calculated by detecting the passing data of the lane, the signal timing scheme executed historically, the length of the lane queue, the number of times the lane is parked and the minimum green time.
After the historical signal period of the intersection, the actual traffic demand of each phase of the intersection and the saturation flow rate of each phase of the intersection are obtained, the traffic supply and demand intensity of each phase of the intersection is calculated according to the historical signal period, the total green light loss time, the actual traffic demand of each phase of the intersection and the saturation flow rate of each phase of the intersection.
In particular according to the formula
Figure BDA0001941612880000061
Calculating to obtain the traffic supply and demand strength of the phase j
Figure BDA0001941612880000062
Wherein, the first and the second end of the pipe are connected with each other,
Figure BDA0001941612880000063
representing said actual traffic demand, S, of phase jjSaid saturated flow rate, T, representing the phase jcycleIs representative of the period of the history signal,
Figure BDA0001941612880000064
representing the total green light lost time.
Then, the traffic supply and demand intensity of each phase of the intersection is summed and calculated, and the sum of the traffic supply and demand intensity of each phase of the intersection is determined as the total traffic supply and demand intensity I of the intersectioninter
That is to say that the temperature of the molten steel,
Figure BDA0001941612880000065
after determining the total traffic supply and demand intensity of the intersection, the method proceeds to step 1300, and the green light time of each phase of the intersection is calculated according to the total traffic supply and demand intensity and the preset signal period of the intersection.
According to the formula
Figure BDA0001941612880000066
Calculating the green time of phase j
Figure BDA0001941612880000067
Wherein, the first and the second end of the pipe are connected with each other,
Figure BDA0001941612880000068
which is representative of the period of the preset signal,
Figure BDA0001941612880000069
the traffic supply and demand strength representing the phase j,
Figure BDA0001941612880000071
and representing the total traffic supply and demand intensity of m phases at the intersection.
The information processing method of the present embodiment has been described above with reference to fig. 1. In this embodiment, when the green time of each phase at the intersection is calculated, the reasonable green time at the intersection is calculated by combining the actual traffic demand at the intersection.
On the basis of the foregoing embodiment, after step 1300, as shown in fig. 2, the information processing method provided in the embodiment of the present invention may further include:
at step 2100, the phase requiring an increase in green time and the phase requiring a compression of green time are determined.
Specifically, the green time of each phase at the intersection is compared with the corresponding minimum green time. Wherein, the minimum green time is preset according to the intersection requirement. If the green time of the phase is less than the corresponding minimum green time, which indicates that the calculated green time of the phase cannot meet the actual requirement of the intersection, secondary calculation needs to be performed on the green time of each phase of the intersection.
It should be noted that, in this embodiment, in order to ensure that the preset signal period required by the intersection is not changed, the increase amount of the green time in the phase that needs to increase the green time needs to be compressed and shared from other phases.
Therefore, the phase in which the green light time is less than the corresponding minimum green light time is determined as the phase in which the green light time needs to be increased; and determining the phase of the green light time which is greater than or equal to the corresponding minimum green light time as the phase of the green light time needing to be compressed.
In step 2200, the green time of each phase is adjusted according to a preset adjustment manner.
And adjusting the green time of the phase of which the green time is less than the corresponding minimum green time to the minimum green time corresponding to the phase, and then calculating the green time compression amount of each phase needing to compress the green time.
Specifically, the formula is firstly determined
Figure BDA0001941612880000072
Calculating the total increase of the green time of the phase needing to increase the green time
Figure BDA0001941612880000073
Where n represents the number of phases that require an increase in green time,
Figure BDA0001941612880000074
representing said phase k corresponds toThe time of the minimum green light is,
Figure BDA0001941612880000075
is representative of the period of the said pre-set signal,
Figure BDA0001941612880000076
the intensity of the traffic demand for phase k is represented,
Figure BDA0001941612880000077
and representing the total traffic supply and demand intensity of m phases at the intersection.
Then according to the formula
Figure BDA0001941612880000081
Calculating a green light time compression amount DeltaT of each phase of the green light time to be compressedj,adjust-
Wherein, the first and the second end of the pipe are connected with each other,
Figure BDA0001941612880000082
representing the minimum green time for phase j,
Figure BDA0001941612880000083
the total compression of the green time representing the m-n phases of the green time that needs to be compressed,
Figure BDA0001941612880000084
indicating the total increase in the green light time,
Figure BDA0001941612880000085
indicating the green time for phase j.
According to the formula
Figure BDA0001941612880000086
And calculating to obtain m-n new green light time corresponding to the phase of the green light time needing to be compressed.
And after the new green light time corresponding to each phase of the intersection is obtained through calculation, the green light time of the corresponding phase in the traffic signal lamp is adjusted according to the green light time of each phase of the intersection obtained through calculation, so that the green light time meets the actual traffic requirement of the intersection.
The information processing method of the present embodiment has been described above with reference to fig. 2. In this embodiment, the reasonable green time at the intersection can be calculated according to the actual traffic demand at the intersection, and the secondary calculation of the green time can be performed when the calculated green time does not meet the minimum green time requirement in combination with the minimum green time requirement at the intersection, so that the calculation result meets the minimum green time requirement at the intersection.
< example >
Fig. 3 shows a schematic flow chart of an example of embodiment of the invention.
In this example, assume that the intersection contains M phases.
As shown in FIG. 3, at step 3100, phase is takenjMiddle actual traffic demand diMaximum lane as phasejBy phase ofjThe actual traffic demand of the key lane as the phasejActual traffic demand of
Figure BDA0001941612880000087
That is to say that the temperature of the molten steel,
Figure BDA0001941612880000088
taking the saturation flow rate of the key lane as the phasejSaturation flow rate S ofjThe green light loss time of the key lane is used as the phasejGreen light loss time Δ lj
The actual traffic demand of the lane is calculated by detecting the vehicle passing data of the lane, a signal timing scheme executed historically, the lane queuing length, the lane parking times and the minimum green time.
In step 3200, the total green light loss time Δ L for each cycle of the intersection is calculated.
In particular, the green light loss times of M phases of the intersection are summed, i.e.
Figure BDA0001941612880000091
In step 3300, according to the traffic engineering signal control principle, the traffic supply and demand intensity of M phases at the intersection is calculated
Figure BDA0001941612880000092
That is to say that the first and second electrodes,
Figure BDA0001941612880000093
wherein the content of the first and second substances,
Figure BDA0001941612880000094
representing said actual traffic demand, S, of phase jjSaid saturated flow rate, T, representing phase jcycleIs representative of the period of the historical signal,
Figure BDA0001941612880000095
representing the total green light lost time.
Calculating the traffic supply and demand intensity of M phases
Figure BDA0001941612880000096
Then, calculating the total traffic supply and demand intensity I of the intersectioninter
That is to say that the first and second electrodes,
Figure BDA0001941612880000097
at step 3400, according to the traffic supply and demand intensity of the M phases and the preset signal period of the intersection, calculating the green time of the M phases at the intersection
Figure BDA0001941612880000098
In particular, the method comprises the following steps of,
Figure BDA0001941612880000099
wherein, the first and the second end of the pipe are connected with each other,
Figure BDA00019416128800000910
indicating a predetermined signal periodIn the period of time of the first stage,
Figure BDA00019416128800000911
the traffic supply and demand strength of the phase j is represented,
Figure BDA00019416128800000912
and the total traffic supply and demand intensity of M phases at the intersection is represented.
According to the steps 3100 to 3400, the reasonable split can be calculated according to the actual traffic demand of the intersection.
Further, after calculating the green time of each phase at the intersection, step 3500 is entered, if it is determined that the green time of a phase is less than the minimum green time required at the intersection, that is,
Figure BDA00019416128800000913
the green time of each phase is calculated twice according to the minimum green time.
Namely, the green time of each phase is compared with the corresponding minimum green time to determine the phase needing to increase the green time and the phase needing to compress the green time, and the green time of each phase at the intersection is adjusted according to a preset adjusting mode.
Specifically, the green light time of the phase requiring the increase in the green light time is adjusted to the minimum green light time, that is,
Figure BDA00019416128800000914
assuming that N phases are phases needing to increase the green time, calculating the total increase of the green time of the N phases at the intersection according to a formula
Figure BDA0001941612880000101
Figure BDA0001941612880000102
Where n represents the number of phases requiring an increase in green time,
Figure BDA0001941612880000103
Represents the minimum green time for phase k,
Figure BDA0001941612880000104
is representative of the period of the said pre-set signal,
Figure BDA0001941612880000105
the intensity of the traffic demand for phase k is represented,
Figure BDA0001941612880000106
and representing the total traffic supply and demand intensity of m phases at the intersection.
In order to ensure the preset signal period required by the intersection
Figure BDA0001941612880000107
And invariably, the total increase of the green light time of the above N phases needs to be compressed and shared from other M-N phases.
Specifically, the green light time compression quantity delta T of M-N phases needing green light time compression is obtained by respectively calculating according to a formulaj,adjust-
Figure BDA0001941612880000108
Wherein, the first and the second end of the pipe are connected with each other,
Figure BDA0001941612880000109
represents the minimum green time for phase j,
Figure BDA00019416128800001010
the total compression of the green time representing the m-n phases of the green time that needs to be compressed,
Figure BDA00019416128800001011
indicating the total increase in the green light time,
Figure BDA00019416128800001012
indicating the green time for phase j.
Then, after recalculation, the green time of M-N phases
Figure BDA00019416128800001013
Comprises the following steps:
Figure BDA00019416128800001014
according to
Figure BDA00019416128800001015
And adjusting the green time of the phase j in the traffic signal lamp.
The information processing method provided by the embodiment in combination with the attached drawings can calculate the reasonable green time of the intersection according to the actual traffic demand of the intersection, and can perform secondary calculation of the green time when the calculated green time does not meet the demand of the minimum green time in combination with the demand of the intersection on the minimum green time, so that the calculation result meets the demand of the minimum green time of the intersection.
< information processing apparatus >
Those skilled in the art should understand that, in the electronic technology field, the method described above can be embodied in products by software, hardware and a combination of software and hardware, and those skilled in the art can easily generate an information processing apparatus based on the method of the above embodiment of the invention, the information processing apparatus including modules for performing the respective operations in the information processing method according to the above embodiment.
Fig. 4 shows a schematic block diagram of an information processing apparatus according to a first embodiment of the present invention.
For example, as shown in fig. 4, the information processing apparatus 4000 includes: a first determining module 4100, a second determining module 4200, and a calculating module 4300.
Wherein, the first determining module 4100 is configured to determine a total green light loss time of the intersection; the second determining module 4200 is configured to determine the total traffic supply and demand intensity of the intersection according to the total green light loss time; the calculation module 4300 is configured to calculate a green time of each phase of the intersection according to the total traffic supply and demand intensity and the preset signal period of the intersection.
Specifically, the first determining module 4100 is configured to obtain green light loss time of each phase at the intersection; and determining the sum of the green light loss time of each phase as the total green light loss time of the intersection.
The second determining module 4200 is specifically configured to obtain a historical signal period of the intersection, actual traffic demand and saturation flow rate of each phase of the intersection; respectively calculating the traffic supply and demand intensity of each phase of the intersection according to the historical signal period, the total green light loss time, the actual traffic demand of each phase of the intersection and the saturation flow rate of each phase of the intersection; and determining the sum of the traffic supply and demand strength of each phase of the intersection as the total traffic supply and demand strength of the intersection.
The second determining module 4200 may specifically calculate the traffic demand intensity of each phase according to a formula
Figure BDA0001941612880000111
Calculating to obtain the traffic supply and demand strength of the phase j
Figure BDA0001941612880000112
Wherein, the first and the second end of the pipe are connected with each other,
Figure BDA0001941612880000113
the actual traffic demand, S, representing phase jjSaid saturated flow rate, T, representing phase jcycleIs representative of the period of the history signal,
Figure BDA0001941612880000114
representing the total green light lost time.
In practical applications, the calculating module 4300 is specifically used for calculating according to a formula
Figure BDA0001941612880000115
Calculating the green time of phase j
Figure BDA0001941612880000116
Wherein, the first and the second end of the pipe are connected with each other,
Figure BDA0001941612880000117
which is representative of the period of the preset signal,
Figure BDA0001941612880000118
the traffic supply and demand intensity representing phase j,
Figure BDA0001941612880000119
and representing the total traffic supply and demand intensity of m phases at the intersection.
Further, the information processing apparatus 4000 may further include a third determining module and an adjusting module (not shown in the figure). The third determining module is used for determining the phase of the green light time needing to be increased and the phase of the green light time needing to be compressed; the adjusting module is used for adjusting the green time of each phase according to a preset adjusting mode.
Specifically, when determining the phase in which the green light time needs to be increased and the phase in which the green light time needs to be compressed, the third determining module compares the green light time of each phase with the corresponding minimum green light time. And determining the phase of which the green light time is less than the corresponding minimum green light time as the phase of which the green light time needs to be increased. And determining the phase of the green light time which is greater than or equal to the corresponding minimum green light time as the phase of the green light time needing to be compressed.
And after the third determining module determines the phase needing to increase the green light time and the phase needing to compress the green light time, triggering the adjusting module to adjust the green light time of each phase according to a preset adjusting mode.
Specifically, the adjusting module calculates the total increase of the green time of the phase position needing to increase the green time according to the following formula
Figure BDA0001941612880000121
Figure BDA0001941612880000122
Where n represents the number of phases that require an increase in green time,
Figure BDA0001941612880000123
represents the minimum green time for phase k,
Figure BDA0001941612880000124
is representative of the period of the said pre-set signal,
Figure BDA0001941612880000125
the traffic supply and demand strength of phase k is represented,
Figure BDA0001941612880000126
and representing the total traffic supply and demand intensity of m phases at the intersection.
Meanwhile, the adjusting module calculates the green light time compression amount delta T of the phase of each green light time needing to be compressed according to the following formulaj,adjust-
Figure BDA0001941612880000127
Wherein, the first and the second end of the pipe are connected with each other,
Figure BDA0001941612880000128
represents the minimum green time for phase j,
Figure BDA0001941612880000129
the total compression of the green time representing the m-n phases of the green time that needs to be compressed,
Figure BDA00019416128800001210
indicating the total increase in the green light time,
Figure BDA00019416128800001211
indicating the green time for phase j.
The adjusting module respectively obtains the total increment of the green light time
Figure BDA00019416128800001212
And green time compression amount delta Tj,adjust-Then according to the formula
Figure BDA00019416128800001213
And calculating to obtain m-n new green light time corresponding to the phase of the green light time needing to be compressed.
Furthermore, the adjusting module can be further configured to adjust the green time of the corresponding phase in the traffic signal lamp according to the calculated green time of each phase at the intersection.
The information processing apparatus of this embodiment may be configured to execute the technical solutions of the above method embodiments, and the implementation principles and technical effects thereof are similar, and are not described herein again.
In addition, fig. 5 shows a schematic block diagram of an information processing apparatus according to a second embodiment of the present invention.
As shown in fig. 5, the information processing apparatus 5000 includes a memory 5200 and a processor 5100. The memory 5200 is used for storing instructions for controlling the processor 5100 to operate to execute any one of the information processing methods provided by the embodiments of the present invention. The skilled person can design the instructions according to the disclosed solution. How the instructions control the operation of the processor is well known in the art and will not be described in detail here.
< computer-readable storage Medium >
In the present embodiment, there is also provided a computer-readable storage medium storing a computer program which, when executed by a processor, implements any one of the information processing methods provided in the above embodiments.
It is well known to those skilled in the art that with the development of electronic information technology such as large scale integrated circuit technology and the trend of software hardware, it has been difficult to clearly divide the software and hardware boundaries of a computer system. As any of the operations may be implemented in software or hardware. Execution of any of the instructions may be performed by hardware, as well as by software. Whether a hardware implementation or a software implementation is employed for a certain machine function depends on non-technical factors such as price, speed, reliability, storage capacity, change period, and the like. A software implementation and a hardware implementation are equivalent for the skilled person. The skilled person can choose software or hardware to implement the above described scheme as desired. Therefore, specific software or hardware is not limited herein.
The present invention may be an apparatus, method, and/or computer program product. The computer program product may include a computer-readable storage medium having computer-readable program instructions embodied therewith for causing a processor to implement various aspects of the present invention.
The computer readable storage medium may be a tangible device that can hold and store the instructions for use by the instruction execution device. The computer readable storage medium may be, for example, but not limited to, an electronic memory device, a magnetic memory device, an optical memory device, an electromagnetic memory device, a semiconductor memory device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a Static Random Access Memory (SRAM), a portable compact disc read-only memory (CD-ROM), a Digital Versatile Disc (DVD), a memory stick, a floppy disk, a mechanical encoding device, such as punch cards or in-groove raised structures having instructions stored thereon, and any suitable combination of the foregoing. Computer-readable storage media as used herein is not to be interpreted as a transitory signal per se, such as a radio wave or other freely propagating electromagnetic wave, an electromagnetic wave propagating through a waveguide or other transmission medium (e.g., optical pulses through a fiber optic cable), or an electrical signal transmitted through an electrical wire.
The computer-readable program instructions described herein may be downloaded from a computer-readable storage medium to a respective computing/processing device, or to an external computer or external storage device over a network, such as the internet, a local area network, a wide area network, and/or a wireless network. The network may include copper transmission cables, fiber optic transmission, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. The network adapter card or network interface in each computing/processing device receives the computer-readable program instructions from the network and forwards the computer-readable program instructions for storage in a computer-readable storage medium in the respective computing/processing device.
Computer program instructions for carrying out operations of the present invention may be assembler instructions, Instruction Set Architecture (ISA) instructions, machine-related instructions, microcode, firmware instructions, state setting data, or source or object code in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider). In some embodiments, aspects of the present invention are implemented by personalizing an electronic circuit, such as a programmable logic circuit, a Field Programmable Gate Array (FPGA), or a Programmable Logic Array (PLA), with state information of computer-readable program instructions, which can execute the computer-readable program instructions.
Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer readable program instructions.
These computer-readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer-readable program instructions may also be stored in a computer-readable storage medium that can direct a computer, programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer-readable medium storing the instructions comprises an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer, other programmable apparatus or other devices implement the functions/acts specified in the flowchart and/or block diagram block or blocks.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions. It is well known to those skilled in the art that implementation by hardware, by software, and by a combination of software and hardware are equivalent.
Having described embodiments of the present invention, the foregoing description is intended to be exemplary, not exhaustive, and not limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terminology used herein is chosen in order to best explain the principles of the embodiments, the practical application, or improvements made to the technology in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein. The scope of the invention is defined by the appended claims.

Claims (10)

1. An information processing method, characterized in that the method comprises:
determining total green light loss time of the intersection;
determining the total traffic supply and demand intensity of the intersection according to the total green light loss time;
calculating to obtain the green time of each phase of the intersection according to the total traffic supply and demand intensity and the preset signal period of the intersection;
the determining of the total green light loss time of the intersection comprises:
acquiring green light loss time of each phase of the intersection;
determining the sum of the green light loss time of each phase as the total green light loss time of the intersection;
the determining the total traffic supply and demand intensity of the intersection according to the total green light loss time comprises the following steps:
acquiring a historical signal period of the intersection, actual traffic demands of each phase of the intersection and saturation flow rates of each phase of the intersection;
respectively calculating the traffic supply and demand intensity of each phase of the intersection according to the historical signal period, the total green light loss time, the actual traffic demand of each phase of the intersection and the saturation flow rate of each phase of the intersection;
and determining the sum of the traffic supply and demand strength of each phase of the intersection as the total traffic supply and demand strength of the intersection.
2. The method of claim 1, wherein said step of calculating said traffic demand intensity for each phase of said intersection based on said historical signal periods, said total green light loss time, actual traffic demand for each phase of said intersection, and saturation flow rate for each phase of said intersection comprises:
according to the formula
Figure FDA0003582548250000011
Calculating to obtain the traffic supply and demand intensity of the phase j
Figure FDA0003582548250000012
Wherein, the first and the second end of the pipe are connected with each other,
Figure FDA0003582548250000013
the actual traffic demand, S, representing phase jjSaid saturated flow rate, T, representing the phase jcycleIs representative of the period of the history signal,
Figure FDA0003582548250000021
representing the total green light lost time.
3. The method of claim 2, wherein the step of calculating the green time of each phase of the intersection according to the total traffic supply and demand intensity and the preset signal period of the intersection comprises:
according to the formula
Figure FDA0003582548250000022
Calculating the green time of phase j
Figure FDA0003582548250000023
Wherein the content of the first and second substances,
Figure FDA0003582548250000024
is representative of the period of the said pre-set signal,
Figure FDA0003582548250000025
the traffic supply and demand strength representing the phase j,
Figure FDA0003582548250000026
and representing the total traffic supply and demand intensity of m phases at the intersection.
4. The method of claim 1, further comprising:
determining a phase in which the green light time needs to be increased and a phase in which the green light time needs to be compressed;
and adjusting the green time of each phase according to a preset adjustment mode.
5. The method of claim 4, wherein the step of determining the phase at which the green time needs to be increased and the phase at which the green time needs to be compressed comprises:
comparing the green light time of each phase with the corresponding minimum green light time respectively; the minimum green light time is preset according to the intersection requirement;
determining the phase in which the green light time is less than the corresponding minimum green light time as the phase in which the green light time needs to be increased;
and determining the phase of the green light time which is greater than or equal to the corresponding minimum green light time as the phase of the green light time needing to be compressed.
6. The method of claim 5, wherein the step of adjusting the green time of each phase according to the preset adjustment comprises:
according to the formula
Figure FDA0003582548250000031
Calculating the total increase of the green time of the phase needing to increase the green time
Figure FDA0003582548250000032
Where n represents the number of phases that require an increase in green time,
Figure FDA0003582548250000033
represents the minimum green time for phase k,
Figure FDA0003582548250000034
which is representative of the period of the preset signal,
Figure FDA0003582548250000035
the traffic supply and demand strength of phase k is represented,
Figure FDA0003582548250000036
representing the total traffic supply and demand intensity of m phases at the intersection;
according to the formula
Figure FDA0003582548250000037
Calculating a green time compression amount Delta T of each phase of the green time to be compressedj,adjust-(ii) a Wherein, the first and the second end of the pipe are connected with each other,
Figure FDA0003582548250000038
representing the minimum green time for phase j,
Figure FDA0003582548250000039
the total compression of the green time representing the m-n phases of the green time that needs to be compressed,
Figure FDA00035825482500000310
indicating the total increase in the green light time,
Figure FDA00035825482500000311
a green time representing phase j;
according to the formula
Figure FDA00035825482500000312
And calculating to obtain m-n new green light time corresponding to the phase of the green light time needing to be compressed.
7. The method of claim 1, wherein after the step of calculating the green time for each phase of the intersection, the method further comprises:
and adjusting the green time of the corresponding phase in the traffic signal lamp according to the calculated green time of each phase at the intersection.
8. An information processing apparatus characterized by comprising:
the first determining module is used for determining total green light loss time of the intersection;
the determining of the total green light loss time of the intersection comprises the following steps:
acquiring green light loss time of each phase of the intersection;
determining the sum of the green light loss time of each phase as the total green light loss time of the intersection;
the second determining module is used for determining the total traffic supply and demand intensity of the intersection according to the total green light loss time;
the determining the total traffic supply and demand intensity of the intersection according to the total green light loss time comprises the following steps:
acquiring a historical signal period of the intersection, actual traffic demands of each phase of the intersection and saturation flow rate of each phase of the intersection;
respectively calculating the traffic supply and demand intensity of each phase of the intersection according to the historical signal period, the total green light loss time, the actual traffic demand of each phase of the intersection and the saturation flow rate of each phase of the intersection;
determining the sum of the traffic supply and demand intensity of each phase of the intersection as the total traffic supply and demand intensity of the intersection;
and the calculating module is used for calculating the green light time of each phase of the intersection according to the total traffic supply and demand intensity and the preset signal period of the intersection.
9. An information processing apparatus comprising a memory for storing instructions and a processor; the instructions are for controlling the processor to operate so as to carry out the information processing method according to any one of claims 1 to 7.
10. A computer-readable storage medium, characterized in that a computer program is stored thereon, which, when being executed by a processor, implements the information processing method according to any one of claims 1 to 7.
CN201910023414.9A 2019-01-10 2019-01-10 Information processing method, device and computer readable storage medium Active CN111429715B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201910023414.9A CN111429715B (en) 2019-01-10 2019-01-10 Information processing method, device and computer readable storage medium
PCT/CN2020/070056 WO2020143519A1 (en) 2019-01-10 2020-01-02 Information processing method and device, and computer readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910023414.9A CN111429715B (en) 2019-01-10 2019-01-10 Information processing method, device and computer readable storage medium

Publications (2)

Publication Number Publication Date
CN111429715A CN111429715A (en) 2020-07-17
CN111429715B true CN111429715B (en) 2022-07-15

Family

ID=71520945

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910023414.9A Active CN111429715B (en) 2019-01-10 2019-01-10 Information processing method, device and computer readable storage medium

Country Status (2)

Country Link
CN (1) CN111429715B (en)
WO (1) WO2020143519A1 (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114419895B (en) * 2022-02-11 2022-12-27 青岛海信网络科技股份有限公司 Traffic intersection evacuation scheme generation method and device

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5257194A (en) * 1991-04-30 1993-10-26 Mitsubishi Corporation Highway traffic signal local controller
CN101763735B (en) * 2010-02-01 2015-02-25 王茜 Method for controlling dynamic signal control system capable of having negative system loss time
CN101976510A (en) * 2010-10-26 2011-02-16 隋亚刚 Method for optimally controlling crossing vehicle signal under high definition video detection condition
WO2013143621A1 (en) * 2012-03-30 2013-10-03 Nec Europe Ltd. Method and system for adapting vehicular traffic flow
CN103578281B (en) * 2012-08-02 2015-10-21 中兴通讯股份有限公司 A kind of main line of communication signal lamp optimal control method and device
CN104036645B (en) * 2014-06-03 2015-11-18 东南大学 Based on the intersection signal control method of changeable driveway
CN104299432B (en) * 2014-10-31 2017-11-10 青岛海信网络科技股份有限公司 A kind of supersaturation crossing signals lamp control method and device
CN106023608B (en) * 2016-06-08 2018-08-14 吉林大学 A kind of method of the real-time dynamic timing of crossroad access signal lamp
CN109035786A (en) * 2018-10-10 2018-12-18 南京宁昱通交通科技有限公司 A kind of traffic slot control method improving trunk roads Adjacent Intersections traffic efficiency

Also Published As

Publication number Publication date
CN111429715A (en) 2020-07-17
WO2020143519A1 (en) 2020-07-16

Similar Documents

Publication Publication Date Title
CN110910661B (en) Intersection message control machine control method and device
EP3822944A1 (en) Traffic scheme control method and device
CN111681428B (en) Overflow detection method and device, electronic equipment and storage medium
CN115062877B (en) Power equipment material information adjusting method, device, equipment and computer medium
CN111508225B (en) Information processing method, traffic control method, information processing device, traffic control equipment and storage medium
JP2021082287A (en) Traffic light timing setting method and apparatus, electronic apparatus, and storage medium
CN113409593A (en) Traffic signal lamp control signal generation method and device, electronic equipment and medium
CN111429715B (en) Information processing method, device and computer readable storage medium
CN105405052A (en) Method and system for calculating insurance-related cost of insurance product
CN111721310B (en) Determination method and device of navigation path to be optimized, medium and electronic equipment
Kim et al. Comparison of control delays from CORSIM and the Highway Capacity Manual for oversaturated signalized intersections
US9836697B2 (en) Determining variable optimal policy for an MDP paradigm
CN108512711B (en) Method, device and equipment for obtaining instantaneous interface access statistic
CN111582543A (en) Generation method of prediction model, and determination method and device of estimated arrival time
CN106331577B (en) Method and device for adjusting codes
CN113470380B (en) Data processing method and device, electronic equipment and readable storage medium
CN110782063A (en) Method and device for predicting regional congestion degree
CN113708952B (en) Method and device for guaranteeing web service connection stability
CN113075921B (en) Local path planning method and device for unmanned equipment
CN112590811B (en) Method, apparatus, electronic device, and medium for controlling longitudinal travel of vehicle
CN114463981B (en) Traffic facility control method, device, equipment and medium
US11281474B2 (en) Partial computer processor core shutoff
CN109063872B (en) Network appointment vehicle positioning method and device
US11416288B2 (en) Method, device and computer program product for service management
CN118262545A (en) Intersection signal control timing optimization method and device using special phase sequence

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