Solutions of Airspace Conflicts Based on Raster Method and Monte Carlo Method

To detect and resolve airspace conflicts swiftly and effectively, a new method is proposed according to the idea of designing an airspace conflict detection algorithm based on global discrete grids put forward by Zhao Guhao et al. Airspace conflicts are detected by rasterization and the evaluation model of airspace resolution is established by the matrix corresponding to the airspace grid, with the best moving distance obtained by the Monte Carlo method. At the same time, to expedite the results, the method of constructing a letter matrix was adopted, using different letters to distinguish between different airspaces. This approach provides a clearer assessment of airspace conflicts and aids in devising conflict resolution strategies. Following the establishment of the method for judging and resolving airspace conflicts, verification was conducted through simulation experiments, leading to the determination of airspace conflict and resolution strategies. Subsequent research will focus on improving the precision of airspace gridification while simultaneously enhancing the speed of obtaining airspace resolution strategies. In small and mediumsized airspace conflicts, the algorithm can detect the aircraft sending conflicts in quick and simple manners, and bring forth the corresponding scheme to resolve airspace conflicts.