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

被引:10
作者
An, Woosun [1 ]
Park, Chulwoo [1 ]
Han, Xu [1 ]
Pattipati, Krishna R. [1 ]
Kleinman, David L. [2 ]
Kemple, William G. [2 ]
机构
[1] Univ Connecticut, Dept Elect Engn, Storrs, CT 06029 USA
[2] USN, Postgrad Sch, Dept Informat Sci, Monterey, CA 93943 USA
来源
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS | 2011年 / 41卷 / 06期
关键词
Auction algorithm; coordination delays; hidden Markov model (HMM); information gain (IG) heuristic sensor scheduling; partition algorithm; sensor assignment; ALGORITHM; SEARCH;
D O I
10.1109/TSMCA.2011.2114342
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:1092 / 1106
页数:15
相关论文
共 34 条
[1]  
An W., 2008, J ADV, V2, P33
[2]  
Ashish N, 2008, INTEGR SER INFORM SY, V18, P517
[3]   A MAXIMIZATION TECHNIQUE OCCURRING IN STATISTICAL ANALYSIS OF PROBABILISTIC FUNCTIONS OF MARKOV CHAINS [J].
BAUM, LE ;
PETRIE, T ;
SOULES, G ;
WEISS, N .
ANNALS OF MATHEMATICAL STATISTICS, 1970, 41 (01) :164-&
[4]  
Bertsekas D.P., 1998, Network optimization: Continuous and discrete models, P251
[5]  
Bertsekas D. P., 1992, COMPUTATIONAL OPTIMI, V1, P7, DOI DOI 10.1007/BF00247653
[6]   AN AUCTION ALGORITHM FOR SHORTEST PATHS [J].
Bertsekas, Dimitri P. .
SIAM JOURNAL ON OPTIMIZATION, 1991, 1 (04) :425-447
[7]   Coupled hidden Markov models for complex action recognition [J].
Brand, M ;
Oliver, N ;
Pentland, A .
1997 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, PROCEEDINGS, 1997, :994-999
[8]   OPTIMAL SEARCH STRATEGIES IN DYNAMIC HYPOTHESIS-TESTING [J].
CASTANON, DA .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1995, 25 (07) :1130-1138
[9]  
Chhetri S., 2006, THESIS ARIZONA STATE
[10]   Scalable information-driven sensor querying and routing for ad hoc heterogeneous sensor networks [J].
Chu, M ;
Haussecker, H ;
Zhao, F .
INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICATIONS, 2002, 16 (03) :293-313