Mine Drift Prediction Tactical Decision Aid (TDA) Navy SBIR FY2013.2 Sol No.: Navy SBIR FY2013.2 Topic No.: N132-136 Topic Title: Mine Drift Prediction Tactical Decision Aid (TDA) Proposal No.: N132-136-0614 Firm: Ocean Acoustical Services and Instrumentation Syst 5 Militia Drive Lexington, Massachusetts 02421 Contact: Kevin Heaney Phone: (703) 346-3676 Web Site: oasislex.com Abstract: Drifting mines pose a serious threat to the safe passage of US and international naval and commercial shipping traffic. In this SBIR, OASIS Inc. proposes to combine two algorithms developed under ONR/SPAWAR funding into a Mine Drift Tactical Decision Aid (MD-TDA). These algorithms include a tracer forecasting method, developed by the University of New Orleans and the Naval Research Lab, and an optimal path-planning algorithm developed by OASIS. Safe Q-routing (a detailed flight plan that includes specific transit lanes and turns) will be determined using a combination of dynamic ocean model forecasting that includes uncertainty, assimilation of in-situ measurements and situational awareness, and non-linear optimization algorithms. These tools will be integrated into a state-of-the-art 3D visualization mission-planning package for a prototype of the MD-TDA during Phase I. In Phase II these algorithms will be integrated with standard Mine Counter Measures (MCM) Command and Control (C2) systems. Benefits: The potential commercial benefits of the integration of mine-risk forecasting and optimal path planning are significant. A critical task for all of the world's navies is providing safe passage for their vessels in regions where floating mines could be present. The advent of rogue and failed states has made this a pressing geo-political problem. The commercial development of a safe Q-route planning TDA would also be of benefit to the merchant marine community. This mine-presence risk forecasting methodology could also easily be extended to consider additional threat sources and produce such products as Pirate Risk Forecasts and safe optimal Q-routing for path planning. Return