相关论文: A combinatorial model for lane merging

The following optimal stopping problem is considered. The vertices of a graph $G$ are revealed one by one, in a random order, to a selector. He aims to stop this process at a time $t$ that maximizes the expected number of connected…

The weaving ramp scenario is a critical bottleneck in highway networks due to conflicting flows and complex interactions among merging, exiting, and through vehicles. In this work, we propose a game-theoretic model to capture and predict…

Traffic on a circular road is described by dynamic programming equations associated to optimal control problems. By solving the equations analytically, we derive the relation between the average car density and the average car flow, known…

This paper considers an unsignalized intersection used by two traffic streams. A stream of cars is using a primary road, and has priority over the other, low-priority, stream. Cars belonging to the latter stream cross the primary road if…

The fast-growing amount of traffic data brings many opportunities for revealing more insightful information about traffic dynamics. However, it also demands an effective database management system in which information retrieval is arguably…

A flow of moving agents can be observed at different scales. Thus, in traffic modeling, three levels are generally considered: the micro, meso and macro levels, representing respectively the interactions between vehicles, groups of vehicles…

Merging is, in general, a challenging task for both human drivers and autonomous vehicles, especially in dense traffic, because the merging vehicle typically needs to interact with other vehicles to identify or create a gap and safely merge…

Traffic state estimation plays an important role in facilitating effective traffic management. This study develops a combinatorial approach for nonparametric short-term queue length estimation in terms of cycle-by-cycle partially observed…

The effect of mixture lengths of vehicles on the asymmetric exclusion model is studied using numerical simulations for both open and periodic boundaries in parallel dynamics. Densities are calculated as a function of the injecting rates…

We study Schroder paths drawn in a (m,n) rectangle, for any positive integers m and n. We get explicit enumeration formulas, closely linked to those for the corresponding (m,n)-Dyck paths. Moreover we study a Schroder version of…

Set intersection is a fundamental operation in information retrieval and database systems. This paper introduces linear space data structures to represent sets such that their intersection can be computed in a worst-case efficient way. In…

k-nearest neighbor graph is a fundamental data structure in many disciplines such as information retrieval, data-mining, pattern recognition, and machine learning, etc. In the literature, considerable research has been focusing on how to…

A coloring of edges of a finite directed graph turns the graph into finite-state automaton. The synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton…

Given a graph $G(V, E)$ and a positive integer $k$ ($k \geq 1$), a simple path on $k$ vertices is a sequence of $k$ vertices in which no vertex appears more than once and each consecutive pair of vertices in the sequence are connected by an…

The equation of motion of a general class of macroscopic traffic flow models is linearized around a steady uniform flow. A closed-form solution of a boundary-initial value problem is obtained, and it is used to describe several phenomena.…

The anticipated launch of fully autonomous vehicles presents an opportunity to develop and implement novel traffic management systems. Intersections are one of the bottlenecks for urban traffic, and thus offer tremendous potential for…

Ramp merging is considered as one of the major causes of traffic congestion and accidents because of its chaotic nature. With the development of connected and automated vehicle (CAV) technology, cooperative ramp merging has become one of…

In a given scenario, simultaneously and accurately predicting every possible interaction of traffic participants is an important capability for autonomous vehicles. The majority of current researches focused on the prediction of an single…

This dissertation proposes two solutions for urban traffic control in the presence of connected and automated vehicles. First a centralized platoon-based controller is proposed for the cooperative intersection management problem that takes…

In this work, we aim to predict the future motion of vehicles in a traffic scene by explicitly modeling their pairwise interactions. Specifically, we propose a graph neural network that jointly predicts the discrete interaction modes and…