|
Algorithms for Dynamic 4D (3D space with time) Volumetric Calculations and Analysis
Navy SBIR 2010.1 - Topic N101-019 NAVAIR - Mrs. Janet McGovern - [email protected] Opens: December 10, 2009 - Closes: January 13, 2010 N101-019 TITLE: Algorithms for Dynamic 4D (3D space with time) Volumetric Calculations and Analysis TECHNOLOGY AREAS: Information Systems, Electronics, Battlespace ACQUISITION PROGRAM: Joint Strike Fighter RESTRICTION ON PERFORMANCE BY FOREIGN CITIZENS (i.e., those holding non-U.S. Passports): This topic is "ITAR Restricted." The information and materials provided pursuant to or resulting from this topic are restricted under the International Traffic in Arms Regulations (ITAR), 22 CFR Parts 120 - 130, which control the export of defense-related material and services, including the export of sensitive technical data. Foreign Citizens may perform work under an award resulting from this topic only if they hold the "Permanent Resident Card", or are designated as "Protected Individuals" as defined by 8 U.S.C. 1324b(a)(3). If a proposal for this topic contains participation by a foreign citizen who is not in one of the above two categories, the proposal will be rejected. OBJECTIVE: Develop an innovative software capability that can correctly and efficiently calculate the optimal flight path given the terrain data, aircraft position, flight characteristics, and positions of known threat emitters. Proposed solutions should identify required computer hardware configuration, third party tools, algorithms, and techniques. The software should execute within the mission planning timeline, and the developed algorithms should allow users to retrieve the data from the calculations to effectively place a sensor at the right place and at the right time to be effective. DESCRIPTION: An optimal flight path is often required to maximize the effectiveness of a mission. This may, for example, include a flight path in which friendly forces are least vulnerable to hostile attack, or a flight path in which friendly forces can perform most efficiently given the known location of hostile resources and weapons. The basis for determining the best flight path is to evaluate the volume space as a function of time with respect to all known resources between the friendly and the hostile forces. The optimal path will be constrained by flight performance characteristics and will maximize the performance of the friendly forces. Inputs to the algorithm would include threat emitter locations, weapon locations, aircraft position, and flight characteristics. The expected output would be a flight path that includes turnpoints, with specified time, speed, and course corrections. The algorithm should consider: This effort should also include analysis tools that provide: The performance of this algorithm will be a critical factor given mission planning execution timelines. These timelines would be dependent on the density of calculation points, and will be specified. PHASE I: Develop a proof of concept that identifies the techniques and algorithms that will be used, along with third party tools. The effort should identify the minimum computer hardware configuration required. Proof of concept should show that the performance requirements will be met. PHASE II: Develop and demonstrate prototype software to meet the performance requirements. PHASE III: Integrate software with existing systems, and extend software to improve capability based on realistic scenarios. PRIVATE SECTOR COMMERCIAL POTENTIAL/DUAL-USE APPLICATIONS: The tool has potential for all sensor and communications related applications involving calculation of optimal flight paths through dynamic volume spaces. REFERENCES: 2. Bailey, C. "Department of Defense Usage of FalconView." http://www.blm.gov/pgdata/etc/medialib/blm/nifc/aviation/airspace.Par.77886.File.dat/FalconView.pdf. KEYWORDS: 3D Visualization; Volume Space; Mission Planning; Electronic Attack; Optimal Flight Path Routing; Software Algorithms
|