Formation flight has the potential to significantly reduce aircraft fuel consumption by allowing “follower” aircraft to fly in the aerodynamic wake of “leader” aircraft. However, this requirement for aircraft to be in close proximity for large parts …
The Travelling Salesman and its variations are some of the most well known NP hard optimisation problems. This paper looks to use both centralised and decentralised implementations of Evolutionary Algorithms (EA) to solve a dynamic variant of the …
This paper looks to use both centralised and decentralised implementations of Evolutionary Algorithms to solve a dynamic variant of the Multi-Agent Travelling Salesman Problem. The problem is allocating an active set of tasks to a set of agents …
This paper explores an analytic, geometric approach to finding optimal routes for commercial formation flight. A weighted extension of the classical Fermat point problem is used to develop a scalable methodology for the formation routing problem, …
This thesis investigates the notion of fuel-reduction through formation flight for com- mercial aircraft, addressing the problems of global routing and assignment. A two stage centralised approach is presented, firstly, assuming a reduction in …
This paper explores the impact ground delay can have on designing and executing rendezvous operations such as formation flight. For a given formation pairing the route is fixed, speed policies are then generated to compensate for uncertainty in …
This paper explores an extension to a geometric approach of finding optimal routes for commercial formation flight. An adaption of the Breguet range equation, alongside specific aircraft characteristics, is used to represent realistic aircraft and …
This paper explores a geometric approach to finding optimal routes for commercial formation flight. A weighted extension of the classical Fermat point problem is used to develop an analytic solution to finding optimal routes, thereby reducing the …