Uncertainty damping in kinetic traffic models by driver-assist controls

In this paper, we propose a kinetic model of traffic flow with uncertain binary interactions, which explains the scattering of the fundamental diagram in terms of the macroscopic variability of aggregate quantities, such as the mean speed and the flux of the vehicles, produced by the microscopic uncertainty. Moreover, we design control strategies at the level of the microscopic interactions among the vehicles, by which we prove that it is possible to dampen the propagation of such an uncertainty across the scales. Our analytical and numerical results suggest that the aggregate traffic flow may be made more ordered, hence predictable, by implementing such control protocols in driver-assist vehicles. Remarkably, they also provide a precise relationship between a measure of the macroscopic damping of the uncertainty and the penetration rate of the driver-assist technology in the traffic stream

Hybrid stochastic kinetic description of two-dimensional traffic dynamics

In this work we present a two-dimensional kinetic traffic model which takes into account speed changes both when vehicles interact along the road lanes and when they change lane. Assuming that lane changes are less frequent than interactions along the same lane and considering that their mathematical description can be done up to some uncertainty in the model parameters, we derive a hybrid stochastic Fokker-Planck-Boltzmann equation in the quasi-invariant interaction limit. By means of suitable numerical methods, precisely structure preserving and direct Monte Carlo schemes, we use this equation to compute theoretical speed-density diagrams of traffic both along and across the lanes, including estimates of the data dispersion, and validate them against real data

Optimisation of Mobile Communication Networks - OMCO NET

The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University. The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing

Particle filter state estimator for large urban networks

This paper applies a particle filter (PF) state estimator to urban traffic networks. The traffic network consists of signalized intersections, the roads that link these intersections, and sensors that detect the passage time of vehicles. The traffic state X(t) specifies at each time time t the state of the traffic lights, the queue sizes at the intersections, and the location and size of all the platoons of vehicles inside the system. The basic entity of our model is a platoon of vehicles that travel close together at approximately the same speed. This leads to a discrete event simulation model that is much faster than microscopic models representing individual vehicles. Hence it is possible to execute many random simulation runs in parallel. A particle filter (PF) assigns weights to each of these simulation runs, according to how well they explain the observed sensor signals. The PF thus generates estimates at each time t of the location of the platoons, and more importantly the queue size at each intersection. These estimates can be used for controlling the optimal switching times of the traffic light

Equation-free analysis of a dynamically evolving multigraph

In order to illustrate the adaptation of traditional continuum numerical techniques to the study of complex network systems, we use the equation-free framework to analyze a dynamically evolving multigraph. This approach is based on coupling short intervals of direct dynamic network simulation with appropriately-defined lifting and restriction operators, mapping the detailed network description to suitable macroscopic (coarse-grained) variables and back. This enables the acceleration of direct simulations through Coarse Projective Integration (CPI), as well as the identification of coarse stationary states via a Newton-GMRES method. We also demonstrate the use of data-mining, both linear (principal component analysis, PCA) and nonlinear (diffusion maps, DMAPS) to determine good macroscopic variables (observables) through which one can coarse-grain the model. These results suggest methods for decreasing simulation times of dynamic real-world systems such as epidemiological network models. Additionally, the data-mining techniques could be applied to a diverse class of problems to search for a succint, low-dimensional description of the system in a small number of variables