Algorithms for Dynamic 4D (3D space with time) Volumetric Calculations and Analysis
Navy SBIR FY2010.1
Sol No.: |
Navy SBIR FY2010.1 |
Topic No.: |
N101-019 |
Topic Title: |
Algorithms for Dynamic 4D (3D space with time) Volumetric Calculations and Analysis |
Proposal No.: |
N101-019-1755 |
Firm: |
Inkographics 7925 Romaine Street
suite 306
West Hollywood, California 90046-7187 |
Contact: |
Simon Latyshev |
Phone: |
(323) 356-5314 |
Web Site: |
http://www.inkographics.com |
Abstract: |
Inkographics will develop an algorithm for generating optimal flight paths for two aircraft (protected entity and jammer asset) over terrain with known threat emitters, and implement it in software. This algorithm utilizes a hybrid approach to path generation, borrowing from both reactive and deliberative motion planning techniques. It runs in two stages, defining safe corridor volumes for each aircraft first, and then computing optimal trajectories within these corridors. The safe corridors are generated solving a constrained motion problem, where constraints are derived from flight characteristics/ aircraft dynamics, alignment geometries of aircraft, threat emitter locations and characteristics, and terrain features. Each next set of waypoints is generated with the use of a cost function. At the core of this path-planning algorithm are volumetric calculations such as intersection of jammer acceptability regions with safe corridor segments, as well as the technique for rollback and path branching. These two key components bound runtime performance of the algorithm. The proposed hardware/software architecture is designed in consideration of the defined restriction on runtime performance. The proposed modeling, simulation, visualization, and analysis software provides high-quality 3D visualization as well as playback and interactive capabilities. |
Benefits: |
The proposed implementation will provide an efficient path-planning and trajectory generation algorithm that can be beneficial for autonomous and piloted aircraft in need of an optimal flight path through dynamic volume spaces. Complete with defined hardware/software assembly, algorithm implementation, modeling solution, and analysis functionality it is expected to be of interest for scientific research and engineering R&D. It is modular, and could be readily updated, customized, and changed according to specific requirements of a project. |
Return
|