Minghua Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Minghua Li has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
Chengyong Xu
Beijing Urban Construction Design & Development Group Co., Limited, Beijing 100037, China
1 shared publicationLi Ma
China Academy of Civil Aviation Science and Technology, Beijing 100028, China
1 shared publicationYan Xu
College of Metropolitan Transportation, Beijing University of Technology, Beijing, China
1 shared publication- Yan Xu
Beijing University of Technology
1 shared publication Yun Wei
National Engineering Laboratory for Green & Safe Construction Technology in Urban Rail Transit, Beijing, China
1 shared publication- Yun Wei
Subway Operation Safety Assurance Technology Beijing Key Laboratory, Beijing Mass Transit Railway Operation Corporation Ltd., Beijing, China
1 shared publication
Latest Publications
- Open Access
- 21 January 2022
- Published by Wiley in Journal of Advanced Transportation
- Vol. 2022, 1-19
Dynamic Sign Guidance Optimization for Crowd Evacuation considering Flow Equilibrium
The dynamic exit sign has been verified as an effective means to guide the pedestrian during evacuation. The most critical mechanism with dynamic exit sign guidance is to balance the pedestrian flow on each exit route by optimizing the direction of signs. This paper formulates a bi-level programming model for the direction optimization problem of dynamic signs in buildings. In the bi-level program, the upper-level model is a system optimal model, aiming to minimize the total travel time by optimizing the dynamic sign direction. The lower-level model is a pedestrian assignment model satisfying the dynamic user optimal principle that describes the evacuee exit/route choice behaviour to achieve a balanced pedestrian distribution on the route. A method based on the fundamental diagram, the cell transmission model, and the point-queuing theory is developed to estimate evacuation travel time considering congestion and queuing. A heuristic algorithm is extended to solve the bi-level program. Finally, the proposed methodology is validated with numerical examples. Results reveal that the proposed model can produce the optimal dynamic sign direction, significantly improving the evacuation efficiency.
- 21 January 2022
- Published by Wiley in Journal of Advanced Transportation
- Vol. 2022, 1-19
Open AccessDynamic Sign Guidance Optimization for Crowd Evacuation considering Flow Equilibrium
The dynamic exit sign has been verified as an effective means to guide the pedestrian during evacuation. The most critical mechanism with dynamic exit sign guidance is to balance the pedestrian flow on each exit route by optimizing the direction of signs. This paper formulates a bi-level programming model for the direction optimization problem of dynamic signs in buildings. In the bi-level program, the upper-level model is a system optimal model, aiming to minimize the total travel time by optimizing the dynamic sign direction. The lower-level model is a pedestrian assignment model satisfying the dynamic user optimal principle that describes the evacuee exit/route choice behaviour to achieve a balanced pedestrian distribution on the route. A method based on the fundamental diagram, the cell transmission model, and the point-queuing theory is developed to estimate evacuation travel time considering congestion and queuing. A heuristic algorithm is extended to solve the bi-level program. Finally, the proposed methodology is validated with numerical examples. Results reveal that the proposed model can produce the optimal dynamic sign direction, significantly improving the evacuation efficiency.
- Open Access
- 30 December 2019
- Published by SAGE Publications in Advances in Mechanical Engineering
- Vol. 11 (12)
A route navigation algorithm for pedestrian simulation based on grid potential field
Pedestrian simulation modeling has become an important means to study the dynamic characters of dense populations. In the continuous pedestrian simulation model for complex simulation scenario with obstacles, the pedestrian path planning algorithm is an indispensable component, which is used for the calculation of pedestrian macro path and microscopic movement desired direction. However, there is less efficiency and poor robustness in the existing pedestrian path planning algorithm. To address this issue, we propose a new pedestrian path planning algorithm to solve these problems in this article. In our algorithm, we have two steps to determine pedestrian movement path, that is, the discrete potential fields are first generated by the flood fill algorithm and then the pedestrian desired speeds are determined along the negative gradient direction in the discrete potential field. Combined with the social force model, the proposed algorithm is applied in a corridor, a simple scene, and a complex scene, respectively, to verify its effectiveness and efficiency. The results demonstrate that the proposed pedestrian path planning algorithm in this article can greatly improve the computational efficiency of the continuous pedestrian simulation model, strengthen the robustness of application in complex scenes.
- 30 December 2019
- Published by SAGE Publications in Advances in Mechanical Engineering
- Vol. 11 (12)
Open AccessA route navigation algorithm for pedestrian simulation based on grid potential field
Pedestrian simulation modeling has become an important means to study the dynamic characters of dense populations. In the continuous pedestrian simulation model for complex simulation scenario with obstacles, the pedestrian path planning algorithm is an indispensable component, which is used for the calculation of pedestrian macro path and microscopic movement desired direction. However, there is less efficiency and poor robustness in the existing pedestrian path planning algorithm. To address this issue, we propose a new pedestrian path planning algorithm to solve these problems in this article. In our algorithm, we have two steps to determine pedestrian movement path, that is, the discrete potential fields are first generated by the flood fill algorithm and then the pedestrian desired speeds are determined along the negative gradient direction in the discrete potential field. Combined with the social force model, the proposed algorithm is applied in a corridor, a simple scene, and a complex scene, respectively, to verify its effectiveness and efficiency. The results demonstrate that the proposed pedestrian path planning algorithm in this article can greatly improve the computational efficiency of the continuous pedestrian simulation model, strengthen the robustness of application in complex scenes.