Hidden Markov Model and Auction-Based Formulations of Sensor Coordination Mechanisms in Dynamic Task Environments

In this paper, multistage auction-based intelligence, surveillance, and reconnaissance (ISR) sensor coordination mechanisms are investigated in the context of dynamic and uncertain mission environments such as those faced by expeditionary strike groups. Each attribute of the mission task is modeled using a hidden Markov model (HMM) with controllable emission matrices, corresponding to each ISR asset package (subset of sensors). For each HMM-asset package pair, we evaluate a matrix of information gains (uncertainty reduction measures). The elements of this matrix depend on the asset coordination structure and the concomitant delays accrued. We consider three coordination structures (distributed ISR coordination, ISR officer serving as a coordinator, and ISR officer serving as a commander) here. We evaluate these structures on a hypothetical mission scenario that requires the monitoring of ISR activities in multiple geographic regions. The three structures are evaluated by comparing the task state estimation error cost, as well as travel, waiting, and assignment delays. The results of the analysis were used as a guide in the design of a mission scenario and asset composition for a team-in-the-loop experimentation. Our solution has the potential to be a mixed initiative decision support tool to an ISR coordinator/commander, where the human provides possible ISR asset package-task pairings and the tool evaluates the efficacy of the assignment in terms of task accuracy and delays. We also apply our approach to a hypothetical disaster management scenario involving chemical contamination and discuss the computational complexity of our approach.

[1]  Alf Isaksson,et al.  On sensor scheduling via information theoretic criteria , 1999, Proceedings of the 1999 American Control Conference (Cat. No. 99CH36251).

[2]  Feng Zhao,et al.  Scalable Information-Driven Sensor Querying and Routing for Ad Hoc Heterogeneous Sensor Networks , 2002, Int. J. High Perform. Comput. Appl..

[3]  Krishna R. Pattipati,et al.  Anomaly Detection via Feature-Aided Tracking and Hidden Markov Models , 2007, 2007 IEEE Aerospace Conference.

[4]  John N. Tsitsiklis,et al.  The Complexity of Optimal Queuing Network Control , 1999, Math. Oper. Res..

[5]  David A. Castañón Optimal search strategies in dynamic hypothesis testing , 1995, IEEE Trans. Syst. Man Cybern..

[6]  Nalini Venkatasubramanian,et al.  Situational Awareness Technologies for Disaster Response , 2008 .

[7]  Dimitri P. Bertsekas,et al.  An Auction Algorithm for Shortest Paths , 1991, SIAM J. Optim..

[8]  J. Gittins Bandit processes and dynamic allocation indices , 1979 .

[9]  Robin J. Evans,et al.  Simulation-Based Optimal Sensor Scheduling with Application to Observer Trajectory Planning , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[10]  Timothy Van Zandt,et al.  Real-Time Hierarchical Resource Allocation with Quadratic Costs , 2003 .

[11]  P. Whittle Restless bandits: activity allocation in a changing world , 1988, Journal of Applied Probability.

[12]  Keith D. Kastella,et al.  Foundations and Applications of Sensor Management , 2010 .

[13]  Katta G. Murty,et al.  Letter to the Editor - An Algorithm for Ranking all the Assignments in Order of Increasing Cost , 1968, Oper. Res..

[14]  J. Peschon,et al.  Optimal control of measurement subsystems , 1967, IEEE Transactions on Automatic Control.

[15]  David L. Kleinman,et al.  An Investigation of ISR Coordination and Information Presentation Strategies to Support Expeditionary Strike Groups , 2007 .

[16]  Krishna R. Pattipati,et al.  Optimal and near-optimal test sequencing algorithms with realistic test models , 1999, IEEE Trans. Syst. Man Cybern. Part A.

[17]  A. Volgenant,et al.  A shortest augmenting path algorithm for dense and sparse linear assignment problems , 1987, Computing.

[18]  Keith D. Kastella,et al.  Search for optimal sensor management , 1996, Defense, Security, and Sensing.

[19]  Darryl Morrell,et al.  Sensor scheduling and efficient algorithm implementation for target tracking , 2006 .

[20]  Feng Zhao,et al.  Information-driven dynamic sensor collaboration , 2002, IEEE Signal Process. Mag..

[21]  Peng Shi,et al.  Approximation algorithms for restless bandit problems , 2007, JACM.

[22]  Lawrence R. Rabiner,et al.  A tutorial on hidden Markov models and selected applications in speech recognition , 1989, Proc. IEEE.

[23]  D. Kleinman,et al.  Optimal measurement scheduling for state estimation , 1992, [Proceedings] 1992 IEEE International Conference on Systems, Man, and Cybernetics.

[24]  R. Radner The organization of decentralized information processing , 1993 .

[25]  Dimitri P. Bertsekas,et al.  Auction algorithms for network flow problems: A tutorial introduction , 1992, Comput. Optim. Appl..

[26]  Dimitri P. Bertsekas,et al.  Network optimization : continuous and discrete models , 1998 .

[27]  Duncan McFarlane,et al.  Developments in holonic production planning and control , 2000 .

[28]  Daniel W. Stockton Adaptive architecture for command and control (A2C2) Experiment 11 determining an effective ISR management structure at the operational level of conflict , 2008 .

[29]  Krishna R. Pattipati,et al.  Dynamic Scheduling of Multiple Hidden Markov Model-Based Sensors , 2008, J. Adv. Inf. Fusion.

[30]  Alex Pentland,et al.  Coupled hidden Markov models for complex action recognition , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[31]  Vikram Krishnamurthy,et al.  Algorithms for optimal scheduling and management of hidden Markov model sensors , 2002, IEEE Trans. Signal Process..

[32]  L. Baum,et al.  A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains , 1970 .

[33]  Robert B. Washburn,et al.  Application of Multi-Armed Bandits to Sensor Management , 2008 .