Using unmanned robotic systems in military operations such as reconnaissance or surveillance, as well as in many civil applications, is common practice. In this article, the problem of monitoring the specified area of interest by a fleet of unmanned aerial systems is examined. The monitoring is planned via the Cooperative Aerial Model, which deploys a number of waypoints in the area; these waypoints are visited successively by unmanned systems. The original model proposed in the past assumed that the area to be explored is perfectly flat. A new formulation of this model is introduced in this article so that the model can be used in a complex environment with uneven terrain and/or with many obstacles, which may occlude some parts of the area of interest. The optimization algorithm based on the simulated annealing principles is proposed for positioning of waypoints to cover as large an area as possible. A set of scenarios has been designed to verify and evaluate the proposed approach. The key experiments are aimed at finding the minimum number of waypoints needed to explore at least the minimum requested portion of the area. Furthermore, the results are compared to the algorithm based on the lawnmower pattern.

This article examines autonomous reconnaissance in a complex urban environment using unmanned aerial vehicles (UAVs). Environments with many buildings and other types of obstacles and/or an uneven terrain are harder to be explored as occlusion of objects of interest may often occur. First, in this article, the problem of autonomous reconnaissance in a complex urban environment via a swarm of UAVs is formulated. Then, the algorithm based on the metaheuristic approach is proposed for a solution. This solution lies in deploying a number of waypoints in the area of interest to be explored, from which the monitoring is performed, and planning the routes for available UAVs among these waypoints so that the monitored area is as large as possible and the operation as short as possible. In the last part of this article, two types of main experiments based on computer simulations are designed to verify the proposed algorithms. The first type focuses on comparing the results achieved on the benchmark instances with the optimal solutions. The second one presents and discusses the results obtained from a number of scenarios, which are based on typical reconnaissance operations in real environments.

Capability-based planning as an approach to defense planning is an almost infinitely complex engineered system with countless nodes and layers of interdependency, influenced by state and non-state diplomatic activities, information, military and economic actions creating secondary and third order effects. The main output of capability-based planning is the set of capability requirements needed to achieve the expected end-state. One revitalized qualitative technique that allows us to gain insights into unstructured and fuzzy problems in the military is wargaming—in its simplest form this involves manual wargaming. At the same time, there has been a push to bring computer assistance to such wargaming, especially to support umpire adjudication and move more generally towards full automation of human elements in wargames. However, computer assistance in wargaming should not be pushed, regardless of cost, towards quantitative techniques. The objective complexity of a problem often does not allow us to replicate the operational environment with the required fidelity to get credible experimental results. This paper discusses a discovery experiment aiming to verify the concept of applying a qualitative expert system within computer assisted wargaming for developing capability requirements in order to reduce umpire bias and risk associated with their decisions. The innovation here lies in applying system dynamics modelling and simulation paradigms when designing the theoretical model of capability development, which forms the core of the expert system. This new approach enables qualitative comparisons between different sets of proposed capability requirements. Moreover, the expert system allows us to reveal the effects of budget cuts on proposed capability requirement solutions, which the umpire was previously unable to articulate when comparing individual solutions by relying solely on his own knowledge. Players in the wargame validated the proposed concept and suggested how the study might be developed going forward: namely, by enabling users to define their own capabilities and not being limited by a predefined set of capabilities.

In recent years, the use of modern technology in military operations has become standard practice. Unmanned systems play an important role in operations such as reconnaissance and surveillance. This article examines a model for planning aerial reconnaissance using a fleet of mutually cooperating unmanned aerial vehicles to increase the effectiveness of the task. The model deploys a number of waypoints such that, when every waypoint is visited by any vehicle in the fleet, the area of interest is fully explored. The deployment of waypoints must meet the conditions arising from the technical parameters of the sensory systems used and tactical requirements of the task at hand. This paper proposes an improvement of the model by optimizing the number and position of waypoints deployed in the area of interest, the effect of which is to improve the trajectories of individual unmanned systems, and thus increase the efficiency of the operation. To achieve this optimization, a modified simulated annealing algorithm is proposed. The improvement of the model is verified by several experiments. Two sets of benchmark problems were designed: (a) benchmark problems for verifying the proposed algorithm for optimizing waypoints, and (b) benchmark problems based on typical reconnaissance scenarios in the real environment to prove the increased effectiveness of the reconnaissance operation. Moreover, an experiment in the SteelBeast simulation system was also conducted.