The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Robotic load balancing for mobility-on-demand systems
Open accessAbstract
In this paper we develop methods for maximizing the throughput of a mobility-on-demand urban transportation system. We consider a finite group of shared vehicles, located at a set of stations. Users arrive at the stations, pickup vehicles, and drive (or are driven) to their destination station where they drop-off the vehicle. When some origins and destinations are more popular than others, the system will inevitably become out of balance: vehicles will build up at some stations, and become depleted at others. We propose a robotic solution to this rebalancing problem that involves empty robotic vehicles autonomously driving between stations. Specifically, we utilize a fluid model for the customers and vehicles in the system. Then, we develop a rebalancing policy that lets every station reach an equilibrium in which there are excess vehicles and no waiting customers and that minimizes the number of robotic vehicles performing rebalancing trips. We show that the optimal rebalancing policy can be found as the solution to a linear program. We use this solution to develop a real-time rebalancing policy which can operate in highly variable environments. Finally, we verify policy performance in a simulated mobility-on-demand environment and in hardware experiments.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Differential equations with discontinuous right hand sides
(1989) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(89)90171-7 · Cited by 4,893
Differential Equations with Discontinuous Righthand Sides
Filippov, A. F. (1988) · Mathematics and Its Applications · doi:10.1007/978-94-015-7793-9 · Cited by 4,720
(2006) · Algorithms and Combinatorics 21 · doi:10.1007/3-540-29297-7 · Cited by 1,156
Dynamic load balancing for distributed memory multiprocessors
Cybenko, G. (1989) · Journal of Parallel and Distributed Computing · doi:10.1016/0743-7315(89)90021-x · Cited by 997
Parragh, S. N., Doerner, K. F., & Hartl, R. F. (2008) · Journal für Betriebswirtschaft · doi:10.1007/s11301-008-0036-4 · Cited by 857
Foundations of Dynamic Traffic Assignment: The Past, the Present and the Future
Peeta, S., & Ziliaskopoulos, A. K. (2001) · Networks and Spatial Economics · doi:10.1023/a:1012827724856 · Cited by 779
Dynamic pickup and delivery problems
Berbeglia, G., Cordeau, J.-F., & Laporte, G. (2010) · European Journal of Operational Research · doi:10.1016/j.ejor.2009.04.024 · Cited by 679
A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem
Friesz, T. L., Bernstein, D. H., Smith, T. E., Tobin, R. L., & Wie, B. (1993) · Operations Research · doi:10.1287/opre.41.1.179 · Cited by 663
Combinatorial optimization: Theory and algorithms
(2001) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(01)90023-9 · Cited by 600
Dynamic load balancing on Web-server systems
Cardellini, V., Colajanni, M., & Yu, P. S. (1999) · IEEE Internet Computing · doi:10.1109/4236.769420 · Cited by 559
Ziliaskopoulos, A. K. (2000) · Transportation Science · doi:10.1287/trsc.34.1.37.12281 · Cited by 498
(2005) · Embedding Problems in Symplectic Geometry · doi:10.1515/9783110199697.107 · Cited by 461
Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem
Friesz, T. L., Luque, J., Tobin, R. L., & Wie, B. (1989) · Operations Research · doi:10.1287/opre.37.6.893 · Cited by 430
Robotics: Science and Systems V
(2009) · doi:10.15607/rss.2009.v · Cited by 367
The DARPA Urban Challenge: Autonomous Vehicles in City Traffic
(2009) · Springer Tracts in Advanced Robotics · doi:10.1007/978-3-642-03991-1 · Cited by 341
Optimality Conditions for a Dynamic Traffic Assignment Model
Merchant, D. K., & Nemhauser, G. L. (1978) · Transportation Science · doi:10.1287/trsc.12.3.200 · Cited by 324
The 2005 DARPA Grand Challenge: The Great Robot Race
(2007) · Springer Tracts in Advanced Robotics · doi:10.1007/978-3-540-73429-1 · Cited by 276
Reinventing the automobile: personal urban mobility for the 21st century
(2010) · Choice Reviews Online · doi:10.5860/choice.48-1430 · Cited by 239
Reinventing the Automobile: Personal Urban Mobility for the 21st Century
Mitchell, W. J., Hainley, B. E., & Burns, L. D. (2010) · The MIT Press eBooks · doi:10.7551/mitpress/8490.001.0001 · Cited by 203
The 2005 DARPA Grand Challenge – The Great Robot Race
(2008) · Industrial Robot: An International Journal · doi:10.1108/ir.2008.04935fae.001 · Cited by 198
The role of smart bike-sharing systems in urban mobility
Midgley, P. (2009) · Cited by 195
Load Balancing for Mobility-on-Demand Systems
Pavone, M., Smith, S. L., Frazzoli, E., & Rus, D. L. (2011) · Robotics: Science and Systems · doi:10.15607/rss.2011.vii.034 · Cited by 52
Self-citationUser Behavior Evaluation of an Intelligent Shared Electric Vehicle System
Barth, M., & Todd, M. (2001) · Transportation Research Record Journal of the Transportation Research Board · doi:10.3141/1760-19 · Cited by 31
Cited by
On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment
Alonso-Mora, J., Samaranayake, S., Wallar, A., Frazzoli, E., & Rus, D. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1611675114 · Cited by 1,186
Self-citationPlanning and Decision-Making for Autonomous Vehicles
Schwarting, W., Alonso-Mora, J., & Rus, D. (2018) · Annual Review of Control, Robotics, and Autonomous Systems · doi:10.1146/annurev-control-060117-105157 · Cited by 972
Self-citationSpieser, K., Treleaven, K., Zhang, R., Frazzoli, E., Morton, D., & Pavone, M. (2014) · Lecture Notes in Mobility · doi:10.1007/978-3-319-05990-7_20 · Cited by 426
Self-citationControl of robotic mobility-on-demand systems: A queueing-theoretical perspective
Zhang, R., & Pavone, M. (2016) · The International Journal of Robotics Research · doi:10.1177/0278364915581863 · Cited by 367
Self-citationSurvey of E-scooter users in Vienna: Who they are and how they ride
Laa, B., & Leth, U. (2020) · Journal of Transport Geography · doi:10.1016/j.jtrangeo.2020.102874 · Cited by 288
Metadata
- Authors
- Pavone, M., Smith, S. L., Frazzoli, E., & Rus, D.
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- Published
- 2012-05-11
- Volume
- 31
- Issue
- 7
- Pages
- 839-854
- ISSN
- 0278-3649 (ISSN-L)
- 1741-3176
- OpenAlex
- W2064526960
- Cited by
- 287
- References
- 23
- FWCI
- 10.97
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.