A system architecture for exploiting mission information requirement and resource allocation

In a military scenario, commanders need to determine what kinds of information will help them execute missions. The amount of information available to support each mission is constrained by the availability of information assets. For example, there may be limits on the numbers of sensors that can be deployed to cover a certain area, and limits on the bandwidth available to collect data from those sensors for processing. Therefore, options for satisfying information requirements should take into consideration constraints on the underlying information assets, which in certain cases could simultaneously support multiple missions. In this paper, we propose a system architecture for modeling missions and allocating information assets among them. We model a mission as a graph of tasks with temporal and probabilistic relations. Each task requires some information provided by the information assets. Our system suggests which information assets should be allocated among missions. Missions are compatible with each other if their needs do not exceed the limits of the information assets; otherwise, feedback is sent to the commander indicating information requirements need to be adjusted. The decision loop will eventually converge and the utilization of the resources is maximized.

[1]  A. Nemirovski,et al.  Scenario Approximations of Chance Constraints , 2006 .

[2]  Yuval Rabani,et al.  Allocating bandwidth for bursty connections , 1997, STOC '97.

[3]  Jan Vondrák,et al.  Approximating the stochastic knapsack problem: the benefit of adaptivity , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[4]  Alun D. Preece,et al.  A distributed architecture for heterogeneous multi sensor-task allocation , 2011, 2011 International Conference on Distributed Computing in Sensor Systems and Workshops (DCOSS).

[5]  Alun Preece,et al.  Tasking and sharing sensing assets using controlled natural language , 2012, Defense + Commercial Sensing.

[6]  J. Vondrák,et al.  Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity , 2008 .

[7]  A. Charnes,et al.  Cost Horizons and Certainty Equivalents: An Approach to Stochastic Programming of Heating Oil , 1958 .

[8]  James R. Luedtke,et al.  A Sample Approximation Approach for Optimization with Probabilistic Constraints , 2008, SIAM J. Optim..

[9]  Giuseppe Carlo Calafiore,et al.  The scenario approach to robust control design , 2006, IEEE Transactions on Automatic Control.

[10]  Alun D. Preece,et al.  Integrating hard and soft information sources for D2D using controlled natural language , 2012, 2012 15th International Conference on Information Fusion.

[11]  Alexander Shapiro,et al.  Sample Average Approximation Method for Chance Constrained Programming: Theory and Applications , 2009, J. Optimization Theory and Applications.

[12]  Ashish Goel,et al.  Stochastic load balancing and related problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[13]  Thomas F. La Porta,et al.  Resource Allocation with Stochastic Demands , 2012, 2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems.

[14]  Alun D. Preece,et al.  An Ontology-Centric Approach to Sensor-Mission Assignment , 2008, EKAW.

[15]  Alun D. Preece,et al.  Demo: A distributed architecture for heterogeneous multi sensor-task allocation , 2011, 2011 International Conference on Distributed Computing in Sensor Systems and Workshops (DCOSS).