Regional Boundary Control of Traffic Network Based on MFD and FR-PID
Bibliographic record
Abstract
In recent years, urban traffic congestion has become more serious and the capacity of roads has declined, resulting in frequent traffic accidents. In order to effectively alleviate the traffic congestion of the regional road network, aiming at the problem of lack of accurate OD data of the road network, a regional boundary control method of the traffic network based on fuzzy RBF neural network PID (FR-PID) is proposed by combining the theory of macroscopic fundamental diagram (MFD). Firstly, based on the traffic survey, the simulation model of the study area is built, and the basic data such as the traffic flow and the time occupation rate of each road section are obtained. Secondly, the simulation data are used to test the existence of MFD in the road network, and the controlled area is defined. Then, the vehicle change model of the road network area is established. Then, in view of the problem of poor adaptive ability of traditional PID control, the FR-PID control structure is designed. Finally, an example is verified by VISSIM software. In the simulation, different control methods are used for comparison and verification, and the simulation results are analyzed. The results show that the control effect of the proposed method is better than that of the traditional method, and the regional average accumulative vehicle number, regional average completed volume, regional accumulative delays, and total vehicle travel time are optimized by 28.21%, 41.19%, 27.06%, and 32.73%, respectively. The research results can provide reference for the management of urban congestion, thereby reducing the number of traffic accidents and improving urban traffic safety.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".