Grid Free Algorithms for Strike Planning for Cruise Missiles

Abstract : This document contains two technical reports related to the development of a strike plan for a multiple cruise missile launch. The first report presents an extension of our previous algorithm for finding a short path with few segments from a designated origin to a designated destination that either avoids all threat regions or satisfies some probability constraint for a successful traversal based on proximity to the threats. In our previous work the threat regions were restricted to be circles, but based on this new work they may now also be modeled as convex polygons. The second report presents an algorithm for automatic generation of a strike plan for multiple missions which assures some reasonable path separation for missiles having a common origin and destination. This new algorithm utilizes the enhanced single mission algorithm presented in the first report.