Skip to main content
https://www.youtube.com/watch?v=cDy9t85_CZk

Government

Design of Experiments Software Simulation Application

Customer Challenges:

Multiple algorithms were developed for routing of unmanned air vehicles performing intelligence, surveillance, and reconnaissance missions, all making use of different input data and generating different output data. There was no clear way to incorporate and execute all of the algorithms in one integrated system, and compare their results across numerous scenarios.

Our Solution:

  • The ISEA TEK team performed an in-depth systems analysis of each individual algorithm.
  • The ISEA TEK team developed an integrated high-fidelity design-of-experiment simulation software capability.
  • This simulation software capability allowed multiple routing algorithms to ‘plug-in’ and participate in the design-of-experiments performance trade-study.
  • The ISEA TEK team also developed a suite of metrics, measures of performance, and measures of effectiveness to assess the performance of the different routing algorithms. These assessments were viewable through a graphical user interface dashboard, as well as through downloadable reports.

Overlapping Collection Requests and Sensor Footprints

Customer Challenges:

For intelligence, surveillance, and reconnaissance missions, there are many different groups that request collection events. These collection events, in many cases, result in overlapping spatial-temporal collection requirements. With limited taskable resources available to perform the collections, the problem was to determine what collection requests to schedule to satisfy all of the collection requirements.

Our Solution:

  • The ISEA TEK team abstracted the real-world problem into the mathematical problem of determining a minimal subset of non-convex 3D polygons that cover the complete set of non-convex 3D polygons.
  • The ISEA TEK team developed mathematical formulations to model the non-convex polygon problem, as well as a specialized convex polygon problem.
  • Based upon the mathematical formulations, the ISEA TEK team developed approximate algorithms to find near-optimal solutions.
  • The ISEA TEK team performed various trade-studies to validate the developed algorithms.

Routing of Collected Data across a Temporally Dynamic Communication Network

Customer Challenges:

For intelligence, surveillance, and reconnaissance missions, once data is collected by an asset, there is the need to transmit that data across a communication network in order for analysis during mission execution. This is a very challenging problem when the communication network is dynamic and temporally evolving, in a mobile ad-hoc network architecture, with limited bandwidth available.

Our Solution:

  • The ISEA TEK team developed mathematical formulations to model the routing of data across temporally dynamic mobile ad-hoc communication networks.
  • The ISEA TEK team developed multiple algorithms, to work in a centralized, locally centralized, and decentralized communication control paradigm.
  • The ISEA TEK team performed various trade-studies to validate the developed algorithms, across multiple design-of-experiments.