Coordinating Dynamical Routes with Statistical Physics on Space-time Networks
arXiv:1806.09289 · doi:10.1103/PhysRevE.99.042123
Abstract
Coordination of dynamical routes can alleviate traffic congestion and is essential for the coming era of autonomous self-driving cars. However, dynamical route coordination is difficult and many existing routing protocols are either static or without inter-vehicle coordination. In this paper, we first apply the cavity approach in statistical physics to derive the theoretical behavior and an optimization algorithm for dynamical route coordination, but they become computational intractable as the number of time segments increases. We therefore map static spatial networks to space-time networks to derive a computational feasible message-passing algorithm compatible with arbitrary system parameters; it agrees well with the analytical and algorithmic results of conventional cavity approach and outperforms multi-start greedy search in saving total travel time by as much as 15% in simulations. The study sheds light on the design of dynamical route coordination protocols, and the solution to other dynamical problems via static analytical approaches on space-time networks.
arXiv comment12 pages, 11 figures
References in corpus (12)
- Diffusion dynamics on multiplex networks
- The random K-satisfiability problem: from an analytic solution to an efficient algorithm
- Scaling laws in the spatial structure of urban road networks
- Phase Transitions in the Coloring of Random Graphs
- The Price of Anarchy in Transportation Networks: Efficiency and Optimality Control
- Transport in weighted networks: Partition into superhighways and roads
- From the Physics of Interacting Polymers to Optimizing Routes on the London Underground
- The Competition for Shortest Paths on Sparse Graphs
- Equilibration through local information exchange in networks
- Shortest node-disjoint paths on random graphs
- The edge-disjoint path problem on random graphs by message-passing
- Coverage versus Supply Cost in Facility Location: Physics of Frustrated Spin Systems
Cited by in corpus (5)
- Sustainable optimal transport in multilayer networks
- Bilevel Optimization for Traffic Mitigation in Optimal Transport Networks
- The Futility of Being Selfish -- The Impact of Selfish Routing on Uncoordinated and Optimized Transportation Networks
- Scalable Node-Disjoint and Edge-Disjoint Multi-wavelength Routing
- Optimally coordinated traffic diversion by statistical physics