A novel evolutionary route planner for aircraft is proposed in this paper. In the new planner, individual candidates are evaluated with respect to the workspace, thus the computation of the configuration space is not ...A novel evolutionary route planner for aircraft is proposed in this paper. In the new planner, individual candidates are evaluated with respect to the workspace, thus the computation of the configuration space is not required. By using problem-specific chromosome structure and genetic operators, the routes are generated in real time, with different mission constraints such as minimum route leg length and flying altitude, maximum turning angle, maximum climbing/diving angle and route distance constraint taken into account.展开更多
A conflict is an event in which two or more aircraft experience a loss of minimum separation. In this paper, we formulate the problem of solving conflicts arising among several aircraft moving in a shared airspace as ...A conflict is an event in which two or more aircraft experience a loss of minimum separation. In this paper, we formulate the problem of solving conflicts arising among several aircraft moving in a shared airspace as a Constraint Satisfaction Problem (CSP). The constraint satisfaction problem being NP-complete, the algorithms developed to solve it have been of two types: non-systematic and systematic search methods. In this paper, we have considered a breakout algorithm as an example of non-systematic search methods and a backtracking procedure that maintains Arc Consistency (MAC) as an example of systematic search methods. The performance of these algorithms was compared experimentally and the Breakout algorithm is shown to be clearly superior.展开更多
文摘A novel evolutionary route planner for aircraft is proposed in this paper. In the new planner, individual candidates are evaluated with respect to the workspace, thus the computation of the configuration space is not required. By using problem-specific chromosome structure and genetic operators, the routes are generated in real time, with different mission constraints such as minimum route leg length and flying altitude, maximum turning angle, maximum climbing/diving angle and route distance constraint taken into account.
文摘A conflict is an event in which two or more aircraft experience a loss of minimum separation. In this paper, we formulate the problem of solving conflicts arising among several aircraft moving in a shared airspace as a Constraint Satisfaction Problem (CSP). The constraint satisfaction problem being NP-complete, the algorithms developed to solve it have been of two types: non-systematic and systematic search methods. In this paper, we have considered a breakout algorithm as an example of non-systematic search methods and a backtracking procedure that maintains Arc Consistency (MAC) as an example of systematic search methods. The performance of these algorithms was compared experimentally and the Breakout algorithm is shown to be clearly superior.