Goto

Collaborating Authors

 nullnullnullnullnull






Supplementary Material: Necessary and sufficient graphical conditions for optimal adjustment sets in causal graphical models with hidden variables [

Neural Information Processing Systems

There can be no loops or directed cycles. See Figure 1A for an example. The results also hold for Maximal Ancestral Graphs (MAG) [Richardson and Spirtes, 2002] without selection variables. Kinships are defined as usual: parents Our approach does not involve modified graph constructions as in van der Zander et al. [2019] and other works. A node is an ancestor and descendant of itself, but not a parent/child/spouse of itself.




Autonomous generation of different courses of action in mechanized combat operations

Schubert, Johan, Hansen, Patrik, Hörling, Pontus, Johansson, Ronnie

arXiv.org Artificial Intelligence

In this paper, we propose a methodology designed to support decision-making during the execution phase of military ground combat operations, with a focus on one's actions. This methodology generates and evaluates recommendations for various courses of action for a mechanized battalion, commencing with an initial set assessed by their anticipated outcomes. It systematically produces thousands of individual action alternatives, followed by evaluations aimed at identifying alternative courses of action with superior outcomes. These alternatives are appraised in light of the opponent's status and actions, considering unit composition, force ratios, types of offense and defense, and anticipated advance rates. Field manuals evaluate battle outcomes and advancement rates. The processes of generation and evaluation work concurrently, yielding a variety of alternative courses of action. This approach facilitates the management of new course generation based on previously evaluated actions. As the combat unfolds and conditions evolve, revised courses of action are formulated for the decision-maker within a sequential decision-making framework.