Related papers: Scheduling Autonomous Vehicle Platoons Through an …
Electric, intelligent, and network are the most important future development directions of automobiles. Intelligent electric vehicles have shown great potentials to improve traffic mobility and reduce emissions, especially at unsignalized…
In this paper we study the routing and rebalancing problem for a fleet of autonomous vehicles providing on-demand transportation within a congested urban road network (that is, a road network where traffic speed depends on vehicle density).…
We consider the problem of coordinating a collection of robots at an intersection area taking into account dynamical constraints due to actuator limitations. We adopt the coordination space approach, which is standard in multiple robot…
Road congestion induces significant costs across the world, and road network disturbances, such as traffic accidents, can cause highly congested traffic patterns. If a planner had control over the routing of all vehicles in the network,…
This article aims to develop novel path planning algorithms required to deploy multiple unmanned vehicles in Global Positioning System (GPS) denied environments. Unmanned vehicles (ground or aerial) are ideal platforms for executing…
Urban traffic congestion is a chronic problem faced by many cities. It is essentially inefficient infrastructure use which results in increased vehicle fuel consumption and emissions. This in turn adds extra costs to commuters and…
With the advent of autonomous driving technologies, traffic control at intersections is expected to experience revolutionary changes. Various novel intersection control methods have been proposed in the existing literature, and they can be…
This paper explores the application of a new algebraic method of edge coloring, called complex coloring, to the scheduling problems of input queued switches. The proposed distributed parallel scheduling algorithm possesses two important…
We consider the routing flow shop problem with two machines on an asymmetric network. For this problem we discuss properties of an optimal schedule and present a polynomial time algorithm assuming the number of nodes of the network to be…
Vehicle platooning using connected and automated vehicles (CAVs) has attracted considerable attention. In this paper, we address the problem of optimal coordination of CAV platoons at a highway on-ramp merging. We present a single-level…
This paper introduces a novel numerical approach to achieving smooth lane-change trajectories in autonomous driving scenarios. Our trajectory generation approach leverages particle swarm optimization (PSO) techniques, incorporating Neural…
Connected and automated vehicles have shown great potential in improving traffic mobility and reducing emissions, especially at unsignalized intersections. Previous research has shown that vehicle passing order is the key influencing factor…
The emergence of Connected and Automated Vehicles (CAVs) promises better traffic mobility for future transportation systems. Existing research mostly focused on fully-autonomous scenarios, while the potential of CAV control at a mixed…
We study the strategic interaction among vehicles in a non-cooperative platoon coordination game. Vehicles have predefined routes in a transportation network with a set of hubs where vehicles can wait for other vehicles to form platoons.…
We investigate the problem of coordinating human-driven vehicles in road intersections without any traffic lights or signs by issuing speed advices. The vehicles in the intersection are assumed to move along an a priori known path and to be…
Intersections are essential road infrastructures for traffic in modern metropolises. However, they can also be the bottleneck of traffic flows as a result of traffic incidents or the absence of traffic coordination mechanisms such as…
We study a scheduling problem in which jobs may be split into parts, where the parts of a split job may be processed simultaneously on more than one machine. Each part of a job requires a setup time, however, on the machine where the job…
Due to the complex and dynamic character of intersection scenarios, the autonomous driving strategy at intersections has been a difficult problem and a hot point in the research of intelligent transportation systems in recent years. This…
This paper considers the problem of scheduling jobs on single and parallel machines where all the jobs possess different processing times but a common due date. There is a penalty involved with each job if it is processed earlier or later…
The blocking problem naturally arises in transportation systems as multiple vehicles with different itineraries share available resources. In this paper, we investigate the impact of the blocking problem to the waiting time at the…