Aerospace energy conservation utilizing optimum methods

In general, the minimum path problem is concerned with finding shortest paths between a start to an end node in the minimum distance sense. There are many interesting algorithms which may be utilized for that purpose, that fall under the category of the Euclidian travelling salesman problem [1] and [2]. Although these methodologies determine the optimum waypoint guidance to be traversed by an aerial vehicle, to reach a destination, there is need for the inclusion of dynamical and functional constraints in order to describe the means to reach the goal. While the resulting path(s) are of minimum-distance sense they do not take into account the energy requirements. Consequently wasting fuel the path may not be feasible or reachable. In the included work the arbitrary energy requirements for the mission are described with a focus on optimum-energy demand for a waypoint based sequence of elementary walks. The later is illustrated through a simulation of an aircraft which needs to reach a goal from a source point passing via intermediate waypoints of interest. In addition wind disturbances are included in the formulation and analysis.