Search

The article describes the problem of excessive traffic concentration at signalized pedestrian crossings. The main drawback of such crossings is the inappropriate duration of green signals for vehicles. Too long green times for vehicular traffic significantly increase time lost by pedestrians, while too short ones cause short-term congestion, resulting in long queues of vehicles and a deteriorated level of service. The negative effects of both of these situations also include dangerous behavior of road users, such as red light running or crossing. Recent (June 2021) changes in the road traffic law in Poland have privileged unprotected road users at pedestrian crossings. New models and technical and design standards proposed in this country (March 2021) recommend the installation of pedestrian priority crossings at particularly dangerous spots and in urban areas with a high proportion of pedestrian traffic. All this is done mainly for traffic-calming purposes. However, previously these measures were not a common practice in Poland. Therefore, the objective of this article was to develop a simple method of green signal timing, ensuring, firstly, priority to pedestrian traffic at such places, and, secondly, sustained capacity of vehicular traffic lanes. The developed models are practical, universal and easy to adapt in other countries. They ensure a very good or good quality of vehicle traffic service, with average lost time not exceeding 25 s in a vast majority of analyzed traffic level cases. The article also describes a traffic control algorithm dependent on traffic detection. [ABSTRACT FROM AUTHOR]

Congestion is an important issue in Internet of Things (IoT) networks with constrained devices and a growing number of applications. This paper investigated the problem of congestion control for burst traffic in such networks. We highlight the shortcomings of the current constrained application protocol (CoAP) in its inability to support burst traffic and rate control. Subsequently, we propose an analytical model for CoAP burst traffic and a new rate-control algorithm for CoAP to avoid congestion. A CoAP sender increases or decreases the transmission rate depending on the congestion detection. Using simulations, we compared the performance of the proposed algorithm with the current CoAP in various traffic scenarios. Experimental results show that the proposed algorithm is efficient for burst traffic and provides better performance in terms of delay, throughput, retransmission, packet duplication, and packet loss compared to CoAP. [ABSTRACT FROM AUTHOR]

We develop reinforcement learning (RL) boundary controllers to mitigate stop-and-go traffic congestion on a freeway segment. The traffic dynamics of the freeway segment are governed by a macroscopic Aw–Rascle–Zhang (ARZ) model, consisting of 2 $\times $ 2 quasi-linear partial differential equations (PDEs) for traffic density and velocity. The boundary stabilization of the linearized ARZ PDE model has been solved by PDE backstepping, guaranteeing spatial $L^{2}$ norm regulation of the traffic state to uniform density and velocity and ensuring that traffic oscillations are suppressed. Collocated proportional (P) and proportional–integral (PI) controllers also provide stability guarantees for allowable control gains and are always applicable as model-free control options through gain tuning by trial and error, or by model-free optimization. Although these approaches are mathematically elegant, the stabilization result only holds locally and is usually affected by the change of model parameters. Therefore, we reformulate the PDE boundary control problem as an RL problem that pursues stabilization without knowing the system dynamics, simply by observing the state values. The proximal policy optimization (PPO), a neural network-based policy gradient algorithm, is employed to obtain RL controllers by interacting with a numerical simulator of the ARZ PDE. Being stabilization-inspired, the RL state-feedback boundary controllers are compared and evaluated against the rigorously stabilizing controllers in two cases: 1) in a system with perfect knowledge of the traffic flow dynamics and then 2) in one with only partial knowledge. We obtain RL controllers that nearly recover the performance of the backstepping, P, and PI controllers with perfect knowledge and outperform them in some cases with partial knowledge. It must be noted, however, that the RL controllers are obtained by conducting about one thousand episodes of iterative training on a simulation model. This training cannot be performed in a collision-free fashion in real traffic, nor convergence guaranteed when training. Thus, we demonstrate that the RL approach has learning (i.e., adaptation) potential for traffic PDE systems under uncertain and changing conditions, but RL is neither simple nor a fully safe substitute for model-based control in real traffic systems. [ABSTRACT FROM AUTHOR]

Purpose. To increase output of traffic network while deriving new dependencies of transport flow characteristics upon control law parameters and using them to develop an algorithm to automate a process of the transport flow coordinated regulation within towns and cities. Methodology. The aggregated simulation model, describing processes of road traffic formation within a local section of urban traffic system, is used for the analysis of dependencies to assess quality of transport flow control upon correcting conditions being parameters of traffic cycles within intersections. The abovementioned should involve a PID controller as well as a negative feedback idea to automate control of the road traffi c process. In this context, control criterion is applied to determine critical flow intensity if a traffic jam occurs. The criterion makes it possible to identify changes in the road traffic nature. To determine the optimal settings of the PID controller for diff erent stocks of the stability control system, the standard deviation of the controlled variable from the set value and the mean static control error are defined. The derived dependencies of control quality criteria upon a law of flow regulation have helped develop a new algorithm of the coordinated automated road traffi c control within a local section of urban traffic section using standard control action. Simulation experiments made it possible to assess efficiency of the proposed algorithm of control compared with available ones applied in terms of different road conditions. Findings. As a part of the studies, algorithm of the coordinated automated road traffic has been developed. It helps support maximum output of road systems while monitoring changes in the traffic environment characteristics. Originality. For the first time, dependencies of assessment criteria of traffic flow control upon the parameters of a law of flow intensity regulation have been identified if maximum output of road systems is provided. The dependencies have helped substantiate optimum control criteria for different road conditions while automating a process of coordinated traffic flow regulation within local section of urban traffic network. Practical value. The proposed dependencies of assessment criteria of traffic flow control upon the parameters of a law of flow intensity regulation as well as the algorithm of automated coordinated control are the theoretical foundations to solve such an important applied scientific problem as automation of a process of urban traffic flow regulation. [ABSTRACT FROM AUTHOR]

The tremendous increase in vehicular navigation often witnessed daily has elicited constant and continuous traffic congestion at signalized road intersections. This study focuses on applying an artificial neural network trained by particle swarm optimization (ANN-PSO) to unravel the problem of traffic congestion. Traffic flow variables, such as the speed of vehicles on the road, number of different categories of vehicles, traffic density, time, and traffic volumes, were considered input and output variables for modelling traffic flow of non-autonomous vehicles at a signalized road intersection. Four hundred and thirty-four (434) traffic datasets, divided into thirteen (13) inputs and one (1) output, were obtained from seven roadsites connecting to the N1 Allandale interchange identified as the busiest road in Southern Africa. The results obtained from this research have shown a training and testing performance of 0.98356 and 0.98220. These results are indications of a significant positive correlation between the inputs and output variables. Optimal performance of the ANN-PSO model was achieved by tuning the number of neurons, accelerating factors, and swarm population sizes concurrently. The evidence from this research study suggests that the ANN-PSO model is an appropriate predictive model for the swift optimization of vehicular traffic flow at signalized road intersections. This research extends our knowledge of traffic flow modelling at a signalized road intersection using metaheuristics algorithms. The ANN-PSO model developed in this research will assist traffic engineers in designing traffic lights and creation of traffic rules at signalized road intersections. [ABSTRACT FROM AUTHOR]

The study of traffic flow bifurcation control analysis is of great significance for understanding the essential evolution law of traffic flow, controlling traffic flow with practical means and alleviating traffic congestion. This paper describes the influence of lateral distance compensation in the process of lane change, and adjusts the traffic flow from the perspective of bifurcation control, which can capture the characteristics of traffic flow better, so as to describe the practical significance of the actual traffic phenomenon better. For example, the green ratio of traffic lights in the road, the planning and design of traffic signs, and the guidance of traffic condition prediction in ITS. In addition, the traffic flow is introduced and applied to the traffic model from the perspective of random function, and the bifurcation control is carried out according to the bifurcation behavior in traffic. That is, the bifurcation characteristics of the system are modified by the designed feedback controller, and the appearance of the equilibrium point of the system is adjusted to make it move forward, backward or disappear, so as to prevent or alleviate traffic congestion. There are few researches on bifurcation control of traffic flow model with lateral distance compensation. This paper introduces stochastic function based on lateral compensation model to study Hopf bifurcation phenomenon and Hopf bifurcation control. Firstly, the existence condition of Hopf bifurcation at the equilibrium point in the model is proved theoretically. Then, a feedback controller is designed to control the amplitudes of the Hopf bifurcation and the limit cycles formed by the Hopf bifurcation. Finally, the theoretical results are verified by numerical simulation. The research shows that by adjusting the control parameters in the feedback controller, the influence of boundary conditions on the stability of the traffic system is fully described, the effect of unstable focus and saddle point on the system is inhibited, and the traffic flow is slowed down. In addition, the unstable bifurcation points can be eliminated, and the amplitude of the limit cycle formed by Hopf bifurcation can be adjusted, so as to achieve the stability of the control system. • A new continuum model is proposed taking into account the lateral offset compensation. • Introducing the traffic flow into the traffic model from the perspective of the random function. • The designed feedback controller corrects the bifurcation characteristics of the system and adjusts the appearance of the balance point of the system to make it forward, backward or disappear, so as to prevent or reduce traffic jams. [ABSTRACT FROM AUTHOR]

The objective of this paper is the regulation of freeway traffic by means of optimal control techniques. A first innovative aspect of the proposed approach is the adopted objective function in which, besides the reduction of traffic congestion (which is typically considered in traffic control schemes), the minimization of traffic emissions is also included. Moreover, a multi-class framework is defined in which two classes of vehicles (cars and trucks) are explicitly modelled, and specific control actions for each vehicle class are sought. This results in the formulation of a multi-objective optimal control problem which is described in the paper and for which a specific solution algorithm is developed and used. The algorithm exploits a specific version of the feasible direction algorithm whose effectiveness is demonstrated in the paper by means of simulation results. [ABSTRACT FROM AUTHOR]

• Propose a cooperative signal-free intersection control framework under V2X communications. • Proposed framework integrates virtual platooning control and traffic flow regulation. • Virtual platooning controller mitigates effects of parametric inaccuracies and unparameterized disturbances. • Virtual platooning controller guarantees string stability. • Traffic flow regulation alleviates traffic spillbacks and travel delays. The emerging technologies of connectivity and automation enable the potential for signal-free intersection control. In this context, virtual platooning is posited to be an innovative, decentralized control strategy that maps two-dimensional vehicle movements onto a one-dimension virtual platoon to enable intersection operations. However, the effectiveness of virtual platooning-based control can be limited or degraded by parametric inaccuracies and unparameterized disturbances in vehicle dynamics, heavy traffic congestion, and/or uncoordinated platoons in multi-lane intersections. To explicitly address these limitations, this study proposes a hybrid cooperative intersection control framework consisting of microscopic-level virtual platooning control and macroscopic-level traffic flow regulation for traffic environments with connected autonomous vehicles. In virtual platooning control, vehicles approaching an intersection are organized into coordinated independent virtual platoons to avoid potential conflicts triggered by platoon formation changes. Through coordination, vehicles in a platoon are grouped into compatible passing sets to maintain desired safe spacing when proceeding through the intersection. We propose a distributed adaptive sliding mode controller (DASMC) which uses the backstepping control method and model reference adaptive control method to address parametric inaccuracies, and the sliding mode control method to consistently suppress the negative effects of the unparameterized disturbances. Each vehicle approaching the intersection utilizes the kinematic information from neighboring vehicles to implement the DASMC in a distributed manner such that vehicles within the same virtual platoon can achieve consensus safely. However, virtual platooning control cannot preclude excessive traffic from approaching the intersection, which can cause undesired spillbacks and degrade intersection control performance. To address this issue, traffic flow regulation is integrated with the virtual platooning control using an iterative feedback loop mechanism. In each iteration of the iterative feedback loop, a constrained finite-time optimal control (CFTOC) problem is solved to determine the optimal input flow permitted to proceed through the intersection, and the virtual platooning control provides feedback on the queue status to the CFTOC to initiate the next iteration. The effectiveness of the proposed intersection control framework is evaluated through numerical experiments. The results indicate that the proposed virtual platooning DASMC controller can mitigate the effects of parametric inaccuracies and unparameterized disturbances to achieve consensus for approaching vehicles, as well as guarantee string stability. Further, the proposed framework can alleviate traffic spillbacks and travel delays effectively through traffic flow regulation. [ABSTRACT FROM AUTHOR]

Highlights: [•] Provide a critical review on the approaches to estimating work zone capacity and traffic delay in work zones. [•] Identify the limitations and shortcomings of these approaches. [•] Provide some directions and recommendations for future research. [ABSTRACT FROM AUTHOR]

Copyright of RISTI: Iberian Journal on Information Systems & Technologies / Revista Ibérica de Sistemas e Tecnologias de Informação is the property of Associacao Iberica de Sistemas e Tecnologias de Informacao (AISTI) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

One-directional traffic on two-lanes is modeled in the framework of a spring-block type model. A fraction q of the cars are allowed to change lanes, following simple dynamical rules, while the other cars keep their initial lane. The advance of cars, starting from equivalent positions and following the two driving strategies is studied and compared. As a function of the parameter q the winning probability and the average gain in the advancement for the lane-changing strategy is computed. An interesting phase-transition like behavior is revealed and conclusions are drawn regarding the conditions when the lane changing strategy is the better option for the drivers. [ABSTRACT FROM AUTHOR]

Abstract: The advent of techniques to measure velocities of “GPS equipped vehicles” using satellite technology, replacing the density of the road traffic sensors, motivates and justifies the revision of conceptual, mathematical algorithms and software based models. This paper summarizes studies on the traffic evolutions achieving the minimum of a congestion function controlled “macroscopic traffic velocities” called “celerities” instead of founding traffic regulation on the measures of traffic densities. The flux valued function is the Fenchel transform of the fundamental diagram and is a convex decreasing function. We use the properties of capture basins investigated in viability theory, specifically a Lax–Hopf formula characterizing them and the “Max-Plus” morphism of capture basins for deriving the statements proved in this paper. Traffic conditions involve as well boundary conditions or conditions on trajectories inside the domain. [ABSTRACT FROM AUTHOR]

Abstract: The continuously increasing daily traffic congestions on motorway networks around the world call for innovative control measures that would drastically improve the current traffic conditions. Mainstream traffic flow control (MTFC) is proposed as a novel and efficient motorway traffic management tool, and its possible implementation and principal impact on traffic flow efficiency is analysed. Variable speed limits, suitably operated and enforced, is considered as one (out of several possible) way(s) for MTFC realisation, either as a stand-alone measure or in combination with ramp metering. A previously developed, computationally efficient software tool for optimal integrated motorway network traffic control including MTFC is applied to a large-scale motorway ring-road. It is demonstrated via several investigated control scenarios that traffic flow can be substantially improved via MTFC with or without integration with coordinated ramp metering actions. [Copyright &y& Elsevier]

We describe the development of fast heuristics and methodologies for congestion minimization problems in directional wireless networks, and we compare their performance with optimal solutions. The focus is on the network layer topology control problem (NLTCP) defined by selecting an optimal ring topology as well as the flows on it. Solutions to NLTCP need to be computed in near realtime due to changing weather and other transient conditions and which generally preclude traditional optimization strategies. Using a mixed-integer linear programming formulation, we present both new constraints for this problem and fast heuristics to solve it. The new constraints are used to increase the lower bound from the linear programming relaxation and hence speed up the solution of the optimization problem by branch and bound. The upper and lower bounds for the optimal objective function to the mixed integer problem then serve to evaluate new node-swapping heuristics which we also present. Through a series of tests on different sized networks with different traffic demands, we show that our new heuristics achieve within about 0.5% of the optimal value within seconds. [ABSTRACT FROM AUTHOR]

Although widely accepted, traffic controls are an unnecessary evil, imposed on a road network by governments with no commercial incentive to ensure the free flow of traffic. Far from making our roads safer and less congested, traffic lights make matters worse. They take our eyes off the road, obstruct our progress and cause needless delay. In the process they damage our health, the economy and the environment. There is another way: remove controls and restore the common law principle of first-come, first-served – or ‘filter-in-turn’, as it's known in the Channel Islands. The optimum form of traffic control is self-control. The onus should be on government to prove otherwise. [ABSTRACT FROM AUTHOR]

The author presents his views about the third motor age, wherein the goal of maximizing traffic speed and volume is being balanced against other goals for creating livable settings. He mentions that local elected officials, specifically mayors, stated that the cost of providing even more capacity has been too high, financially and in terms of quality of life. As a traffic engineer, he presents his views about the dominant features of the current road system. Traffic engineers have defined and responded to the traffic problem with vertical thinking and attention has turned to efficient innovations like smart cars, intelligent vehicle highway systems, and better signal systems.

We consider an example to show that the minimum instantaneous cost path principle, as suggested in Friesz et al. [1] for generalising Wardrop's first principle to the dynamic state, may cause some drivers' routes to ‘loop’. These looping routes traverse the same link more than once - indeed, in our example six times. [ABSTRACT FROM AUTHOR]