Related papers: Problems on One Way Road Networks
Recently, adaptive graph convolutional network based traffic prediction methods, learning a latent graph structure from traffic data via various attention-based mechanisms, have achieved impressive performance. However, they are still…
In this paper we consider Contact graphs of Paths on a Grid (CPG graphs), i.e. graphs for which there exists a family of interiorly disjoint paths on a grid in one-to-one correspondence with their vertex set such that two vertices are…
We present in this article an algebraic approach to model and simulate road traffic networks. By defining a set of road traffic systems and adequate concatenating operators in that set, we show that large regular road networks can be easily…
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…
Maximum throughput requires path diversity enabled by bifurcating traffic at different network nodes. In this work, we consider a network where traffic bifurcation is allowed only at a subset of nodes called \emph{routers}, while the rest…
Multi-lane roads are typical scenarios in the real-world traffic system. Vehicles usually have preference on lanes according to their routes and destinations. Few of the existing studies looks into the problem of controlling vehicles to…
We address the problem of optimally controlling Connected and Automated Vehicles (CAVs) arriving from four multi-lane roads at an intersection where they conflict in terms of safely crossing (including turns) with no collision. The…
In the freeway network control (FNC) problem, the operation of a traffic network is optimized using only flow control. For special cases of the FNC problem, in particular the case when all merging flows are controlled, there exist tight…
In earlier work, a decentralized optimal control framework was established for coordinating online connected and automated vehicles (CAVs) at urban intersections. The policy designating the sequence that each CAV crosses the intersection,…
Traffic forecasting is an important prerequisite for the application of intelligent transportation systems in urban traffic networks. The existing works adopted RNN and CNN/GCN, among which GCRN is the state of art work, to characterize the…
The notion of forbidden-transition graphs allows for a robust generalization of walks in graphs. In a forbidden-transition graph, every pair of edges incident to a common vertex is permitted or forbidden; a walk is compatible if all pairs…
The application of machine learning techniques in the setting of road networks holds the potential to facilitate many important intelligent transportation applications. Graph Convolutional Networks (GCNs) are neural networks that are…
Trajectory planning and control have historically been separated into two modules in automated driving stacks. Trajectory planning focuses on higher-level tasks like avoiding obstacles and staying on the road surface, whereas the controller…
Assessing the resilience of a road network is instrumental to improve existing infrastructures and design new ones. Here we apply the optimal path crack model (OPC) to investigate the mobility of road networks and propose a new proxy for…
We introduce the problem of finding a spanning tree along with a partition of the tree edges into fewest number of feasible sets, where constraints on the edges define feasibility. The motivation comes from wireless networking, where we…
A topological theory initiated recently by the author uses methods of algebraic topology to estimate numerically the character of instabilities arising in motion planning algorithms. The present paper studies random motion planning…
Circular layouts are a popular graph drawing style, where vertices are placed on a circle and edges are drawn as straight chords. Crossing minimization in circular layouts is \NP-hard. One way to allow for fewer crossings in practice are…
We introduce the notion of a network's conduciveness, a probabilistically interpretable measure of how the network's structure allows it to be conducive to roaming agents, in certain conditions, from one portion of the network to another.…
A graph $G$ is called $B_k$-VPG, for some constant $k\geq 0$, if it has a string representation on an axis-parallel grid such that each vertex is a path with at most $k$ bends and two vertices are adjacent in $G$ if and only if the…
The increasing wireless communication capabilities of vehicles creates opportunities for more efficient intersection management strategies. One promising approach is the replacement of traffic lights with a system wherein vehicles run…