The Key Problems In Dynamic Route Planning Of Surface Aircrafts In A-SMGCS

With sustained and rapid development of civil aviation transport industry and the domestic airportcontinued expansion in china, the airport scene to implement automatic control guide became inevitabledevelopment trend. This paper solved some problems which were needed for airport surface dynamicroute planning and than gave a method of dynamic route planning. Firstly, gave a method of getting thepredicted arrivel time. In this method, the multiple groups of different aircraft’s track records can beacquired by using simulation program of approach radar; and then arrange these records to obtain aproup of empirical data; the empirical data responses the regular pattern of the target aircraft landing,and then the empirical data is used to be the observed value in Kalman filter, and then fit the data toachieve a fitting equation, then use the fitting equation to extrapolate the target aircraft’s track accordingKalman filter to deduce the ETOA which is more accurate than planned schedule. Secondly, matched theaircraft’s position with the path’s center line. Using the mesh generation method to get a position of thecoordinates from scene monitoring system of the target aircraft.The positioning within the region of thepath as a candidate path, based on the point to the line projection distance, get the shortest path to be acandidate, and through the returned position sequence to determine its direction of movement, and thuspath matched. And using the Calman filter method to reduce error of the direction of the parallel to thepath.Finally, set up an activity network model, using the backtracking Dijkstra algorithm to get a targetfunctions for global sliding time shortest path solution, so as to obtain the scene aircraft candidate paths.Using the airport regulation, the global minimum waiting time as the objective function, thus the optimalpath set, and update the planned routes when the aircraft passed a cross, and when the aircraft deviatedfrom the preselected path, then re-plan.