Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2311.03268

Congestion-aware Ride-pooling in Mixed Traffic for Autonomous Mobility-on-Demand Systems

Fabio Paparella·Leonardo Pedroso·Theo Hofman·Mauro Salazar
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper presents a modeling and optimization framework to study congestion-aware ride-pooling Autonomous Mobility-on-Demand (AMoD) systems, whereby self-driving robotaxis are providing on-demand mobility, and users headed in the same direction share the same vehicle for part of their journey. Specifically, taking a mesoscopic time-invariant perspective and on the assumption of a large number of travel requests, we first cast the joint ride-pooling assignment and routing problem as a quadratic program that does not scale with the number of demands and can be solved with off-the-shelf convex solvers. Second, we compare the proposed approach with a significantly simpler decoupled formulation, whereby only the routing is performed in a congestion-aware fashion, whilst the ride-pooling assignment part is congestion-unaware. A case study of Sioux Falls reveals that such a simplification does not significantly alter the solution and that the decisive factor is indeed the congestion-aware routing. Finally, we solve the latter problem accounting for the presence of user-centered private vehicle users in a case study of Manhattan, NYC, characterizing the performance of the car-network as a function of AMoD penetration rate and percentage of pooled rides within it. Our results show that AMoD can significantly reduce congestion and travel times, but only if at least 40% of the users are willing to be pooled together. Otherwise, for higher AMoD penetration rates and low percentage of pooled rides, the effect of the additional rebalancing empty-vehicle trips can be even more detrimental than the benefits stemming from a centralized routing, worsening congestion and leading to an up to 15% higher average travel time.

Explore related subjects

eess.SYcs.SYmath.OC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fabio Paparella, Leonardo Pedroso, Theo Hofman, Mauro Salazar. 2023-11-06. Congestion-aware Ride-pooling in Mixed Traffic for Autonomous Mobility-on-Demand Systems. https://arxiv.org/abs/2311.03268

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Ensuring Stability of Non-Minimal Modes in Input-Output Data-Driven Representation

Many recent data-driven control approaches for linear time-invariant systems are based on output trajectory prediction using input-output data matrices. The system dynamics described by this predictor, which we refer to as the input-output data-driven representation, yields non-unique autoregressive with exogenous inputs (ARX) models having possibly unstable non-minimal modes. In this note, we show that the stability of these non-minimal modes is ensured by a certain choice of ARX model, which coincides with the minimum-norm least-squares predictor using the Moore-Penrose inverse of the data matrix. This stability guarantee holds regardless of the underlying system's stability. Moreover, the stability persists under sufficiently small noise in data when a suitably truncated Moore-Penrose inverse is used. Consequently, the ARX model need not be reduced to the true system order in order to avoid unstable additional modes.

eess.SY↗
arXiv2026

Optimization-Based Formation Flight on Libration Point Orbits

A model predictive control (MPC) framework is developed for station-keeping in spacecraft formation flight along libration point orbits. At each control period, the MPC policy solves a multi-vehicle optimal control problem (MVOCP) that tracks a reference trajectory, while enforcing path constraints on the relative motion of the formation. The control policy makes use of a limited set of control nodes consistent with operational constraints that allow only a small number of maneuver opportunities per revolution. To promote recursive feasibility, path constraints are progressively tightened across the prediction horizon. An isoperimetric reformulation of the constraints is used to prevent inter-sample violations. The resulting MVOCP is a nonconvex program, which is solved via sequential convex programming. The proposed approach is evaluated in a high-fidelity ephemeris model under uncertainties for a formation along the near-rectilinear halo orbit (NRHO), and subject to path constraints on inter-spacecraft separation and relative Sun phase angle. The results demonstrate maintenance of a spacecraft formation that satisfies the path constraints with realistic cumulative propellant consumption.

eess.SY↗
arXiv2026

Certificates Synthesis for A Class of Observational Properties in Stochastic Systems: A Unified Approach

In this paper, we investigate the probabilistic formal verification of stochastic dynamical systems over continuous state spaces. Motivated by problems in state estimation and information-flow security, we introduce the notion of observational properties, which characterize the inferences an external observer can draw from system outputs. These properties are formulated as probabilistic hyperproperties based on HyperLTL over finite traces, yielding a unified framework that subsumes several existing notions studied separately in the literature. We reduce the verification problem to reachability analysis over an augmented structure that integrates the system dynamics with an automaton representation of the specification. Building on this construction, we develop stochastic barrier certificates that provide probabilistic guarantees for property satisfaction while avoiding explicit state-space discretization. The effectiveness of the proposed framework is demonstrated through a case study.

eess.SY↗