Technical Field
[0001] The present subject matter is, in general, related to traffic management and more
particularly, but not exclusively, to method and system for reducing road congestion.
Background
[0002] Currently, number of vehicles on road is increasing at a rapid rate and is resulting
in increase of stress on the road infrastructure. Additionally, the increase in number
of vehicles is also causing traffic congestion, especially in the developing countries.
Traffic congestion is one of the major bottlenecks for the development. Thus, creating
an appropriate road infrastructure for avoiding traffic congestion is important.
[0003] One of the main reasons for the traffic congestion is stoppage of vehicles at traffic
signals. Frequent stoppage and starting of the vehicles disturb the normal flow of
the traffic and create congestion at the traffic signals. As a general scenario, each
time a vehicle stops at the traffic signal, the vehicle loses considerable travel
time due to slow human reflex and creates lag and eventual congestion at the traffic
signals. Also, frequent stoppage of the vehicles causes wastage of fuel and may even
increase the pollution. Therefore, minimizing the stoppage at the traffic signals
can greatly help in reducing the traffic congestion on the road.
[0004] There exist several methods for avoiding traffic congestion and managing movement
of the vehicles through the traffic signals. However, the existing methods do not
take into consideration critical parameters such as stoppage of vehicles at different
parts of the road, the continuous adjustment of the vehicle speed, signal condition
and timing of the traffic signals to reduce the number of times the vehicles have
to stop/start at the traffic signals.
[0005] The information disclosed in this background of the disclosure section is only for
enhancement of understanding of the general background of the invention and should
not be taken as an acknowledgement or any form of suggestion that this information
forms the prior art already known to a person skilled in the art.
Summary
[0006] Disclosed herein is a method for reducing road congestion. The method comprises receiving,
by a congestion management system, traffic data related to a plurality of vehicles
moving on a selected path of a road from one or more sensors deployed along the selected
path. Further, the method comprises predicting a speed of each of the plurality of
vehicles at one or more predetermined intersection points along the selected path
and a signal time associated with each of the one or more predetermined intersection
points using a trained traffic model. The traffic model is trained using historic
traffic data related to the plurality of vehicles. Subsequently, the method comprises
determining an optimal speed for each of the plurality of vehicles and an optimal
signal time for each of the one or more predetermined intersection points based on
analysis of predicted speed and predicted signal time. Finally, the method comprises
providing the optimal speed of each of the plurality of vehicles to a vehicle control
system associated with corresponding each of the plurality of vehicles and the optimal
signal time to a traffic controller associated with corresponding each of the one
or more predetermined intersection points, thereby reducing the road congestion.
[0007] Further, the present disclosure relates to a congestion management system for reducing
road congestion. The congestion management system comprises a processor and a memory.
The memory is communicatively coupled to the processor and stores processor-executable
instructions, which on execution, cause the processor to receive traffic data related
to a plurality of vehicles moving on a selected path of a road, from one or more sensors
deployed along the selected path. The instructions further cause the processor to
predict a speed of each of the plurality of vehicles at one or more predetermined
intersection points along the selected path and a signal time associated with each
of the one or more predetermined intersection points using a trained traffic model.
The traffic model is trained using historic traffic data related to the plurality
of vehicles. Subsequently, the instructions cause the processor to determine an optimal
speed for each of the plurality of vehicles and an optimal signal time for each of
the one or more predetermined intersection points based on analysis of predicted speed
and predicted signal time. Finally, the instructions cause the processor to provide
the optimal speed of each of the plurality of vehicles to a vehicle control system
associated with corresponding each of the plurality of vehicles and the optimal signal
time to a traffic controller associated with corresponding each of the one or more
predetermined intersection points, thereby reducing the road congestion.
[0008] Furthermore, the present disclosure relates to a non-transitory computer readable
medium including instructions stored thereon that when processed by at least one processor
cause a congestion management system to perform operations comprising receiving traffic
data, related to a plurality of vehicles moving on a selected path of a road, from
one or more sensors deployed along the selected path. Further, the instructions cause
the congestion management system to predict a speed of each of the plurality of vehicles
at one or more predetermined intersection points along the selected path and a signal
time associated with each of the one or more predetermined intersection points using
a trained traffic model. The traffic model is trained using historic traffic data
related to the plurality of vehicles. Further, the instructions cause the congestion
management system to determine an optimal speed for each of the plurality of vehicles
and an optimal signal time for each of the one or more predetermined intersection
points based on analysis of predicted speed and predicted signal time. Finally, the
instructions cause the congestion management system to provide the optimal speed of
each of the plurality of vehicles to a vehicle control system associated with corresponding
each of the plurality of vehicles and the optimal signal time to a traffic controller
associated with corresponding each of the one or more predetermined intersection points,
thereby reducing the road congestion.
[0009] The foregoing summary is illustrative only and is not intended to be in any way limiting.
In addition to the illustrative aspects, embodiments, and features described above,
further aspects, embodiments, and features will become apparent by reference to the
drawings and the following detailed description.
Brief description of accompanying Drawings
[0010] The accompanying drawings, which are incorporated in and constitute a part of this
disclosure, illustrate exemplary embodiments and, together with the description, explain
the disclosed principles. In the figures, the left-most digit(s) of a reference number
identifies the figure in which the reference number first appears. The same numbers
are used throughout the figures to reference like features and components. Some embodiments
of system and/or methods in accordance with embodiments of the present subject matter
are now described, by way of example only, and regarding the accompanying figures,
in which:
FIG. 1 illustrates an exemplary environment for reducing road congestion in accordance
with some embodiments of the present disclosure.
FIG. 2 shows a detailed block diagram of a congestion management system in accordance with
some embodiments of the present disclosure.
FIG. 3 shows a flowchart illustrating a method of reducing road congestion in accordance
with some embodiments of the present disclosure.
FIG. 4 illustrates a block diagram of an exemplary computer system for implementing embodiments
consistent with the present disclosure.
[0011] It should be appreciated by those skilled in the art that any block diagrams herein
represent conceptual views of illustrative systems embodying the principles of the
present subject matter. Similarly, it will be appreciated that any flow charts, flow
diagrams, state transition diagrams, pseudo code, and the like represent various processes
which may be substantially represented in computer readable medium and executed by
a computer or processor, whether such computer or processor is explicitly shown.
Detailed Description
[0012] In the present document, the word "exemplary" is used herein to mean "serving as
an example, instance, or illustration." Any embodiment or implementation of the present
subject matter described herein as "exemplary" is not necessarily to be construed
as preferred or advantageous over other embodiments.
[0013] While the disclosure is susceptible to various modifications and alternative forms,
specific embodiment thereof has been shown by way of example in the drawings and will
be described in detail below. It should be understood, however that it is not intended
to limit the disclosure to the specific forms disclosed, but on the contrary, the
disclosure is to cover all modifications, equivalents, and alternative falling within
the scope of the disclosure.
[0014] The terms "comprises", "comprising", "includes", or any other variations thereof,
are intended to cover a non-exclusive inclusion, such that a setup, device, or method
that comprises a list of components or steps does not include only those components
or steps but may include other components or steps not expressly listed or inherent
to such setup or device or method. In other words, one or more elements in a system
or apparatus proceeded by "comprises... a" does not, without more constraints, preclude
the existence of other elements or additional elements in the system or method.
[0015] The present disclosure relates to method and congestion management system for reducing
road congestion. In an embodiment, the present disclosure provides a mechanism to
create a virtual green corridor and/or a signal-free path for the vehicles to prevent
any stoppage of vehicles within a selected stretch of the road and subsequently creating
a better traffic flow. Accordingly, the present disclosure discloses collecting traffic
data from different edge sensors deployed in the selected stretch of the road and
then processing the collected traffic data to create an appropriate traffic plan for
the vehicles moving through the selected stretch of the road. The traffic plan is
configured with an adaptable signalling timer and machine learning analytics to continuously
adjust speed of the vehicle and the signal time. Further, the determined variable
speed limit and the signal time are communicated to the vehicles within the selected
path for controlling the congestion on the selected path.
[0016] In an embodiment, the method of present disclosure helps in reducing traffic congestion
on any selected portion of the road. Additionally, the method of present disclosure
helps in eliminating and/or minimizing the number of instances that the vehicles have
to stop/start at the traffic signals, thereby enhancing fuel economy and reducing
waiting time for the vehicles. Further, the method of present disclosure also helps
in designing a traffic-free and/or zero traffic green corridor for smooth, congestion-less
movement of the vehicles by designing an appropriate plan for the selected path.
[0017] In the following detailed description of the embodiments of the disclosure, reference
is made to the accompanying drawings that form a part hereof, and in which are shown
by way of illustration specific embodiments in which the disclosure may be practiced.
These embodiments are described in sufficient detail to enable those skilled in the
art to practice the disclosure, and it is to be understood that other embodiments
may be utilized and that changes may be made without departing from the scope of the
present disclosure. The following description is, therefore, not to be taken in a
limiting sense.
[0018] FIG. 1 illustrates an exemplary environment
100 for reducing road congestion in accordance with some embodiments of the present disclosure.
[0019] In an embodiment, the environment
100 may include, without limiting to, a selected path
101, a plurality of vehicles
103 moving on the selected path
101, one or more sensors
105 deployed on the path
101, a congestion management system
109 and a trained traffic model
111 associated with the path
101.
[0020] In an embodiment, the path
101 may be a smaller portion of a road selected for reducing the congestion. Generally,
the road may consist of multiple paths and each path may, in turn, consist of multiple
distance segments
102 namely, distance segment 1
1021 to distance segment 2
102N (collectively referred as distance segments
102) and one or more predetermined intersection points
107. In an embodiment, the path
101 may be bi-directional, that is, having both an upward traffic flow and a downward
traffic flow. Further, each distance segment
102 of the path
101 may be deployed with multiple sensors
105 to collect various dynamic and static information related to the path
101. As an example, the one or more sensors
105 that are deployed on the path
101 may include, without limiting to, an entry sensor, an exist sensor, an intermediate
edge sensor and a display unit. The entry sensor may be configured to monitor and
report number of vehicles
103 entering the path
101. Similarly, the exit sensor may be configured to monitor and report number of vehicles
103 exiting the path
101. The intermediate edge sensor may be used to monitor and report events such as traffic
incidents occurring in the path
101, stoppage of vehicles
103 in the path
101 and the like. The display unit may be used for displaying and/or providing real-time
information and recommendations to drivers of the plurality of vehicles
103 moving through the path
101.
[0021] In an embodiment, the plurality of vehicles
103 may include, for example, cars, busses, trucks, motorcycles and the like. In an implementation,
the plurality of vehicles
103 may also include autonomous and/or driverless vehicles
103.
[0022] In an embodiment, the congestion management system
109 may be any computing system including, without limiting to, a desktop computer, a
laptop, a smartphone or a server, which is capable of being configured to reduce road
congestion as per embodiments of the present disclosure. In an implementation, the
congestion management system
109 may be operated from a remote location and configured to dynamically exchange information
such as traffic data with the one or more sensors
105 and the trained traffic model
111.
[0023] In an embodiment, the trained traffic model
111 may be a machine learning model, which is trained with historic traffic data
211 related to the path
101 for predicting (e.g., estimating) a speed of each of the plurality of vehicles
103 passing through the path
101 and signal time associated with each of the one or more predetermined intersection
points
107 on the path
101. Further, the trained traffic model
111 may be configured to dynamically analyse and learn any deviations between the predicted
values of the speed and signal time to the actual values of the speed and signal time.
[0024] In an embodiment, for reducing the road congestion over the path
101, it may be necessary to minimize and/or eliminate vehicle stop/start process within
the path
101. Further, to minimize the vehicle stop/start process, it may be important to ensure
that there is no congestion at the one or more predetermined intersection points
107. This may be met by adaptively controlling the speed of each of the plurality of vehicles
103 and dynamically varying the signal time at the one or more predetermined intersection
points
107. Therefore, an optimal speed
113 and an optimal signal time
115 must be continuously determined and provided to respective controlling mechanisms
for reducing the congestion on the path
101.
[0025] In an embodiment, in order to achieve the objective as illustrated above, the congestion
management system
109 may be configured for receiving traffic data (also referred as real-time traffic
data) related to the plurality of vehicles
103 moving on the path
101 from, one or more sensors
105 deployed along the path
101. As an example, the traffic data may include, without limiting to, a current location
of each of the plurality of vehicles
103, weather condition across the path
101, information of any incidents reported on the path
101, a current speed of the plurality of vehicles
103, current signal condition and signal timing, number of vehicles
103 entering and crossing the path
101, number of vehicles
103 waiting at the traffic signal and the like.
[0026] In an embodiment, upon receiving the traffic data, the congestion management system
109 may predict (e.g., estimate) the speed of each of the plurality of vehicles
103 at one or more predetermined intersection points
107 and the signal time associated with each of the one or more predetermined intersection
points
107 using the trained traffic model
111. Here, the trained traffic model
111 uses the real-time traffic data of the path
101 and predicts (e.g., outputs) possible values of the speed of vehicles
103 and the signal time in the path
101.
[0027] In an embodiment, subsequent to predicting the speed and the signal time, the congestion
management system
109 may determine an optimal speed
113 for each of the plurality of vehicles
103 and an optimal signal time
115 for each of the one or more predetermined intersection points
107 based on an analysis of the predicted speed and the predicted signal time values.
In some implementations, the predicted speed and the predicted signal time may be
analysed using at least one of a multivariate linear regression model or a re-enforcement
learning model.
[0028] In an embodiment, once the optimal speed
113 and the optimal signal time
115 are determined, the congestion management system
109 may provide the values of the optimal speed
113 and the optimal signal time
115 to respective control mechanisms to ensure that movement of each of the plurality
of vehicles
103 in the path
101 is controlled according to the optimal speed
113 and the optimal signal time
115. In an implementation, the optimal speed
113 may be communicated to drivers of the plurality of vehicles
103 by means of a suitable audio and/or visual notification. Similarly, the optimal signal
time
115 may be communicated to a traffic controller associated with corresponding each of
the one or more predetermined intersection points
107.
[0029] In an embodiment, the congestion management system
109 may continuously determine the optimal speed
113 and the optimal signal time
115 at predetermined regular intervals, for example, once in every one second to ensure
that the path
101 is maintained in a congestion-free state at any point of time. In an alternative
embodiment, determination of the optimal speed
113 and the optimal signal time
115 may be dynamically triggered only when a congestion is detected on the path
101 and/or on the one or more predetermined intersection points
107.
[0030] FIG. 2 shows a detailed block diagram of a congestion management system
109 in accordance with some embodiments of the present disclosure.
[0031] In some implementations, the congestion management system
109 may include an I/O interface
201, a processor
203 and a memory
205. The I/O interface
201 may be communicatively interfaced with one or more sensors
105 deployed on a selected path
101 of a road for receiving traffic data
213 related to a plurality of vehicles
103 moving through the selected path
101. Further, the I/O interface
201 may be interfaced with a trained traffic model
111 for obtaining optimal values of speed of the plurality of vehicles
103 and an optimal value of signal time. The memory
205 may be communicatively coupled to the processor
203 and may store data
207 and one or more modules
209. The processor
203 may be configured to perform one or more functions of the congestion management system
109 for reducing road congestion, using the data
207 and the one or more modules
209.
[0032] In an embodiment, the data
207 may include, without limitation, historic traffic data
211, traffic data
213, optimal speed
113, optimal signal time
115 and other data
215. In some implementations, the data
207 may be stored within the memory
205 in the form of various data structures. Additionally, the data
207 may be organized using data models, such as relational or hierarchical data models.
The other data
221 may store various temporary data and files generated by one or more modules
209 while performing various functions of the congestion management system
109. As an example, the other data
221 may include, without limiting to, dimensions of the road, real-time weather information
from surrounding of the road and the like.
[0033] In an embodiment, the historic traffic data
211 may be the data related to the path 101 and the plurality of vehicles
103 moving on the path
101 collected over a period of time. As an example, the traffic data
213 collected over a period of 6-months may be considered as the historic traffic data
211 for the path
101. In an embodiment, the historic traffic data
211 may be used for training the traffic model
111 for predicting/estimating the speed and the signal time values.
[0034] In an embodiment, the traffic data
213 or the real-time traffic data
213 may be the real-time traffic data
213 collected by the one or more sensors
105 deployed in the path
101. The traffic data
213 may be used for determining the optimal speed
113 and the optimal signal time
115 for the plurality of vehicles
103 moving on the path
101. As an example, the traffic data
213 may include, without limiting to, number of vehicles
103 moving on the path
101, length of the path
101, current speed of the plurality of vehicles
103 and the signal wait/open time at the predetermined intersection points
107 on the path
101. In an embodiment, the real-time traffic data
213 may be dynamically collected at predetermined regular intervals such as, for example,
1 second.
[0035] In an embodiment, the optimal speed
113 may be a minimum speed range that has to be maintained by each of the plurality of
vehicles
103, to ensure that the plurality of vehicles
103 do not form a congestion at the one or more intersection points
107 or elsewhere on the path
101. In other words, the optimal speed
113 may be a target speed for the plurality of vehicles
103, while the plurality of vehicles
103 are moving on the path
101. In an implementation, value of the optimal speed
113 may be different for one or more vehicles
103 of the plurality of vehicles
103, such that, each of the plurality of vehicles
103 do not arrive at the one or more intersection points
107 at the same time, thus avoiding congestion at the one or more intersection points
107.
[0036] In an embodiment, the optimal signal time
115 may be an ideal signal wait and/or open time that needs to be maintained for avoiding
congestion at the one or more intersection points 107. The optimal signal time
115 ensures that a maximum number of vehicles
103 are allowed to cross the signals with no or very minimal waiting at the one or more
intersection points
107. Since controlling the speed of the vehicles
103 alone may not be effective in reducing the congestion, especially during a dense
traffic condition, maintaining the optimal signal time
115 at the one or more intersection points
107 becomes crucial for reducing the congestion.
[0037] In an embodiment, the data
207 may be processed by the one or more modules
209. In some implementations, the one or more modules
209 may be communicatively coupled to the processor
203 for performing one or more functions of the congestion management system
109. In an implementation, the one or more modules
209 may include, without limiting to, a receiving module
217, a prediction module
219, a determination module
221, a recommendation module
223 and other modules
225.
[0038] As used herein, the term module refers to an Application Specific Integrated Circuit
(ASIC), an electronic circuit, a hardware processor (shared, dedicated, or group)
and memory that execute one or more software or firmware programs, a combinational
logic circuit, and/or other suitable components that provide the described functionality.
In an embodiment, the other modules
233 may be used to perform various miscellaneous functionalities of the congestion management
system
109. It will be appreciated that such one or more modules
209 may be represented as a single module or a combination of different modules.
[0039] In an embodiment, the receiving module
217 may be configured for receiving the traffic data
213 from the one or more sensors
105 deployed along the selected path
101. In an embodiment, the one or more sensors
105 may collect relevant traffic data
213 from the one or more intersection points
107 and the distance segments
102 comprised in the selected path
101. Further, one or more intermediate edge sensors
105 may collect various information regarding the traffic entering the selected path
101 and the traffic moving out of the selected path
101. In an embodiment, the receiving module
217 may collect the traffic data
213 relating to both directions of the traffic flow, that is, the upward traffic movement
and the downward traffic movement.
Table A below shows exemplary traffic data
213 that may be collected from the one or more sensors
105 deployed on the selected path
101.
Table A - Exemplary traffic data
Time windo w |
Car rele ase wind ow start |
Time of 1st car touching DS1 |
Time of last car exiting DS1 |
Optimal entry speed for DS1 |
Time of 1st car touching DS2 |
Time of last car exiting DS2 |
Optim al entry speed for DS2 |
Time of 1st car touching intersect ion C1 |
Time of last car exiting C1 |
No. of cars at C1 |
Signal time for C1 |
8-8:05 AM |
60 Sec |
8:02:04 AM |
8:04:20 AM |
40 Km/Hr |
8:04:20 AM |
8:05:20 AM |
25 Km/Hr |
8:03:10 AM |
8:06:25 AM |
45 |
125 Sec |
[0040] In an embodiment, upon collecting the traffic data
213, the receiving module
217 may analyze and process the traffic data
213 before using the traffic data
213 for further processing. As an example, data processing operations such as data normalization,
data enrichment and refinement may be performed on the collected traffic data
213 before the traffic data
213 is further analyzed. Additionally, the processed traffic data
213 may be stored in a reference database and may be used for training of the traffic
model
111.
[0041] In an embodiment, the receiving module
217 may collect the traffic data
213 at predefined time units. As an example, the time unit may be 1 second, which means
that the traffic data
213 is collected once in every second. Further, the series of traffic data
213 received at each of the time units may be serialized and stored in the reference
database for future reference. In an embodiment, there may be a higher granularity
and better control over the collected traffic data
213 when the time unit is a smaller.
[0042] In an embodiment, the collected traffic data 213 may be checked for errors by comparing
the collected traffic data 213 with reference traffic data 213 collected from both
a normal traffic condition (i.e. without specifically selecting a path 101) and a
controlled traffic condition (i.e. when the vehicles 103 are moving in the optimal
speed 113 and the optimal signal time 115 is set). The above comparison helps in training
of the traffic model 111 and also prepares the traffic model 111 to respond to various
situations quickly.
[0043] In an embodiment, the prediction module 219 may be configured for predicting the
speed of each of the plurality of vehicles 103 at one or more predetermined intersection
points 107 and the signal time associated with each of the one or more predetermined
intersection points
107 using a trained traffic model
111.
[0044] In an embodiment, the prediction module
219 may employ a two-step multivariate regression analysis method on the collected traffic
data
213 to predict (e.g., estimate) the signal time at an intersection point at 'M' (IC
M), at time 'T' as PSICT
M, wherein:
PSICT
M = {Ts: start Time, T
E: end Time, S: Signal state, EVS: Expected Vehicle speed at signal}
[0045] Additionally, the prediction module
219 may predict (e.g., estimate) the speed and the signal state for a Distance Segment
(DS)
102 within the path
101. As an example, the predicted values for the Path (P
p) at distance segment

and time 'T' may be defined as

wherein:

[0046] Further, a prediction function may be created after performing the two-step regression
multivariate analysis of the collected traffic data
213. In an embodiment, the serialized traffic data
213 collected at a series of time units may be represented as

and

such that:

[0047] Here, each data point may have location information of a specific DS and Intersection
point (IC). Also, each feature set may consist of time, location and the various parameters
as defined in

and

above. Further, a multivariate analysis may be performed on the above feature sets
for obtaining the final feature sets. As an example, the multivariate analysis may
include operations such as 'dimensionality reduction', 'variable selection', and 'multivariate
regression analysis', which help in identifying the correct parameters useful for
performing the linier regression.
[0048] As an example, after analyzing the feature sets, if the final feature set may be
as defined as X
i, for each time series, the output prediction may be defined as PSICT
M for an intersection point 'M'. Further, the predicted outcome may be defined as Y
i for the input X
i. Subsequently, once sufficient data set has been collected, the linier regression
may be performed. As an example, the linier regression function may be defined by
equation (1) below:

[0049] In an embodiment, initially, the traffic model
111 may be trained with global data. Subsequently, the traffic model
111 may be fine-tuned with the local data within the selected path
101, having an intersection point 'M'. This may be defined as shown in equation (2) below:

[0050] In an embodiment, the traffic model
111 defined in the equation (2) may be deployed for generating results including the
optimal speed
113 and the optimal signal time
115 and to make a comparison with actual values of the vehicle speed and the signal time.
In an embodiment, if the deviation between the generated optimal values and the actual
values is more than a threshold, then the traffic model
111 may be re-trained until accurate results are obtained.
[0051] Thus, a final traffic model
111 for a path 'P' having an intersection point 'M' may be defined as shown in equation
(3) below:

[0052] Thereafter, from the output of the equation (3) above, a subsequent multivariate
regression may be performed with freshly predicted values of the speed and signal
time.
[0053] Finally, a final traffic model
111 for the entire path 'P' may be defined as shown in equation (4) below:

[0054] In an embodiment, there may be multiple distance segments
102 between two intersection points
107 of the selected path
101. However, the same multivariate linear regression may be used for predicting the speed
and the signal time information across each distance segments
102. Alternatively, a re-enforcement learning algorithm with greedy policy may be used
for predicting the speed and the signal time information. In the case of re-enforcement
learning, the system may perform exploration/exploitation trade off and learn to predict
the speed and the signal information.
[0055] In an embodiment, the determination module
221 may be configured for determining the optimal speed
113 for each of the plurality of vehicles
103 and the optimal signal time
115 for each of the one or more predetermined intersection points
107 based on analysis of the predicted speed and the predicted signal time.
[0056] In an embodiment, once the final traffic model
111 is trained and deployed according to the traffic plan defined for the selected path
101, the real-time traffic data
213 may be collected from the one or more sensors
105 deployed on the selected path
101, and relevant information including the predicted speed and the predicted signal time
may be used for determining the optimal speed
113 and the optimal signal time
115. In an embodiment, the determination module
221 may estimate the optimal speed
113 and the optimal signal time
115 based on the functions F
PredictIC and F
PredictDS (as illustrated above), which generated and finalized during the learning phase of
the traffic model
111.
[0057] In an embodiment, the recommendation module
223 may be configured for providing the optimal speed
113 of each of the plurality of vehicles
103 to a vehicle control system associated with corresponding each of the plurality of
vehicles
103. Additionally, the recommendation module
223 may be configured for providing the optimal signal time
115 to a traffic controller associated with corresponding each of the one or more predetermined
intersection points
107 for reducing the road congestion.
[0058] In an embodiment, the optimal speed
113 and the optimal signal time
115 may be transmitted to intermediate edge sensors
105 and display units associated with the path
101 for notifying the drivers of the plurality of vehicles
103. Additionally, the optimal speed
113 and the optimal signal time
115 may be transmitted to an in-vehicle edge system configured in the plurality of vehicles
103, moving within the selected path
101 based on help of real-time location of the plurality of vehicles
103.
[0059] In an embodiment, the optimal speed
113 and the optimal signal time
115 may be compared with the predicted values of the speed and the signal time. Further,
when the plurality of vehicles
103 progress through various distance segments
102 within the selected path
101, any deviation from the original prediction may be captured and values of the signal
time and the speed may be dynamically re-adjusted. In an embodiment, if extra time
is needed, priority may be given to the vehicles
103 moving in the selected path
101, by increasing the signal time to ensure that all the vehicles
103 move out of the selected path
101 without causing the congestion.
[0060] In case there a possibility of halt and/or stoppage of a vehicle at a traffic signals,
such vehicle may be stopped before the intersection points
107, in-between the two distance segments
102 
within the selected path
101. Further, when it is time to open the signal at the intersection point, a few time
slots earlier to the

and after the

may be activated. As a result, when the vehicle that had stopped before the intersection
points
107 arrives at the intersection point, the signal may be turned green/open, thereby allowing
the vehicle to pass through the signal. Consequently, the vehicles
103 that are in motion/moving condition may clear the intersection points
107 much efficiently.
[0061] In an embodiment, each of the plurality of vehicles
103 moving on the selected path
101 may get information related to the speed at which they must move, and information
of stop points in-between the intersection points
107, if needed. Consequently, the plurality of vehicles
103 driving through the selected path
101 may experience no stoppage of traffic along the selected path
101, which in turn, reduces the congestion at the traffic signals and avoids the start/stop
or idling of the vehicles
103 in the signal. In other words, the controlling the movement of the plurality of vehicles
103 according to the optimal speed
113 and the optimal signal time
115 may help to achieve less congestion at the traffic signals, avoids dead-stop of the
vehicles
103 and hence improves momentum of the traffic flow. This also helps in reducing wastage
of fuel and reduces pollution at the traffic signals.
[0062] In the current scenario, the traffic data
213 may be collected from the one or more sensors
105 deployed on the selected path
101. In an alternative embodiment, in the scenario of connected vehicle system, the traffic
data
213 may be collected directly from the vehicles
103 to perform the similar activity, without the requirement of implementing the sensors
105 along the path
101. Additionally, it may be also possible to send the speed and other driving information
directly to the vehicle, without the requirement of any display units.
[0063] FIG. 3 shows a flowchart illustrating a method of reducing road congestion in accordance
with some embodiments of the present disclosure.
[0064] As illustrated in
FIG. 3, the method
300 may include one or more blocks illustrating a method for reducing road congestion
using a congestion management system
109 illustrated in
FIG. 1. The method
300 may be described in the general context of computer executable instructions. Generally,
computer executable instructions can include routines, programs, objects, components,
data structures, procedures, modules, and functions, which perform specific functions
or implement specific abstract data types.
[0065] The order in which the method
300 is described is not intended to be construed as a limitation, and any number of the
described method blocks can be combined in any order to implement the method. Additionally,
individual blocks may be deleted from the methods without departing from the scope
of the subject matter described herein. Furthermore, the method can be implemented
in any suitable hardware, software, firmware, or combination thereof.
[0066] At block
301, the method
300 includes receiving, by the congestion management system
109, traffic data
213 related to a plurality of vehicles
103 moving on a selected path
101 of a road from one or more sensors
105 deployed along the selected path
101. In an embodiment, selecting the path
101 for deploying the one or more sensors
105 may include identifying one or more distance segments
102 and one or more intersection points
107 along the path
101. In one implementation, the one or more distance segments
102 may be configured with at least one of the one or more sensors
105 including an entry sensor, an exist sensor, an intermediate edge sensor and a display
unit.
[0067] At block
303, the method
300 includes predicting, by the congestion management system
109, a speed of each of the plurality of vehicles
103 at one or more predetermined intersection points
107 along the selected path
101 and a signal time associated with each of the one or more predetermined intersection
points
107 using a trained traffic model
111. In an embodiment, the traffic model
111 may be trained using historic traffic data
211 related to the plurality of vehicles
103. As an example, the historic traffic data
211 may include, without limiting to, at least one of number of vehicles
103 moving on the path
101, length of the path
101, speed of the plurality of vehicles
103 and the signal time of predetermined intersection points
107 along the path
101.
[0068] At block
305, the method
300 includes determining, by the congestion management system
109, an optimal speed
113 for each of the plurality of vehicles
103 and an optimal signal time
115 for each of the one or more predetermined intersection points
107 based on analysis of predicted speed and predicted signal time. In an embodiment,
the optimal speed
113 of each of the plurality of vehicles
103 and the optimal signal time
115 of each of the one or more predetermined intersection points
107 may be provided to the traffic model
111 for re-training of the traffic model
111.
[0069] At block
307, the method
300 includes providing, by the congestion management system
109, the optimal speed
113 of each of the plurality of vehicles
103 to a vehicle control system associated with corresponding each of the plurality of
vehicles
103 and the optimal signal time
115 to a traffic controller associated with corresponding each of the one or more predetermined
intersection points
107 for reducing the road congestion. In an embodiment, the road congestion may be reduced
by controlling each of the plurality of vehicles
103 in the optimal speed
113 corresponding to each of the plurality of vehicles
103. In addition, each of the one or more predetermined intersection points
107 may be maintained in the optimal signal time
115 for reducing the congestion at the traffic.
[0070] In an embodiment, value of the optimal speed
113 for the plurality of vehicles
103 may be provided to a driver of corresponding each of the plurality of vehicles
103, using at least one of an audio notification or a visual notification when the plurality
of vehicles
103 are on the selected path
101.
[0071] In an embodiment, the predicted speed and the predicted signal time may be analysed
using at least one of a multivariate linear regression model or a re-enforcement learning
model. Further, the optimal speed
113 and the optimal signal time
115 may be determined at predetermined intervals or upon detecting a congestion in the
one or more intersection points
107.
Computer System
[0072] FIG. 4 illustrates a block diagram of an exemplary computer system
400 for implementing embodiments consistent with the present disclosure. In an embodiment,
the computer system
400 may be the congestion management system
109 illustrated in
FIG. 1, which may be used for reducing road congestion. The computer system
400 may include a central processing unit ("CPU" or "processor")
402. The processor
402 may comprise at least one data processor for executing program components for executing
user- or system-generated business processes. A user may include a person, a traffic
police, a driver, an organization or any system/sub-system being operated parallelly
to the computer system
400. The processor
402 may include specialized processing units such as integrated system (bus) controllers,
memory management control units, floating point units, graphics processing units,
digital signal processing units, etc.
[0073] The processor
402 may be disposed in communication with one or more input/output (I/O) devices
(411 and
412) via I/O interface
401. The I/O interface
401 may employ communication protocols/methods such as, without limitation, audio, analog,
digital, stereo, IEEE®-1394, serial bus, Universal Serial Bus (USB), infrared, PS/2,
BNC, coaxial, component, composite, Digital Visual Interface (DVI), high-definition
multimedia interface (HDMI), Radio Frequency (RF) antennas, S-Video, Video Graphics
Array (VGA), IEEE® 802.n /b/g/n/x, Bluetooth, cellular (e.g., Code-Division Multiple
Access (CDMA), High-Speed Packet Access (HSPA+), Global System For Mobile Communications
(GSM), Long-Term Evolution (LTE) or the like), etc. Using the I/O interface
401, the computer system
400 may communicate with one or more I/O devices
411 and
412.
[0074] In some embodiments, the processor
402 may be disposed in communication with a communication network
409 via a network interface
403. The network interface
403 may communicate with the communication network
409. The network interface
403 may employ connection protocols including, without limitation, direct connect, Ethernet
(e.g., twisted pair 10/100/1000 Base T), Transmission Control Protocol/Internet Protocol
(TCP/IP), token ring, IEEE® 802.11a/b/g/n/x, etc. Using the network interface
403 and the communication network
409, the computer system
400 may communicate with the one or more sensors
105 for receiving traffic data
213 related to a plurality of vehicles
103 moving on a selected path
101 of the road. Additionally, the computer system
400 may communicate with a trained traffic model
111 that predicts the speed of the plurality of vehicles
103 and a signal time associated with each of one or more predetermined intersection
points
107.
[0075] In an implementation, the communication network
409 may be implemented as one of the several types of networks, such as intranet or Local
Area Network (LAN) and such within the organization. The communication network
409 may either be a dedicated network or a shared network, which represents an association
of several types of networks that use a variety of protocols, for example, Hypertext
Transfer Protocol (HTTP), Transmission Control Protocol/Internet Protocol (TCP/IP),
Wireless Application Protocol (WAP), etc., to communicate with each other. Further,
the communication network
409 may include a variety of network devices, including routers, bridges, servers, computing
devices, storage devices, etc.
[0076] In some embodiments, the processor
402 may be disposed in communication with a memory
405 (e.g., RAM
413, ROM
414, etc. as shown in
FIG. 4) via a storage interface
404. The storage interface
404 may connect to memory
405 including, without limitation, memory drives, removable disc drives, etc., employing
connection protocols such as Serial Advanced Technology Attachment (SATA), Integrated
Drive Electronics (IDE), IEEE-1394, Universal Serial Bus (USB), fiber channel, Small
Computer Systems Interface (SCSI), etc. The memory drives may further include a drum,
magnetic disc drive, magneto-optical drive, optical drive, Redundant Array of Independent
Discs (RAID), solid-state memory devices, solid-state drives, etc.
[0077] The memory
405 may store a collection of program or database components, including, without limitation,
user/application interface
406, an operating system
407, a web browser
408, and the like. In some embodiments, computer system
400 may store user/application data
406, such as the data, variables, records, etc. as described in this invention. Such databases
may be implemented as fault-tolerant, relational, scalable, secure databases such
as Oracle® or Sybase®.
[0078] The operating system
407 may facilitate resource management and operation of the computer system
400. Examples of operating systems include, without limitation, APPLE® MACINTOSH® OS X®,
UNIX®, UNIX-like system distributions (E.G., BERKELEY SOFTWARE DISTRIBUTION® (BSD),
FREEBSD®, NETBSD®, OPENBSD, etc.), LINUX® DISTRIBUTIONS (E.G., RED HAT®, UBUNTU®,
KUBUNTU®, etc.), IBM® OS/2®, MICROSOFT® WINDOWS® (XP®, VISTA®/7/8, 10 etc.), APPLE®
IOS®, GOOGLE™ ANDROID™, BLACKBERRY® OS , or the like.
[0079] The user interface
406 may facilitate display, execution, interaction, manipulation, or operation of program
components through textual or graphical facilities. For example, the user interface
406 may provide computer interaction interface elements on a display system operatively
connected to the computer system
400, such as cursors, icons, check boxes, menus, scrollers, windows, widgets, and the
like. Further, Graphical User Interfaces (GUIs) may be employed, including, without
limitation, APPLE® MACINTOSH® operating systems' Aqua®, IBM® OS/2®, MICROSOFT® WINDOWS®
(e.g., Aero, Metro, etc.), web interface libraries (e.g., ActiveX®, JAVA®, JAVASCRIPT®,
AJAX, HTML, ADOBE® FLASH®, etc.), or the like.
[0080] The web browser
408 may be a hypertext viewing application. Secure web browsing may be provided using
Secure Hypertext Transport Protocol (HTTPS), Secure Sockets Layer (SSL), Transport
Layer Security (TLS), and the like. The web browsers
408 may utilize facilities such as AJAX, DHTML, ADOBE® FLASH®, JAVASCRIPT®, JAVA®, Application
Programming Interfaces (APIs), and the like. Further, the computer system
400 may implement a mail server stored program component. The mail server may utilize
facilities such as ASP, ACTIVEX®, ANSI® C++/C#, MICROSOFT®, NET, CGI SCRIPTS, JAVA®,
JAVASCRIPT®, PERL®, PHP, PYTHON®, WEBOBJECTS®, etc. The mail server may utilize communication
protocols such as Internet Message Access Protocol (IMAP), Messaging Application Programming
Interface (MAPI), MICROSOFT® exchange, Post Office Protocol (POP), Simple Mail Transfer
Protocol (SMTP), or the like. In some embodiments, the computer system 400 may implement
a mail client stored program component. The mail client may be a mail viewing application,
such as APPLE® MAIL, MICROSOFT® ENTOURAGE®, MICROSOFT® OUTLOOK®, MOZILLA® THUNDERBIRD®,
and the like.
[0081] Furthermore, one or more computer-readable storage media may be utilized in implementing
embodiments consistent with the present invention. A computer-readable storage medium
refers to any type of physical memory on which information or data readable by a processor
may be stored. Thus, a computer-readable storage medium may store instructions for
execution by one or more processors, including instructions for causing the processor(s)
to perform steps or stages consistent with the embodiments described herein. The term
"computer-readable medium" should be understood to include tangible items and exclude
carrier waves and transient signals, i.e., non-transitory. Examples include Random
Access Memory (RAM), Read-Only Memory (ROM), volatile memory, nonvolatile memory,
hard drives, Compact Disc (CD) ROMs, Digital Video Disc (DVDs), flash drives, disks,
and any other known physical storage media.
Advantages of the embodiments of the present disclosure are illustrated herein.
[0082] In an embodiment, the method of present disclosure helps in reducing traffic congestion
on any selected portion of the road.
[0083] In an embodiment, the method of present disclosure eliminates and/or minimizes the
number of instances that the vehicles have to stop/start at the traffic signals, thereby
enhancing fuel economy and reducing waiting time for the vehicles.
[0084] In an embodiment, the method of present disclosure helps in designing a traffic-free
and/or zero traffic green corridor for smooth, congestion-less movement of the vehicles
by designing an appropriate plan for the selected path.
[0085] The method and system disclosed in the present disclosure may be used to overcome
a technical problem of traffic congestion on roads. Specifically, the method and system
disclosed herein aim to avoid/reduce traffic stoppage at traffic signals on the road,
since the traffic stoppage, more often, disturbs the regular flow of the traffic and
creates congestion at the traffic signals. Additionally, the disclosed method and
system aim to eliminate other inherent drawbacks of traffic stoppage including: wastage
of time due to human reflex lag during start/stop of vehicles, wastage of fuel due
to repeated engine start/stop operation, increases pollution and the like. In other
words, the disclosed method and system have a practical application and provide a
technically advanced solution to the technical problem of avoiding traffic congestion.
[0086] The aforesaid technical advancement and practical application of the disclosed method
and system may be attributed to the aspect of determining: a) an optimal speed for
each of the plurality of vehicles and b) an optimal signal time for each intersection
points, as disclosed in the 'determining' step of claims 1 and 10 of the disclosure.
[0087] In light of the technical advancements provided by the disclosed method and system,
the claimed steps, as discussed above, are not routine, conventional, or well-known
aspects in the art, as the claimed steps provide the aforesaid solutions to the technical
problems existing in the conventional technologies. Further, the claimed steps clearly
bring an improvement in the functioning of the system itself, as the claimed steps
provide a technical solution to a technical problem.
[0088] A description of an embodiment with several components in communication with each
other does not imply that all such components are required. On the contrary, a variety
of optional components are described to illustrate the wide variety of possible embodiments
of the invention.
[0089] When a single device or article is described herein, it will be clear that more than
one device/article (whether they cooperate) may be used in place of a single device/article.
Similarly, where more than one device or article is described herein (whether they
cooperate), it will be clear that a single device/article may be used in place of
the more than one device or article or a different number of devices/articles may
be used instead of the shown number of devices or programs. The functionality and/or
the features of a device may be alternatively embodied by one or more other devices
which are not explicitly described as having such functionality/features. Thus, other
embodiments of the invention need not include the device itself.
[0090] Finally, the language used in the specification has been principally selected for
readability and instructional purposes, and it may not have been selected to delineate
or circumscribe the inventive subject matter. It is therefore intended that the scope
of the invention be limited not by this detailed description, but rather by any claims
that issue on an application based here on. Accordingly, the embodiments of the present
invention are intended to be illustrative, but not limiting, of the scope of the invention,
which is set forth in the following claims.
[0091] While various aspects and embodiments have been disclosed herein, other aspects and
embodiments will be apparent to those skilled in the art. The various aspects and
embodiments disclosed herein are for purposes of illustration and are not intended
to be limiting, with the scope being indicated by the following claims.