Conference PaperPDF Available

Collaboration in Network-Centric Warfare Modeling Joint Fire Support Teams

  • aditerna GmbH
  • Lübeck University of Applied Sciences

Abstract and Figures

This paper presents an agent-based model to compare different coordination patterns in joint fire support (JFS) scenarios. Modern war fighting approaches depend heavily on a separation of concerns (like reconnaissance, coordination and engagement) and therefore impose high requirements on the coordination of all involved parties. Following the General Reference Model for Agent-Based Modeling and Simulation (GRAMS), we present an agent-based model of this problem domain. Our simulations indicate that decentralized JFS coordination leads to smaller average times from identification of a target to final engagement, while at the same time requiring extensive resources. Central coordination is more effective in terms of engaged units and reduced resource requirements, but tends to take more time.
Content may be subject to copyright.
A preview of the PDF is not available
... Fidanci's work required around three months, while using several machines, to complete all simulations. Gerstner et al. (2010) partially used cares' vision of the IACM as a basis for a model they developed for joint fire support systems. Their model had target, reconnaissance, command and control, and engagement units. ...
Network centric operations (NCO) has been dubbed the most significant revolution in military affairs (RMA) in the past 200 years. The promise of NCO is based on the notion that information sharing and connectivity is fundamental to the effectiveness of a combat force. This is due to the ability of a properly networked force to self-synchronise itself as it engages enemy forces. The information age combat model (IACM) is a popular representation of NCO. Previous research at modelling the IACM has so far focused solely at using agent-based modelling. That work produced significant contributions to the IACM literature. However, it has proven to be computationally expensive. IACM simulations must be sustainable as research into IACM evolves and more NCO complexities are introduced. This research will propose a discrete-event simulation (DES) approach to model the IACM. The paper will present the basis upon which DES was selected for this purpose and will illustrate how the DES approach can provide significant improvements in terms of the time and computational power needed to run IACM simulations.
... Despite the hierarchical design of the response plans, it has been observed that organizations follow a " net-centric approach " when it comes to the actual response to a disaster (Gerstner, Siegfried, Kratzke, 2010; Boersma, et. al, 2014). ...
Conference Paper
Full-text available
Crisis management frameworks are typically associated with concepts related to command and control or " hierarchical " decision-making. However, advancements in communication technologies and new media platforms have brought new prospects to the design of crisis management frameworks. Social media platforms, for example, enable volunteering citizens to actively take part in crisis response efforts. In our paper we explore comparing and contrasting two forms of crisis management frameworks: a formal, the well-tested Incident Command System of the US, and an informal example, the Community Emergency Response Teams (CERT) program. The goal of the paper is to outline potential ways to examine the disparities in network structure and collaboration linkages in different forms of crisis management frameworks.
Wireless Body Area Networks (WBANs) are a growing field of research; the challenges and applications have been explored and resolved by many researchers. The benefits of mobile communication based WBANs is using cellular communication as communication methodologies in the WBANs. Especially in emergency systems like medicare and military system, WBANs can be described as ease of provision, maintenance and management. In this paper, a Search Knight (SK) algorithm is proposed which is Outlier Analysis based technique. The SK algorithm is proposed for identifying unknown nodes (terrorist) in the border line using WBANs. The geographical location of the each node position is identified and tabulated on each time unit. The difference on neighbourhood time period is calculated and the proposed SK algorithm is applied to the location and movements. To detect the terrorist intrusion in the military system, the proposed SK algorithm is proved its capability and relaibility.
Full-text available
Using the MS/RPD integrated modeling approach, we have modeled a variety of tasks. We typically try to capture aspects of human performance and evaluate the qualitative and quantitative fit of model behavior to human data. A collection of individual models and demonstrations of fit to human data constitute an important validation of a modeling approach. However, there are problems with focusing solely on the "good fit" and "typical model" section of model complexity and parameter space. In this paper, we argue that as modelers, we need to examine our approaches in a broader context, going beyond the comfort zone of good fit and typical models. Using a very simple "generic" model, we examined a relatively small search space, with the goal of better covering and understanding a wider range of complexity and parameter values than our typical models utilize. We investigated scaling by systematically increasing the number of cues and COAs, and we investigated a range of values for three key model parameters. We learned something about limits of scaling. In our parameter exploration, the results underscored the importance of exploring the full range of possible values because parameter values did not always affect performance and learning in a monotonic way.
Full-text available
We consider the problem of providing decision support to a patrolling or security service in an adversarial domain. The idea is to create patrols that can achieve a high level of coverage or reward while taking into account the presence of an adversary. We assume that the adversary can learn or observe the patrolling strategy and use this to its advantage. We follow two different approaches depending on what is known about the adversary. If there is no information about the adversary we use a Markov Decision Process (MDP) to represent patrols and identify randomized solutions that minimize the information available to the adversary. This lead to the development of algorithms CRLP and BRLP, for policy randomization of MDPs. Second, when there is partial information about the adversary we decide on efficient patrols by solving a Bayesian–Stackelberg games. Here, the leader decides first on a patrolling strategy and then an adversary, of possibly many adversary types, selects its best response for the given patrol. We provide two efficient MIP formulations named DOBSS and ASAP to solve this NP-hard problem. Our experimental results show the efficiency of these algorithms and illustrate how these techniques provide optimal and secure patrolling policies. We note that these models have been applied in practice, with DOBSS being at the heart of the ARMOR system that is currently deployed at the Los Angeles International airport (LAX) for randomizing checkpoints on the roadways entering the airport and canine patrol routes within the airport terminals.
Based upon the requirements specified in the previous chapter, this chapter presents the General Reference Model for Agent-based Modeling and Simulation (GRAMS).
The patterns of interactions, both economic and otherwise, between individuals, groups or corporations form social networks whose structure can have a substantial effect on economic outcomes. The study of social networks and their implications has a long history in the social sciences and more recently in applied mathematics and related fields. This article reviews the main developments in the area with a focus on practical applications of network mathematics.
This paper contains a formal description – a "model" – of the structure, dynamics and operational evolution of Information Age combat. It reviews the assumptions underlying extant (Industrial Age) combat models and discusses their potential applicability in the Information Age. Recent developments in combat modeling are reviewed. An Information Age Combat Model derived from the first principles and scientific fundamentals of distributed, networked systems is introduced and the mathematics of its structure, dynamics and operational evolution are presented. Implications of the model for policy assessment, concept development and systems engineering are discussed and suggestions for further research are explored. A technical appendix is included.
An information age combat model Director, Net Assessment, Office of the Secretary of Defense
  • J Cares
Erweiterung und Implementierung eines Modells zur Analyse von Fragestellungen zur Koordination verteilter Organisationsstrukturen
  • C Gerstner
C. Gerstner, "Erweiterung und Implementierung eines Modells zur Analyse von Fragestellungen zur Koordination verteilter Organisationsstrukturen," BSc Thesis, University of the Federal Armed Forces Munich, December 2009.
  • D S Alberts
  • F P Stein
D. S. Alberts, G. J. J., and F. P. Stein, Network Centric Warfare. DoD Command and Control Research Program (CCRP), 1999.
Distributed Networked Operations: The Foundations of Network Centric Warfare. iUniverse
——, Distributed Networked Operations: The Foundations of Network Centric Warfare. iUniverse, 2006.