Abstract

The airport apron is a high-risk area for aircraft collisions due to its heavy operational load and high aircraft density. Currently, existing quantitative models for apron collision risk provide limited consideration and classification of risk areas. In response, this paper proposes a Petri net-based method for assessing aircraft collision risk. The method predicts the probability of aircraft reaching different areas at different times based on operational data, enabling the calculation of collision risks within the Petri net framework. This approach highlights areas with potential collision risks and provides a classification evaluation. Subsequently, aircraft path re-planning is carried out to reduce collision risks. The model simplifies the complex operations of the apron system, making the calculation process clearer. The results show that, during the mid-phase of aircraft taxiing, there is a significant deviation between the actual and ideal positions of aircraft. Areas with high taxiway occupancy are more prone to collision risks. On peak days, due to relatively high flight volumes, the frequency of collision risks is 14% higher than on regular days, with an average risk increase of 23.3%, and the risks are more concentrated. Therefore, reducing collision risks through path planning becomes more challenging. It is recommended to focus attention on areas with high taxiway occupancy during peak periods and carefully plan routes to ensure apron safety.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.