Implementation and optimization of multi-agent cooperative game algorithm in urban rail transit train path planning
With the acceleration of urbanisation and population densification, urban rail systems face path planning challenges, and traditional methods are difficult to cope with complex traffic. This study focuses on the application of multi-agent cooperative game algorithm in urban railway train path planning. Based on the theory of cooperative game, we design the algorithm framework, clarify the cooperation mechanism, game rules and benefit distribution among agents, and promote the optimisation of individuals and the whole. Experimental validation shows that compared with the traditional algorithm, the new algorithm significantly reduces the number of iterations (79.39%), path nodes (50%), path length (8.26%), and planning time (5.19%), which verifies its high efficiency and practicality.
Authors
- Pin Zhang (ORCID: https://orcid.org/0000-0002-9004-647X)
- Chuanzhen Liu
- Dali Wu
Institutions
- Tongji University (CN)
Publication Details
- Published
- 2024-11-08
- DOI
- https://doi.org/10.1117/12.3049758
- Primary Topic
- Transportation and Mobility Innovations
- Type
- article
- Field-Weighted Citation Impact
- 0.00