Related papers: Dispatching Fire Trucks under Stochastic Driving T…

This paper considers the dispatching of large-scale real-time ride-sharing systems to address congestion issues faced by many cities. The goal is to serve all customers (service guarantees) with a small number of vehicles while minimizing…

Real-world multi-agent planning problems cannot be solved using decision-theoretic planning methods due to the exponential complexity. We approximate firefighting in rescue simulation as a spatially distributed task and model with…

In this paper, we investigate the charging scheduling optimization problem for large electric truck fleets operating with dedicated charging infrastructure. A central coordinator jointly determines the charging sequence and power allocation…

We study the trade-off between delivery delay and energy consumption in a delay tolerant network in which a message (or a file) has to be delivered to each of several destinations by epidemic relaying. In addition to the destinations, there…

Platooning is a way to significantly reduce fuel consumption of trucks. Vehicles that drive at close inter-vehicle distance assisted by automatic controllers experience substantially lower air-drag. In this paper, we deal with the problem…

In this paper we consider a real time queuing system with rewards and deadlines. We assume that packet processing time is known upon arrival, as is the case in communication networks. This assumption allows us to demonstrate that the well…

Platooning connected and autonomous vehicles (CAVs) provide significant benefits in terms of traffic efficiency and fuel economy. However, most existing platooning systems assume the availability of pre-determined plans, which is not…

In this paper, we study a dynamic pickup and delivery problem with docking constraints. There is a homogeneous fleet of vehicles to serve pickup-and-delivery requests at given locations. The vehicles can be loaded up to their capacity,…

We study a transportation problem where two heavy-duty trucks travel across the national highway from separate origins to destinations, subject to individual deadline constraints. Our objective is to minimize their total fuel consumption by…

Same-day delivery for e-commerce has become a popular service. Companies usually offer several time delivery options with the earliest one being next hour delivery. Due to tight delivery deadlines and thin margins, companies often find it…

Truck platooning refers to a series of trucks driving in close proximity via communication technologies, and it is considered one of the most implementable systems of connected and automated vehicles, bringing huge energy savings and safety…

We propose a real-time decision framework for multimodal freight dispatch through a system of hierarchical hubs, using a probabilistic model for transit times. Instead of assigning a fixed time to each transit, we advocate using historical…

We propose an optimal solution to a deterministic dynamic assignment problem by leveraging connections to the theory of discrete optimal transport to convert the combinatorial assignment problem into a tractable linear program. We seek to…

Shared autonomous electric vehicles can provide on-demand transportation for passengers while also interacting extensively with the electric distribution system. This interaction is especially beneficial after a disaster when the large…

In this work, we address the problem of charging coordination between electric trucks and charging stations. The problem arises from the tension between the trucks' nontrivial charging times and the stations' limited charging facilities.…

Mobile-edge computing (MEC) emerges as a promising paradigm to improve the quality of computation experience for mobile devices. Nevertheless, the design of computation task scheduling policies for MEC systems inevitably encounters a…

We consider emergent situations that require transporting individuals from their locations to a facility using a single capacitated vehicle, where transportation duration has a negative impact on the individuals. A dispatcher determines…

This paper considers the vehicle routing problem with stochastic demands (VRPSD) under optimal restocking. We develop an exact algorithm that is effective for solving instances with many vehicles and few customers per route. In our…

We address multi-robot safe mission planning in uncertain dynamic environments. This problem arises in several applications including safety-critical exploration, surveillance, and emergency rescue missions. Computation of a multi-robot…

Due to recurrent (e.g. daily or weekly) patterns and non-recurrent disruptions (e.g. caused by incidents), travel times in road networks are time-dependent and inherently random. This is challenging for travelers planning a future trip,…