相关论文: A combinatorial model for lane merging

The Longest Path Problem is a question of finding the maximum length between pairs of vertices of a graph. In the general case, the problem is NP-complete. However, there is a small collection of graph classes for which there exists an…

We consider the exclusion process on a ring with time-dependent defective bonds at which the hoping rate periodically switches between zero and one. This system models main roads in city traffics, intersecting with perpendicular streets. We…

Urban intersections are prone to delays and inefficiencies due to static precedence rules and occlusions limiting the view on prioritized traffic. Existing approaches to improve traffic flow, widely known as automatic intersection…

Traffic congestion has large economic and social costs. The introduction of autonomous vehicles can potentially reduce this congestion by increasing road capacity via vehicle platooning and by creating an avenue for influencing people's…

We consider navigation schemes on planar diluted lattices and semi lattices with one discrete and one continuous component. More precisely, nodes that survive inhomogeneous Bernoulli site percolation, or are placed as inhomogeneous Poisson…

Graphs drawn in the plane are ubiquitous, arising from data sets through a variety of methods ranging from GIS analysis to image classification to shape analysis. A fundamental problem in this type of data is comparison: given a set of such…

Enhancing simulation environments to replicate real-world driver behavior, i.e., more humanlike sim agents, is essential for developing autonomous vehicle technology. In the context of highway merging, previous works have studied the…

Combinatorial games are two-player games of pure strategy where the players, usually called Left and Right, move alternately. In this paper, we introduce Cheating Robot games. These arise from simultaneous-play combinatorial games where one…

A conjecture attributed to Smith states that every pair of longest cycles in a $k$-connected graph intersect each other in at least $k$ vertices. In this paper, we show that every pair of longest cycles in a~$k$-connected graph on $n$…

Statistical mechanics of a disordered system of cars on a single-lane road is developed. Behaviour of cars is defined by conditional probability of car velocity depending on the distance and velocity of the car ahead. A system consisting of…

We generalize a recently introduced traffic model, where the statistical weights are associated with whole trajectories, to the case of two-way flow. An interaction between the two lanes is included which describes a slowing down when two…

When a new vehicle joins a lane, those behind may have to temporarily slow to accommodate them. Changing lane can be forced due to lane drops or junctions, but may also take place spontaneously at discretion of drivers, and recent studies…

Recent research has paid little attention to complex driving behaviors, namely merging car-following and lane-changing behavior, and how lane-changing affects algorithms designed to model and control a car-following vehicle. During the…

In this paper we investigate the growth rate of the number of all possible paths in graphs with respect to their length in an exact analytical way. Apart from the typical rates of growth, i.e. exponential or polynomial, we identify…

We consider a system of ordered cars moving in $\R$ from right to left. Each car is represented by a point in $\R$; two or more cars can occupy the same point but cannot overpass. Cars have two possible velocities: either 0 or 1. An…

In this paper we study a traffic intersection with vehicle-actuated traffic signal control. Traffic lights stay green until all lanes within a group are emptied. Assuming general renewal arrival processes, we derive exact limiting…

Given a finite directed graph, a coloring of its edges turns the graph into a finite-state automaton. A k-synchronizing word of a deterministic automaton is a word in the alphabet of colors at its edges that maps the state set of the…

Traffic flow prediction, particularly in areas that experience highly dynamic flows such as motorways, is a major issue faced in traffic management. Due to increasingly large volumes of data sets being generated every minute, deep learning…

We consider the class of directed graphs with $N\geq 1$ edges and without loops shorter than $k\geq1$. Using the concept of a labelled graph, we determine graphs from this class that maximize the number of all paths of length $k$. Then we…

Laman graphs naturally arise in structural mechanics and rigidity theory. Specifically, they characterize minimally rigid planar bar-and-joint systems which are frequently needed in robotics, as well as in molecular chemistry and polymer…