Coordinated Routing Mechanisms (CRM) for Connected Vehicle Systems

1. Modeling: proposing snapshot equilibrium routing mechanisms based on atomic game theories to mitigate traffic congestion without violating travelers’ self-interests.
2. Solution: developing efficient and robust distributed solution algorithms to solve large-scale game models in real-time for online navigation services and handle unstable wireless communications commonly encountered in real-world applications.
3. Optimality: Designing information perturbations, and information incentives and utilizing game theories to push snapshot equilibrium routing decisions toward system optimal while satisfying travelers’ selfish nature without using externalities such as regulations and tolls.
4. Scalability: developing routing coordination potential theories and applying AI to form routing coordination coalitions that could solve the scalability issue of implementing CRM in big cities with a large scale of travelers.
5. Extension. Applying the coordination strategy to improve the system’s efficiency in other transportation scenarios such as parking, ridesharing, EV charging, etc.

Figure 4. Concept and Research development for CRM.

Funding source: NSF career award, 1818526; NSF award, 2124858; STRIDE UTC H3 project.