|Appears in Collections:||Computing Science and Mathematics Journal Articles|
|Peer Review Status:||Refereed|
|Title:||An Interval Type-2 Fuzzy Logic Based Map Matching Algorithm for Airport Ground Movements|
Brownlee, Alexander E I
Woodward, John R
airport ground movement
interval type- 2 fuzzy logic
|Citation:||Wang X, Brownlee AEI, Weiszer M, Woodward JR, Mahfouf M & Chen J (2022) An Interval Type-2 Fuzzy Logic Based Map Matching Algorithm for Airport Ground Movements. <i>IEEE Transactions on Fuzzy Systems</i>, 31 (2), pp. 582-595. https://doi.org/10.1109/TFUZZ.2022.3221793|
|Abstract:||Airports and their related operations have become the major bottlenecks to the entire air traffic management system, raising predictability, safety and environmental concerns. One of the underpinning techniques for digital and sustainable air transport is airport ground movement optimisation. Currently, real ground movement data is made freely available for the majority of aircraft at many airports. However, the recorded data is not accurate enough due to measurement errors and general uncertainties. In this paper, we aim to develop a new interval type-2 fuzzy logic based map matching algorithm, which can match each raw data point to the correct airport segment. To this aim, we first specifically design a set of interval type-2 Sugeno fuzzy rules and their associated rule weights, as well as the model output, based on preliminary experiments and sensitivity tests. Then, the fuzzy membership functions are fine-tuned by a particle swarm optimisation algorithm. Moreover, an extra checking step using the available data is further integrated to improve map matching accuracy. Using the real-world aircraft movement data at Hong Kong Airport, we compared the developed algorithm with other well-known map matching algorithms. Experimental results show that the designed interval type-2 fuzzy rules have the potential to handle map matching uncertainties, and the extra checking step can effectively improve map matching accuracy. The proposed algorithm is demonstrated to be robust and achieve the best map matching accuracy of over 96% without compromising the run time.|
|Rights:||© 2022 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.|
|TFS_R1 (1).pdf||Fulltext - Accepted Version||6.04 MB||Adobe PDF||View/Open|
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/
If you believe that any material held in STORRE infringes copyright, please contact firstname.lastname@example.org providing details and we will remove the Work from public display in STORRE and investigate your claim.