REVIEW 3 cited by
Robo-taxi Fleet Coordination at Scale via Reinforcement Learning
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Fleets of robo-taxis offering on-demand transportation services, commonly known as Autonomous Mobility-on-Demand (AMoD) systems, hold significant promise for societal benefits, such as reducing pollution, energy consumption, and urban congestion. However, orchestrating these systems at scale remains a critical challenge, with existing coordination algorithms often failing to exploit the systems' full potential. This work introduces a novel decision-making framework that unites mathematical modeling with data-driven techniques. In particular, we present the AMoD coordination problem through the lens of reinforcement learning and propose a graph network-based framework that exploits the main strengths of graph representation learning, reinforcement learning, and classical operations research tools. Extensive evaluations across diverse simulation fidelities and scenarios demonstrate the flexibility of our approach, achieving superior system performance, computational efficiency, and generalizability compared to prior methods. Finally, motivated by the need to democratize research efforts in this area, we release publicly available benchmarks, datasets, and simulators for network-level coordination alongside an open-source codebase designed to provide accessible simulation platforms and establish a standardized validation process for comparing methodologies. Code available at: https://github.com/StanfordASL/RL4AMOD
Forward citations
Cited by 3 Pith papers
-
Multi-Agent Path Finding via Finite-Horizon Hierarchical Factorization
A receding-horizon hierarchical factorization algorithm for multi-agent path finding that reduces time-to-first-action by up to 60% versus an offline baseline.
-
Robust Vehicle Rebalancing with Deep Uncertainty in Autonomous Mobility-on-Demand Systems
DURO uses a graph-LSTM network to output demand prediction intervals, then solves a robust rebalancing model; in single-morning NYC simulations it reduces waiting times versus deterministic baselines and runs about 60...
-
Robo-Taxi Fleet Coordination with Accelerated High-Capacity Ridepooling
Two heuristic accelerations, data-driven clique filtering and shareability-graph partitioning, speed up the Alonso-Mora 2017 high-capacity ridepooling algorithm on Manhattan data.
Discussion (0). Continue with ORCID to comment.