Fibreoptic Guided Missiles: Optimization of Flight Paths

摘要

This report addresses the problem of finding the optimal paths between the launchsite and the target area for a system of fiber optic guided missiles. The missiles will try to avoid flying over areas with high risk. A network model of the problem together with algorithms to solve it is developed. First we look at how to solve the problem with a dynamic programming approach. The dynamic programming algorithm that is used finds the k node-disjoint paths with a minimum total cost. Also, we look at an algorithm concerning how to restrict the maximum number of nodes, and therefore also the length, in a path. Secondly, we investigate briefly how a neural network can be implemented to solve the problem. In this mehtod, we iterate a solution that converges toward the optimal one. A test is run on the first dynamic programming algorithm and presented in the appendix.