Routing autonomous vehicles in congested transportation networks: structural properties and coordination algorithms
- 572 Downloads
This paper considers the problem of routing and rebalancing a shared fleet of autonomous (i.e., self-driving) vehicles providing on-demand mobility within a capacitated transportation network, where congestion might disrupt throughput. We model the problem within a network flow framework and show that under relatively mild assumptions the rebalancing vehicles, if properly coordinated, do not lead to an increase in congestion (in stark contrast to common belief). From an algorithmic standpoint, such theoretical insight suggests that the problems of routing customers and rebalancing vehicles can be decoupled, which leads to a computationally-efficient routing and rebalancing algorithm for the autonomous vehicles. Numerical experiments and case studies corroborate our theoretical insights and show that the proposed algorithm outperforms state-of-the-art point-to-point methods by avoiding excess congestion on the road. Collectively, this paper provides a rigorous approach to the problem of congestion-aware, system-wide coordination of autonomously driving vehicles, and to the characterization of the sustainability of such robotic systems.
KeywordsSelf-driving cars Intelligent transportation systems Vehicle routing Autonomous systems
The authors would like to thank Zachary Sunberg for his analysis on the road network symmetry of U.S. cities.
Supplementary material 1 (mp4 10550 KB)
- Balmer, M., Rieser, M., Meister, K., Charypar, D., Lefebvre, N., & Nagel, K. (2009). MATSim-t: Architecture and simulation times. In A. Ana Bazzan & F. Klügl (Eds.), Multi-agent systems for traffic and transportation engineering (pp. 57–78).Google Scholar
- Barnard, M. (2016). Autonomous cars likely to increase congestion. Available at http://cleantechnica.com/2016/01/17/autonomous-cars-likely-increase-congestion. Accessed 15 Feb 2017.
- Bureau of Public Roads. (1964). Traffic assignment manual. Technical Report, U.S. Department of Commerce, Urban Planning Division.Google Scholar
- Cornuejols, G., Nemhauser, G. L., & Wolsey, L. A. (1990). The uncapacitated facility location problem. In P. B. Mirchandani & R. L. Francis (Eds.), Discrete location theory (pp. 119–171). Hoboken: Wiley.Google Scholar
- Goldberg, A., Oldham, J., Plotkin, S., & Stein, C. (1998). An implementation of a combinatorial approximation algorithm for minimum-cost multicommodity flow. In International conference on integer programming and combinatorial optimization.Google Scholar
- Goldberg, A. V., Tardos, E., & Tarjan, R. E. (1990). Network flow algorithms. In B. H. Korte (Ed.), Algorithms and combinatorics. Volume 9: paths, flows, and VLSI-layout (pp. 101–161). Springer-Verlag.Google Scholar
- Horni, A., Nagel, K., & Axhausen, K. W. (Eds.). (2016). The multi-agent transport simulation MATSim. London: Ubiquity Press.Google Scholar
- Maciejewski, M., Bischoff, J., Hrl, S., & Nagel, K. (2018). Towards a testbed for dynamic vehicle routing algorithms. In International conference on practical applications of agents and multi-agent systems—Workshop on the application of agents to passenger transport (PAAMS-TAAPS) (in press).Google Scholar
- Mitchell, W. J., Borroni-Bird, C. E., & Burns, L. D. (2010). Reinventing the automobile: Personal urban mobility for the 21st century. Cambridge: MIT Press.Google Scholar
- Papageorgiou, M., Hadj-Salem, H., & Blosseville, J. M. (1991). ALINEA: A local feedback control law for on-ramp metering. Transportation Research Record: Journal of the Transportation Research Board, 1320, 58–64.Google Scholar
- Spieser, K., Treleaven, K., Zhang, R., Frazzoli, E., Morton, D., & Pavone, M. (2014). Toward a systematic approach to the design and evaluation of autonomous mobility-on-demand systems: A case study in Singapore. In: G. Meyer & S. Beiker (Eds.), Road vehicle automation (pp. 229–245). Springer.Google Scholar
- Srinivasan, A. (1999). A survey of the role of multicommodity flow and randomization in network design and routing. In P. M. Pardalos, S. Rajasekaran, & J. D. P. Rolim (Eds.), Randomization methods in algorithm design: DIMACS Workshop, December 12–14, 1997 (pp. 271–302). American Mathematical Society.Google Scholar
- Templeton, B. (2010). Traffic congestion & capacity. Available at http://www.templetons.com/brad/robocars/congestion.html. Accessed 15 Feb 2017.
- Treleaven, K., Pavone, M., & Frazzoli, E. (2011). An asymptotically optimal algorithm for pickup and delivery problems. In Proceedings of IEEE Conference on decision and control.Google Scholar
- Treleaven, K., Pavone, M., & Frazzoli, E. (2012). Models and efficient algorithms for pickup and delivery problems on roadmaps. In Proceedings of IEEE conference on decision and control.Google Scholar
- Urmson, C. (2014). Just press go: Designing a self-driving vehicle. Available at http://googleblog.blogspot.com/2014/05/just-press-go-designing-self-driving.html. Accessed 15 Feb 2017.
- Wilkie, D., van den Berg, J. P., Lin, M. C., & Manocha, D. (2011). Self-aware traffic route planning. In Proceedings of AAAI conference on artificial intelligence.Google Scholar
- Wilkie, D., Baykal, C., & Lin, M. C. (2014). Participatory route planning. In ACM SIGSPATIAL.Google Scholar
- Xiao, N., Frazzoli, E., Luo, Y., Li, Y., Wang, Y., & Wang, D. (2015). Throughput optimality of extended back-pressure traffic signal control algorithm. In Mediterranean conference on control and automation.Google Scholar
- Zhang, R., Rossi, F., & Pavone, M. (2016). Model predictive control of autonomous mobility-on-demand systems. In Proceedings of IEEE conference on robotics and automation.Google Scholar