相关论文: A combinatorial model for lane merging

Highway merges present difficulties for human drivers and automated vehicles due to incomplete situational awareness and a need for a structured (precedence, order) environment, respectively. In this paper, an unstructured merge algorithm…

In this paper, a framework for lane merge coordination is presented utilising a centralised system, for connected vehicles. The delivery of trajectory recommendations to the connected vehicles on the road is based on a Traffic Orchestrator…

Aiming at the problem of driver's perception lag and low utilization efficiency of space-time resources in expressway ramp confluence area, based on the preemptive spatiotemporal trajectory Adjustment system, from the perspective of…

Tandem duplication is an evolutionary process whereby a segment of DNA is replicated and proximally inserted. The different configurations that can arise from this process give rise to some interesting combinatorial questions. Firstly, we…

We propose three models for the traffic of vehicles within a network formed by sites (cities, car-rental agencies, parking lots, etc.) and connected by two-way arteries (roads, highways), that allow forecasting the vehicular flux in a…

Understanding the intentions of drivers at intersections is a critical component for autonomous vehicles. Urban intersections that do not have traffic signals are a common epicentre of highly variable vehicle movement and interactions. We…

Pairs-trading is a trading strategy that involves matching a long position with a short position in two stocks aiming at market-neutral profits. While a typical pairs-trading system monitors the prices of two statistically correlated stocks…

This paper presents a matching mechanism for assigning drivers to routes where the drivers pay a toll for the marginal delay they impose on other drivers. The simple matching mechanism is derived from the RANKING algorithm for online…

Motivated by an emerging framework of Autonomous Modular Vehicles, we consider the abstract problem of optimally routing two modules, i.e., vehicles that can attach to or detach from each other in motion on a graph. The modules' objective…

We give a series of combinatorial results that can be obtained from any two collections (both indexed by $\Z\times \N$) of left and right pointing arrows that satisfy some natural relationship. When applied to certain self-interacting…

Suppose that $m$ drivers each choose a preferred parking space in a linear car park with $n$ spots. In order, each driver goes to their chosen spot and parks there if possible, and otherwise takes the next available spot if it exists. If…

A ride sharing problem is considered where we are given a graph, whose edges are equipped with a travel cost, plus a set of objects, each associated with a transportation request given by a pair of origin and destination nodes. A vehicle…

We address the problem of merging traffic from two roadways consisting of both Connected Autonomous Vehicles (CAVs) and Human Driven Vehicles (HDVs). Guaranteeing safe merging in such mixed traffic settings is challenging due to the…

Interconnected road lanes are a central concept for navigating urban roads. Currently, most autonomous vehicles rely on preconstructed lane maps as designing an algorithmic model is difficult. However, the generation and maintenance of such…

Two mobile agents, starting from different nodes of a network modeled as a graph, and woken up at possibly different times, have to meet at the same node. This problem is known as rendezvous. We consider deterministic distributed rendezvous…

This paper extends our previous work in [1],[2], on optimal scheduling of autonomous vehicle arrivals at intersections, from one to a grid of intersections. A scalable distributed Mixed Integer Linear Program (MILP) is devised that solves…

In train routing, the headway is the minimum distance that must be maintained between successive trains for safety and robustness. We introduce a model for train routing that requires a fixed headway to be maintained between trains, and…

A two-lane extension of a recently proposed cellular automaton model for traffic flow is discussed. The analysis focuses on the reproduction of the lane usage inversion and the density dependence of the number of lane changes. It is shown…

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…

The congestion of a motorway section is propagated to its neighbouring sections, leading to correlations. The resulting correlation matrix encodes the information on congestion. Here, we study symmetrized time-lagged correlations and show…