Fair Planning for Mobility-on-Demand with Temporal Logic Requests
Kaier Liang, Cristian-Ioan Vasile

TL;DR
This paper introduces a scalable, fair multi-vehicle route planning approach for mobility-on-demand systems that handles complex temporal logic demands, ensuring near-envy-free allocations and improved operational efficiency.
Contribution
It presents a novel ILP-based method with automata and assignment graphs for fair, efficient routing under complex temporal demands in large-scale mobility systems.
Findings
Significantly reduces utility deviation among agents.
Decreases vehicle vacancy rates in case studies.
Demonstrates scalability in large urban environments.
Abstract
Mobility-on-demand systems are transforming the way we think about the transportation of people and goods. Most research effort has been placed on scalability issues for systems with a large number of agents and simple pick-up/drop-off demands. In this paper, we consider fair multi-vehicle route planning with streams of complex, temporal logic transportation demands. We consider an approximately envy-free fair allocation of demands to limited-capacity vehicles based on agents' accumulated utility over a finite time horizon, representing for example monetary reward or utilization level. We propose a scalable approach based on the construction of assignment graphs that relate agents to routes and demands, and pose the problem as an Integer Linear Program (ILP). Routes for assignments are computed using automata-based methods for each vehicle and demands sets of size at most the capacity…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTransportation and Mobility Innovations · Transportation Planning and Optimization · Traffic control and management
