Related papers: Adaptive Constraint Satisfaction for Markov Decisi…

Challenges in last-mile delivery have encouraged innovative solutions like crowdsourced delivery, where online platforms leverage the services of drivers who occasionally perform delivery tasks for compensation. A key challenge is that…

We consider multiple parallel Markov decision processes (MDPs) coupled by global constraints, where the time varying objective and constraint functions can only be observed after the decision is made. Special attention is given to how well…

To minimize collision risks in the multi-agent path planning problem with stochastic transition dynamics, we formulate a Markov decision process congestion game with a multi-linear congestion cost. Players within the game complete…

In this paper, we study the pickup and delivery problem with multiple transportation modalities, and address the challenge of efficiently allocating transportation resources while price matching users with their desired delivery modes. More…

Congestion pricing, while adopted by many cities to alleviate traffic congestion, raises concerns about widening socioeconomic disparities due to its disproportionate impact on low-income travelers. We address this concern by proposing a…

We describe a new coordination mechanism for non-atomic congestion games that leads to a (selfish) social cost which is arbitrarily close to the non-selfish optimal. This mechanism does not incur any additional extra cost, like tolls, which…

Modern commercial ground vehicles are increasingly equipped with multiple operational modalities (e.g., human driving, advanced driver assistance, remote tele-operation, full autonomy). These often rely on heterogeneous sensing…

Congestion pricing has long been hailed as a means to mitigate traffic congestion; however, its practical adoption has been limited due to the resulting social inequity issue, e.g., low-income users are priced out off certain roads. This…

Mass transit systems are experiencing increasing congestion in many cities. The schedule-based transit assignment problem (STAP) involves a joint choice model for departure times and routes, defining a space-time path in which passengers…

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…

The inefficiency of the Wardrop equilibrium of nonatomic routing games can be eliminated by placing tolls on the edges of a network so that the socially optimal flow is induced as an equilibrium flow. A solution where the minimum number of…

We study the impact of player capability on social welfare in congestion games. We introduce a new game, the Distance-bounded Network Congestion game (DNC), as the basis of our study. DNC is a symmetric network congestion game with a bound…

We consider the problem of constrained Markov Decision Process (CMDP) where an agent interacts with a unichain Markov Decision Process. At every interaction, the agent obtains a reward. Further, there are $K$ cost functions. The agent aims…

In this paper, we consider a class of continuous-time, continuous-space stochastic optimal control problems. Building upon recent advances in Markov chain approximation methods and sampling-based algorithms for deterministic path planning,…

The congestion formation on a urban road network is one of the key issue for the development of a sustainable mobility in the future smart cities. In this work we propose a reductionist approach studying the stationary states of a simple…

We investigate the problem of optimal control synthesis for Markov Decision Processes (MDPs), addressing both qualitative and quantitative objectives. Specifically, we require the system to satisfy a qualitative task specified by a Linear…

Urban traffic congestion remains a persistent issue for cities worldwide. Recent macroscopic models have adopted a mathematically well-defined relation between network flow and density to characterize traffic states over an urban region.…

Optimal queueing control of multi-hop networks remains a challenging problem even in the simplest scenarios. In this paper, we consider a two-hop half-duplex relaying system with random channel connectivity. The relay is equipped with a…

In the present paper we deal with an optimal control problem related to a model in population dynamics; more precisely, the goal is to modify the behavior of a given density of individuals via another population of agents interacting with…

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…