Dan Shen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Dan Shen has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Genshe Chen
DCM Research Resources, LLC (United States)
3 shared publications - Chiman Kwan
Applied Research LLC, Rockville, MD 20850, USA
2 shared publications - Jose B. Cruz
The Ohio State Univ. (United States)
2 shared publications - Jose B. Cruz
The Ohio State University, 2015 Neil Ave, Columbus, OH 43202
2 shared publications - Martin Kruger
The Office of Naval Research
2 shared publications - Erik Blasch
Air Force Research Lab. (United States)
1 shared publication
Latest Publications
- 1 March 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2008 IEEE Aerospace Conference
- No. 1095323X,p. 1-9
A Game Theoretic Data Fusion Aided Path Planning Approach for Cooperative UAV ISR
Cooperative and intelligent path planning is important for UAVs to carry out coordinated intelligence, surveillance and reconnaissance (ISR) in adversarial environments. In this paper, we propose a game theoretic data fusion aided platform routing algorithm for cooperative ISR. Our approach consists of three closely coupled components: 1) closed-loop data fusion. The Level 1 (Object), Level 2 (Situation) and Level 3 (threat) data fusion form a closed-loop structure, in which Markov game theoretic intent inferences will execute from the results of Level 1 and Level 2 results. The estimated threat intents will be fed back to the Level 2 fusion to improve the performance of the entity aggregation. 2) Cooperative platform routing based on Pareto-optimization, social foraging, and cooperative jamming. Given the threat information including the threat intents from the data fusion module, a Pareto-optimal problem is formed and graph-cut based fast solution serves as a reference trajectory for a foraging algorithm, which further dynamically refines the reference path to avoid pop-up obstacles detected along the planned path. 3) display/monitor module, in which relevant threats and constraints information are indicated, the terrain data are shown, and current real route and planned route are highlighted, compared, and evaluated. The commander's suggestions can be inputted in this mode.
- 1 March 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2008 IEEE Aerospace Conference
- No. 1095323X,p. 1-9
A Game Theoretic Data Fusion Aided Path Planning Approach for Cooperative UAV ISR
Cooperative and intelligent path planning is important for UAVs to carry out coordinated intelligence, surveillance and reconnaissance (ISR) in adversarial environments. In this paper, we propose a game theoretic data fusion aided platform routing algorithm for cooperative ISR. Our approach consists of three closely coupled components: 1) closed-loop data fusion. The Level 1 (Object), Level 2 (Situation) and Level 3 (threat) data fusion form a closed-loop structure, in which Markov game theoretic intent inferences will execute from the results of Level 1 and Level 2 results. The estimated threat intents will be fed back to the Level 2 fusion to improve the performance of the entity aggregation. 2) Cooperative platform routing based on Pareto-optimization, social foraging, and cooperative jamming. Given the threat information including the threat intents from the data fusion module, a Pareto-optimal problem is formed and graph-cut based fast solution serves as a reference trajectory for a foraging algorithm, which further dynamically refines the reference path to avoid pop-up obstacles detected along the planned path. 3) display/monitor module, in which relevant threats and constraints information are indicated, the terrain data are shown, and current real route and planned route are highlighted, compared, and evaluated. The commander's suggestions can be inputted in this mode.
- 1 January 2008
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 41 (2) , 15433-15438
Adaptive State Feedback Nash Strategies for Linear Quadratic Discrete-Time Games
- 1 January 2008
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 41 (2) , 15433-15438
Adaptive State Feedback Nash Strategies for Linear Quadratic Discrete-Time Games
- 1 March 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 1095323X,p. 1-13
An Adaptive Markov Game Model for Threat Intent Inference
In an adversarial military environment, it is important to efficiently and promptly predict the enemy's tactical intent from lower level spatial and temporal information. In this paper, we propose a decentralized Markov game (MG) theoretic approach to estimate the belief of each possible enemy course of action (ECOA), which is utilized to model the adversary intents. It has the following advantages: (1) It is decentralized. Each cluster or team makes decisions mostly based on local information. We put more autonomies in each group allowing for more flexibilities; (2) A Markov decision process (MDP) can effectively model the uncertainties in the noisy military environment; (3) It is a game model with three players: red force (enemies), blue force (friendly forces), and white force (neutral objects); (4) Correlated-Q reinforcement learning is integrated. With the consideration that actual value functions are not normally known and they must be estimated, we integrate correlated-Q learning concept in our game approach to dynamically adjust the payoffs function of each player. A simulation software package has been developed to demonstrate the performance of our proposed algorithms. Simulations have verified that our proposed algorithms are scalable, stable, and satisfactory in performance.
- 1 March 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 1095323X,p. 1-13
An Adaptive Markov Game Model for Threat Intent Inference
In an adversarial military environment, it is important to efficiently and promptly predict the enemy's tactical intent from lower level spatial and temporal information. In this paper, we propose a decentralized Markov game (MG) theoretic approach to estimate the belief of each possible enemy course of action (ECOA), which is utilized to model the adversary intents. It has the following advantages: (1) It is decentralized. Each cluster or team makes decisions mostly based on local information. We put more autonomies in each group allowing for more flexibilities; (2) A Markov decision process (MDP) can effectively model the uncertainties in the noisy military environment; (3) It is a game model with three players: red force (enemies), blue force (friendly forces), and white force (neutral objects); (4) Correlated-Q reinforcement learning is integrated. With the consideration that actual value functions are not normally known and they must be estimated, we integrate correlated-Q learning concept in our game approach to dynamically adjust the payoffs function of each player. A simulation software package has been developed to demonstrate the performance of our proposed algorithms. Simulations have verified that our proposed algorithms are scalable, stable, and satisfactory in performance.
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Game Theoretic Approach to Threat Prediction and Situation Awareness
The strategy of data fusion has been applied in threat prediction and situation awareness and the terminology has been standardized by the Joint Directors of Laboratories (JDL) in the form of a so-called JDL data fusion model, which currently called DFIG model. Higher levels of the DFIG model call for prediction of future development and awareness of the development of a situation. It is known that Bayesian network is an insightful approach to determine optimal strategies against asymmetric adversarial opponent. However, it lacks the essential adversarial decision processes perspective. In this paper, a highly innovative data-fusion framework for asymmetric-threat detection and prediction based on advanced knowledge infrastructure and stochastic (Markov) game theory is proposed. In particular, asymmetric and adaptive threats are detected and grouped by intelligent agent and hierarchical entity aggregation in level 2 and their intents are predicted by a decentralized Markov (stochastic) game model with deception in level 3. We have verified that our proposed algorithms are scalable, stable, and perform satisfactorily according to the situation awareness performance metric
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Game Theoretic Approach to Threat Prediction and Situation Awareness
The strategy of data fusion has been applied in threat prediction and situation awareness and the terminology has been standardized by the Joint Directors of Laboratories (JDL) in the form of a so-called JDL data fusion model, which currently called DFIG model. Higher levels of the DFIG model call for prediction of future development and awareness of the development of a situation. It is known that Bayesian network is an insightful approach to determine optimal strategies against asymmetric adversarial opponent. However, it lacks the essential adversarial decision processes perspective. In this paper, a highly innovative data-fusion framework for asymmetric-threat detection and prediction based on advanced knowledge infrastructure and stochastic (Markov) game theory is proposed. In particular, asymmetric and adaptive threats are detected and grouped by intelligent agent and hierarchical entity aggregation in level 2 and their intents are predicted by a decentralized Markov (stochastic) game model with deception in level 3. We have verified that our proposed algorithms are scalable, stable, and perform satisfactorily according to the situation awareness performance metric