Safety assessment of approximate segregated parallel operation on closely spaced parallel runways

With the continuous growth of air traffic flow, some airports in China or other countries begin to construct Closely Spaced Parallel Runways(CSPR) to meet the capacity requirement of civil aviation. In this paper, the simulation and calculation method of flight trajectory is developed,as well as the collision risk calculation method and wake vortex encounter risk calculation method.New methods for departure and go-around procedures are proposed to achieve approximate segregated parallel operation in an attempt to obtain approximately the same results on closely spaced parallel runways as on widely spaced parallel runways. By comparing with the independent parallel departure and segregated parallel operation in ICAO Doc. 9643, it is found that the lateral separation between aircraft in this proposal is not less than the separations in the other two cases. Based on the simulation calculation of flight trajectories under different conditions, the probabilities of collision conflict and encountering wake vortex are lower than those in current operation plan.The proposed plan has no special requirements in pilot operation, control command procedures,airport facilities, or meteorological observation and prediction, so it is convenient to promote and implement at the airports with closely spaced parallel runways.

Cooperative coalition for formation flight scheduling based on incomplete information

This study analyzes the cooperative coalition problem for formation scheduling based on incomplete information. A multi-agent cooperative coalition framework is developed to optimize the formation scheduling problem in a decentralized manner. The social class differentiation mech- anism and role-assuming mechanism are incorporated into the framework, which, in turn, ensures that the multi-agent system （MAS） evolves in the optimal direction. Moreover, a further differen- tiation pressure can be achieved to help MAS escape from local optima. A Bayesian coalition nego- tiation algorithm is constructed, within which the Harsanyi transformation is introduced to transform the coalition problem based on incomplete information to the Bayesian-equivalent coali- tion problem based on imperfect information. The simulation results suggest that the distribution of agents＇ expectations of other agents＇ unknown information approximates to the true distribution after a finite set of generations. The comparisons indicate that the MAS cooperative coalition algo- rithm produces a significantly better utility and possesses a more effective capability of escaping from local optima than the proposal-engaged marriage algorithm and the Simulated Annealing algorithm.