1,721,082 research outputs found
A Micro-Simulation Study of the Generalized Proportional Allocation Traffic Signal Control
In this paper, we study the problem of determining phase activations for signalized junctions by utilizing feedback, more specifically, by measure the queue-lengths on the incoming lanes to each junction. The controller we are investigating is the Generalized Proportional Allocation (GPA) controller, which has previously been shown to have desired stability and throughput properties in a continuous averaged dynamical model for queueing networks. In this paper, we provide and implement two discretized versions of the GPA controller in the SUMO micro simulator. We also compare the GPA controllers with the MaxPressure controller, a controller that requires more information than the GPA, in an artificial Manhattan-like grid. To show that the GPA controller is easy to implement in a real scenario, we also implement it in a previously published realistic traffic scenario for the city of Luxembourg and compare its performance with the static controller provided with the scenario. The simulations show that the GPA performs better than a static controller for the Luxembourg scenario, and better than the MaxPressure pressure controller in the Manhattan-grid when the demands are low
Evaluation of Decentralized Feedback Traffic Light Control with Dynamic Cycle Length
An established rule of thumb in the field of traffic light control prescribes that, during periods of higher demand, it is convenient to have longer cycles. This is in order to reduce the fraction of the cycle length when no incoming lanes receive green light. In this paper, we simulate a novel, provably stable, decentralized feedback traffic light control policy with variable cycle length. The proposed control strategy is fully decentralized and does not require any information about the network structure or the turning rates. Through simulations on a micro simulator, we compare the performance of our variable cycle length policy to a similar feedback policy with fixed cycle length and with a fixed-time control policy. The simulations show that having dynamic cycle lengths allows one to significantly reduce the overall queue lengths in the network, in both medium and low demands
On Generalized Proportional Allocation Policies for Traffic Signal Control
The fast-increasing demand and relatively slow growth of infrastructure capacity are providing a strong motivation for research in real-time urban traffic controls that make the best use of novel sensing in order to increase efficiency and resilience of the transportation system. In our contribution, we focus on a class of dynamic feedback traffic signal control policies that are based on a generalized proportional allocation rule. The proposed traffic signal controls are decentralized (they make use of local information only), scalable (they are independent of the network size and topology), and universal (they do not rely on any information about external inflows or turning ratios). In spite of their fully distributed nature, we prove that such control policies achieve a global objective, maximum throughput, in that they stabilize the urban traffic network whenever possible under the given capacity constraints. The traffic model we consider consists in a network of interconnected vertical queues with deterministic dynamics driven by physical laws (conservation of mass and preservation of non-negativity of the traffic volumes) as well as scheduling constraints (described as a set of phases, each phase consisting in a subset of lanes that can be be given green light simultaneously). This results in a differential inclusion for which we prove existence and, in the special case of orthogonal phases, uniqueness of continuous solutions via a generalization of the reflection principle. Stability is then proved by interpreting the generalized proportional allocation controllers as minimizers of a certain entropy-like function that is then used as a Lyapunov function for the closed-loop system
On Distributed Optimal Control of Traffic Flows in Transportation Networks
We propose and analyze distributed computation algorithms for finite-horizon optimal control problems in transportation networks. We model traffic flow dynamics by the cell-transmission model and focus on two problems: system-optimum dynamic traffic assignment (where the routing is part of the optimization) and freeway network control (where the routing is exogenous and the optimization is confined to speed limits and ramp-metering controls). While these are non-convex problems, we focus on some recently proposed provably exact convex relaxations and apply Alternating Direction Method of Multipliers techniques. We present fully distributed iterative algorithms and implement them on some transportation network testbeds, testing their convergence speed and accuracy
Entropy-like Lyapunov Functions for the Stability Analysis of Adaptive Traffic Signal Controls
Stability of some decentralized traffic signal control policies for urban traffic networks is studied. It is proven that, whenever the arrival rates belong to a certain region -which is the largest where stability is possible- the resulting traffic network dynamics admit a globally asymptotically stable equilibrium. The results rely on the use of some entropy-like Lyapunov functions previously considered in the context of stochastic queuing networks
Going Beyond Counting First Authors in Author Co-citation Analysis
The present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
We provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
Dispelling the Myths Behind First-author Citation Counts
We conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
- …
