Urban Microcirculation Traffic Network Planning Method Based on Fast Search Random Tree Algorithm
Unbalanced urban development causes complex and diverse urban traffic conditions, which complicates microcirculation traffic network planning. To address this, a method based on fast search random tree algorithm is proposed. An urban microcirculation traffic network is constructed using directed gra...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Zagreb, Faculty of Transport and Traffic Sciences
2024-12-01
|
| Series: | Promet (Zagreb) |
| Subjects: | |
| Online Access: | https://traffic2.fpz.hr/index.php/PROMTT/article/view/749 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1846114425247891456 |
|---|---|
| author | Ning YU |
| author_facet | Ning YU |
| author_sort | Ning YU |
| collection | DOAJ |
| description | Unbalanced urban development causes complex and diverse urban traffic conditions, which complicates microcirculation traffic network planning. To address this, a method based on fast search random tree algorithm is proposed. An urban microcirculation traffic network is constructed using directed graphs, and road network interference intensity and capacity are calculated. The interpolation collision detection method is used to determine the shortest path while considering constraint conditions. By incorporating target gravity into the RRT algorithm, a growth guidance function is obtained, optimising the planned path and completing urban microcirculation traffic network planning. Experimental results demonstrate accurate shortest path calculation with up to 11% delay reduction compared to existing methods. Energy consumption during planning is lower than 10 kJ, ensuring fair resource distribution within the urban microcirculation transportation network. These advantages highlight the practicality and effectiveness of this research method. |
| format | Article |
| id | doaj-art-1cc939c2d3b248b89bcd3a287d1bd5b8 |
| institution | Kabale University |
| issn | 0353-5320 1848-4069 |
| language | English |
| publishDate | 2024-12-01 |
| publisher | University of Zagreb, Faculty of Transport and Traffic Sciences |
| record_format | Article |
| series | Promet (Zagreb) |
| spelling | doaj-art-1cc939c2d3b248b89bcd3a287d1bd5b82024-12-20T11:28:44ZengUniversity of Zagreb, Faculty of Transport and Traffic SciencesPromet (Zagreb)0353-53201848-40692024-12-013661120113210.7307/ptt.v36i6.749749Urban Microcirculation Traffic Network Planning Method Based on Fast Search Random Tree AlgorithmNing YU0Qiqihar University, School of Architecture and Civil EngineeringUnbalanced urban development causes complex and diverse urban traffic conditions, which complicates microcirculation traffic network planning. To address this, a method based on fast search random tree algorithm is proposed. An urban microcirculation traffic network is constructed using directed graphs, and road network interference intensity and capacity are calculated. The interpolation collision detection method is used to determine the shortest path while considering constraint conditions. By incorporating target gravity into the RRT algorithm, a growth guidance function is obtained, optimising the planned path and completing urban microcirculation traffic network planning. Experimental results demonstrate accurate shortest path calculation with up to 11% delay reduction compared to existing methods. Energy consumption during planning is lower than 10 kJ, ensuring fair resource distribution within the urban microcirculation transportation network. These advantages highlight the practicality and effectiveness of this research method.https://traffic2.fpz.hr/index.php/PROMTT/article/view/749fast search random tree algorithmmicrocirculation trafficroad network planningshortest pathgrowth guidance function |
| spellingShingle | Ning YU Urban Microcirculation Traffic Network Planning Method Based on Fast Search Random Tree Algorithm Promet (Zagreb) fast search random tree algorithm microcirculation traffic road network planning shortest path growth guidance function |
| title | Urban Microcirculation Traffic Network Planning Method Based on Fast Search Random Tree Algorithm |
| title_full | Urban Microcirculation Traffic Network Planning Method Based on Fast Search Random Tree Algorithm |
| title_fullStr | Urban Microcirculation Traffic Network Planning Method Based on Fast Search Random Tree Algorithm |
| title_full_unstemmed | Urban Microcirculation Traffic Network Planning Method Based on Fast Search Random Tree Algorithm |
| title_short | Urban Microcirculation Traffic Network Planning Method Based on Fast Search Random Tree Algorithm |
| title_sort | urban microcirculation traffic network planning method based on fast search random tree algorithm |
| topic | fast search random tree algorithm microcirculation traffic road network planning shortest path growth guidance function |
| url | https://traffic2.fpz.hr/index.php/PROMTT/article/view/749 |
| work_keys_str_mv | AT ningyu urbanmicrocirculationtrafficnetworkplanningmethodbasedonfastsearchrandomtreealgorithm |