arXiv (All)
open access
The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand
Autonomous ride-hailing platforms must strategically position idle robotaxis to minimize the wait times of prospective riders. We formalize this as the robotaxi placement problem ($k$-RP). Given a finite metric space and a demand distribution over its points, the goal is to position $k$ robotaxis to
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- ROBIN: activity based robot management system#260709
- Efficient Mathematical Programming Formulation and Algorithmic Framework for Optimal Camera Placement#1063732
- An Exact Algorithm for the Max-Min Covering Location Blocker Problem#1064628
- Skill-Space Shooting for Autonomous Robot Policy Improvement#1142473
- Skill-Space Shooting for Autonomous Robot Policy Improvement#1122272
Record · ID 1199840
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive