We present a combinatorial assignment algorithm for reserving space-time trajectories from origins to destinations given an ordered list of vehicles. Space-time trajectories include guaranteed arrival times at every node in the path, including at the destination. Traffic flows are modeled using the cell transmission model, a Godunov approximation to the kinematic wave model. Space-time trajectories are constructed to follow the cell transmission model constraints and first-in-first-out behavior. Reservation-based intersection control for connected autonomous vehicles, which determines intersection access and delays for individual vehicles, is used to ensure that reserved trajectories are followed. The algorithm is suitable for city networks. Results show that vehicles with higher priority tend to have much lower travel times. In addition, the trajectory reservation system reduced overall congestion in the network compared with dynamic user equilibrium assignments.
Bibliographical noteFunding Information:
Acknowledgements The authors are grateful for the support of the Data-Supported Transportation Operations & Planning Center and the National Science Foundation, Grant No. 1254921.
© 2018, Springer Science+Business Media, LLC, part of Springer Nature.
- Autonomous vehicles
- Cell transmission model
- Dynamic traffic assignment
- Trajectory reservation