-
The fuel consumption doesn’t increase anymore for 3 consecutive steps
-
The mean and mode of the maximum and minimum altitude doesn’t increase for 3 consecutive steps.
In the following picture is represented a typical aircraft trajectory with the variables limits (XiMin; XiMax).
Fig.12 Aircraft trajectory with A320 typical performance parameters (maximum and Minimum speed, altitude, climb time and distance)
5.1.6.2 Dijkstra based trajectory optimizer Dijkstra’s algorithm finds the shortest path from the source node v1 to all other nodes in a network with nonnegative arc weights [29]. Dijkstra’s algorithm maintains a distance label d(i) with each node i, which is an upper bound on the shortest path cost to node i. At any intermediate step, the algorithm divides the nodes into two groups: those which it designates as permanently labeled (or permanent) and those it designates as temporarily labeled (or temporary). The distance label to any permanent node represents the shortest distance from the source to that node. For any temporary node, the distance label is an upper bound on the shortest path distance to that node. The basic idea of the algorithm is to fan out from node v1 and permanently label nodes in the order of their distances from node v1. Initially, we give node v1 a permanent label of zero, and each other node j a temporary label equal to ∞. At each iteration, the label of a node i is its shortest distance from the source node along a path whose internal nodes (i.e., nodes other than v1 or the node i itself) are all permanently labeled.
62
