Abstract
From a system perspective, one important characteristic of the air traffic system, is the uncertainty or even the lack of knowledge of future states (aircraft trajectories). In a such context, deciding when an action (to solve a conflict) has to be performed is an open issue. However, since the knowledge of future states (aircraft trajectories) is dynamically refined and updated, the air traffic system can be considered as a dynamic system. In this context, attempting to identify an "optimal" time to manoeuvre (and the manoeuvre itself) can be formulated as a problem of optimal control of a dynamic system. It has been shown that this class of problem can be modelled by the Hamilton-Jacobi-Bellman equation. The dynamic programming approach could be used to solve this equation for a dynamic system. As a first attempt to take advantage of this perspective, the paper proposes an initial problem statement (including the HJB equation and a cost function), along with a possible dynamic programming algorithm to solve it. Some simulations have been conducted to stress the impact of different cost functions and level of knowledge about surrounding aircraft.
Original document
The different versions of the original document can be found in:
Document information
Published on 01/01/2001
Volume 2001, 2001
DOI: 10.2514/6.2001-4235
Licence: CC BY-NC-SA license
Share this document
Keywords
claim authorship
Are you one of the authors of this document?