Author
Listed:
- Can Chen
(Department of Civil and Environmental Engineering, The Hong Kong Polytechnic University, Kowloon, Hong Kong 999077, China)
- Nikolas Geroliminis
(Urban Transport Systems Laboratory, School of Architecture, Civil and Environmental Engineering, EPFL, CH-1015 Lausanne, Switzerland)
- Renxin Zhong
(School of Intelligent Systems Engineering, Sun Yat-Sen University, Shenzhen 518107, China)
Abstract
Macroscopic fundamental diagrams (MFDs) have been widely adopted to model the traffic flow of large-scale urban networks. Coupling perimeter control and regional route guidance (PCRG) is a promising strategy to decrease congestion heterogeneity and reduce delays in large-scale MFD-based urban networks. For MFD-based PCRG, one needs to distinguish between the dynamics of (a) the plant that represents reality and is used as the simulation tool and (b) the model that contains easier-to-measure states than the plant and is used for devising controllers, that is, the model-plant mismatch should be considered. Traditional model-based methods (e.g., model predictive control (MPC)) require an accurate representation of the plant dynamics as the prediction model. However, because of the inherent network uncertainties, such as uncertain dynamics of heterogeneity and demand disturbance, MFD parameters could be time-varying and uncertain. Conversely, existing data-driven methods (e.g., reinforcement learning) do not consider the model-plant mismatch and the limited access to plant-generated data, for example, subregional OD-specific accumulations. Therefore, we develop an iterative adaptive dynamic programming (IADP)-based method to address the limited data source induced by the model-plant mismatch. An actor-critic neural network structure is developed to circumvent the requirement of complete information on plant dynamics. Performance comparisons with other PCRG schemes under various scenarios are carried out. The numerical results indicate that the IADP controller trained with a limited data source can achieve comparable performance with the “benchmark” MPC approach using perfect measurements from the plant. The results also validate the IADP’s robustness against various uncertainties (e.g., demand noise, MFD error, and trip distance heterogeneity) when minimizing the total time spent in the urban network. These results demonstrate the great potential of the proposed scheme in improving the efficiency of multiregion MFD systems.
Suggested Citation
Can Chen & Nikolas Geroliminis & Renxin Zhong, 2024.
"An Iterative Adaptive Dynamic Programming Approach for Macroscopic Fundamental Diagram-Based Perimeter Control and Route Guidance,"
Transportation Science, INFORMS, vol. 58(4), pages 896-918, July.
Handle:
RePEc:inm:ortrsc:v:58:y:2024:i:4:p:896-918
DOI: 10.1287/trsc.2023.0091
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:58:y:2024:i:4:p:896-918. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.